Engineering a simple, efficient code-generator generator
- 1 September 1992
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Letters on Programming Languages and Systems
- Vol. 1 (3), 213-226
- https://doi.org/10.1145/151640.151642
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 (bottom-up rewrite system) matchers, but they are more flexible and still practical.Keywords
This publication has 9 references indexed in Scilit:
- BURGACM SIGPLAN Notices, 1992
- A retargetable compiler for ANSI CACM SIGPLAN Notices, 1991
- A code generation interface for ANSI CSoftware: Practice and Experience, 1991
- Hard‐coding bottom‐up code generation tables to save time and spaceSoftware: Practice and Experience, 1991
- Efficient retargetable code generation using bottom-up tree pattern matchingComputer Languages, 1990
- Code generation using tree matching and dynamic programmingACM Transactions on Programming Languages and Systems, 1989
- Pattern Matching in TreesJournal of the ACM, 1982
- Optimal Code Generation for Expression TreesJournal of the ACM, 1976
- Efficient string matchingCommunications of the ACM, 1975