Semantic evaluation from left to right
Communications of the ACM
Modular Compiler Descriptions Based on Abstract Semantic Data Types (Extended Abstract)
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Alternating semantic evaluator
ACM '75 Proceedings of the 1975 annual conference
Automatic generation of efficient evaluators for attribute grammars
POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
Generating Language-Based Environments
Generating Language-Based Environments
An open toolkit for prototyping reverse engineering visualizations
VISSYM '02 Proceedings of the symposium on Data Visualisation 2002
The canonical activities of reverse engineering
Annals of Software Engineering
| Hi-index | 0.00 |
Attributed graphs are well suited to represent structured sets of data objects. A multiple attribute grammar (MTAG) consists of several attribute grammars that describe an attributed graph as a union of attributed trees. Thus, from an MTAG one can automatically generate attribute evaluators for graphs. Dependency analysis at generation time of the attribute evaluator leads to fast attribute evaluation, and to significant space savings due to attribute overlay.