haddock-library-1.5.0.1: Library exposing some functionality of Haddock.

Safe HaskellNone
LanguageHaskell2010

Documentation.Haddock.Parser.Monad

Synopsis

Documentation

newtype Parser a Source #

Constructors

Parser (StateT ParserState Parser a) 
Instances
Monad Parser Source # 
Instance details

Methods

(>>=) :: Parser a -> (a -> Parser b) -> Parser b #

(>>) :: Parser a -> Parser b -> Parser b #

return :: a -> Parser a #

fail :: String -> Parser a #

Functor Parser Source # 
Instance details

Methods

fmap :: (a -> b) -> Parser a -> Parser b #

(<$) :: a -> Parser b -> Parser a #

Applicative Parser Source # 
Instance details

Methods

pure :: a -> Parser a #

(<*>) :: Parser (a -> b) -> Parser a -> Parser b #

liftA2 :: (a -> b -> c) -> Parser a -> Parser b -> Parser c #

(*>) :: Parser a -> Parser b -> Parser b #

(<*) :: Parser a -> Parser b -> Parser a #

Alternative Parser Source # 
Instance details

Methods

empty :: Parser a #

(<|>) :: Parser a -> Parser a -> Parser a #

some :: Parser a -> Parser [a] #

many :: Parser a -> Parser [a] #

MonadPlus Parser Source # 
Instance details

Methods

mzero :: Parser a #

mplus :: Parser a -> Parser a -> Parser a #

a ~ ByteString => IsString (Parser a) Source # 
Instance details

Methods

fromString :: String -> Parser a #

newtype ParserState Source #

Constructors

ParserState 
Instances
Eq ParserState Source # 
Instance details
Show ParserState Source # 
Instance details

lift :: Parser a -> Parser a Source #

peekUnicode :: Parser (Char, Int) Source #

Peek a unicode character and return the number of bytes that it took up

satisfyUnicode :: (Char -> Bool) -> Parser Char Source #

Like satisfy, but consuming a unicode character

scan :: s -> (s -> Char -> Maybe s) -> Parser ByteString Source #

choice :: Alternative f => [f a] -> f a #

count :: Monad m => Int -> m a -> m [a] #

option :: Alternative f => a -> f a -> f a #

many' :: MonadPlus m => m a -> m [a] #

many1 :: Alternative f => f a -> f [a] #

many1' :: MonadPlus m => m a -> m [a] #

manyTill :: Alternative f => f a -> f b -> f [a] #

manyTill' :: MonadPlus m => m a -> m b -> m [a] #

sepBy :: Alternative f => f a -> f s -> f [a] #

sepBy' :: MonadPlus m => m a -> m s -> m [a] #

sepBy1 :: Alternative f => f a -> f s -> f [a] #

sepBy1' :: MonadPlus m => m a -> m s -> m [a] #

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

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

eitherP :: Alternative f => f a -> f b -> f (Either a b) #