Using Peephole Optimization on Intermediate Code

A.S. Tanenbaum, H. van Staveren, J.W. Stevenson

Research output: Contribution to JournalArticleAcademicpeer-review

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 reserved.
Original languageEnglish
Pages (from-to)21-36
Number of pages16
JournalACM Transactions on Programming Languages and Systems
Volume4
Issue number1
DOIs
Publication statusPublished - 1 Jan 1982

Keywords

  • abstract machine
  • intermediate code
  • peephole optimizer

Fingerprint Dive into the research topics of 'Using Peephole Optimization on Intermediate Code'. Together they form a unique fingerprint.

Cite this