Engineering a simple, efficient code-generator generator (1992)
Cached
Download Links
- [www.well.com]
- [www.research.microsoft.com]
- [storage.webhop.net]
- [ftp.cs.princeton.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | ACM Letters on Programming Languages and Systems |
| Citations: | 107 - 5 self |
BibTeX
@ARTICLE{Fraser92engineeringa,
author = {Christopher W Fraser and David R. Hanson and Todd A. Proebsting},
title = {Engineering a simple, efficient code-generator generator},
journal = {ACM Letters on Programming Languages and Systems},
year = {1992},
volume = {1},
pages = {213--226}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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. Categories and Subject Descriptors: D.3.4 [Programming Languages]: Processors—code gener-ation; compilers; translator writing systems and compiler generators
