Thumbnail
Access Restriction
Subscribed

Author DeRemer, Franklin L.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Context-free grammar ♦ Lr(k) grammar ♦ Parsing algorithm ♦ Syntactic analysis ♦ Deterministic pushdown automaton ♦ Precedence grammar ♦ Finite-state machine ♦ Parser
Abstract A class of context-free grammars, called the “Simple LR(k)” or SLR(k) grammars is defined. This class has been shown to include weak precedence and simple precedence grammars as proper subsets. How to construct parsers for the SLR(k) grammars is also shown. These parser-construction techniques are extendible to cover all of the LR(k) grammars of Knuth; they have been implemented and by direct comparison proved to be superior to precedence techniques, not only in the range of grammars covered, but also in the speed of parser construction and in the size and speed of the resulting parsers.
Description Affiliation: Univ. of California, Santa Cruz (DeRemer, Franklin L.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 14
Issue Number 7
Page Count 8
Starting Page 453
Ending Page 460


Open content in new tab

   Open content in new tab
Source: ACM Digital Library