Safe Haskell	None
Language	Haskell98

Text.Papillon.Core

Contents

For Text.Papillon library
- For parse error message
For papillon command

Synopsis

For Text.Papillon library

papillonCore :: String -> DecsQ #

class Source sl where #

Minimal complete definition

getToken, initialPos, updatePos

Associated Types

type Token sl #

data Pos sl #

Methods

getToken :: sl -> Maybe (Token sl, sl) #

initialPos :: Pos sl #

updatePos :: Token sl -> Pos sl -> Pos sl #

Instances

Source ByteString #
Associated Types type Token ByteString :: * # data Pos ByteString :: * # Methods getToken :: ByteString -> Maybe (Token ByteString, ByteString) # initialPos :: Pos ByteString # updatePos :: Token ByteString -> Pos ByteString -> Pos ByteString #
SourceList c => Source [c] #
Associated Types type Token [c] :: * # data Pos [c] :: * # Methods getToken :: [c] -> Maybe (Token [c], [c]) # initialPos :: Pos [c] # updatePos :: Token [c] -> Pos [c] -> Pos [c] #

class SourceList c where #

Minimal complete definition

listToken, listInitialPos, listUpdatePos

Associated Types

data ListPos c #

Methods

listToken :: [c] -> Maybe (c, [c]) #

listInitialPos :: ListPos c #

listUpdatePos :: c -> ListPos c -> ListPos c #

Instances

SourceList Char #
Associated Types data ListPos Char :: * # Methods listToken :: [Char] -> Maybe (Char, [Char]) # listInitialPos :: ListPos Char # listUpdatePos :: Char -> ListPos Char -> ListPos Char #

For parse error message

data ParseError pos drv #

Instances

Error (ParseError pos drv) #
Methods noMsg :: ParseError pos drv # strMsg :: String -> ParseError pos drv #

mkParseError :: forall pos drv. String -> String -> String -> drv -> [String] -> pos -> ParseError pos drv #

peDerivs :: ParseError pos drv -> drv #

peReading :: ParseError pos drv -> [String] #

peMessage :: ParseError pos drv -> String #

peCode :: ParseError pos drv -> String #

peComment :: ParseError pos drv -> String #

pePosition :: ParseError pos drv -> pos #

pePositionS :: forall drv. ParseError (Pos String) drv -> (Int, Int) #

For papillon command

papillonFile :: String -> Q ([PPragma], ModuleName, Maybe Exports, Code, DecsQ, Code) #

data PPragma #

Constructors

LanguagePragma [String]
OtherPragma String

Instances

Show PPragma #
Methods showsPrec :: Int -> PPragma -> ShowS # show :: PPragma -> String # showList :: [PPragma] -> ShowS #

type ModuleName = [String] #

type Exports = String #

type Code = String #

(<*>) :: Applicative f => forall a b. f (a -> b) -> f a -> f b infixl 4 #

Sequential application.

A few functors support an implementation of <*> that is more efficient than the default one.

(<$>) :: Functor f => (a -> b) -> f a -> f b infixl 4 #

An infix synonym for fmap.

The name of this operator is an allusion to $. Note the similarities between their types:

 ($)  ::              (a -> b) ->   a ->   b
(<$>) :: Functor f => (a -> b) -> f a -> f b

Whereas $ is function application, <$> is function application lifted over a Functor.

Examples

Convert from a Maybe Int to a Maybe String using show:

>>> show <$> Nothing
Nothing
>>> show <$> Just 3
Just "3"

Convert from an Either Int Int to an Either Int String using show:

>>> show <$> Left 17
Left 17
>>> show <$> Right 17
Right "17"

Double each element of a list:

>>> (*2) <$> [1,2,3]
[2,4,6]

Apply even to the second element of a pair:

>>> even <$> (2,2)
(2,True)

runError :: forall err a. ErrorT err Identity a -> Either err a #