Higher-Order Functions for Parsing

Hutton, Graham (1992) Higher-Order Functions for Parsing. Journal of Functional Programming, 2 (3). pp. 323-343.

Full text not available from this repository.


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.

Item Type: Article
RIS ID: https://nottingham-repository.worktribe.com/output/1024967
Schools/Departments: University of Nottingham, UK > Faculty of Science > School of Computer Science
Depositing User: Hutton, Graham
Date Deposited: 26 Oct 2005
Last Modified: 04 May 2020 20:33
URI: https://eprints.nottingham.ac.uk/id/eprint/221

Actions (Archive Staff Only)

Edit View Edit View