Thumbnail
Access Restriction
Subscribed

Author Johnson, S. C. ♦ Ullman, J. D. ♦ Aho, A. V.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Ambiguous grammars ♦ Parser generation ♦ Programming language specification ♦ Ll parsing ♦ Lr parsing ♦ Syntax analysis ♦ Translator writing systems
Abstract Methods of describing the syntax of programming languages in ways that are more flexible and natural than conventional BNF descriptions are considered. These methods involve the use of ambiguous context-free grammars together with rules to resolve syntactic ambiguities. It is shown how efficient LR and LL parsers can be constructed directly from certain classes of these specifications.
Description Affiliation: Bell Labs., Murray Hill, NJ (Aho, A. V.; Johnson, S. C.) || Princeton Univ., Princeton, NJ (Ullman, J. D.)
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 18
Issue Number 8
Page Count 12
Starting Page 441
Ending Page 452


Open content in new tab

   Open content in new tab
Source: ACM Digital Library