Passes and paths of attribute grammars
- 31 May 1981
- journal article
- Published by Elsevier in Information and Control
- Vol. 49 (2) , 125-169
- https://doi.org/10.1016/s0019-9958(81)90466-6
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- AlternationJournal of the ACM, 1981
- Tree transducers, L systems, and two-way machinesJournal of Computer and System Sciences, 1980
- Ordered attributed grammarsActa Informatica, 1980
- Circularity Testing of Attribute Grammars Requires Exponential Time: A Simpler ProofDAIMI Report Series, 1980
- Bounded nesting in macro grammarsInformation and Control, 1979
- Semantic evaluation from left to rightCommunications of the ACM, 1976
- The intrinsically exponential complexity of the circularity problem for attribute grammarsCommunications of the ACM, 1975
- Bottom-up and top-down tree transformations— a comparisonTheory of Computing Systems, 1975
- Translations on a context free grammarInformation and Control, 1971
- Characterizations of Pushdown Machines in Terms of Time-Bounded ComputersJournal of the ACM, 1971