An optimal-time recursive evaluator for attribute grammars
- 1 January 1984
- book chapter
- Published by Springer Nature
- p. 167-178
- https://doi.org/10.1007/3-540-12925-1_37
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Attribute grammars and recursive program schemes ITheoretical Computer Science, 1982
- The formal power of one-visit attribute grammarsActa Informatica, 1981
- A Simpler Construction for Showing the Intrinsically Exponential Complexity of the Circularity Problem for Attribute GrammarsJournal of the ACM, 1981
- Passes and paths of attribute grammarsInformation and Control, 1981
- Ordered attributed grammarsActa Informatica, 1980
- A Deterministic Attribute Grammar Evaluator Based on Dynamic SchedulingACM Transactions on Programming Languages and Systems, 1979
- Automatic generation of near-optimal linear-time translators for non-circular attribute grammarsPublished by Association for Computing Machinery (ACM) ,1979
- Semantic evaluation from left to rightCommunications of the ACM, 1976
- Automatic generation of efficient evaluators for attribute grammarsPublished by Association for Computing Machinery (ACM) ,1976
- Semantics of context-free languagesTheory of Computing Systems, 1968