Combinator parsers: From toys to tools

Electronic Notes in Theoretical Computer Science

Volumn 41, Issue 1, 2001, Pages 38-59

  Swierstra, S D ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; ENCODING (SYMBOLS); ERROR CORRECTION; PROGRAM COMPILERS; RECURSIVE FUNCTIONS; SEMANTICS;

COMBINATOR PARSERS; GRAMMER; LEFT FACTORING; SEMANTIC PROCESSING;

COMBINATORIAL MATHEMATICS;

EID: 0012574830     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80545-6     Document Type: Conference Paper

References (7)

1. Burge W.H. Recursvie Programming Techniques. 1975;Addison Wesley
2. M. M. T. Chakravarty. Lazy lexing is fast. In A. Middeldorp and T. Sato, editors, Fourth Fuji International Symposium on Functional and Logic Programming: FLOPS 99, number 1722 in LNCS, pages 68-84,1999.
3. J. Fokker. Functional parsers. In J. Jeuring and H. Meijer, editors, Advanced Functional Programming, number 925 in LNCS, pages 1-52, 1995.
4. Hutton G., Meijer H. Monadic parser combinators. Journal of Functional Programming. 8:(4):1988;437-444
5. J. Jeuring and S. Swierstra. Lecture notes on grammars and parsing. http://www.cs.uu.nl/people/doaitse/Books/GramPars2000.pdf.
6. S. Swierstra and P. 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.
7. Swierstra S., Duponcheel L. Deterministic, error-correcting combinator parsers. Launchbury J., Meijer E., Sheard T. Advanced Functional Programming, volume 1129 of LNCS-Tutorial. 1996;184-207 Springer-Verlag