Hoogle Search
Within LTS Haskell 24.36 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
Prefix :: ParsecT s u m (a -> a) -> Operator s u (m :: Type -> Type) aparsec Text.Parsec.Expr No documentation available.
-
This module implements permutation parsers. The algorithm used is fairly complex since we push the type system to its limits :-) The algorithm is described in: Parsing Permutation Phrases, by Arthur Baars, Andres Loh and Doaitse Swierstra. Published as a functional pearl at the Haskell Workshop 2001. From the abstract: A permutation phrase is a sequence of elements (possibly of different types) in which each element occurs exactly once and the order is irrelevant. Some of the permutable elements may be optional.
type
PermParser tok st a = StreamPermParser String st aparsec Text.Parsec.Perm Provided for backwards compatibility. The tok type is ignored.
-
Textual source positions.
-
The primitive parser combinators.
type
Parsec s u = ParsecT s u Identityparsec Text.Parsec.Prim No documentation available.
data
ParsecT s u (m :: Type -> Type) aparsec Text.Parsec.Prim ParserT monad transformer and Parser type ParsecT s u m a is a parser with stream type s, user state type u, underlying monad m and return type a. Parsec is strict in the user state. If this is undesirable, simply use a data type like data Box a = Box a and the state type Box YourStateType to add a level of indirection.
type
Parser = Parsec String ()parsec Text.Parsec.String No documentation available.
-
parsec Text.Parsec.Text No documentation available.
-
parsec Text.Parsec.Text.Lazy No documentation available.