Higher-Order Functions for Parsing

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

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
216Kb

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.

Item Type:Article
Schools/Departments:Faculty of Science > School of Computer Science and Information Technology
ID Code:221
Deposited By:Hutton, Graham
Deposited On:26 Oct 2005
Last Modified:09 Oct 2007 16:50

Repository Staff Only: item control page