Difference between revisions of "Parsec"
Jump to navigation
Jump to search
BrettGiles (talk | contribs) m (Changing combinator link to singular) |
|||
| Line 13: | Line 13: | ||
Parsec lets you construct parsers by combining higher-order |
Parsec lets you construct parsers by combining higher-order |
||
| − | [[ |
+ | [[Combinator]]s to create larger expressions. Combinator parsers are |
written and used within the same programming language as the rest of the |
written and used within the same programming language as the rest of the |
||
program. The parsers are first-class citizens of the langugage, unlike |
program. The parsers are first-class citizens of the langugage, unlike |
||
Revision as of 20:13, 5 October 2006
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.
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.