Higher-Order Functions for Parsing

Hutton, Graham

Abstract

In combinator parsing, the text of parsers resembles BNF notation. We present the basic method, and a number of extensions. We address the special problems presented by white-space, and parsers with separate lexical and syntactic phases. In particular, a combining form for handling the offside rule is given. Other extensions to the basic method include an $quot;into$quot; combining form with many useful applications, and a simple means by which combinator parsers can produce more informative error messages.

Citation

Hutton, G. (1992). Higher-Order Functions for Parsing. Journal of Functional Programming, 2(3), https://doi.org/10.1017/S0956796800000411

• Journal Article Type: Article
• Publication Date: Jul 1, 1992
• 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: 2
• Issue: 3
• DOI: https://doi.org/10.1017/S0956796800000411
• Public URL: https://nottingham-repository.worktribe.com/output/1024967