Safe Haskell	Safe
Language	Haskell2010

Text.ParserCombinators.Class

Synopsis

class (Monad p, Alternative p) => IsParser p where
- type SymbolOf p
- satisfy :: (SymbolOf p -> Bool) -> p (SymbolOf p)
- look :: p [SymbolOf p]
- label :: String -> p a -> p a
- (<<|>) :: p a -> p a -> p a
(<?>) :: IsParser p => p a -> String -> p a
char :: (IsParser p, Eq (SymbolOf p), Show (SymbolOf p)) => SymbolOf p -> p (SymbolOf p)
noneOf :: (IsParser p, SymbolOf p ~# Char) => [Char] -> p Char
oneOf :: (IsParser p, SymbolOf p ~# Char) => [Char] -> p Char
spaces :: (IsParser p, SymbolOf p ~# Char) => p ()
space :: (IsParser p, SymbolOf p ~# Char) => p Char
newline :: (IsParser p, Eq (SymbolOf p), Show (SymbolOf p), SymbolOf p ~# Char) => p Char
tab :: (IsParser p, Eq (SymbolOf p), Show (SymbolOf p), SymbolOf p ~# Char) => p Char
upper :: (IsParser p, SymbolOf p ~# Char) => p Char
lower :: (IsParser p, SymbolOf p ~# Char) => p Char
alphaNum :: (IsParser p, SymbolOf p ~# Char) => p Char
letter :: (IsParser p, SymbolOf p ~# Char) => p Char
digit :: (IsParser p, SymbolOf p ~# Char) => p Char
hexDigit :: (IsParser p, SymbolOf p ~# Char) => p Char
octDigit :: (IsParser p, SymbolOf p ~# Char) => p Char
anySymbol :: IsParser p => p (SymbolOf p)
string :: (IsParser p, SymbolOf p ~ Char) => String -> p String
choice :: Alternative f => [f a] -> f a
option :: Alternative f => a -> f a -> f a
between :: Applicative m => m x -> m y -> m a -> m a
manyGreedy :: IsParser m => m a -> m [a]
skipMany1 :: Alternative f => f a -> f ()
skipMany :: Alternative f => f a -> f ()
sepBy :: Alternative f => f a1 -> f a2 -> f [a1]
sepBy1 :: Alternative f => f a1 -> f a2 -> f [a1]
count :: Applicative m => Int -> m a -> m [a]
chainr :: (Alternative f, Monad f) => f a -> f (a -> a -> a) -> a -> f a
chainl :: (Alternative f, Monad f) => f a -> f (a -> a -> a) -> a -> f a
chainr1 :: (Monad f, Alternative f) => f t -> f (t -> t -> t) -> f t
chainl1 :: (Alternative m, Monad m) => m b -> m (b -> b -> b) -> m b
munch :: IsParser m => (SymbolOf m -> Bool) -> m [SymbolOf m]
munch1 :: IsParser m => (SymbolOf m -> Bool) -> m [SymbolOf m]
endOfFile :: IsParser p => p ()

Documentation

class (Monad p, Alternative p) => IsParser p where Source #

Parser class

Associated Types

type SymbolOf p Source #

Methods

satisfy Source #

Arguments

:: (SymbolOf p -> Bool)
-> p (SymbolOf p)	accept a symbol satisfying a given predicate

look Source #

Arguments

:: p [SymbolOf p]

access the stream of symbols from the current point

label Source #

Arguments

:: String
-> p a
-> p a	label the parser

(<<|>) infixr 3 Source #

Arguments

:: p a
-> p a
-> p a	Left-biased choice.

Instances

IsParser Parser Source #
Instance details Defined in Text.ParserCombinators.Parsek.Position Associated Types type SymbolOf Parser :: Type Source # Methods satisfy :: (SymbolOf Parser -> Bool) -> Parser (SymbolOf Parser) Source # look :: Parser [SymbolOf Parser] Source # label :: String -> Parser a -> Parser a Source # (<<\|>) :: Parser a -> Parser a -> Parser a Source #
IsParser (Parser s) Source #
Instance details Defined in Text.ParserCombinators.Parsek Associated Types type SymbolOf (Parser s) :: Type Source # Methods satisfy :: (SymbolOf (Parser s) -> Bool) -> Parser s (SymbolOf (Parser s)) Source # look :: Parser s [SymbolOf (Parser s)] Source # label :: String -> Parser s a -> Parser s a Source # (<<\|>) :: Parser s a -> Parser s a -> Parser s a Source #