parser-combinators

Lightweight package providing commonly useful parser combinators

Version1.3.1
CategoryParsing
LicenceBSD-3-Clause
AuthorMark Karpov <markkarpov92@gmail.com> Alex Washburn <github@recursion.ninja>
MaintainerMark Karpov <markkarpov92@gmail.com>
Homepagegithub.com/mrkkrp/parser-combinators
Pinned byhackage parser-combinators 1.3.1
Sourcehackage.haskell.org/package/parser-combinators-1.3.1

Modules

Control.Applicative.CombinatorsThe module provides parser combinators defined for instances of
Control.Applicative.Combinators.NonEmptyThe module provides NonEmpty list variants of some of the functions
Control.Applicative.PermutationsThis module is a generalization of the package parsec-permutation
Control.Monad.CombinatorsThe module provides more efficient versions of the combinators from
Control.Monad.Combinators.ExprA helper module to parse expressions. It can build a parser given a table
Control.Monad.Combinators.NonEmptyThe module provides NonEmpty list variants of some of the functions
Control.Monad.PermutationsThis module specialized the interface to Monad for potential efficiency

Lightweight package providing commonly useful parser combinators.

1 package