Higher-order functions for parsing

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 whitespace, 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 ‘intO' combining form with many useful applications, and a simple means by which combinator parsers can produce more informative error messages. © 1992, Cambridge University Press. All rights reserved.