BURS automata generation

Research output: Contribution to journalArticle

27 Citations (Scopus)

Abstract

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.

Original languageEnglish (US)
Pages (from-to)461-486
Number of pages26
JournalACM Transactions on Programming Languages and Systems
Volume17
Issue number3
DOIs
StatePublished - May 1995

Fingerprint

Trimming
Data structures

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software

Cite this

BURS automata generation. / Proebsting, Todd A.

In: ACM Transactions on Programming Languages and Systems, Vol. 17, No. 3, 05.1995, p. 461-486.

Research output: Contribution to journalArticle

@article{30a23e6a566d4e2fb2881cf1312bf301,
title = "BURS automata generation",
abstract = "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.",
author = "Proebsting, {Todd A}",
year = "1995",
month = "5",
doi = "10.1145/203095.203098",
language = "English (US)",
volume = "17",
pages = "461--486",
journal = "ACM Transactions on Programming Languages and Systems",
issn = "0164-0925",
publisher = "Association for Computing Machinery (ACM)",
number = "3",

}

TY - JOUR

T1 - BURS automata generation

AU - Proebsting, Todd A

PY - 1995/5

Y1 - 1995/5

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0029308706&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029308706&partnerID=8YFLogxK

U2 - 10.1145/203095.203098

DO - 10.1145/203095.203098

M3 - Article

AN - SCOPUS:0029308706

VL - 17

SP - 461

EP - 486

JO - ACM Transactions on Programming Languages and Systems

JF - ACM Transactions on Programming Languages and Systems

SN - 0164-0925

IS - 3

ER -