Difference between revisions of "Parsec"
m (minor text change for ParsecJ) |
Technocrat (talk | contribs) m (Updated links to Therning blog posts) |
||
| Line 66: | Line 66: | ||
=== Blog articles === |
=== Blog articles === |
||
| − | * [http://therning.org/magnus/ |
+ | * [http://therning.org/magnus/posts/2007-05-27-289-adventures-in-parsing.html Adventures in Parsing] by Magnus Therning |
| − | * [http://therning.org/magnus/ |
+ | * [http://therning.org/magnus/posts/2007-05-29-290-more-adventures-in-parsing.html More Adventures in Parsing] |
| − | * [http://therning.org/magnus/ |
+ | * [http://therning.org/magnus/posts/2007-06-03-295-adventures-in-parsing-part-3.html Adventures in Parsing, Part 3] |
| − | * [http://therning.org/magnus/ |
+ | * [http://therning.org/magnus/posts/2007-06-05-296-adventures-in-parsing-part-4.html Adventures in Parsing, Part 4] |
* [http://panicsonic.blogspot.com/2009/12/adventures-in-parsec.html Adventures in Parsec] by Antoine Latter |
* [http://panicsonic.blogspot.com/2009/12/adventures-in-parsec.html Adventures in Parsec] by Antoine Latter |
||
Revision as of 18:58, 16 November 2015
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
- "Using Parsec" chapter on Real World Haskell.
- Write Yourself a Scheme in 48 Hours/Parsing. Note, that where the example uses the read function, the Token module of Parsec could have been used, to handle numbers.
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]
- Bennu JavaScript Parser Combinator Library: [14]
- ParsecJ for Java [15] is implemented in a functional style based on the original Parsec papers.
Interesting non-Parsec parser combinator libraries:
Links
Docs
- Parsec: Direct Style Monadic Parser Combinators For The Real World (PDF)
- Parsec, a fast combinator parser (PDF)
Blog articles
- Adventures in Parsing by Magnus Therning
- More Adventures in Parsing
- Adventures in Parsing, Part 3
- Adventures in Parsing, Part 4
- Adventures in Parsec by Antoine Latter
Other
- Introduction to parsing with Haskell and Parsec
- Parsec on Stack Overflow