Engineering a Simple, Efficient Code-Generator Generator

Christopher W. Fraser; David R. Hanson; Todd A. Proebsting

doi:10.1145/151640.151642

Engineering a Simple, Efficient Code-Generator Generator

Christopher W. Fraser, David R. Hanson, Todd A. Proebsting

Research output: Contribution to journal › Article › peer-review

144 Scopus citations

Abstract

Many code-generator generators use tree pattern matching and dynamic programming. This paper describes a simple program that generates matchers that are fast, compact, and easy to understand. It is simpler than common alternatives: 200–700 lines of Icon or 950 lines of C versus 3000 lines of C for Twig and 5000 for burg. Its matchers run up to 25 times faster than Twig's. They are necessarily slower than burg's BURS 1992 matchers, but they are more flexible and still practical.

Original language	English (US)
Pages (from-to)	213-226
Number of pages	14
Journal	ACM Letters on Programming Languages and Systems (LOPLAS)
Volume	1
Issue number	3
DOIs	https://doi.org/10.1145/151640.151642
State	Published - Jan 9 1992
Externally published	Yes

Keywords

Icon programming language
code generation
code-generator generator
dynamic programming
tree pattern matching

ASJC Scopus subject areas

Software
General Engineering

Access to Document

10.1145/151640.151642

Cite this

@article{bb8e832b3b6647708bf254f04e28d388,

title = "Engineering a Simple, Efficient Code-Generator Generator",

abstract = "Many code-generator generators use tree pattern matching and dynamic programming. This paper describes a simple program that generates matchers that are fast, compact, and easy to understand. It is simpler than common alternatives: 200–700 lines of Icon or 950 lines of C versus 3000 lines of C for Twig and 5000 for burg. Its matchers run up to 25 times faster than Twig's. They are necessarily slower than burg's BURS 1992 matchers, but they are more flexible and still practical.",

keywords = "Icon programming language, code generation, code-generator generator, dynamic programming, tree pattern matching",

author = "Fraser, {Christopher W.} and Hanson, {David R.} and Proebsting, {Todd A.}",

year = "1992",

month = jan,

day = "9",

doi = "10.1145/151640.151642",

language = "English (US)",

volume = "1",

pages = "213--226",

journal = "ACM Letters on Programming Languages and Systems (LOPLAS)",

issn = "1057-4514",

number = "3",

}

TY - JOUR

T1 - Engineering a Simple, Efficient Code-Generator Generator

AU - Fraser, Christopher W.

AU - Hanson, David R.

AU - Proebsting, Todd A.

PY - 1992/1/9

Y1 - 1992/1/9

N2 - Many code-generator generators use tree pattern matching and dynamic programming. This paper describes a simple program that generates matchers that are fast, compact, and easy to understand. It is simpler than common alternatives: 200–700 lines of Icon or 950 lines of C versus 3000 lines of C for Twig and 5000 for burg. Its matchers run up to 25 times faster than Twig's. They are necessarily slower than burg's BURS 1992 matchers, but they are more flexible and still practical.

AB - Many code-generator generators use tree pattern matching and dynamic programming. This paper describes a simple program that generates matchers that are fast, compact, and easy to understand. It is simpler than common alternatives: 200–700 lines of Icon or 950 lines of C versus 3000 lines of C for Twig and 5000 for burg. Its matchers run up to 25 times faster than Twig's. They are necessarily slower than burg's BURS 1992 matchers, but they are more flexible and still practical.

KW - Icon programming language

KW - code generation

KW - code-generator generator

KW - dynamic programming

KW - tree pattern matching

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

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

U2 - 10.1145/151640.151642

DO - 10.1145/151640.151642

M3 - Article

AN - SCOPUS:0026916192

SN - 1057-4514

VL - 1

SP - 213

EP - 226

JO - ACM Letters on Programming Languages and Systems (LOPLAS)

JF - ACM Letters on Programming Languages and Systems (LOPLAS)

IS - 3

ER -

Engineering a Simple, Efficient Code-Generator Generator

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this