Text.ParserCombinators.Class

Documentation

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

Parser class

Associated Types

type SymbolOf p

Methods

satisfy

Arguments

:: (SymbolOf p -> Bool)

-> p (SymbolOf p)

accept a symbol satisfying a given predicate

look

Arguments

:: p [SymbolOf p]

access the stream of symbols from the current point

label

Arguments

:: String

-> p a

-> p a

label the parser

(<<|>) infixr 3

Arguments

:: p a

-> p a

-> p a

Left-biased choice.

Instances

IsParser Parser

IsParser (Parser s)

(<?>) :: IsParser p => p a -> String -> p a infix 2

Label a parser

char :: (IsParser p, Show (SymbolOf p), Eq (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, (~) * (SymbolOf p) Char) => p Char

tab :: (IsParser 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]

Greedy repetition: match as many occurences as possible of the argument.

skipMany1 :: Alternative f => f a -> f ()

skipMany :: Alternative f => f a -> f ()

sepBy :: Alternative f => f a -> f a1 -> f [a]

sepBy1 :: Alternative f => f a -> f a1 -> f [a]

count :: Applicative m => Int -> m a -> m [a]

chainr :: (Monad f, Alternative f) => f a -> f (a -> a -> a) -> a -> f a

chainl :: (Monad f, Alternative f) => f a -> f (a -> a -> a) -> a -> f a

chainr1 :: (Monad m, Alternative m) => m t -> m (t -> t -> t) -> m t

chainl1 :: (Monad m, Alternative 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, MonadPlus p) => p ()