Testing attribute grammars for circularity
- 1 June 1982
- journal article
- research article
- Published by Springer Nature in Acta Informatica
- Vol. 17 (2), 185-192
- https://doi.org/10.1007/bf00288969
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Passes and paths of attribute grammarsInformation and Control, 1981
- Circularity Testing of Attribute Grammars Requires Exponential Time: A Simpler ProofDAIMI Report Series, 1980
- Experiences with the compiler writing system HLPLecture Notes in Computer Science, 1980
- Automatic generation of efficient evaluators for attribute grammarsPublished by Association for Computing Machinery (ACM) ,1976
- 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