Monadic parsing in Haskell

Hutton, Graham; Meijer, Erik

Abstract

This paper is a tutorial on defining recursive descent parsers in Haskell. In the spirit of one-stop shopping, the paper combines material from three areas into a single source. The three areas are functional parsers, the use of monads to structure functional programs, and the use of special syntax for monadic programs in Haskell. More specifically, the paper shows how to define monadic parsers using do notation in Haskell. The paper is targeted at the level of a good undergraduate student who is familiar with Haskell, and has completed a grammars and parsing course. Some knowledge of functional parsers would be useful, but no experience with monads is assumed.

Citation

Hutton, G., & Meijer, E. (1998). Monadic parsing in Haskell. Journal of Functional Programming, 8(4), https://doi.org/10.1017/s0956796898003050

• Journal Article Type: Article
• Publication Date: Jul 1, 1998
• Deposit Date: Oct 26, 2005
• Publicly Available Date: Oct 9, 2007
• Journal: Journal of Functional Programming
• Print ISSN: 0956-7968
• Electronic ISSN: 1469-7653
• Publisher: Cambridge University Press
• Peer Reviewed: Peer Reviewed
• Volume: 8
• Issue: 4
• DOI: https://doi.org/10.1017/s0956796898003050
• Public URL: https://nottingham-repository.worktribe.com/output/1024100
• Contract Date: Oct 26, 2005