Difference between revisions of "Parsec"
Jump to navigation
Jump to search
m (Small typo correction (langugge -> language)) |
BrettGiles (talk | contribs) m (Add category) |
||
| Line 2: | Line 2: | ||
[[Category:Compiler tools]] |
[[Category:Compiler tools]] |
||
| + | [[Category:Combinators]] |
||
Parsec is an industrial strength, monadic parser combinator library for |
Parsec is an industrial strength, monadic parser combinator library for |
||
Revision as of 22:54, 17 May 2007
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 language , 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.