BURS automata generation
In: ACM transactions on programming languages and systems, Jg. 17 (1995), Heft 3, S. 461-486
Online
academicJournal
- print, 15 ref
Zugriff:
A simple and efficient algorithm for generating bottom-up rewrite system (BURS) tables is described. A small code-generator generator implementation produces BURS tables efficiently, even for complex instruction set descriptions. The algorithm does not require novel data structures or complicated algorithmic techniques. Previously published methods for on-the-fly elimination of states are generalized and simplified to create a new method, triangle trimming, that is employed in the algorithm. A prototype implementation, burg, generates BURS tables very efficiently.
Titel: |
BURS automata generation
|
---|---|
Autor/in / Beteiligte Person: | PROEBSTING, T. A |
Link: | |
Zeitschrift: | ACM transactions on programming languages and systems, Jg. 17 (1995), Heft 3, S. 461-486 |
Veröffentlichung: | New York, NY: Association for Computing Machinery, 1995 |
Medientyp: | academicJournal |
Umfang: | print, 15 ref |
ISSN: | 0164-0925 (print) |
Schlagwort: |
|
Sonstiges: |
|