Parsec (parser)

From Wikipedia, the free encyclopedia

Original authorsDaan Leijen, Paolo Martini, Antoine Latter
DevelopersHerbert Valerio Riedel, Derek Elkins, Antoine Latter, Roman Cheplyaka, Ryan Scott
Initial releaseNovember 2, 2006; 19 years ago (2006-11-02)[1]
Stable release
3.1.17.0 / April 5, 2024; 21 months ago (2024-04-05)[2]
Parsec
Original authorsDaan Leijen, Paolo Martini, Antoine Latter
DevelopersHerbert Valerio Riedel, Derek Elkins, Antoine Latter, Roman Cheplyaka, Ryan Scott
Initial releaseNovember 2, 2006; 19 years ago (2006-11-02)[1]
Stable release
3.1.17.0 / April 5, 2024; 21 months ago (2024-04-05)[2]
Repositorygithub.com/haskell/parsec
Written inHaskell
Operating systemLinux, macOS, Windows
PlatformHaskell Platform
Available inEnglish
TypeParser combinator, library
LicenseBSD-2-clause
Websitehackage.haskell.org/package/parsec

Parsec is a library for writing parsers written in the programming language Haskell.[3] It is based on higher-order parser combinators, so a complicated parser can be made out of many smaller ones.[4] It has been reimplemented in many other languages, including Erlang,[5] Elixir,[6] OCaml,[7] Racket,[8] F#,[9][10] and the imperative programming languages C#,[11] and Java.[12]

Because a parser combinator-based program is generally slower than a parser generator-based program,[citation needed] Parsec is normally used for small domain-specific languages, while Happy is used for compilers such as the Glasgow Haskell Compiler (GHC).[13]

Other Haskell parser combinator libraries that have been derived from Parsec include Megaparsec[14] and Attoparsec.[15]

Parsec is free software released under the BSD-3-Clause license.[16]

References

Related Articles

Wikiwand AI