input-parsers: Extension of the parsers library with more capability and efficiency

[ bsd3, library, parsing ] [ Propose Tags ]

Extended version of the parsers library, with the additional classes providing more capable and efficient methods.

[Skip to Readme]
Versions [faq] 0.1,
Change log
Dependencies attoparsec (>= && <0.14), base (>=4.9 && <5), binary (>=0.7.2 && <1), bytestring (==0.10.*), monoid-subclasses (==1.0.*), parsec (==3.1.*), parsers (==0.12.*), text (==1.2.*), transformers (>=0.2 && <0.6) [details]
License BSD-3-Clause
Copyright (c) 2020 Mario Blažević
Author Mario Blažević
Category Parsing
Bug tracker
Uploaded by MarioBlazevic at 2020-07-19T16:51:05Z
Distributions Arch:, NixOS:
Downloads 186 total (21 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs uploaded by user
Build status unknown [no reports yet]


[Index] [Quick Jump]



You can disable the use of the binary package using -f-binary.


You can disable the use of the parsec package using -f-parsec.


You can disable the use of the attoparsec package using -f-attoparsec.


Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info


Maintainer's Corner

For package maintainers and hackage trustees

Readme for input-parsers-

[back to package description]


An extension of the parsers library

The parsers library provides a number of subclasses of the Alternative type class, as well as lots of combinators useful for writing actual parsers.

What those classes like Parsing and CharParsing lack is the ability to express certain efficient parser primitives like Attoparsec's takeWhile. To rectify for this failing and enable more efficient parsers to be expressed, the present package input-parsers adds type classes InputParsing and InputCharParsing. The common characteristic of almost all their methods is that their parse result has the same type as the parser input, and is a prefix of the input.

The present package also exports the class DeterministicParsing, which provides a number of parser methods that are guaranteed to succeed with a single (typically longest possible) result. This is most useful for writing the lexical layer of a parser, but it can help avoid ambiguities and inefficiencies in general.