Abstract:
Parsec is an industrial strength, monadic parser combinator library for Haskell. It can parse context-sensitive, innite look-ahead grammars but it performs best on predictive (LL[1]) grammars. Combinator parsing is well known in the literature and oers several advantages to YACC or event-based parsing.
Citations
|
393
|
Comprehending monads
– Wadler
- 1992
|
|
286
|
Featherweight Java: A minimal core calculus for Java and GJ
– Igarashi, Pierce, et al.
- 1999
|
|
195
|
Compilers: principles, techniques and tools
– Aho, Sethi, et al.
- 1996
|
|
97
|
Recursive Programming Techniques
– Burge
- 1975
|
|
82
|
Higher-order functions for parsing
– Hutton
- 1992
|
|
51
|
Monadic parser combinators
– Hutton, Meijer
- 1996
|
|
39
|
Deterministic, error-correcting combinator parsers
– Swierstra, Duponcheel
- 1996
|
|
38
|
Henk: A typed intermediate language
– Jones, Meijer
- 1997
|
|
18
|
Combinators for parsing expressions
– Hill
- 1996
|
|
16
|
Predictive parser combinators need four values to report errors
– Partridge, Wright
- 1996
|
|
12
|
Ratatosk: a parser generator and scanner generator for Gofer
– Mogensen
- 1993
|
|
7
|
How to replace failure with a list of successes
– Wadler
- 1985
|
|
6
|
Happy: the parser generator
– Gill, Marlow
- 1995
|
|
4
|
Garbage collection and memory eciency in lazy functional languages
– Rojemo
- 1995
|
|
4
|
Fast, Error Correcting Parser Combinators: A Short Tutorial. SOFSEM'99 Theory and Practice of Informatics
– Swierstra, Azero
- 1999
|
|
3
|
Ecient Combinator Parsers. Implementation of Functional Languages
– Koopman, Plasmeijer
- 1999
|
|
