(Enter summary)
Abstract: The intermediate representations (IR) used by most compilers have an operational
semantics. The nodes in the graph (or tree, or quad-code sequence) have an interpretation
as the operation codes of some abstract machine.
A denotational semantics, in which each node in the IR graph has a static meaning,
can lead to a clean interface between the front and back ends of the compiler. Furthermore,
it is possible to concisely specify a code generator to translate the denotational
representation into... (Update)
Context of citations to this paper: More
.... a corresponding automatic tool: LEX [ES86] for the lexical analyzer, YACC [Joh86] and PGS [GK88] for the parser, TWIG [AGT89] and [NN, App85, Ras82] for the code generator, LIGA [Kas90] and [Far86] for the attribute grammar evaluator, and Sharlit [TH92] and GOSpeL...
.... The first attempts were to translate denotation semantics directly to terms which are then executed by an abstract machine [1, 30, 40, 49]. The compilers produced this way were not very competitive with traditional techniques. More advanced systems for semantics directed...
Cited by: More
More Advice on Proving a Compiler Correct: Improve a Correct.. - Meijer (1993)
(Correct)
Semantically-Sensitive Macroprocessing - Maddox (1989)
(Correct)
Compiling with Proofs - Necula (1997)
(Correct)
Active bibliography (related documents): More All
0.3: Concise Specifications of Locally Optimal Code Generators - Appel (1987)
(Correct)
0.2: Instruction Set Commutivity - Windley
(Correct)
0.2: The Design and Implementation of Genesis - Whitfield, Soffa (1994)
(Correct)
Similar documents based on text: More All
0.0: Iterated Register Coalescing - George, Appel (1996)
(Correct)
0.0: Compiling Functional Languages - Bibliography - Tolmach (1996)
(Correct)
0.0: Welldefined Decision Scenarios - Nielsen, Jensen (1999)
(Correct)
Related documents from co-citation: More All
3: YACC: Yet another compiler-compiler
- Johnson - 1979
2: Programs and their proofs: an algebraic approach (context) - Burstall, Landin - 1969
2: Compiler generation from denotational semantics (context) - Jones, Schmidt - 1980
BibTeX entry: (Update)
Andrew W. Appel. Semantics-directed code generation. In Proceedings of the Annual ACM Symposium on Principles of Programming Languages, pages 315--324, 1985. http://citeseer.ist.psu.edu/appel85semanticsdirected.html More
@inproceedings{ appel85semanticsdirected,
author = "A. W. Appel",
title = "Semantics-Directed Code Generation",
booktitle = "Proceedings of the {ACM} Symposium on Principles of Programming Languages",
publisher = "Association for Computing Machinery",
address = "New Orleans, LA",
pages = "315--324",
year = "1985",
url = "citeseer.ist.psu.edu/appel85semanticsdirected.html" }
Citations (may not include all citations):
95
Hope: an Experimental Applicative Language
- Burstall, MacQueen et al. - 1980 DBLP
76
Towards a mathematical semantics for computer languages (context) - Scott, Strachey - 1971
40
Deriving Target Code as a Representation of Continuation Sem.. (context) - Wand - 1980 ACM DBLP
39
Springer-Verlag (context) - Gordon, Milner et al. - 1979
22
A Semantics-Directed Compiler Generator (context) - Paulson - 1982 ACM DBLP
20
Design of an Optimizing Compiler (context) - Wulf, Johnsson et al. - 1975
14
Using Peephole Optimization on Intermediate Code (context) - Tanenbaum, van Staveren et al. - 1982 ACM DBLP
12
Automatic Generation of Peephole Optimizations (context) - Davidson, Fraser - 1984 ACM DBLP
11
Control Flow Aspects of Semantics Directed Compiling (context) - Sethi - 1983
10
Formalization and automatic derivation of code generators (context) - Cattell - 1978
6
Peep -- An Architectural Description Driven Peephole Optimiz.. (context) - Kessler - 1984
5
Simplifying Code Generation Through Peephole Optimization (context) - Davidson - 1981 ACM
1
SIS -- Reference and user's guide (context) - Mosses - 1979
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.princeton.edu/faculty/appel/papers/): More
Profiling in the Presence of Optimization and Garbage Collection - Andrew Appel (1988)
(Correct)
Generalizations of the Sethi-Ullman algorithm for register.. - Appel, Supowit (1987)
(Correct)
A Standard ML Compiler - Appel, MacQueen (1987)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC