Engineering a simple, efficient code-generator generator
Christopher W. Fraser, David R. Hanson, Todd A. Proebsting · ACM Letters on Programming Languages and Systems · 1992
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 (bottom-up rewrite system) matchers, but they are more flexible and still practical.
Cited by 210 works. doi:10.1145/151640.151642
Authors
References
- Compilers: Principles, Techniques, and Tools
- Efficient string matching
- The icon programming language
- Optimal Code Generation for Expression Trees
- Pattern Matching in Trees
- Code generation using tree matching and dynamic programming
- A retargetable compiler for ANSI C
- BURG
- A code generation interface for ANSI C
- Optimal code generation for expression trees: an application BURS theory