parser-combinators

Lightweight package providing commonly useful parser combinators https://github.com/mrkkrp/parser-combinators

Version on this page:1.1.0
LTS Haskell 14.6:1.1.0
Stackage Nightly 2019-09-21:1.1.0
Latest on Hackage:1.2.0

See all snapshots parser-combinators appears in

Maintained by Mark Karpov

Module documentation for 1.1.0

This version can be pinned in stack with:parser-combinators-1.1.0@sha256:0c79260aeb14db4790a859dd1a3f772b1c6c7c640e93308b4795e983db4a62d7,1856

Parser combinators

License BSD3 Hackage Stackage Nightly Stackage LTS Build Status

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 and will be reviewed quickly.

License

Copyright © 2017–2019 Mark Karpov

Distributed under BSD 3 clause license.

Changes

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.
comments powered byDisqus