Difference between revisions of "Parsec"

From HaskellWiki
Jump to: navigation, search
(Updated links; put links between square brackets; moved stub template to the top; added a link for Nemerle)
m
Line 12: Line 12:
 
but it performs best on predictive (LL[1]) grammars.
 
but it performs best on predictive (LL[1]) grammars.
   
The latest stable release with Haddock documentation is available on [http://hackage.haskell.org/package/parsec Hackage] and development versions are [http://code.haskell.org/parsec3/ available via the darcs repository].
+
The latest stable release with Haddock documentation is available on [http://hackage.haskell.org/package/parsec Hackage] and development versions are [http://code.haskell.org/parsec3/ available via the Darcs repository].
   
   
Line 39: Line 39:
 
== Parsec clones in other languages ==
 
== Parsec clones in other languages ==
   
* PCL for O'Caml [http://lprousnth.files.wordpress.com/2007/08/pcl.pdf] (PDF)
+
* PCL for OCaml [http://lprousnth.files.wordpress.com/2007/08/pcl.pdf] (PDF)
 
* JParsec for Java [http://jparsec.codehaus.org/JParsec+Overview]
 
* JParsec for Java [http://jparsec.codehaus.org/JParsec+Overview]
 
* NParsec, JParsec ported to C# [http://jparsec.codehaus.org/NParsec+Tutorial]
 
* NParsec, JParsec ported to C# [http://jparsec.codehaus.org/NParsec+Tutorial]

Revision as of 12:28, 25 March 2013

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


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.


Examples

See also the list of reverse dependencies for Parsec.


Parsec clones in other languages

  • PCL for OCaml [1] (PDF)
  • JParsec for Java [2]
  • NParsec, JParsec ported to C# [3]
  • Ruby Parsec, JParsec ported to Ruby [4]]
  • FParsec for F# [5]
  • XParsec for F# [6] is a type-and-source-polymorphic, generalized and extensible parsec implementation in F# 3.0 which supports powerful domain-specific non-linear navigation combinators (such as for XML trees)
  • Parsec-Erlang [7], 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: [8])
  • AliceParsec for Alice ML [9]
  • Parsnip for C++ [10]
  • A Nemerle port [11] (Zip file)
  • Pysec for Python [12]
  • JSParsec for JavaScript: [13]

Interesting non-Parsec parser combinator libraries:

  • Parse::RecDescent for Perl [14]
  • Spirit for C++ [15]


Links

Docs

Blog articles

Other