Simple and Efficient BURS Table Generation

Todd A. Proebsting

doi:10.1145/143103.143145

Simple and Efficient BURS Table Generation

Todd A. Proebsting

Research output: Contribution to journal › Article › peer-review

22 Scopus citations

Abstract

A simple and efficient algorithm for generating bottom-up rewrite system 1992 tables is described. A small prototype implementation produces tables 10 to 30 times more quickly than the best current techniques. The algorithm does not require novel data structures or complicated algorithmic techniques. Previously published methods for the on-the-fly elimination of states are generalized and simplified to create a new method, triangle trimming, that is employed in the algorithm.

Original language	English (US)
Pages (from-to)	331-340
Number of pages	10
Journal	SIGPLAN Notices (ACM Special Interest Group on Programming Languages)
Volume	27
Issue number	7
DOIs	https://doi.org/10.1145/143103.143145
State	Published - Jan 7 1992
Externally published	Yes

ASJC Scopus subject areas

Software
Computer Graphics and Computer-Aided Design

Access to Document

10.1145/143103.143145

Cite this

@article{de75e4310c464f9aa1c0cf5ebb20bddb,

title = "Simple and Efficient BURS Table Generation",

abstract = "A simple and efficient algorithm for generating bottom-up rewrite system 1992 tables is described. A small prototype implementation produces tables 10 to 30 times more quickly than the best current techniques. The algorithm does not require novel data structures or complicated algorithmic techniques. Previously published methods for the on-the-fly elimination of states are generalized and simplified to create a new method, triangle trimming, that is employed in the algorithm.",

author = "Proebsting, {Todd A.}",

year = "1992",

month = jan,

day = "7",

doi = "10.1145/143103.143145",

language = "English (US)",

volume = "27",

pages = "331--340",

journal = "SIGPLAN Notices (ACM Special Interest Group on Programming Languages)",

issn = "0362-1340",

publisher = "Association for Computing Machinery (ACM)",

number = "7",

}

TY - JOUR

T1 - Simple and Efficient BURS Table Generation

AU - Proebsting, Todd A.

PY - 1992/1/7

Y1 - 1992/1/7

N2 - A simple and efficient algorithm for generating bottom-up rewrite system 1992 tables is described. A small prototype implementation produces tables 10 to 30 times more quickly than the best current techniques. The algorithm does not require novel data structures or complicated algorithmic techniques. Previously published methods for the on-the-fly elimination of states are generalized and simplified to create a new method, triangle trimming, that is employed in the algorithm.

AB - A simple and efficient algorithm for generating bottom-up rewrite system 1992 tables is described. A small prototype implementation produces tables 10 to 30 times more quickly than the best current techniques. The algorithm does not require novel data structures or complicated algorithmic techniques. Previously published methods for the on-the-fly elimination of states are generalized and simplified to create a new method, triangle trimming, that is employed in the algorithm.

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

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

U2 - 10.1145/143103.143145

DO - 10.1145/143103.143145

M3 - Article

AN - SCOPUS:0026985241

SN - 0362-1340

VL - 27

SP - 331

EP - 340

JO - SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

JF - SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

IS - 7

ER -

Simple and Efficient BURS Table Generation

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this