article

Free access

Automatic construction of incremental LR(1)—parsers

Authors:

Uwe KastensAuthors Info & Claims

ACM SIGPLAN Notices, Volume 23, Issue 3

Pages 33 - 42

https://doi.org/10.1145/43895.43899

Published: 01 March 1988 Publication History

Abstract

An effective method is presented for automatic construction of incremental LR(1) parsers. The resulting parsers allow multiple modifications of the original input as well as epsilon productions in the underlying LR(1) grammar. For parsing a modified input, their space require ment depends linear on the length of the input and their runtime is proportional to the total size of the modifications. The method has been implemented for experimental purposes.

References

[1]

{1} A.V. Aho and J.D. Ullman: The Theory of Parsing, Translation, and Compiling, Vols. 1 & 2, Prentice-Hall, 1972 & 1973.

Digital Library

[2]

{2} R. Agrawal and K.D. Detro: An Efficient Incremental LR Parser for Grammars with Epsilon Productions, Acta Informatica Vol. 19 (1983), pp. 369-376.

Digital Library

[3]

{3} G. Bran et al: The token-oriented approach to program editing, SIGPLAN NOTICES Vol. 20, NO. 2(Feb. 1985), pp. 17-20.

Digital Library

[4]

{4} A. Celentano: Incremental LR Parsing, Acta Informatica, Vol. 10 (1978), pp. 307-321.

[5]

{5} P. Dencker: Ein Neues LALR System, Diplomarbeit, Institut fuer Informatik, Universitaet Karlsruhe, 1977.

[6]

{6} C. Ghezzi and D. Mandrioli: Incremental Parsing, ACM Transaction on Programming Languages and Systems, Vol. 1, No. 1 (1979), pp. 58-70.

Digital Library

[7]

{7} C. Ghezzi and D. Mandrioli: Augmenting Parsers to Support the Incrementality, Journal of ACM, Vol. 27, No. 3 (1980), pp. 564-579.

Digital Library

[8]

{8} F. Jalili and J.H. Gallier: Building Friendly Parsers, Conference Record of the 9-th ACM Symposium on Principles of Programming Languages (January 1982), pp. 196-206.

Digital Library

[9]

{9} G. Kaiser and E. Kant: Incremental Expression Parsing for Syntax-Directed Editors, Report CMU-CS-82-141, Carnegie-Mellon University, 1982.

[10]

{10} U. Kastens, B. Huett and E. Zimmerman: GAG: A Practical Compiler Generator, Lecture Notes on Computer Science 141, Springer Verlag, 1982.

[11]

{11} U. Kastens: Ordered Attribute Grammars, Acta Informatica, Vol. 12(1980), pp. 229-256.

[12]

{12} J. Morris and M. Schwartz: The Design of a Language-Directed Editor for Block-Structured Languages, Proceedings of the ACM SIGPLAN-SIGOA Symposium on Text Manipulation. (June 1981), pp. 28-33.

Digital Library

[13]

{13} M. Wegman: Parsing for Structural Editors, The 21-st Annual Symposium on Foundation of Computer Science, (1980), pp. 320-327.

[14]

{14} D. Yeh: On Incremental Shift-Reduce Parsing, BIT 23:1(1983), pp. 36-48.

[15]

{15} D. Yeh: Incremental Syntactic and Semantic Analysis of Modified Programs, Thesis approved at Division of Computer Science, The Norwegian Institute of Technology, Trondheim, Norway, December 1983.

[16]

{16} D. Yeh and U. Kastens: A Time-Efficient Incremental Evaluation Algorithm for Ordered Attribute Grammars (to be published).

Cited By

Larchevêque J(2005)Using an LALR compiler compiler to generate incremental parsersCompiler Compilers10.1007/3-540-53669-8_80(147-164)Online publication date: 4-Jun-2005
https://doi.org/10.1007/3-540-53669-8_80
Ho SLui S(2003)Exploring the factors affecting internet content filters acceptanceACM SIGecom Exchanges10.1145/844357.8443664:1(29-36)Online publication date: 1-Mar-2003
https://dl.acm.org/doi/10.1145/844357.844366
Guo JSun C(2003)Context representation of product dataACM SIGecom Exchanges10.1145/844357.8443644:1(20-28)Online publication date: 1-Mar-2003
https://dl.acm.org/doi/10.1145/844357.844364
Show More Cited By

