Difference between revisions of "Parsec"

From HaskellWiki
Jump to navigation Jump to search
(Update ghc/parsec link to point to latest version of ghc)
Line 12: Line 12:
 
* [http://hackage.haskell.org/package/parsec hackage]
 
* [http://hackage.haskell.org/package/parsec hackage]
 
* [http://www.haskell.org/ghc/docs/latest/html/libraries/parsec/Text-ParserCombinators-Parsec.html GHC library documentation]
 
* [http://www.haskell.org/ghc/docs/latest/html/libraries/parsec/Text-ParserCombinators-Parsec.html GHC library documentation]
  +
* [http://code.haskell.org/parsec3/ darcs code repository]
   
 
=== Usage ===
 
=== Usage ===

Revision as of 06:56, 5 March 2010

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.

For downloads and documentation see:

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.

Parsec clones in other languages

Interesting non-Parsec parser combinator libraries: