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 machine code. Combined with recent work allowing the denotational specification of front ends to translate the input language into the IR, a complete compiler with a well-defined semantics may be generated. Using this technique, compilers have been written for (most of) Pascal and C which, although they compile slowly, produce fairly good machine code. July 25, - 1 - 1 1. Introduction The intermediate representations (IR) used by most compilers have an operational semantics. The nodes in the gra...

Citations

114	C.: Toward a mathematical semantics for computer languages - Scott, Strachey - 1971
46	Deriving Target Code as a Representation of Continuation Semantics - Wand - 1982
35	D.Sannella: Hope: an experimental applicative language - Burstall - 1980
34	The Design of an Optimizing Compiler - Wulf, Weinstock, et al. - 1975
26	Using peephole optimization on intermediate code - TANENBAUM, STRAVEN, et al. - 1982
26	A semantics-directed compiler generator - Paulson - 1982
20	Automatic Generation of Peephole Optimizations - Davidson, Fraser - 1984
19	Formalization and Automatic Derivation of Code Generators - Cattell - 1978
14	Peep: an architectural description driven peephole optimizer - KESSLER - 1984
10	Simplifying Code Generation Through Peephole Optimizations - Davidson - 1981
7	Control Flow Aspects of Semantics Directed Compiling - Sethi - 1983
1	IV (H) compiler program logic manual," Form Y28-6642-3 - IBM - 1968
1	SIS -- Reference and user's guide - Mosses - 1979