Fast, error correcting parser combinators: A short tutorial

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1725, Issue , 1999, Pages 112-131

  Doaitse Swierstra, S ^a   Azero Alcocer, Pablo R ^a,b  

^a UTRECHT UNIVERSITY   (Netherlands)

^b UNIVERSIDAD MAYOR DE SAN SIMÓN   (Bolivia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957614599     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47849-3_7     Document Type: Conference Paper

References (5)

1. Hutton, G., Meijer, E. Monadic parser combinators.. Journal of Functional Programming, 8(4):437-444, July 1998.
2. Fokker J. Functional parsers. In Jeuring J. and Meijer E., (Eds.), Advanced Functional Programming, Vol. 925 in Lecture Notes in Computer Science, pp. 1-52 Springer-Verlag, Berlin, 1995.
3. Hammond, K., Peterson, J. (Eds). Haskell 1.4 report. Available at: http://www.haskell.org/, May 1997.
4. Milder R., Tofte M., Harper R. The De_nition of Standard ML. MIT Press, 1990.
5. Swierstra S. D., Duponcheel L. Deterministic, error-correcting combinator parsers. In John Launchbury, Erik Meijer, and Tim Sheard (Eds.), Advanced Functional Programming, Vol. 1129 in Lecture Notes in Computer Science, pp.184-207. Springer- Verlag, 1996.