Journal of the ACM (JACM)
Generating parsers for affix grammars
Communications of the ACM
A syntax directed compiler for ALGOL 60
Communications of the ACM
Compiler Construction for Digital Computers
Compiler Construction for Digital Computers
Formal languages and their relation to automata
Formal languages and their relation to automata
Journal of Computer and System Sciences
Program transformations and their applications in teaching procedural and nonprocedural languages
SIGCSE '85 Proceedings of the sixteenth SIGCSE technical symposium on Computer science education
Semantic evaluation from left to right
Communications of the ACM
Language-based approaches to software measurement
METRICS '96 Proceedings of the 3rd International Symposium on Software Metrics: From Measurement to Empirical Results
On the complexity of regular-grammars with integer attributes
Journal of Computer and System Sciences
Top-Down Parsing With Simultaneous Evaluation Of Noncircular Attribute Grammars
Fundamenta Informaticae
| Hi-index | 0.02 |
Attributed translation grammars are introduced as a means of specifying a translation from strings of input symbols to strings of output symbols. Each of these symbols can have a finite set of attributes, each of which can take on a value from a possibly infinite set. Attributed translation grammars can be applied in depth to practical compiling problems. Certain augmented pushdown machines are defined and characterizations are given of the attributed translations they can perform both deterministically and non-deterministically. Classes of attributed translation grammars are defined whose translation can be performed deterministically while parsing top down or bottom up.