The DOI matches its Crossref record.
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 (bottom-up rewrite system) matchers, but they are more flexible and still practical.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
SPIRAL: Code Generation for DSP Transforms
Puschel, M., Moura, J. M. F., Johnson, J. R., Padua, D., Veloso, M. M., Singer, B. W., Xiong, J., Franchetti, F., Gacic, A., Voronenko, Y., et al. (2005) · Proceedings of the IEEE · doi:10.1109/jproc.2004.840306 · Cited by 826
The Garp architecture and C compiler
Callahan, T. J., Hauser, J. R., & Wawrzynek, J. (2000) · Computer · doi:10.1109/2.839323 · Cited by 392
Toward an engineering discipline for grammarware
Klint, P., Lämmel, R., & Verhoef, C. (2005) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/1072997.1073000 · Cited by 271
Metadata
- Authors
- Fraser, C. W., Hanson, D. R., & Proebsting, T. A.
- Venue
- ACM Letters on Programming Languages and Systems
- Published
- 1992-09
- Volume
- 1
- Issue
- 3
- Pages
- 213-226
- ISSN
- 1057-4514 (ISSN-L)
- 1557-7384
- OpenAlex
- W2136285318
- Cited by
- 210
- References
- 0
- FWCI
- 5.37
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Engineering a simple, efficient code-generator generator. https://app.cochat.ai/papers/10.1145/151640.151642
- The paper
- Fraser, C. W., Hanson, D. R., & Proebsting, T. A. (1992). Engineering a simple, efficient code-generator generator. ACM Letters on Programming Languages and Systems. https://doi.org/10.1145/151640.151642
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.