A simple translation automaton allowing the generation of optimized code
This paper explains the general lines of a compiler and especially of the part of the compiler which generates code, starting from the output of the syntactic analysis. This part of the compiler is a two stack automaton providing for a mechanism allowing to generate optimized code.
In order to increase the portability of the compiler, an intermediate code is defined which is as machine independent as possible. The automaton is supposed to generate such an intermediate code.
The principles explained here have been successfully implemented in an ALGOL 68 compiler operational since early 1973 .
KeywordsSource Function Static Elaboration Source Language Source Program Composition Rule
Unable to display preview. Download preview PDF.
- P. Branquart, J. P. Cardinael, J. Lewi, J. P. Delescaille and M. Van Begin, "An optimized translation process and its application to ALGOL 68", MBLE Res. Lab., Report R204, to be published in Lectures Notes in Computer Science, Springer-Verlag.Google Scholar
- A. van Wijngaarden et al., "Report on the Algorithmic Language ALGOL 68", Num. Math., 14, 79–218 (1969), Springer-Verlag.Google Scholar
- D. E. Knuth, Semantics of context-free languages, Mathematical Systems theory, vol. 2, no1, 1968.Google Scholar
- W. M. Mc Keeman, Peephole optimization, CACM, July 1965.Google Scholar