Skip to main content
SpringerLink
Log in

Parsing Using Combinators

  • Conference paper
Functional Programming

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

Abstract

In combinator parsing, the text of parsers resembles BNF notation. We present the basic method, and show how it may be extended to more practical parsers. We address the special problems of layout, and parsers with separate lexical and syntactic phases. In particular, an elegant new way of handling the offside rule is given. Many examples and comments are included.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Alfred Aho, Ravi Sethi and Jeffrey Ullman. Compilers - Principles, Techniques and Tools. Addison-Wesley, 1986.

    Google Scholar 

  2. Philip Wadler. How to Replace Failure by a List of Successes. FPCA 85, LNCS 201, 1985.

    Google Scholar 

  3. John Fairbairn. Making Form Follow Function. Glasgow University, 1986.

    Google Scholar 

  4. Richard Frost and John Launchbury. Constructing Natural Language Interpreters in Lazy Functional Languages. Glasgow University, 1988.

    Google Scholar 

  5. John Launchbury. Parsing in a Functional Language using Higher Order Cornbinators. Glasgow University, 1988. ( Unpublished )

    Google Scholar 

  6. Peter Landin. The Next 700 Programming Languages. CACM Vol. 9, March 1966.

    Google Scholar 

  7. Geraint Jones. Programming in occam. Prentice-Hall International, 1987.

    Google Scholar 

  8. Paul Hudak and Philip Wadler (editors). Report on the Programming Language Haskell. Glasgow University and Yale University. 1989. ( Draft )

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing Science, University of Glasgow, Scotland, UK

    Graham Hutton

Authors
  1. Graham Hutton
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing Science, University of Glasgow, Glasgow, G12 8QQ, Scotland

    Kei Davis MSc  & John Hughes BA, DipCompSci, DPhil  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1990 British Computer Society

About this paper

Cite this paper

Hutton, G. (1990). Parsing Using Combinators. In: Davis, K., Hughes, J. (eds) Functional Programming. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3166-3_24

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3166-3_24

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19609-9

  • Online ISBN: 978-1-4471-3166-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation