Difference between revisions of "Parsec"

From HaskellWiki
Jump to navigation Jump to search
(Add the fuller Erlang Parsec clone to the list.)
Line 33: Line 33:
 
* Ruby Parsec, JParsec ported to Ruby http://jparsec.codehaus.org/Ruby+Parsec
 
* Ruby Parsec, JParsec ported to Ruby http://jparsec.codehaus.org/Ruby+Parsec
 
* FParsec for F# http://www.quanttec.com/fparsec/
 
* FParsec for F# http://www.quanttec.com/fparsec/
* A small Parsec in Erlang http://www.engr.uconn.edu/~jeffm/Source/Erlang/
+
* Parsec-Erlang, http://bitbucket.org/dmercer/parsec-erlang/ is a faithful reproduction of Parsec in Erlang (there is also an older toy Parsec-like parser that isn't monadic, nor does it give error messages: http://www.engr.uconn.edu/~jeffm/Source/Erlang/)
 
* AliceParsec for Alice ML http://www.ps.uni-sb.de/alice/contribs.html
 
* AliceParsec for Alice ML http://www.ps.uni-sb.de/alice/contribs.html
 
* Parsnip for C++ http://parsnip-parser.sourceforge.net/
 
* Parsnip for C++ http://parsnip-parser.sourceforge.net/

Revision as of 03:32, 8 April 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: