Simple and efficient BURS table generation

Research output: Chapter in Book/Report/Conference proceedingConference contribution

18 Citations (Scopus)

Abstract

A simple and efficient algorithm for generating bottom-up rewrite system (BURS) 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 on-the-fly elimination of states are generalized and simplified to create a new method, triangle trimming, that is employed in the algorithm.

Original languageEnglish (US)
Title of host publicationSIGPLAN Notices (ACM Special Interest Group on Programming Languages)
PublisherPubl by ACM
Pages331-340
Number of pages10
ISBN (Print)0897914759
StatePublished - 1992
Externally publishedYes
EventProceedings of the ACM SIGPLAN '92 Conference on Programming Language Design and Implementation - San Francisco, CA, USA
Duration: Jun 17 1992Jun 19 1992

Other

OtherProceedings of the ACM SIGPLAN '92 Conference on Programming Language Design and Implementation
CitySan Francisco, CA, USA
Period6/17/926/19/92

Fingerprint

Trimming
Data structures

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software

Cite this

Proebsting, T. A. (1992). Simple and efficient BURS table generation. In SIGPLAN Notices (ACM Special Interest Group on Programming Languages) (pp. 331-340). Publ by ACM.

Simple and efficient BURS table generation. / Proebsting, Todd A.

SIGPLAN Notices (ACM Special Interest Group on Programming Languages). Publ by ACM, 1992. p. 331-340.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Proebsting, TA 1992, Simple and efficient BURS table generation. in SIGPLAN Notices (ACM Special Interest Group on Programming Languages). Publ by ACM, pp. 331-340, Proceedings of the ACM SIGPLAN '92 Conference on Programming Language Design and Implementation, San Francisco, CA, USA, 6/17/92.
Proebsting TA. Simple and efficient BURS table generation. In SIGPLAN Notices (ACM Special Interest Group on Programming Languages). Publ by ACM. 1992. p. 331-340
Proebsting, Todd A. / Simple and efficient BURS table generation. SIGPLAN Notices (ACM Special Interest Group on Programming Languages). Publ by ACM, 1992. pp. 331-340
@inproceedings{de75e4310c464f9aa1c0cf5ebb20bddb,
title = "Simple and efficient BURS table generation",
abstract = "A simple and efficient algorithm for generating bottom-up rewrite system (BURS) 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 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",
language = "English (US)",
isbn = "0897914759",
pages = "331--340",
booktitle = "SIGPLAN Notices (ACM Special Interest Group on Programming Languages)",
publisher = "Publ by ACM",

}

TY - GEN

T1 - Simple and efficient BURS table generation

AU - Proebsting, Todd A

PY - 1992

Y1 - 1992

N2 - A simple and efficient algorithm for generating bottom-up rewrite system (BURS) 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 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 (BURS) 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 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

M3 - Conference contribution

SN - 0897914759

SP - 331

EP - 340

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

PB - Publ by ACM

ER -