Bookhound.ParserCombinators

Documentation

class IsMatch a where

Minimal complete definition

is, isNot, inverse

Methods

is :: a -> Parser a

isNot :: a -> Parser a

inverse :: Parser a -> Parser a

oneOf :: [a] -> Parser a

noneOf :: [a] -> Parser a

Instances

IsMatch Text

Defined in Bookhound.ParserCombinators

Methods

is :: Text -> Parser Text

isNot :: Text -> Parser Text

inverse :: Parser Text -> Parser Text

oneOf :: [Text] -> Parser Text

noneOf :: [Text] -> Parser Text

IsMatch String

Defined in Bookhound.ParserCombinators

Methods

is :: String -> Parser String

isNot :: String -> Parser String

inverse :: Parser String -> Parser String

oneOf :: [String] -> Parser String

noneOf :: [String] -> Parser String

IsMatch Char

Defined in Bookhound.ParserCombinators

Methods

is :: Char -> Parser Char

isNot :: Char -> Parser Char

inverse :: Parser Char -> Parser Char

oneOf :: [Char] -> Parser Char

noneOf :: [Char] -> Parser Char

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

char :: Char -> Parser Char

string :: Text -> Parser Text

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

many :: Parser a -> Parser [a]

some :: Parser a -> Parser [a]

multiple :: Parser a -> Parser [a]

between :: Parser a -> Parser b -> Parser c -> Parser c

maybeBetween :: Parser a -> Parser b -> Parser c -> Parser c

surroundedBy :: Parser a -> Parser b -> Parser b

maybeSurroundedBy :: Parser a -> Parser b -> Parser b

manySepBy :: Parser a -> Parser b -> Parser [b]

someSepBy :: Parser a -> Parser b -> Parser [b]

multipleSepBy :: Parser a -> Parser b -> Parser [b]

sepByOps :: Parser a -> Parser b -> Parser ([a], [b])

sepByOp :: Parser a -> Parser b -> Parser (a, [b])

manyEndBy :: forall a b. Parser a -> Parser b -> Parser [b]

someEndBy :: forall a b. Parser a -> Parser b -> Parser [b]

multipleEndBy :: forall a b. Parser a -> Parser b -> Parser [b]

(<?>) :: Parser a -> Text -> Parser a infixl 6

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

(</\>) :: Applicative f => f a -> f b -> f (a, b) infixl 6

(<:>) :: Applicative f => f a -> f [a] -> f [a] infixl 6

(->>-) :: (ToText a, ToText b) => Parser a -> Parser b -> Parser Text infixl 6

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

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

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

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

(||?) :: Parser Char -> Parser Text

(||*) :: Parser Char -> Parser Text

(||+) :: Parser Char -> Parser Text

(||++) :: Parser Char -> Parser Text