Classical and incremental evaluators for attribute grammars
CAAP '86 Proceedings of the 11th colloquium on trees in algebra and programming
4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
Composition and evaluation of attribute coupled grammars
Acta Informatica
Higher order attribute grammars
PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
Pattern-based tree attribution
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Composable attribute grammars: support for modularity in translator design and implementation
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
SIGPLAN '84 Proceedings of the 1984 SIGPLAN symposium on Compiler construction
Higher Order Attribute Grammars
Proceedings on Attribute Grammars, Applications and Systems
Automatic generation of efficient evaluators for attribute grammars
POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
Syntactic and Semantic Checking in
Syntactic and Semantic Checking in
Conditional attribute grammars
ACM Transactions on Programming Languages and Systems (TOPLAS)
Fusion with stacks and accumulating parameters
Proceedings of the 2004 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
XML stream transformer generation through program composition and dependency analysis
Science of Computer Programming
Journal of the ACM (JACM)
Decorated Attribute Grammars: Attribute Evaluation Meets Strategic Programming
CC '09 Proceedings of the 18th International Conference on Compiler Construction: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
| Hi-index | 0.01 |
Using the simple tree attributions described in this paper, attribute values can themselves be trees, enabling attribution to be used for tree transformations. Unlike higher-order attribute grammars, simple tree attributions have the property of descriptional composition, which allows a complex transformation to be built up from simpler ones, yet be executed efficiently. In contrast to other formalisms that admit descriptional composition, notably composable attribute grammars, simple tree attributions have the expressive power to handle remote references and recursive syntactic (tree-generating) functions, providing significantly more general forms of attribution and transformation.