Article

Free access

Incremental generation of parsers

Authors:

J. RekersAuthors Info & Claims

PLDI '89: Proceedings of the ACM SIGPLAN 1989 conference on Programming language design and implementation

Pages 179 - 191

https://doi.org/10.1145/73141.74834

Published: 21 June 1989 Publication History

Abstract

An LR-based parser generator for arbitrary context-free grammars is described, which generates parsers by need and processes grammar modifications by updating already existing parsers. We motivate the need for these techniques in the context of interactive language definition environments, present all required algorithms, and give measurements comparing their performance with that of conventional techniques.

References

[1]

A.V. Aho, R. Sethi, and J.D. Ullman, Compilers. Principles, Techniques and Tools, Addison-Wesley (1986).

Digital Library

[2]

J.A. Bergstra, J. Heering, and P. Klint (eds.), Algebraic Specification, ACM Press Frontier Series, The ACM Press in co-operation with Addison-Wesley (1989).

[3]

J. Earley, "An efficient context-flee parsing algorithm,'' Communications of the A CM 13(2), pp. 94-102 (1970).

Digital Library

[4]

K. Futatsugi, J.A. Goguen, J.-P. Jouannaud, and J. Mes~guer, "Principles of OBJ2," pp. 52-66 in Conference Record of the Twelfth Annual A CM Symposium on Principles of Programming Languages, ACM (1985).

Digital Library

[5]

J. Heering, P. Klint, and J. Rekers, "Incremental generation of lexical scanners," Report CS- R8761, Centre for Mathematics and Computer Science, Amsterdam (1987).

[6]

J. Heefing, P. Klint, and J. Rekers, "Principles of lazy and incremental program generation," Report CS-R8749, Centre for Mathematics and Computer Science, Amsterdam (1987).

[7]

R.N. Horspool, "Incremental generation of LR parsers," Report DCS-79-IR, University of Victoria, Victoria, B.C., Canada (1988).

[8]

S.C. Johnson, "YACC: yet another compilercompiler," in UNIX Programmer's Manual 2B, Bell Laboratories (I 979).

[9]

K. Koskimies, Lazy recursive descent parsing for modular language implementation, Draft, GMD Forschungstelle an dcr Universitat Karlsruhe (1989).

[10]

B. Lang, "Deterministic techniques for efficient non-deterministic parsers," pp. 255-269 in Proceedings of the Second Colloquium on Automata, Languages and Programming, ed. J. Loeckx, Lecture Notes in Computer Science 14, Springer-Verlag (1974).

Digital Library

[11]

LeLisp, Version 15.21, le manuel de rdfdrence, INRIA, Rocquencourt (1987).

[12]

J. Rekers, A parser generator for finitely ambiguous context-free grammars (1989), Chapter 8 in {BHK89}.

[13]

J. Rekers, "Modular Parser Generation," Centre for Mathematics and Computer Science, Amsterdam, to appear.

[14]

D. Sandberg, "LITHE: A language combining a flexible syntax and classes," pp. 142-145 in Conference Record of the Ninth Annual ACM Symposium on Principles of Programming Languages, ACM (1982).

Digital Library

[15]

M. Tomita, Efficient Parsing for Natural Languages, Kluwer Academic Publishers (1985).

Digital Library

[16]

F. Voisin, "CIGALE: a tool for interactive grammar construction and expression parsing," Science of Computer Programming 7, pp. 61-86 (1986).

Digital Library

Cited By

Amorim LSteindorfer MVisser ECombemale BMernik MRumpe B(2017)Deep priority conflicts in the wild: a pilot studyProceedings of the 10th ACM SIGPLAN International Conference on Software Language Engineering10.1145/3136014.3136020(55-66)Online publication date: 23-Oct-2017
https://dl.acm.org/doi/10.1145/3136014.3136020
Bennaceur AAndriescu ECardoso RIssarny V(2015)A unifying perspective on protocol mediation: interoperability in the future internetJournal of Internet Services and Applications10.1186/s13174-015-0027-36:1Online publication date: 13-Jun-2015
https://doi.org/10.1186/s13174-015-0027-3
Koskimies K(2006)Lazy recursive descent parsing for modular language implementationSoftware: Practice and Experience10.1002/spe.438020080220:8(749-772)Online publication date: 30-Oct-2006
https://doi.org/10.1002/spe.4380200802
Show More Cited By

Index Terms

Incremental generation of parsers
1. Software and its engineering
  1. Software notations and tools
    1. System description languages
      1. Specification languages
2. Theory of computation
  1. Formal languages and automata theory
    1. Grammars and context-free languages
  2. Semantics and reasoning
    1. Program reasoning
      1. Parsing

