Skip to main content
×
Home
    • Aa
    • Aa

Higher-order functions for parsing*

  • Graham Hutton (a1)
Abstract
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 ‘into’ combining form with many useful applications, and a simple means by which combinator parsers can produce more informative error messages.

Copyright
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

P. Landin 1966. The Next 700 Programming Languages. Comm. ACM, 9 (Mar.).

P. Wadler 1985. How to Replace Failure by a List of Successes. In Proc. FPCA 85, Vol. 201 of Lecture Notes in Computer Science. Springer-Verlag.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Journal of Functional Programming
  • ISSN: 0956-7968
  • EISSN: 1469-7653
  • URL: /core/journals/journal-of-functional-programming
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics