Difference between revisions of "Parsec"
Jump to navigation
Jump to search
(Update ghc/parsec link to point to latest version of ghc) |
Technocrat (talk | contribs) (Added blog article by Jacub Arnold) |
||
| (27 intermediate revisions by 13 users not shown) | |||
| Line 1: | Line 1: | ||
| ⚫ | |||
| ⚫ | |||
[[Category:Compiler tools]] |
[[Category:Compiler tools]] |
||
[[Category:Combinators]] |
[[Category:Combinators]] |
||
| + | [[Category:Packages]] |
||
| + | [[Category:Libraries]] |
||
| + | |||
| + | == Introduction == |
||
Parsec is an industrial strength, monadic parser combinator library for |
Parsec is an industrial strength, monadic parser combinator library for |
||
Haskell. It can parse context-sensitive, infinite look-ahead grammars |
Haskell. It can parse context-sensitive, infinite look-ahead grammars |
||
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]. |
||
| − | For downloads and documentation see: |
||
| − | * [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] |
||
| + | |||
| ⚫ | |||
| ⚫ | |||
Parsec lets you construct parsers by combining higher-order |
Parsec lets you construct parsers by combining higher-order |
||
[[Combinator]]s to create larger expressions. Combinator parsers are |
[[Combinator]]s to create larger expressions. Combinator parsers are |
||
written and used within the same programming language as the rest of the |
written and used within the same programming language as the rest of the |
||
| − | program. The parsers are first-class citizens of the language |
+ | program. The parsers are first-class citizens of the language, unlike |
[[Happy]] parsers, which must be generated via a preprocessor. |
[[Happy]] parsers, which must be generated via a preprocessor. |
||
| + | An example for parsing a simple grammar of expressions can be found [http://www.haskell.org/haskellwiki/Parsing_expressions_and_statements here]. |
||
| − | Much more documentation can be found on the parsec site. |
||
| + | Much more documentation can be found on [https://web.archive.org/web/20140528151730/http://legacy.cs.uu.nl/daan/parsec.html the parsec website]. |
||
| ⚫ | |||
| + | == Examples == |
||
| ⚫ | |||
| + | * [http://book.realworldhaskell.org/read/using-parsec.html "Using Parsec"] chapter on [http://book.realworldhaskell.org/ Real World Haskell]. |
||
| − | * PCL for O'Caml http://lprousnth.files.wordpress.com/2007/08/pcl.pdf |
||
| + | |||
| ⚫ | |||
| + | * [http://en.wikibooks.org/wiki/Write_Yourself_a_Scheme_in_48_Hours/Parsing 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 [http://packdeps.haskellers.com/reverse/parsec list of reverse dependencies for Parsec]. |
||
| ⚫ | |||
| + | |||
| − | * A small Parsec in Erlang http://www.engr.uconn.edu/~jeffm/Source/Erlang/ |
||
| + | |||
| ⚫ | |||
| ⚫ | |||
| ⚫ | |||
| + | |||
| − | * Somewhere there is a Nemerle port |
||
| − | * |
+ | * PCL for OCaml [http://lprousnth.files.wordpress.com/2007/08/pcl.pdf] (PDF) |
| ⚫ | |||
| ⚫ | |||
| ⚫ | |||
| ⚫ | |||
| + | * XParsec for F# [http://corsis.github.com/XParsec/] 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 [https://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/]) |
||
| ⚫ | |||
| ⚫ | |||
| + | * A Nemerle port [http://kriomant.net/nparsec.zip] (Zip file) |
||
| + | * Pysec for Python [http://www.valuedlessons.com/2008/02/pysec-monadic-combinatoric-parsing-in.html] |
||
| + | * JSParsec for JavaScript: [http://code.google.com/p/jsparsec/] |
||
| + | * Bennu JavaScript Parser Combinator Library: [https://github.com/mattbierner/bennu/] |
||
| + | * ParsecJ for Java [https://github.com/jon-hanson/parsecj/] is implemented in a functional style based on the original Parsec papers. |
||
Interesting non-Parsec parser combinator libraries: |
Interesting non-Parsec parser combinator libraries: |
||
| + | * Parse::RecDescent for Perl [https://metacpan.org/module/Parse::RecDescent] |
||
| − | * Spirit for C++ http://spirit. |
+ | * Spirit for C++ [http://boost-spirit.com/home/doc/] |
| − | * Scala http://www.scala-lang.org/docu/files/api/scala/util/parsing/combinator$content.html |
||
| + | |||
| + | == Links == |
||
| + | |||
| ⚫ | |||
| + | |||
| + | * [http://research.microsoft.com/pubs/65201/parsec-paper-letter.pdf Parsec: Direct Style Monadic Parser Combinators For The Real World] (PDF) |
||
| + | * [http://research.microsoft.com/en-us/um/people/daan/download/parsec/parsec.pdf Parsec, a fast combinator parser] (PDF) |
||
| + | |||
| + | === Blog articles === |
||
| + | |||
| + | * [http://therning.org/magnus/posts/2007-05-27-289-adventures-in-parsing.html Adventures in Parsing] by Magnus Therning |
||
| + | * [http://therning.org/magnus/posts/2007-05-29-290-more-adventures-in-parsing.html More Adventures in Parsing] |
||
| + | * [http://therning.org/magnus/posts/2007-06-03-295-adventures-in-parsing-part-3.html Adventures in Parsing, Part 3] |
||
| + | * [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://blog.jakubarnold.cz/2014/08/10/parsing-css-with-parsec.html Parsing CSS with Parsec] by Jacub Arnold |
||
| + | |||
| + | === Other === |
||
| + | |||
| + | * [https://github.com/JakeWheat/intro_to_parsing Introduction to parsing with Haskell and Parsec] |
||
| + | * [http://stackoverflow.com/questions/tagged/parsec Parsec] on Stack Overflow |
||
Revision as of 18:39, 21 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
- Parsing CSS with Parsec by Jacub Arnold
Other
- Introduction to parsing with Haskell and Parsec
- Parsec on Stack Overflow