Article

Polish parsers, step by step

Authors:

R. John M. Hughes,

S. Doaitse SwierstraAuthors Info & Claims

ICFP '03: Proceedings of the eighth ACM SIGPLAN international conference on Functional programming

Pages 239 - 248

https://doi.org/10.1145/944705.944727

Published: 25 August 2003 Publication History

Get Access

Abstract

We present the derivation of a space efficient parser combinator library: the constructed parsers do not keep unnecessary references to the input, produce online results and efficiently handle ambiguous grammars. The underlying techniques can be applied in many contexts where traditionally backtracking is used.We present two data types, one for keeping track of the progress of the search process, and one for representing the final result in a linear way. Once these data types are combined into a single type, we can perform a breadth-first search, while returning parts of the result as early as possible.

References

[1]

J. Fokker. Functional parsers. In J. Jeuring and E. Meijer, editors, Advanced Functional Programming, number 925 in Lecture Notes in Computer Science, pages 1--52. Springer-Verlag, Berlin, 1995.

Digital Library

Google Scholar

[2]

G. Hutton and E. Meijer. Monadic parser combinators. Journal of Functional Programming, 8(4):437--444, July 1998.

Digital Library

Google Scholar

[3]

D. J. P. Leijen and H. J. M. Meijer. Parsec: Direct style monadic parser combinators for the real world. UU-CS 2001-35, Department of Computer Science, P.O.Box 80.089, 3508 TB Utrecht, the Netherlands, 2001.

Google Scholar

[4]

S. D. Swierstra. Combinator parsers: From toys to tools. In G. Hutton, editor, Electronic Notes in Theoretical Computer Science, volume 41. Elsevier Science Publishers, 2001.

Google Scholar

[5]

S. D. Swierstra and P. R. Azero Alcocer. Fast, error correcting parser combinators: a short tutorial. In J. Pavelka, G. Tel, and M. Bartosek, editors, SOFSEM'99 Theory and Practice of Informatics, 26th Seminar on Current Trends in Theory and Practice of Informatics, volume 1725 of LNCS, pages 111--129, November 1999.

Digital Library

Google Scholar

[6]

S. D. Swierstra and L. Duponcheel. Deterministic, error-correcting combinator parsers. In J. Launchbury, E. Meijer, and T. Sheard, editors, Advanced Functional Programming, volume 1129 of LNCS-Tutorial, pages 184--207. Springer-Verlag, 1996.

Digital Library

Google Scholar

[7]

E. Visser. Scannerless generalized-lr parsing. P 9707, Programming Research Group, University of Amsterdam, July 1997.

Google Scholar

[8]

P. L. Wadler. How to replace failure by a list of successes. In J. Jouannaud, editor, Functional Programming Languages and Computer Architecture, volume 201 of LNCS, pages 113--128. Springer-Verlag, 1985.

Digital Library

Google Scholar

Cited By

View all

BERNARDY JCLAESSEN K(2015)Efficient parallel and incremental parsing of practical context-free languagesJournal of Functional Programming10.1017/S095679681500013125Online publication date: 23-Jul-2015
https://doi.org/10.1017/S0956796815000131
Hidaka SAsada KHu ZKato HNakano K(2013)Structural recursion for querying ordered graphsACM SIGPLAN Notices10.1145/2544174.250060848:9(305-318)Online publication date: 25-Sep-2013
https://dl.acm.org/doi/10.1145/2544174.2500608
Lorenzen FErdweg S(2013)Modular and automated type-soundness verification for language extensionsACM SIGPLAN Notices10.1145/2544174.250059648:9(331-342)Online publication date: 25-Sep-2013
https://dl.acm.org/doi/10.1145/2544174.2500596
Show More Cited By

Index Terms

Polish parsers, step by step
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language types
        Functional languages

Recommendations

Polish parsers, step by step

