Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

  1. newtype Parser t a

    polyparse Text.ParserCombinators.Poly.Lazy

    The only differences between a Plain and a Lazy parser are the instance of Applicative, and the type (and implementation) of runParser. We therefore need to newtype the original Parser type, to allow it to have a different instance.

  2. newtype Parser t a

    polyparse Text.ParserCombinators.Poly.Lex

    This Parser datatype is a specialised parsing monad with error reporting. This version is specialised to pre-lexed String input, where the lexer has been written to yield a LexReturn.

  3. module Text.ParserCombinators.Poly.Parser

    This module contains the definitions for a generic parser, without running state. These are the parts that are shared between the Plain and Lazy variations. Do not import this module directly, but only via T.P.Poly.Plain or T.P.Poly.Lazy.

  4. newtype Parser t a

    polyparse Text.ParserCombinators.Poly.Parser

    This Parser datatype is a fairly generic parsing monad with error reporting. It can be used for arbitrary token types, not just String input. (If you require a running state, use module Poly.State instead)

  5. module Text.ParserCombinators.Poly.Plain

    No documentation available.

  6. newtype Parser t a

    polyparse Text.ParserCombinators.Poly.Plain

    This Parser datatype is a fairly generic parsing monad with error reporting. It can be used for arbitrary token types, not just String input. (If you require a running state, use module Poly.State instead)

  7. newtype Parser s t a

    polyparse Text.ParserCombinators.Poly.State

    This Parser datatype is a fairly generic parsing monad with error reporting, and running state. It can be used for arbitrary token types, not just String input. (If you do not require a running state, use module Poly.Plain instead)

  8. newtype Parser s t a

    polyparse Text.ParserCombinators.Poly.StateLazy

    The only differences between a State and a StateLazy parser are the instance of Applicative, and the type (and implementation) of runParser. We therefore need to newtype the original Parser type, to allow it to have a different instance.

  9. class (Functor p, Monad p, MonadFail p, Applicative p, Alternative p, Commitment p) => PolyParse (p :: Type -> Type)

    polyparse Text.ParserCombinators.Poly.StateLazy

    The PolyParse class is an abstraction gathering all of the common features that a two-level error-handling parser requires: the applicative parsing interface, the monadic interface, and commitment. There are two additional basic combinators that we expect to be implemented afresh for every concrete type, but which (for technical reasons) cannot be class methods. They are next and satisfy.

  10. newtype Parser s t a

    polyparse Text.ParserCombinators.Poly.StateParser

    This Parser datatype is a fairly generic parsing monad with error reporting, and running state. It can be used for arbitrary token types, not just String input. (If you do not require a running state, use module Poly.Plain instead)

Page 592 of many | Previous | Next