Graph translation schemes to generate compiler parts

Authors:
Michael Sonnenschein
Affiliations:
Aachen Univ. of Technology, Aachen, W. Germany
Venue:
ACM Transactions on Programming Languages and Systems (TOPLAS)
Year:
1987

Citing 15
Cited 1

Translation of attribute grammars into procedures

ACM Transactions on Programming Languages and Systems (TOPLAS)
Global storage cells for attributes in an attribute grammar

Acta Informatica
Graph grammar engineering: a method used for the development of an integrated programming support environment

Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT) on Formal Methods and Software, Vol.2: Colloquium on Software Engineering (CSE)
Automatic Derivation of Code Generators from Machine Descriptions

ACM Transactions on Programming Languages and Systems (TOPLAS)
The Cornell program synthesizer: a syntax-directed programming environment

Communications of the ACM
High-level data flow analysis

Communications of the ACM
A new method for compiler code generation

POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
An Attribute Grammar for the Semantic Analysis of ADA

An Attribute Grammar for the Semantic Analysis of ADA
A Programming Methodology in Compiler Construction

A Programming Methodology in Compiler Construction
Passes, Sweeps and Visits

Proceedings of the 8th Colloquium on Automata, Languages and Programming
On Storage Optimization for Automatically Generated Compilers

Proceedings of the 4th GI-Conference on Theoretical Computer Science
Optimization of Generated Code by Means of Attributes: Local Elimination of Common Redandant Sub-Expressions

GI - 4. Jahrestagung
Automatic generation of efficient evaluators for attribute grammars

POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
Definition and use of attribute reevaluation in attributed grammars.

Definition and use of attribute reevaluation in attributed grammars.
Principles of Compiler Design (Addison-Wesley series in computer science and information processing)

Principles of Compiler Design (Addison-Wesley series in computer science and information processing)

Eli: a complete, flexible compiler construction system

Communications of the ACM

Quantified Score

Hi-index	0.02

Visualization

Abstract

Graph translation schemes (GTSs) are a generalization of attribute grammars and of some ideas in Koster's language CDL2 They are specially designed to support a compiler writer in defining parts of the back-end of his compiler, but they can also be useful for the specification of the analysis pass of a compiler. GTSs combine elements of functional and of algorithmic specification techniques to allow iterative attribute evaluation and attributing of program graphs. GTSs consist of only a few syntactical elements. We present operational semantics and discuss improvements in the efficiency of the proposed implementation of GTSs.