Using Peephole Optimization on Intermediate Code

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

doi:10.1145/357153.357155

Using Peephole Optimization on Intermediate Code

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

Computer Systems

Research output: Contribution to Journal › Article › Academic › peer-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 language	English
Pages (from-to)	21-36
Number of pages	16
Journal	ACM Transactions on Programming Languages and Systems
Volume	4
Issue number	1
DOIs	https://doi.org/10.1145/357153.357155
Publication status	Published - 1 Jan 1982

Keywords

abstract machine
intermediate code
peephole optimizer

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

10.1145/357153.357155

Persistent URL (handle)

Copy link address

Cite this

@article{67d63cdad743490eb695110d4a7dbcd8,

title = "Using Peephole Optimization on Intermediate Code",

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. {\textcopyright} 1982, ACM. All rights reserved.",

keywords = "abstract machine, intermediate code, peephole optimizer",

author = "A.S. Tanenbaum and {van Staveren}, H. and J.W. Stevenson",

year = "1982",

month = jan,

day = "1",

doi = "10.1145/357153.357155",

language = "English",

volume = "4",

pages = "21--36",

journal = "ACM Transactions on Programming Languages and Systems",

issn = "0164-0925",

publisher = "Association for Computing Machinery (ACM)",

number = "1",

}

TY - JOUR

T1 - Using Peephole Optimization on Intermediate Code

AU - Tanenbaum, A.S.

AU - van Staveren, H.

AU - Stevenson, J.W.

PY - 1982/1/1

Y1 - 1982/1/1

N2 - 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.

AB - 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.

KW - abstract machine

KW - intermediate code

KW - peephole optimizer

UR - http://www.scopus.com/inward/record.url?scp=84976650258&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84976650258&partnerID=8YFLogxK

U2 - 10.1145/357153.357155

DO - 10.1145/357153.357155

M3 - Article

SN - 0164-0925

VL - 4

SP - 21

EP - 36

JO - ACM Transactions on Programming Languages and Systems

JF - ACM Transactions on Programming Languages and Systems

IS - 1

ER -

Using Peephole Optimization on Intermediate Code

Abstract

Keywords

UN SDGs

Access to Document

Persistent URL (handle)

Other files and links

Fingerprint

Cite this