Difference between revisions of "Parsec"

From HaskellWiki
Jump to: navigation, search
Line 56: Line 56:
== Links ==
== Links ==
=== Docs ===
* [http://legacy.cs.uu.nl/daan/parsec.html on Parsec website]
* [http://research.microsoft.com/en-us/um/people/daan/parsec.html on Microsoft] (content same as above)
=== Blog articles ===
=== Blog articles ===

Revision as of 11:08, 2 February 2011


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.

The latest stable release with Haddock documentation is available on Hackage and development versions are available via the darcs repository.


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.

An example for parsing a simple grammar of expressions can be found here.

Much more documentation can be found on the parsec website.

This article is a stub. You can help by expanding it.


See also the list of reversed dependencies for Parsec.

Parsec clones in other languages

Interesting non-Parsec parser combinator libraries:



Blog articles