Abstract
Attribute grammars (atgs, for short) are string rewriting systems, allowing programming languages to be defined together with their context conditions and translations. In this paper graph grammars are used to specify, in a very general way, the evaluators which are generated from atgs. These graph grammars are correct with respect to the languages derived by atgs, and specify meaningful parsers and compilers if the atgs satisfy some weak conditions.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
A. Aho, J.D. Ullman: The Theory of Parsing, Translation and Compiling. (2 volumes), Prentice Hall, New Jersey (1972).
H. Ehrig: Introduction to the Algebraic Theory of Graph Grammars. In: LNCS 73, 1–63 (1979).
H. Ehrig, B. Hoffmann, I.-R. Schmiedecke: A Graph Theoretical Model for Multi-Pass Parsing. In: Conference on Graph-theoretical Concepts in Computer Science, 19–32 (1981).
H. Ehrig, B. Rosen: The Mathematics of Record Handling. In: SIAM Jr. of Comp. 9, 441–469 (1980).
J.A. Gognen, J.W. Thatcher, E.G. Wagner: An Initial Algebra Approach to the Specification,Correctness and Implementation of Abstract Data Types. In: Current Trends in Programming Methodology IV, 80–144, Prentice Hall, New Jersey (1978).
B. Hoffmann: Using Abstract Data Types in Two-Level Grammars. In: 3rd Compiler-Compiler-Workshop. 105–118, München (1982).
B. Hoffmann: Two-Level Grammars: Definition and Comparison. Research Report, TU Berlin (1982).
B. Hoffmann, I.-R. Schmiedecke: Multi-Pass Parsing for Two-Level Grammars. In: LNCS 88, 275–290 (1980).
J.E. Hopcroft, J.D. Ullman: Formal Languages and Their Relation to Automata. Addison-Wesley, Reading, Mass. (1969).
U. Kastions, B. Hutt, E. Zimmermann: GAG: A Practical Compiler-Generator. LNCS 141, (1982).
D.E. Knuth: Semantics of Context-free Languages. In: Math. Sys. Theory 2(2), 125–145 (1968), Correction: 5(1), 95–96, (1971).
C.H.A. Koster: Affixgrammars. In: Algol68 Implementation, 95–109, North-Holland (1971).
O.L. Madsen, D.A. Watt: Extended Attribute Grammars. Report DAIMI PB 105, Aarhus (1977).
D.A. Watt: Analysis-Oriented Two-Level Grammars. Ph.D. thesis, Glasgow (1974).
A.v. Wijngaarden: Orthogonal Design and Formal Language. Report MR 76 Mathematisch Centrum, Amsterdam (1965).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hoffmann, B. (1983). Modelling compiler generation by graph grammars. In: Ehrig, H., Nagl, M., Rozenberg, G. (eds) Graph-Grammars and Their Application to Computer Science. Graph Grammars 1982. Lecture Notes in Computer Science, vol 153. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0000105
Download citation
DOI: https://doi.org/10.1007/BFb0000105
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12310-1
Online ISBN: 978-3-540-39897-4
eBook Packages: Springer Book Archive