Combinator parsing: A short tutorial

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

Volumn 5520 LNCS, Issue , 2009, Pages 252-300

  Swierstra, S Doaitse ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATOR LIBRARY; COMBINATORS; DOMAIN SPECIFIC; EMBEDDED LANGUAGES; PARSER COMBINATORS; PROGRAMMING LANGUAGE; TYPE SYSTEMS;

COMPUTER SOFTWARE; LIBRARIES; LINGUISTICS; SOFTWARE DESIGN;

QUERY LANGUAGES;

EID: 70349113488     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03153-3_6     Document Type: Conference Paper

References (19)

1. Baars, A.I., Löh, A., Swierstra, S.D.: Parsing permutation phrases. J. Funct. Program. 14(6), 635-646 (2004)
2. Burge, W.H.: Recursive Programming Techniques. Addison-Wesley, Reading (1975)
3. Claessen, K.: Parallel parsing processes. Journal of Functional Programming 14(6), 741-757 (2004)
4. Fokker, J.: Functional parsers. In: Jeuring, J.T., Meijer, H.J.M. (eds.) AFP 1995. LNCS, vol.925, pp. 1-23. Springer, Heidelberg (1995)
5. Heeren, B.: Top Quality Type Error Messages. PhD thesis, Utrecht University (2005)
6. Heeren, B., Hage, J., Swierstra, S.D.: Scripting the type inference process. In: Eighth ACM Sigplan International Conference on Functional Programming, pp. 3-13. ACM Press, New York (2003)
7. Hughes, J.: Generalising monads to arrows. Science of Computer Programming 37(1-3), 67-111 (2000)
8. Hutton, G., Meijer, E.: Monadic parsing in Haskell. J. Funct. Program. 8(4), 437-444 (1998)
9. Leijen, D.: Parsec, a fast combinator parser. Technical Report UU-CS-2001-2026, Institute of Information and Computing Sciences, Utrecht University (2001)
10. Mcbride, C., Paterson, R.A.: Applicative programming with effects. Journal of Functional Programming 18(1), 1-13 (2008)
11. Peyton Jones, S.: Haskell 98 Language and Libraries. Cambridge University Press, Cambridge (2003), http://www.haskell.org/report
12. Röjemo, N.: Garbage collection and memory efficiency in lazy functional languages. PhD thesis, Chalmers University of Technology (1995)
13. Swierstra, S.D., Baars, A., Löh, A., Middelkoop, A.: uuag - Utrecht university attribute grammar system
14. Swierstra, S.D., Azero Alocer, P.R., Saraiava, J.: Designing and implementing com-binator languages. In: Swierstra, S.D., Henriques, P., Oliveira, J. (eds.) AFP 1998. LNCS, vol.1608, pp. 150-206. Springer, Heidelberg (1999)
15. Swierstra, S.D., Duponcheel, L.: Deterministic, error-correcting combinator parsers. In: Launchbury, J., Meijer, E., Sheard, T. (eds.) AFP 1996. LNCS, vol.1129, pp. 184-207. Springer, Heidelberg (1996)
16. Viera, M., Swierstra, S.D., Lempsink, E.: Haskell, do you read me?: constructing and composing efficient top-down parsers at runtime. In: Haskell 2008: Proceedings of the first ACM SIGPLAN symposium on Haskell, pp. 63-74. ACM, New York (2008)
17. Wadler, P.: How to replace failure with a list of successes. In: Jouannaud, J.-P. (ed.) FPCA 1985. LNCS, vol.201, pp. 113-128. Springer, Heidelberg (1985)
18. Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. J. ACM 21(1), 168-173 (1974)
19. Wallace, M.: Partial parsing: Combining choice with commitment. In: Chitil, O., Horváth, Z., Zsók, V. (eds.) IFL 2007. LNCS, vol.5083, pp. 93-110. Springer, Heidelberg (2008)