ParserCombinators

Documentation

class IsMatch a where

Minimal complete definition

is, isNot, inverse

Methods

is :: a -> Parser a

isNot :: a -> Parser a

oneOf :: [a] -> Parser a

noneOf :: [a] -> Parser a

inverse :: Parser a -> Parser a

Instances

IsMatch Char

Defined in ParserCombinators

Methods

is :: Char -> Parser Char

isNot :: Char -> Parser Char

oneOf :: [Char] -> Parser Char

noneOf :: [Char] -> Parser Char

inverse :: Parser Char -> Parser Char

(Num a, Read a, Show a) => IsMatch a

Defined in ParserCombinators

Methods

is :: a -> Parser a

isNot :: a -> Parser a

oneOf :: [a] -> Parser a

noneOf :: [a] -> Parser a

inverse :: Parser a -> Parser a

IsMatch String

Defined in ParserCombinators

Methods

is :: String -> Parser String

isNot :: String -> Parser String

oneOf :: [String] -> Parser String

noneOf :: [String] -> Parser String

inverse :: Parser String -> Parser String

satisfies :: Parser a -> (a -> Bool) -> Parser a

contains :: Eq a => Parser [a] -> [a] -> Parser [a]

notContains :: Eq a => Parser [a] -> [a] -> Parser [a]

times :: Parser a -> Integer -> Parser [a]

maybeTimes :: Parser a -> Parser (Maybe a)

anyTimes :: Parser a -> Parser [a]

someTimes :: Parser a -> Parser [a]

manyTimes :: Parser a -> Parser [a]

within :: Parser a -> Parser b -> Parser b

maybeWithin :: Parser a -> Parser b -> Parser b

withinBoth :: Parser a -> Parser b -> Parser c -> Parser c

maybeWithinBoth :: Parser a -> Parser b -> Parser c -> Parser c

(<|>) :: Parser a -> Parser a -> Parser a infixl 3

(<&>) :: Parser a -> Parser a -> Parser a infixl 3

(<#>) :: Parser a -> Integer -> Parser [a] infixl 6

(>>>) :: (ToString a, ToString b) => Parser a -> Parser b -> Parser String infixl 6

(|?) :: Parser a -> Parser (Maybe a)

(|*) :: Parser a -> Parser [a]

(|+) :: Parser a -> Parser [a]

(|++) :: Parser a -> Parser [a]