Recommendations

Incremental Generation of Parsers

An LR-based parser generator for arbitrary context-free grammars that generates parsers by need and handles modifications to its input grammar by updating the parser it has generated so far is described. The need for these techniques is discussed in the ...
Incremental generation of parsers
Proceedings of the SIGPLAN '89 symposium on Interpreters and interpretive techniques

An LR-based parser generator for arbitrary context-free grammars is described, which generates parsers by need and processes grammar modifications by updating already existing parsers. We motivate the need for these techniques in the context of ...
Multibox parsers

Traditional compiler front end generating tools such as Lex/Yacc assume a front end consisting of two boxes: a lexical box and a syntax box. Lex produces a lexical analyzer using regular expressions as a token description. Yacc generates a syntax ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PLDI '89: Proceedings of the ACM SIGPLAN 1989 conference on Programming language design and implementation

June 1989

355 pages

ISBN:089791306X

DOI:10.1145/73141

Editor:
R. L. Wexelblat
ACM Headquarters, New York, NY

ACM SIGPLAN Notices Volume 24, Issue 7
Proceedings of the SIGPLAN '89 symposium on Interpreters and interpretive techniques
July 1989
355 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/74818
Editor:
Richard Wexelblat
Issue’s Table of Contents

Copyright © 1989 ACM.

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]

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 June 1989

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PLDI89

Sponsor:

SIGPLAN

PLDI89: Programming Language Design & Implementation

June 19 - 23, 1989

Oregon, Portland, USA

Acceptance Rates

Overall Acceptance Rate 406 of 2,067 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

19
Total Citations
View Citations
695
Total Downloads

Downloads (Last 12 months)45
Downloads (Last 6 weeks)10

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Amorim LSteindorfer MVisser ECombemale BMernik MRumpe B(2017)Deep priority conflicts in the wild: a pilot studyProceedings of the 10th ACM SIGPLAN International Conference on Software Language Engineering10.1145/3136014.3136020(55-66)Online publication date: 23-Oct-2017
https://dl.acm.org/doi/10.1145/3136014.3136020
Bennaceur AAndriescu ECardoso RIssarny V(2015)A unifying perspective on protocol mediation: interoperability in the future internetJournal of Internet Services and Applications10.1186/s13174-015-0027-36:1Online publication date: 13-Jun-2015
https://doi.org/10.1186/s13174-015-0027-3
Koskimies K(2006)Lazy recursive descent parsing for modular language implementationSoftware: Practice and Experience10.1002/spe.438020080220:8(749-772)Online publication date: 30-Oct-2006
https://doi.org/10.1002/spe.4380200802
Waller E(2005)Schema updates and consistencyDeductive and Object-Oriented Databases10.1007/3-540-55015-1_9(167-188)Online publication date: 4-Jun-2005
https://doi.org/10.1007/3-540-55015-1_9
Klint P(2005)A meta-environment for generating programming environmentsAlgebraic Methods II: Theory, Tools and Applications10.1007/3-540-53912-3_20(105-124)Online publication date: 5-Jun-2005
https://doi.org/10.1007/3-540-53912-3_20
Jacquenet FFoucherot I(1996)A new logical view of knowledge manipulation with PROLOG1996 Australian New Zealand Conference on Intelligent Information Systems. Proceedings. ANZIIS 9610.1109/ANZIIS.1996.573874(2-5)Online publication date: 1996
https://doi.org/10.1109/ANZIIS.1996.573874
Blot IFoucherot IJacquenet F(1994)Intelligent knowledge manipulation in PROLOGProceedings of ANZIIS '94 - Australian New Zealnd Intelligent Information Systems Conference10.1109/ANZIIS.1994.396998(407-411)Online publication date: 1994
https://doi.org/10.1109/ANZIIS.1994.396998
Pattersson MFritzson P(1992)DML-a meta-language and system for the generation of practical and efficient compilers from denotational specificationsProceedings of the 1992 International Conference on Computer Languages10.1109/ICCL.1992.185475(127-136)Online publication date: 1992
https://doi.org/10.1109/ICCL.1992.185475
Yellin DStrom R(1991)INCACM Transactions on Programming Languages and Systems10.1145/103135.10313713:2(211-236)Online publication date: 1-Apr-1991
https://dl.acm.org/doi/10.1145/103135.103137
Burshteyn B(1990)Generation and recognition of formal languages by modifiable grammarsACM SIGPLAN Notices10.1145/122193.12219625:12(45-53)Online publication date: 1-Dec-1990
https://dl.acm.org/doi/10.1145/122193.122196
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 Table of Contents