Skip to main content

Research Repository

Advanced Search

Higher-Order Functions for Parsing

Hutton, Graham

Authors



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),

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
Publisher Cambridge University Press (CUP)
Peer Reviewed Peer Reviewed
Volume 2
Issue 3
Public URL http://eprints.nottingham.ac.uk/id/eprint/221
Copyright Statement Copyright information regarding this work can be found at the following address: http://eprints.nottingham.ac.uk/end_user_agreement.pdf

Files


parsing.pdf (221 Kb)
PDF

Copyright Statement
Copyright information regarding this work can be found at the following address: http://eprints.nottingham.ac.uk/end_user_agreement.pdf





You might also like



Downloadable Citations