Personal tools

Parsec

From HaskellWiki

(Difference between revisions)
Jump to: navigation, search
(add link to hackage)
(Update ghc/parsec link to point to latest version of ghc)
Line 8: Line 8:
 
but it performs best on predictive (LL[1]) grammars.
 
but it performs best on predictive (LL[1]) grammars.
   
See [http://hackage.haskell.org/packages/archive/pkg-list.html hackage] or [http://www.cs.uu.nl/people/daan/download/parsec/parsec.html the Parsec site]
+
For downloads and documentation see:
for downloads and documentation. Parsec is also distributed with GHC, hence [http://haskell.org/ghc/docs/6.8.2/html/libraries/index.html this documentation] might be more up to date.
+
* [http://legacy.cs.uu.nl/daan/parsec.html the Parsec site]
  +
* [http://hackage.haskell.org/package/parsec hackage]
  +
* [http://www.haskell.org/ghc/docs/latest/html/libraries/parsec/Text-ParserCombinators-Parsec.html GHC library documentation]
   
 
=== Usage ===
 
=== Usage ===

Revision as of 02:00, 8 October 2009

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.

For downloads and documentation see:

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 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.

1.2 Parsec clones in other languages

Interesting non-Parsec parser combinator libraries: