Parsers.Utils.Attoparsec

Class Inputable

class Chunk inp => Inputable inp where

Associated Types

type Token inp

Methods

null :: inp -> Bool

empty :: inp

uncons :: inp -> Maybe (Token inp, inp)

satisfy :: (Token inp -> Bool) -> Parser inp (Token inp)

char :: Char -> Parser inp Char

notInClass :: String -> Token inp -> Bool

Instances

Inputable ByteString

Defined in Parsers.Utils.Attoparsec

Associated Types

type Token ByteString

Methods

null :: ByteString -> Bool

empty :: ByteString

uncons :: ByteString -> Maybe (Token ByteString, ByteString)

satisfy :: (Token ByteString -> Bool) -> Parser ByteString (Token ByteString)

char :: Char -> Parser ByteString Char

notInClass :: String -> Token ByteString -> Bool

Inputable Text

Defined in Parsers.Utils.Attoparsec

Associated Types

type Token Text

Methods

null :: Text -> Bool

empty :: Text

uncons :: Text -> Maybe (Token Text, Text)

satisfy :: (Token Text -> Bool) -> Parser Text (Token Text)

char :: Char -> Parser Text Char

notInClass :: String -> Token Text -> Bool

between :: Applicative f => f a -> f b -> f c -> f c

match :: (Monad m, Eq a) => [a] -> m a -> (a -> m b) -> m b -> m b

skipSome :: Alternative p => p a -> p ()

some :: Alternative p => p a -> p [a]

maybeP :: Alternative p => p a -> p (Maybe a)

fromMaybeP :: Monad m => m (Maybe a) -> m a -> m a

(<+>) :: Alternative p => p a -> p b -> p (Either a b)

(<:>) :: Applicative p => p a -> p [a] -> p [a]

(<~>) :: Applicative p => p a -> p b -> p (a, b)

pfoldl1 :: Alternative p => (b -> a -> b) -> b -> p a -> p b

(>?>) :: MonadPlus m => m a -> (a -> Bool) -> m a

chainPre :: Alternative p => p (a -> a) -> p a -> p a

chainPost :: Alternative p => p a -> p (a -> a) -> p a

chainl1 :: Alternative p => p a -> p (a -> a -> a) -> p a

chainr1 :: Alternative p => p a -> p (a -> a -> a) -> p a

data Level p s a

Constructors

InfixL [p (a -> a -> a)]

InfixR [p (a -> a -> a)]

Prefix [p (a -> a)]

Postfix [p (a -> a)]

precedence :: Alternative p => [Level p s a] -> p a -> p a