ACM Letters on Programming Languages and Systems · 1992 · 211 citations · 13 references
ComputingComputer EngineeringComputer ScienceCompilersDesign AutomationProgramming LanguagesAbstract Syntax TreesCode GenerationPattern GenerationAbstract Syntax Tree GenerationAbstract Syntax Tree Pattern MatchingBottom-up Rewrite SystemsCode Generation By Rewrite RulesPattern MatchingTree Pattern Matching
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.
13
Alfred V. Aho, Margaret J. Corasick · Communications of the ACM · 1975 · 2.9K citations · Full text
Christoph M. Hoffmann, Michael J. O’Donnell · Journal of the ACM · 1982 · 440 citations · Full text
Optimal Code Generation for Expression Trees
Alfred V. Aho, S. C. Johnson · Journal of the ACM · 1976 · 242 citations · Full text