Difference between revisions of "Parsec"

From HaskellWiki
Jump to: navigation, search
(Links)
(Links)
Line 68: Line 68:
 
* [http://therning.org/magnus/archives/295 Adventures in parsing, part 3]
 
* [http://therning.org/magnus/archives/295 Adventures in parsing, part 3]
 
* [http://therning.org/magnus/archives/296 Adventures in parsing, part 4]
 
* [http://therning.org/magnus/archives/296 Adventures in parsing, part 4]
  +
  +
=== Other ===
  +
  +
* [http://stackoverflow.com/questions/tagged/parsec Parsec] on Stack Overflow

Revision as of 21:48, 2 February 2011


Introduction

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.


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.

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.


Examples


See also the list of reversed dependencies for Parsec.

Parsec clones in other languages

Interesting non-Parsec parser combinator libraries:


Links

Docs

Blog articles

Other