Parsec (parser)
 |
This article may be too technical for most readers to understand. (November 2014) (Learn how and when to remove this template message) |
Parsec is a library for writing parsers in Haskell.[1] It is based on higher-order parser combinators, so a complicated parser can be made out of many smaller ones.[2] It has been reimplemented in many other languages, including Erlang,[3] OCaml,[4] and F#,[5][6] as well as imperative languages such as C#,[7] and Java.[8]
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.[9]
References[edit]
- ^ "Parsec on Haskell wiki". Retrieved 29 May 2017.
- ^ "Parsec: Direct Style Monadic Parser Combinators For The Real World" (PDF). Retrieved 22 November 2014.
- ^ "Parsec Erlang". Retrieved 23 November 2014.
- ^ "Parsec OCaml" (PDF). Retrieved 23 November 2014.
- ^ "XParsec by corsis". Retrieved 29 May 2017.
- ^ "FParsec". Retrieved 29 May 2017.
- ^ "CSharp monad". Retrieved 10 December 2014.
- ^ "JParsec". Retrieved 14 October 2016.
- ^ "The Glasgow Haskell Compiler (AOSA Vol. 2)". Retrieved 23 November 2014.
External links[edit]
 |
This software article is a stub. You can help Wikipedia by expanding it. |
