parsers-0.12.4: Parsing combinators

Copyright | (c) Edward Kmett 2011-2013
License | BSD3
Maintainer | ekmett@gmail.com
Stability | experimental
Portability | non-portable
Safe Haskell | None
Language | Haskell2010

Text.Parser.LookAhead

Contents

- Parsing Combinators

Description

Parsers that can `lookAhead`.

Synopsis

- class Parsing m => LookAheadParsing m where

# Parsing Combinators

class Parsing m => LookAheadParsing m where #

Additional functionality needed to describe parsers independent of input type.

Minimal complete definition

lookAhead

Methods

lookAhead :: m a -> m a #

`lookAhead p` parses `p` without consuming any input.

Instances

LookAheadParsing ReadP # |
Methods lookAhead :: ReadP a -> ReadP a #
Chunk i => LookAheadParsing (Parser i) # |
Methods lookAhead :: Parser i a -> Parser i a #
(LookAheadParsing m, MonadPlus m) => LookAheadParsing (StateT s m) # |
Methods lookAhead :: StateT s m a -> StateT s m a #
(LookAheadParsing m, MonadPlus m) => LookAheadParsing (StateT s m) # |
Methods lookAhead :: StateT s m a -> StateT s m a #
(LookAheadParsing m, MonadPlus m, Monoid w) => LookAheadParsing (WriterT w m) # |
Methods lookAhead :: WriterT w m a -> WriterT w m a #
(LookAheadParsing m, MonadPlus m, Monoid w) => LookAheadParsing (WriterT w m) # |
Methods lookAhead :: WriterT w m a -> WriterT w m a #
(LookAheadParsing m, Monad m) => LookAheadParsing (IdentityT * m) # |
Methods lookAhead :: IdentityT * m a -> IdentityT * m a #
(LookAheadParsing m, MonadPlus m) => LookAheadParsing (ReaderT * e m) # |
Methods lookAhead :: ReaderT * e m a -> ReaderT * e m a #
(Stream s m t, Show t) => LookAheadParsing (ParsecT s u m) # |
Methods lookAhead :: ParsecT s u m a -> ParsecT s u m a #
(LookAheadParsing m, MonadPlus m, Monoid w) => LookAheadParsing (RWST r w s m) # |
Methods lookAhead :: RWST r w s m a -> RWST r w s m a #
(LookAheadParsing m, MonadPlus m, Monoid w) => LookAheadParsing (RWST r w s m) # |
Methods lookAhead :: RWST r w s m a -> RWST r w s m a #