Parsec
From HaskellWiki
(Difference between revisions)
(A stub for parsec) |
|||
| Line 1: | Line 1: | ||
== Parsec == | == Parsec == | ||
| - | [[Category:Compiler | + | [[Category:Compiler tools]] |
Parsec is an industrial strength, monadic parser combinator library for | Parsec is an industrial strength, monadic parser combinator library for | ||
Revision as of 20:38, 25 February 2006
1 Parsec
Parsec is an industrial strength, monadic parser combinator library for Haskell. It can parse context-sensitive, infinite look-ahead grammars but it performs best on predictive (LL[1]) grammars.
See the Parsec site for downloads and documentation.
1.1 Usage
Parsec lets you construct parsers by combining higher-order Combinators to create larger expressions. Combinator parsers are written and used within the same programming language as the rest of the program. The parsers are first-class citizens of the langugage, unlike Happy parsers, which must be generated via a preprocessor.
Much more documentation can be found on the parsec site.
This article is a stub. You can help by expanding it.
