Minimizing the Number of Evaluation Passes for Attribute Grammars
- 1 November 1981
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 10 (4) , 772-786
- https://doi.org/10.1137/0210060
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- The shortest common supersequence problem over binary alphabet is NP-completeTheoretical Computer Science, 1981
- On the optimal assignment of attributes to passes in multi-pass attribute evaluatorsPublished by Springer Nature ,1980
- Counter-one-pass features in one-pass compilation: A formalization using attribute grammarsInformation Processing Letters, 1978
- The Complexity of Some Problems on Subsequences and SupersequencesJournal of the ACM, 1978
- Semantic evaluation from left to rightCommunications of the ACM, 1976
- Attributed translationsJournal of Computer and System Sciences, 1974
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- Semantics of context-free languagesTheory of Computing Systems, 1968