Extension of the parsers library with more capability and efficiency
|Version on this page:||0.2.3.1|
|LTS Haskell 20.16:||0.2.3.2|
|Stackage Nightly 2023-03-28:||0.3|
|Latest on Hackage:||0.3|
Module documentation for 0.2.3.1
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
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
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.
Finally, the package provides the class
abstract over the position the parser reached in the input stream.
Revision history for input-parsers
0.2.3.1 – 2021-11-25
- Incremented the upper bound of the optional
0.2.3 – 2021-03-26
- Improved documentation
- Fixed compilation with GHC 8.2.2
0.2.2 – 2021-03-26
- Move Data.ByteString and Data.ByteString.Lazy imports outside ifdef (by Gary Coady)
- Exported all Position methods
0.2.1 – 2021-03-09
- Changed the default instance of
Positiona subclass of
0.2 – 2021-03-07
Positiona class. Deprecated.
0.1.0.1 – 2020-07-19
- Incremented the upper bound of
0.1.0.0 – 2020-07-18
- First version. Released on an unsuspecting world.