Abstract
A simple and efficient algorlthm for generating bottom-up rewrite system (BURS) tables 1s described. A small code-generator generator Implementation produces BURS tables efficiently, even for complex instruction set descriptions The algorlthm does not reqrure novel data structures or cornphcated algorithmic techniques Previously publmhed methods for on-the-fly ellmmatlon of states are generahzed and simphfied to create a new method, tmangle trzmmzng, that is employed m the algorlthm A prototype Implementation, burg, generates BURS tables very efficiently.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 461-486 |
| Number of pages | 26 |
| Journal | ACM Transactions on Programming Languages and Systems (TOPLAS) |
| Volume | 17 |
| Issue number | 3 |
| DOIs | |
| State | Published - May 1 1995 |
Keywords
- Code generation
- code-generator generator
- dynamic programming
- tree pattern matchmg
ASJC Scopus subject areas
- Software