Machines for attribute grammars
In designing a compiler for a given programming language one can use a context free grammar describing the syntax of the language and an attribute grammar (AG) for describing the semantics. The evaluation of the attribute of the nodes of the constructed parse tree is the subject of many recent works. In the present paper the author introduces two automata models that play, with respect to attribute grammars and attribute evaluation for them, the same role as pushdown automata play for context free grammars. The paper begins with a survey on AG, giving the basic definitions, properties, and results on AG, attribute evaluation, and existing automata for AG's (pushdown assembler, pushdown processor, attributed pushdown machines). The temporary (permanent) register pushdown transducers (TRT, PRT) are defined. In the second section the relations among the classes of string- and tree-translations defined by AG, TRT, PRT are found and a new class of AG, called flags-AG is introduced. Next section is dedicated to the study of the transformation of PRT computations. Based on this in the 4th section there are proved the tree- equivalence between one PRT and flags-AG, and string-equivalence of one- PRT, flags-AG and AG, respectively. The formal power of the models introduced in the paper is studied in the next section and, finally, some concluding remarks and further works are presented.
- Attribute grammars and automatic complexity analysis
- scientific article; zbMATH DE number 3980524
- scientific article; zbMATH DE number 1002574
- scientific article; zbMATH DE number 58303
- Attribute grammar applications
- scientific article; zbMATH DE number 4037255
- Attribute grammars. Definitions, systems and bibliography
- A functional semantics of attribute grammars
- Tree automata and attribute grammars
- Attributed tree grammars
- Composition and evaluation of attribute coupled grammars
- Attribute grammar inversion and source-to-source translation
- Attributed tree grammars
- scientific article; zbMATH DE number 3852443 (Why is no real title available?)
- Tree automata and attribute grammars
- An attributed translation grammar for PL/0
- scientific article; zbMATH DE number 13207 (Why is no real title available?)
- scientific article; zbMATH DE number 58303 (Why is no real title available?)
- scientific article; zbMATH DE number 60390 (Why is no real title available?)
- scientific article; zbMATH DE number 627410 (Why is no real title available?)
- scientific article; zbMATH DE number 1089243 (Why is no real title available?)
- On attribute grammars without attribute synthesis
This page was built for publication: Machines for attribute grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3753513)