Space-Efficient Storage Management in an Attribute Grammar Evaluator
ACM Transactions on Programming Languages and Systems (TOPLAS)
On Constructing Efficient Evaluators for Attribute Grammars
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
LINGUIST-86: Yet another translator writing system based on attribute grammars
SIGPLAN '82 Proceedings of the 1982 SIGPLAN symposium on Compiler construction
Automatic generation of efficient evaluators for attribute grammars
POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
The coroutine model of attribute grammar evaluation.
The coroutine model of attribute grammar evaluation.
SIGPLAN '86 Proceedings of the 1986 SIGPLAN symposium on Compiler construction
Design, implementation and evaluation of the FNC-2 attribute grammar system
PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
LISA: a tool for automatic language implementation
ACM SIGPLAN Notices
Conditional attribute grammars
ACM Transactions on Programming Languages and Systems (TOPLAS)
Global storage allocation in attribute evaluation
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
| Hi-index | 0.00 |
This paper presents a new strategy for evaluating attribute grammars, sub-protocol attribute evaluation, and gives an algorithm for constructing sub-protocol-evaluators. Sub-protocol-evaluators can be built for any non-circular attribute grammar; this paper describes how to construct them for absolutely noncircular grammars [4]. Sub-protocol-evaluators are most easily understood as a simple optimization of another evaluator we call the protocol-evaluator. The protocol-evaluator has elements in common with the tree-walk evaluator of Kennedy-Warren [4] and with Nielson's direct evaluator [6]; it can be viewed as a refinement of each of these. Furthermore, the uniform AGs, proposed by Warren [9], and the ordered AGs, proposed by Kastens [3], are both subclasses of grammars for which especially efficient protocol-evaluators can be built.