Article

Free access

The care and feeding of LR(k) grammars

Authors:

Alfred V. Aho,

Jeffrey D. UllmanAuthors Info & Claims

STOC '71: Proceedings of the third annual ACM symposium on Theory of computing

Pages 159 - 170

https://doi.org/10.1145/800157.805048

Published: 03 May 1971 Publication History

PDF eReader

Abstract

We consider methods of modifying LR(k) parsers [1] while preserving the ability of that parsing method to detect errors at the earliest possible point on the input. Two transformations are developed, and the methods of Korenjak [2] and DeRemer [3] are expressed in terms of these transformations. The relation between these two methods is exposed. Proofs are for the most part omitted, but can be found in [4].

References

[1]

D. E. Knuth, "On the translation of languages from left to right," Inf. Control, Vol. 8, no. 6, 607-639, 1965.

Crossref

Google Scholar

[2]

A. J. Korenjak, "A practical method for constructing LR(k) processors," Comm. ACM, vol 12, no. 11, November 1969, 613-623.

Digital Library

Google Scholar

[3]

F. DeRemer, Practical Translators for LR(k) Languages, Project MAC Report MAC TR-65, October 1969, Cambridge, Mass.

Digital Library

Google Scholar

[4]

A and U, The Sensuous Compiler, Prentice Hall, Englewood Cliffs, New Jersey, to appear.

Google Scholar

Cited By

View all

Oyang YHsu C(1982)Extended LL(k) grammars and parsersProceedings of the 20th annual Southeast regional conference10.1145/503896.503938(240-245)Online publication date: 1-Apr-1982
https://dl.acm.org/doi/10.1145/503896.503938
Pager DAho ABorodin AConstable RFloyd RHarrison MKarp RStrong H(1973)The lane tracing algorithm for constructing LR(k) parsersProceedings of the fifth annual ACM symposium on Theory of computing10.1145/800125.804048(172-181)Online publication date: 30-Apr-1973
https://dl.acm.org/doi/10.1145/800125.804048
Aho AUllman JFischer PZeiger HUllman JRosenberg A(1972)A technique for speeding up LR(k) parsersProceedings of the fourth annual ACM symposium on Theory of computing10.1145/800152.804920(251-263)Online publication date: 1-May-1972
https://dl.acm.org/doi/10.1145/800152.804920
Show More Cited By

Index Terms

The care and feeding of LR(k) grammars
1. Theory of computation
  1. Semantics and reasoning
    1. Program reasoning
      1. Parsing

Recommendations

LR(k)-parsing of Coupled-Context-Free Grammars
COLING '94: Proceedings of the 15th conference on Computational linguistics - Volume 1

Coupled-Context-Free Grammars are a generalization of context-free grammars obtained by combining nonterminals to parentheses which can only be substituted simultaneously. Referring to the generative capacity of the grammars we obtain an infinite ...
Parsing extended LR(k) grammars

An extended LR(k) (ELR(k)) grammar is a context free grammar in which the right sides of the productions are regular expressions and which can be parsed from left to right with k symbol look-ahead. We present a practical algorithm for producing small ...
Simple LR(k) grammars

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

Comments

Information & Contributors

Information

Published In

STOC '71: Proceedings of the third annual ACM symposium on Theory of computing

May 1971

270 pages

ISBN:9781450374644

DOI:10.1145/800157

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 03 May 1971

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

STOC '71 Paper Acceptance Rate 23 of 50 submissions, 46%;

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
399
Total Downloads

Downloads (Last 12 months)61
Downloads (Last 6 weeks)3

Reflects downloads up to 26 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Oyang YHsu C(1982)Extended LL(k) grammars and parsersProceedings of the 20th annual Southeast regional conference10.1145/503896.503938(240-245)Online publication date: 1-Apr-1982
https://dl.acm.org/doi/10.1145/503896.503938
Pager DAho ABorodin AConstable RFloyd RHarrison MKarp RStrong H(1973)The lane tracing algorithm for constructing LR(k) parsersProceedings of the fifth annual ACM symposium on Theory of computing10.1145/800125.804048(172-181)Online publication date: 30-Apr-1973
https://dl.acm.org/doi/10.1145/800125.804048
Aho AUllman JFischer PZeiger HUllman JRosenberg A(1972)A technique for speeding up LR(k) parsersProceedings of the fourth annual ACM symposium on Theory of computing10.1145/800152.804920(251-263)Online publication date: 1-May-1972
https://dl.acm.org/doi/10.1145/800152.804920
Ullman J(1972)Applications of language theory to compiler designProceedings of the May 16-18, 1972, spring joint computer conference10.1145/1478873.1478904(235-242)Online publication date: 16-May-1972
https://dl.acm.org/doi/10.1145/1478873.1478904

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

LR(k)-parsing of Coupled-Context-Free Grammars

Parsing extended LR(k) grammars

Simple LR(k) grammars

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

Abstract

References

Cited By

Index Terms

Recommendations

LR(k)-parsing of Coupled-Context-Free Grammars

Parsing extended LR(k) grammars

Simple LR(k) grammars

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations