(Enter summary)
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 ... (Update)
Cited by: More
Gaussian Elimination: a case study in efficient genericity with.. - Carette (2005)
(Correct)
Monadic Compositional Parsing with Context Using Maltese as a Case .. - Pace (2004)
(Correct)
UUXML: A Type-Preserving XML Schema-Haskell Data Binding - Atanassow, Clarke, Jeuring (2004)
(Correct)
Active bibliography (related documents): More All
0.7: Monadic Parsing in Haskell - Hutton, Meijer (1993)
(Correct)
0.3: Compiling Exceptions Correctly - Hutton, Wright
(Correct)
0.3: Compiling Exceptions Correctly (Extended Version) - Hutton, Wright (2004)
(Correct)
Similar documents based on text: More All
1.2: Parsec: Direct Style Monadic Parser Combinators For The Real.. - Leijen, Meijer (2001)
(Correct)
0.9: Monadic Parser Combinators - Graham Hutton University (1996)
(Correct)
0.5: Parsec: A practical parser library - Leijen, Meijer (2001)
(Correct)
Related documents from co-citation: More All
15: Available from httpwww (context) - DeRose, language et al. - 1999
6: error-correcting combinator parsers (context) - Swierstra, Duponcheel - 1996
6: Higher-order functions for parsing
- Hutton - 1992
BibTeX entry: (Update)
G. Hutton and E. Meijer. Monadic Parser Combinators. Journal of functional programming, 1996. http://citeseer.ist.psu.edu/article/hutton96monadic.html More
@techreport{ hutton96monadic,
author = "Graham Hutton and Erik Meijer",
title = "Monadic Parser Combinators",
number = "NOTTCS-TR-96-4",
year = "1996",
url = "citeseer.ist.psu.edu/article/hutton96monadic.html" }
Citations (may not include all citations):
1399
Compilers --- principles (context) - Aho, Sethi et al. - 1986
293
The essence of functional programming
- Philip
254
Comprehending monads
- Philip - 1990
129
A system of constructor classes: overloading and implicit hi..
- Mark
124
Monads for functional programming
- Philip
65
How to replace failure by a list of successes (context) - Philip - 1985
65
Higher-order functions for parsing
- Graham - 1992
10
Ratatosk: a parser generator and scanner generator for Gofer (context) - Torben - 1993
9
Happy: the parser generator for Haskell (context) - Andy, Simon - 1995
9
The next 700 programming languages (context) - Peter - 1966
3
Unpublished manuscript (context) - Mark, Gofer et al. - 1994
3
University of Glasgow (context) - Simon, Launchbury et al. - 1994
2
Lecture notes of the Baastad Spring school on functional pro.. (context) - Jeroen, Functional - 1995
1
Why functional programming matters (context) - Glasgow, John - 1989
1
A functional theory of exceptions (context) - thesis, of et al. - 1990
1
Functional programming beyond the Hindley/Milner type system (context) - Mark
1
Computation lambda-calculus and monads (context) - Copenhagen, Moggi - 1989
1
Garbage collection and memory efficiency in lazy functional .. (context) - Niklas - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www-i2.informatik.rwth-aachen.de/leucker/Literatur/lit.html): More
Implementation of an Efficient Parallel BDD Package - Stornetta (1995)
(Correct)
Composing the user interface with Haggis - Finne, Jones (1996)
(Correct)
Model Checking and Other Games - Stirling (1996)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC