Polish parsers, step by step

ACM SIGPLAN Notices

Volumn 38, Issue 9, 2003, Pages 239-248

  Hughes, R John M ^a   Swierstra, S Doaitse ^b  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Ambiguous grammars; Breadth first search; GLR parsing; Online results; Parser combinators; Polish representation

Indexed keywords

CONTEXT FREE GRAMMARS; ONLINE SYSTEMS; OPTIMIZATION; PROGRAM INTERPRETERS; SYNTACTICS;

AMBIGUOUS GRAMMARS; BREADTH FIRST SEARCH; ONLINE RESULTS; PARSER COMBINATORS; PARSERS; POLISH REPRESENTATION;

PROGRAM DIAGNOSTICS;

EID: 1442313296     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/944746.944727     Document Type: Conference Paper

References (8)

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.
2. G. Hutton and E. Meijer. Monadic parser combinators. Journal of Functional Programming, 8(4):437-444, July 1998.
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.
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.
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.
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.
7. E. Visser. Scannerless generalized-lr parsing. P 9707, Programming Research Group, University of Amsterdam, July 1997.
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.