Using Peephole Optimization on Intermediate Code
- 1 January 1982
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 4 (1), 21-36
- https://doi.org/10.1145/357153.357155
Abstract
Many portable compilers generate an intermediate code that is subsequently translated into the target machine's assembly language. In this paper a stack-machine-based intermediate code suitable for algebraic languages (e.g., PASCAL, C, FORTRAN) and most byte-addressed mini- and microcomputers is described. A table-driven peephole optimizer that improves this intermediate code is then discussed in detail and compared with other local optimization methods. Measurements show an improvement of about 15 percent, depending on the precise metric used. © 1982, ACM. All rights reservedKeywords
This publication has 11 references indexed in Scilit:
- An Overview of the Production-Quality Compiler-Compiler ProjectComputer, 1980
- The Design and Application of a Retargetable Peephole OptimizerACM Transactions on Programming Languages and Systems, 1980
- Implications of structured programming for machine architectureCommunications of the ACM, 1978
- On code generation in a PASCAL compilerSoftware: Practice and Experience, 1977
- The UNIX time-sharing systemCommunications of the ACM, 1974
- The mobile programming system, JanusSoftware: Practice and Experience, 1974
- An empirical study of FORTRAN programsSoftware: Practice and Experience, 1971
- The portability of the BCPL compilerSoftware: Practice and Experience, 1971
- Peephole optimizationCommunications of the ACM, 1965
- UNCOL: The Myth and the FactPublished by Elsevier BV ,1961