parser-combinators

Lightweight package providing commonly useful parser combinators

https://github.com/mrkkrp/parser-combinators

LTS Haskell 21.13:	1.3.0
Stackage Nightly 2023-09-27:	1.3.0
Latest on Hackage:	1.3.0

See all snapshots parser-combinators appears in

BSD-3-Clause licensed by Mark Karpov <markkarpov92@gmail.com> Alex Washburn

Maintained by Mark Karpov

This version can be pinned in stack with:parser-combinators-1.3.0@sha256:edd54ba56cbae8fadbcceebcfef31b2c70a835e92e5eda41151b939c40647281,1570

Module documentation for 1.3.0

Control
- Control.Applicative
  - Control.Applicative.Combinators
    - Control.Applicative.Combinators.NonEmpty
  - Control.Applicative.Permutations
- Control.Monad
  - Control.Monad.Combinators
    - Control.Monad.Combinators.Expr
    - Control.Monad.Combinators.NonEmpty
  - Control.Monad.Permutations

Depends on 1 package(full list with versions):

base

Used by 12 packages in nightly-2023-09-27(full list with versions):

domain, graphql, headed-megaparsec, hedn, hledger-lib, lsp-test, megaparsec, mmark, postgresql-syntax, replace-megaparsec, toml-reader, versions

Parser combinators

The package provides common parser combinators defined in terms of Applicative and Alternative without any dependencies but base. There are also more efficient versions of the combinators defined in terms of Monad and MonadPlus.

Contribution

Issues, bugs, and questions may be reported in the GitHub issue tracker for this project.

Pull requests are also welcome.

License

Distributed under BSD 3 clause license.

Changes

Parser combinators 1.3.0

Changed the Control.Applicative.Permutations module to only require Applicative and not Monad. This module is the least restrictive and works with parsers which are not Monads.
Added the Control.Monad.Permutations module. This module may be substantially more efficient for some parsers which are Monads.
Corrected how permutation parsers intercalate effects and components; parsing an effect requires that a component immediately follows or else a parse error will result.

Parser combinators 1.2.1

The tests in parser-combinators-tests now work with Megaparsec 8.
Dropped support for GHC 8.2.

Parser combinators 1.2.0

Added manyTill_ and someTill_ combinators which work like the older manyTill and someTill except they also return the result of the end parser.
Dropped support for GHC 8.0.

Parser combinators 1.1.0

Added support for ternary operators; see TernR in Control.Monad.Combinators.Expr.

Parser combinators 1.0.3

Dropped support for GHC 7.10.
Added a test suite as a separate package called parser-combinators-tests.

Parser combinators 1.0.2

Defined liftA2 for Permutation manually. The new definition should be more efficient.
Made inner Maybe field in Permutation strict.

Parser combinators 1.0.1

Cosmetic changes in the source code.

Parser combinators 1.0.0

Added the Control.Monad.Combinators.Expr module.
Dropped the compatibility operators (<$$>), (<$?>), (<||>), and (<|?>) from Control.Applicative.Permutations.
Dropped support for GHCs older than 7.10.

Parser combinators 0.4.0

Improved the documentation.
Re-exported Control.Applicative.empty from Control.Applicative.Combinators.
Added the Control.Monad.Combinators and Control.Monad.Combinators.NonEmpty modules which contain more efficient versions of the combinators from Control.Applicative.Combinators and Control.Applicative.Combinators.NonEmpty respectively.

Parser combinators 0.3.0

Added the skipCount combinator.
Improved algorithmic efficiency of the count' combinator.

Parser combinators 0.2.1

Removed the byte order marking at the beginning of the Control.Applicative.Permutations module.

Parser combinators 0.2.0

Added Control.Applicative.Combinators.NonEmpty module that exports non-empty list versions of combinators that cannot return empty lists.
Added Control.Applicative.Permutations module that provides generalized permutation parser combinators.

Parser combinators 0.1.0

Initial release.