Higher order attribute grammars
- 21 June 1989
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 24 (7) , 131-145
- https://doi.org/10.1145/74818.74830
Abstract
A new kind of attribute grammars, called higher order attribute grammars, is defined. In higher order attribute grammars the structure tree can be expanded as a result of attribute computation. A structure tree may be stored in an attribute. The term higher order is used because of the analogy with higher order functions, where a function can be the result or parameter of another function. A relatively simple method, using OAGs, is described to derive an evaluation order on the defining attribute occurrences which comprises all possible direct and indirect attribute dependencies. As in OAGs, visit-sequences are computed from which an efficient algorithm for attribute evaluation can be derived.Keywords
This publication has 6 references indexed in Scilit:
- Attribute coupled grammarsACM SIGPLAN Notices, 1984
- Compiler ConstructionPublished by Springer Nature ,1984
- Incremental Context-Dependent Analysis for Language-Based EditorsACM Transactions on Programming Languages and Systems, 1983
- The intrinsically exponential complexity of the circularity problem for attribute grammarsCommunications of the ACM, 1975
- Semantics of context-free languages: CorrectionTheory of Computing Systems, 1971
- Semantics of context-free languagesTheory of Computing Systems, 1968