Index Terms

Automatic construction of incremental LR(1)—parsers
1. Software and its engineering
  1. Software notations and tools
    1. Compilers
      1. Parsers
    2. General programming languages
      1. Language features
        Data types and structures

Recommendations

LR parsers for natural languages
ACL '84/COLING '84: Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics

MLR, an extended LR parser, is introduced, and its application to natural language parsing is discussed. An LR parser is a shift-reduce parser which is deterministically guided by a parsing table. A parsing table can be obtained automatically from a ...
On different LL and LR parsers used in LLLR parsing

The LLLR parser can be constructed for any LR grammar.The LLLR parser produces the left parse of the input string without backtracking.The canonical LL or the LALL parser can be used as the backbone parser.Small canonical or LALR parsers are used for LL ...
LR(0) grammars generated by LR(0) parsers

Let be an LR (0) parser of a given LR (0) grammar G. Generally, does not only parse the words generated by G but also the words of some other LR (0) grammars different from G . In this paper we shall define a class of LR (0) parsers and ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGPLAN Notices

ACM SIGPLAN Notices Volume 23, Issue 3

March 1988

103 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/43895

Editor:
Richard L. Wexelblat

Issue’s Table of Contents

Copyright © 1988 Authors.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 March 1988

Published in SIGPLAN Volume 23, Issue 3

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

32
Total Citations
View Citations
510
Total Downloads

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

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Larchevêque J(2005)Using an LALR compiler compiler to generate incremental parsersCompiler Compilers10.1007/3-540-53669-8_80(147-164)Online publication date: 4-Jun-2005
https://doi.org/10.1007/3-540-53669-8_80
Ho SLui S(2003)Exploring the factors affecting internet content filters acceptanceACM SIGecom Exchanges10.1145/844357.8443664:1(29-36)Online publication date: 1-Mar-2003
https://dl.acm.org/doi/10.1145/844357.844366
Guo JSun C(2003)Context representation of product dataACM SIGecom Exchanges10.1145/844357.8443644:1(20-28)Online publication date: 1-Mar-2003
https://dl.acm.org/doi/10.1145/844357.844364
Hung PQiu G(2003)Specifying conflict of interest assertions in WS-policy with Chinese wall security policyACM SIGecom Exchanges10.1145/844357.8443624:1(11-19)Online publication date: 1-Mar-2003
https://dl.acm.org/doi/10.1145/844357.844362
Ran S(2003)A model for web services discovery with QoSACM SIGecom Exchanges10.1145/844357.8443604:1(1-10)Online publication date: 1-Mar-2003
https://dl.acm.org/doi/10.1145/844357.844360
Venkatasubramanian N(2002)Safe 'composability' of middleware servicesCommunications of the ACM10.1145/508448.50847345:6(49-52)Online publication date: 1-Jun-2002
https://dl.acm.org/doi/10.1145/508448.508473
Tripathi A(2002)Challenges designing next-generation middleware systemsCommunications of the ACM10.1145/508448.50847145:6(39-42)Online publication date: 1-Jun-2002
https://dl.acm.org/doi/10.1145/508448.508471
Kon FCosta FBlair GCampbell R(2002)The case for reflective middlewareCommunications of the ACM10.1145/508448.50847045:6(33-38)Online publication date: 1-Jun-2002
https://dl.acm.org/doi/10.1145/508448.508470
Callan JConnell M(2001)Query-based sampling of text databasesACM Transactions on Information Systems10.1145/382979.38304019:2(97-130)Online publication date: 1-Apr-2001
https://dl.acm.org/doi/10.1145/382979.383040
Wagner TGraham S(1998)Efficient and flexible incremental parsingACM Transactions on Programming Languages and Systems10.1145/293677.29367820:5(980-1013)Online publication date: 1-Sep-1998
https://dl.acm.org/doi/10.1145/293677.293678
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

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

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents