Parsec (parser)
Parsec is a library for writing parsers in Haskell. It is based on higher-order parser combinators, so a complicated parser can be made out of many smaller ones. It has been reimplemented in many other languages, including Erlang, Elixir, OCaml, Racket, and F#, as well as imperative languages such as C#, and Java.
| Original author(s) | Daan Leijen, Paolo Martini, Antoine Latter |
|---|---|
| Developer(s) | Herbert Valerio Riedel, Derek Elkins, Antoine Latter, Roman Cheplyaka, Ryan Scott |
| Initial release | November 2, 2006 |
| Stable release | 3.1.14.0
/ August 10, 2019 |
| Repository | github |
| Written in | Haskell |
| Operating system | Linux, macOS, Windows |
| Platform | Haskell Platform |
| Type | Parser combinator, Library |
| License | BSD-3 |
| Website | hackage |
Because a parser combinator-based program is generally slower than a parser generator-based program, Parsec is normally used for small domain-specific languages, while Happy is used for compilers such as GHC.
Other Haskell parser combinator libraries that have been derived from Parsec include Megaparsec and Attoparsec.
Parsec is free software released under the BSD-3-Clause license.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.