Improvements of an incremental evaluation algorithm for ordered attribute grammars
- 1 December 1988
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 23 (12) , 45-50
- https://doi.org/10.1145/57669.57672
Abstract
Three improvements are suggested upon an incremental attribute evaluation algorithm proposed by the first author. The resulting algorithm allows multiple subtree replacement and cancels three auxiliary tables required by the previous version.This publication has 8 references indexed in Scilit:
- Automatic construction of incremental LR(1)—parsersACM SIGPLAN Notices, 1988
- Dynamically bypassing copy rule chains in attribute grammarsPublished by Association for Computing Machinery (ACM) ,1986
- On incremental evaluation of ordered attributed grammarsBIT Numerical Mathematics, 1983
- On incremental shift-reduce parsingBIT Numerical Mathematics, 1983
- Optimal-time incremental semantic analysis for syntax-directed editorsPublished by Association for Computing Machinery (ACM) ,1982
- Incremental evaluation for attribute grammars with application to syntax-directed editorsPublished by Association for Computing Machinery (ACM) ,1981
- Ordered attributed grammarsActa Informatica, 1980
- Semantics of context-free languagesTheory of Computing Systems, 1968