We present the derivation of a space efficient parser combinator library: the constructed parsers do not keep unnecessary references to the input, produce online results and efficiently handle ambiguous grammars. The underlying techniques can be applied ...
Deterministic parsing of ambiguous grammars

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 ...
Evaluating GLR parsing algorithms
The fourth workshop on language descriptions, tools, and applications (LDTA'04)

We describe the behaviour of three variants of GLR parsing: (i) Farshi's original Correction to Tomita's non-general algorithm; (ii) the Right Nulled GLR algorithm which provides a more efficient generalisation of Tomita and (iii) the Binary Right ...

Comments

Information & Contributors

Information

Published In

ICFP '03: Proceedings of the eighth ACM SIGPLAN international conference on Functional programming

August 2003

310 pages

ISBN:1581137567

DOI:10.1145/944705

General Chair:
Colin Runciman
University of York, UK
,
Program Chair:
Olin Shivers
Georgia Institute of Technology, USA

ACM SIGPLAN Notices Volume 38, Issue 9
September 2003
289 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/944746
Issue’s Table of Contents

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: 25 August 2003

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

ICFP03

Sponsor:

ICFP03: ACM SIGPLAN International Conference on Functional Programming

August 25 - 29, 2003

Uppsala, Sweden

Acceptance Rates

ICFP '03 Paper Acceptance Rate 24 of 95 submissions, 25%;

Overall Acceptance Rate 333 of 1,064 submissions, 31%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

25
Total Citations
View Citations
519
Total Downloads

Downloads (Last 12 months)7
Downloads (Last 6 weeks)0

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

BERNARDY JCLAESSEN K(2015)Efficient parallel and incremental parsing of practical context-free languagesJournal of Functional Programming10.1017/S095679681500013125Online publication date: 23-Jul-2015
https://doi.org/10.1017/S0956796815000131
Hidaka SAsada KHu ZKato HNakano K(2013)Structural recursion for querying ordered graphsACM SIGPLAN Notices10.1145/2544174.250060848:9(305-318)Online publication date: 25-Sep-2013
https://dl.acm.org/doi/10.1145/2544174.2500608
Lorenzen FErdweg S(2013)Modular and automated type-soundness verification for language extensionsACM SIGPLAN Notices10.1145/2544174.250059648:9(331-342)Online publication date: 25-Sep-2013
https://dl.acm.org/doi/10.1145/2544174.2500596
McDonell TChakravarty MKeller GLippmeier B(2013)Optimising purely functional GPU programsACM SIGPLAN Notices10.1145/2544174.250059548:9(49-60)Online publication date: 25-Sep-2013
https://dl.acm.org/doi/10.1145/2544174.2500595
Delbianco GNanevski A(2013)Hoare-style reasoning with (algebraic) continuationsACM SIGPLAN Notices10.1145/2544174.250059348:9(363-376)Online publication date: 25-Sep-2013
https://dl.acm.org/doi/10.1145/2544174.2500593
Chlipala A(2013)The bedrock structured programming systemACM SIGPLAN Notices10.1145/2544174.250059248:9(391-402)Online publication date: 25-Sep-2013
https://dl.acm.org/doi/10.1145/2544174.2500592
Abel APientka B(2013)Wellfounded recursion with copatternsACM SIGPLAN Notices10.1145/2544174.250059148:9(185-196)Online publication date: 25-Sep-2013
https://dl.acm.org/doi/10.1145/2544174.2500591
Kammar OLindley SOury N(2013)Handlers in actionACM SIGPLAN Notices10.1145/2544174.250059048:9(145-158)Online publication date: 25-Sep-2013
https://dl.acm.org/doi/10.1145/2544174.2500590
Bernardy JClaessen K(2013)Efficient divide-and-conquer parsing of practical context-free languagesACM SIGPLAN Notices10.1145/2544174.250057648:9(111-122)Online publication date: 25-Sep-2013
https://dl.acm.org/doi/10.1145/2544174.2500576
Hritcu CHughes JPierce BSpector-Zabusky AVytiniotis DAzevedo de Amorim ALampropoulos L(2013)Testing noninterference, quicklyACM SIGPLAN Notices10.1145/2544174.250057448:9(455-468)Online publication date: 25-Sep-2013
https://dl.acm.org/doi/10.1145/2544174.2500574
Show More Cited By

View Options

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

Polish parsers, step by step

Deterministic parsing of ambiguous grammars

Evaluating GLR parsing algorithms