• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Monadic Parser Combinators (1996)

Cached

  • Download as a PDF
  •  
  • Download as a PS

Download Links

  • [www.cs.nott.ac.uk]
  • [ftp.cs.nott.ac.uk]
  • [uebb.cs.tu-berlin.de]
  • [www.cs.nott.ac.uk]
  • [www.cs.nott.ac.uk]
  • [cs.fit.edu]
  • [www.cs.fit.edu]
  • [www.cs.nott.ac.uk]

  • Other Repositories/Bibliography

  • CiteULike
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Graham Hutton , Erik Meijer
Citations:54 - 2 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Hutton96monadicparser,
    author = {Graham Hutton and Erik Meijer},
    title = {Monadic Parser Combinators},
    year = {1996}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

In functional programming, a popular approach to building recursive descent parsers is to model parsers as functions, and to define higher-order functions (or combinators) that implement grammar constructions such as sequencing, choice, and repetition. Such parsers form an instance of a monad, an algebraic structure from mathematics that has proved useful for addressing a number of computational problems. The purpose of this article is to provide a step-by-step tutorial on the monadic approach to building functional parsers, and to explain some of the benefits that result from exploiting monads. No prior knowledge of parser combinators or of monads is assumed. Indeed, this article can also be viewed as a first introduction to the use of monads in programming.

Citations

418 Comprehending monads - Wadler - 1990
240 Compilers: principles, techniques and tools - Aho, Sethi, et al. - 1986
171 A system of constructor classes: overloading and implicit higher-order polymorphism - Jones - 1993
164 The next 700 programming languages - Landin - 1966
103 Recursive Programming Techniques - Burge - 1975
94 Higher-order functions for parsing - Hutton - 1992
23 Garbage collection, and memory efficiency, in lazy functional languages - Runciman, Rojemo, et al. - 1995
14 Why functional programming matters. The computer journal - Hughes - 1989
8 Ratatosk: a parser generator and scanner generator for Gofer - Mogensen - 1993
6 A functional theory of exceptions. Science of computer programming - Spivey - 1990
4 Happy – The Parser Generator for Haskell - Gill, Marlow - 1995
4 Functional parsers. Lecture notes of the Baastad Spring school on functional programming - Fokker - 1995
2 Gofer 2.30a release notes. Unpublished manuscript - Hutton, Jones, et al. - 1994
2 How to replace failure by a list of successes. Proc. conference on functional programming and computer architecture - Wadler - 1985
2 The essence of functional programming. Proc. principles of programming languages - Wadler - 1992
1 Functional parsers. Proc. lecture notes of the Baastad Spring school on functional programming - Fokker - 1995
1 Functional programming beyond the Hindley/Milner type system. Proc. lecture notes of the Baastad spring school on functional programming - Jones - 1995
1 The Gofer distribution. Available from the University of Nottingham: http://www.cs.nott.ac.uk/Department/Staff/mpj - Jones - 1995
1 Computation lambda-calculus and monads. Proc. IEEE symposium on logic in computer science. A extended version of the paper is available as a technical report from the - Moggi - 1989
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University