Safe Haskell	None
Language	Haskell98

Text.Papillon.Core

Contents

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

Synopsis

papillonCore :: String -> DecsQ
class Source sl where
- type Token sl
- data Pos sl
- getToken :: sl -> Maybe (Token sl, sl)
- initialPos :: Pos sl
- updatePos :: Token sl -> Pos sl -> Pos sl
class SourceList c where
- data ListPos c
- listToken :: [c] -> Maybe (c, [c])
- listInitialPos :: ListPos c
- listUpdatePos :: c -> ListPos c -> ListPos c
data 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)
papillonFile :: String -> Q ([PPragma], ModuleName, Maybe Exports, Code, DecsQ, Code)
data PPragma
- = LanguagePragma [String]
- | OtherPragma String
type ModuleName = [String]
type Exports = String
type Code = String
(<*>) :: Applicative f => f (a -> b) -> f a -> f b
(<$>) :: Functor f => (a -> b) -> f a -> f b
runError :: forall err a. ErrorT err Identity a -> Either err a

For Text.Papillon library

papillonCore :: String -> DecsQ Source #

class Source sl where Source #

Associated Types

type Token sl Source #

data Pos sl Source #

Methods

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

initialPos :: Pos sl Source #

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

Instances

Source ByteString Source #
Instance details Defined in Text.Papillon.Papillon Associated Types type Token ByteString :: Type Source # data Pos ByteString :: Type Source # Methods getToken :: ByteString -> Maybe (Token ByteString, ByteString) Source # initialPos :: Pos ByteString Source # updatePos :: Token ByteString -> Pos ByteString -> Pos ByteString Source #
SourceList c => Source [c] Source #
Instance details Defined in Text.Papillon.Papillon Associated Types type Token [c] :: Type Source # data Pos [c] :: Type Source # Methods getToken :: [c] -> Maybe (Token [c], [c]) Source # initialPos :: Pos [c] Source # updatePos :: Token [c] -> Pos [c] -> Pos [c] Source #

class SourceList c where Source #

Associated Types

data ListPos c Source #

Methods

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

listInitialPos :: ListPos c Source #

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

Instances

SourceList Char Source #
Instance details Defined in Text.Papillon.Papillon Associated Types data ListPos Char :: Type Source # Methods listToken :: [Char] -> Maybe (Char, [Char]) Source # listInitialPos :: ListPos Char Source # listUpdatePos :: Char -> ListPos Char -> ListPos Char Source #

For parse error message

data ParseError pos drv Source #

Instances

Error (ParseError pos drv) Source #
Instance details Defined in Text.Papillon.Papillon Methods noMsg :: ParseError pos drv # strMsg :: String -> ParseError pos drv #

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

peDerivs :: ParseError pos drv -> drv Source #

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

peMessage :: ParseError pos drv -> String Source #

peCode :: ParseError pos drv -> String Source #

peComment :: ParseError pos drv -> String Source #

pePosition :: ParseError pos drv -> pos Source #

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

For papillon command

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

data PPragma Source #

Constructors

LanguagePragma [String]
OtherPragma String

Instances

Show PPragma Source #
Instance details Defined in Text.Papillon.Parser Methods showsPrec :: Int -> PPragma -> ShowS # show :: PPragma -> String # showList :: [PPragma] -> ShowS #

type ModuleName = [String] Source #

type Exports = String Source #

type Code = String Source #

(<*>) :: Applicative f => 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

Expand

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 Source #