Safe Haskell	None
Language	Haskell2010

Language.Parser.Ptera.TH.ParserLib

Synopsis

newtype ActionM ctx = ActionM {
- runActionM :: [ReduceArgument] -> ActionTask ctx ReduceArgument
}
data ReduceArgument where
- ReduceArgument :: forall a. a -> ReduceArgument
data RunnerParser ctx elem altHelp = RunnerParser {
- parserInitial :: StartNum -> Maybe StateNum
- parserGetTokenNum :: elem -> TokenNum
- parserTrans :: StateNum -> TokenNum -> Trans
- parserAltKind :: AltNum -> AltKind
- parserStateHelp :: StateNum -> [(AltNum, Int)]
- parserAltHelp :: AltNum -> (StringLit, Maybe altHelp)
- parserAction :: AltNum -> ActionM ctx
}
data Trans = Trans {
- transState :: StateNum
- transOps :: [TransOp]
}
data TransOp
- = TransOpEnter VarNum Bool StateNum
- | TransOpPushBackpoint StateNum
- | TransOpHandleNot AltNum
- | TransOpShift
- | TransOpReduce AltNum
failAction :: ActionTask ctx a
modifyAction :: (ctx -> ctx) -> ActionTask ctx ()
getAction :: ActionTask ctx ctx
data ActionTask ctx a
class GrammarToken tokens elem where
- tokenToTerminal :: Proxy tokens -> elem -> T (TokensTag tokens)
data AltKind
- = AltSeq
- | AltNot
- | AltAnd
data Proxy (t :: k) = Proxy
type Parser = T
pteraTHTokenToTerminal :: GrammarToken tokens elem => Proxy tokens -> elem -> Int
pteraTHArrayIndex :: Array Int e -> Int -> e
pteraTHArrayFromList :: Int -> [e] -> Array Int e
pteraTHLookupTable8 :: Int -> Addr# -> Int -> Int -> Int
pteraTHLookupTable16 :: Int -> Addr# -> Int -> Int -> Int
pteraTHLookupTable32 :: Int -> Addr# -> Int -> Int -> Int
pteraTHUnsafeExtractReduceArgument :: ReduceArgument -> a
pteraTHUnsafeRunner :: RunnerParser ctx elem () -> Parser ctx rules elem initials
pteraTHAction :: ([ReduceArgument] -> ActionTask ctx b) -> ActionM ctx
pteraTHActionTaskPure :: a -> ActionTask ctx a

Documentation

newtype ActionM ctx #

Constructors

ActionM
Fields runActionM :: [ReduceArgument] -> ActionTask ctx ReduceArgument

data ReduceArgument where #

Constructors

ReduceArgument :: forall a. a -> ReduceArgument

data RunnerParser ctx elem altHelp #

Constructors

RunnerParser
Fields parserInitial :: StartNum -> Maybe StateNum parserGetTokenNum :: elem -> TokenNum parserTrans :: StateNum -> TokenNum -> Trans parserAltKind :: AltNum -> AltKind parserStateHelp :: StateNum -> [(AltNum, Int)] parserAltHelp :: AltNum -> (StringLit, Maybe altHelp) parserAction :: AltNum -> ActionM ctx

data Trans #

Constructors

Trans
Fields transState :: StateNum transOps :: [TransOp]

Instances

Instances details

Eq Trans
Instance details Defined in Language.Parser.Ptera.Runner.Parser Methods (==) :: Trans -> Trans -> Bool # (/=) :: Trans -> Trans -> Bool #
Show Trans
Instance details Defined in Language.Parser.Ptera.Runner.Parser Methods showsPrec :: Int -> Trans -> ShowS # show :: Trans -> String # showList :: [Trans] -> ShowS #

data TransOp #

Constructors

TransOpEnter VarNum Bool StateNum
TransOpPushBackpoint StateNum
TransOpHandleNot AltNum
TransOpShift
TransOpReduce AltNum

Instances

Instances details

Eq TransOp
Instance details Defined in Language.Parser.Ptera.Runner.Parser Methods (==) :: TransOp -> TransOp -> Bool # (/=) :: TransOp -> TransOp -> Bool #
Show TransOp
Instance details Defined in Language.Parser.Ptera.Runner.Parser Methods showsPrec :: Int -> TransOp -> ShowS # show :: TransOp -> String # showList :: [TransOp] -> ShowS #

failAction :: ActionTask ctx a #

modifyAction :: (ctx -> ctx) -> ActionTask ctx () #

getAction :: ActionTask ctx ctx #

data ActionTask ctx a #

Instances

Instances details

Monad (ActionTask ctx)
Instance details Defined in Language.Parser.Ptera.Syntax Methods (>>=) :: ActionTask ctx a -> (a -> ActionTask ctx b) -> ActionTask ctx b # (>>) :: ActionTask ctx a -> ActionTask ctx b -> ActionTask ctx b # return :: a -> ActionTask ctx a #
Functor (ActionTask ctx)
Instance details Defined in Language.Parser.Ptera.Syntax Methods fmap :: (a -> b) -> ActionTask ctx a -> ActionTask ctx b # (<$) :: a -> ActionTask ctx b -> ActionTask ctx a #
Applicative (ActionTask ctx)
Instance details Defined in Language.Parser.Ptera.Syntax Methods pure :: a -> ActionTask ctx a # (<>) :: ActionTask ctx (a -> b) -> ActionTask ctx a -> ActionTask ctx b # liftA2 :: (a -> b -> c) -> ActionTask ctx a -> ActionTask ctx b -> ActionTask ctx c # (>) :: ActionTask ctx a -> ActionTask ctx b -> ActionTask ctx b # (<*) :: ActionTask ctx a -> ActionTask ctx b -> ActionTask ctx a #

class GrammarToken tokens elem where #

Methods

tokenToTerminal :: Proxy tokens -> elem -> T (TokensTag tokens) #

data AltKind #

Constructors

AltSeq
AltNot
AltAnd

Instances

Instances details

Eq AltKind
Instance details Defined in Language.Parser.Ptera.Machine.PEG Methods (==) :: AltKind -> AltKind -> Bool # (/=) :: AltKind -> AltKind -> Bool #
Show AltKind
Instance details Defined in Language.Parser.Ptera.Machine.PEG Methods showsPrec :: Int -> AltKind -> ShowS # show :: AltKind -> String # showList :: [AltKind] -> ShowS #

data Proxy (t :: k) #

Proxy is a type that holds no data, but has a phantom parameter of arbitrary type (or even kind). Its use is to provide type information, even though there is no value available of that type (or it may be too costly to create one).

Historically, Proxy :: Proxy a is a safer alternative to the undefined :: a idiom.

>>> Proxy :: Proxy (Void, Int -> Int)
Proxy

Proxy can even hold types of higher kinds,

>>> Proxy :: Proxy Either
Proxy

>>> Proxy :: Proxy Functor
Proxy

>>> Proxy :: Proxy complicatedStructure
Proxy

Constructors

Proxy

Instances

Instances details

Generic1 (Proxy :: k -> Type)	Since: base-4.6.0.0
Instance details Defined in GHC.Generics Associated Types type Rep1 Proxy :: k -> Type # Methods from1 :: forall (a :: k0). Proxy a -> Rep1 Proxy a # to1 :: forall (a :: k0). Rep1 Proxy a -> Proxy a #
Monad (Proxy :: Type -> Type)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods (>>=) :: Proxy a -> (a -> Proxy b) -> Proxy b # (>>) :: Proxy a -> Proxy b -> Proxy b # return :: a -> Proxy a #
Functor (Proxy :: Type -> Type)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods fmap :: (a -> b) -> Proxy a -> Proxy b # (<$) :: a -> Proxy b -> Proxy a #
Applicative (Proxy :: Type -> Type)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods pure :: a -> Proxy a # (<>) :: Proxy (a -> b) -> Proxy a -> Proxy b # liftA2 :: (a -> b -> c) -> Proxy a -> Proxy b -> Proxy c # (>) :: Proxy a -> Proxy b -> Proxy b # (<*) :: Proxy a -> Proxy b -> Proxy a #
Foldable (Proxy :: Type -> Type)	Since: base-4.7.0.0
Instance details Defined in Data.Foldable Methods fold :: Monoid m => Proxy m -> m # foldMap :: Monoid m => (a -> m) -> Proxy a -> m # foldMap' :: Monoid m => (a -> m) -> Proxy a -> m # foldr :: (a -> b -> b) -> b -> Proxy a -> b # foldr' :: (a -> b -> b) -> b -> Proxy a -> b # foldl :: (b -> a -> b) -> b -> Proxy a -> b # foldl' :: (b -> a -> b) -> b -> Proxy a -> b # foldr1 :: (a -> a -> a) -> Proxy a -> a # foldl1 :: (a -> a -> a) -> Proxy a -> a # toList :: Proxy a -> [a] # null :: Proxy a -> Bool # length :: Proxy a -> Int # elem :: Eq a => a -> Proxy a -> Bool # maximum :: Ord a => Proxy a -> a # minimum :: Ord a => Proxy a -> a # sum :: Num a => Proxy a -> a # product :: Num a => Proxy a -> a #
Traversable (Proxy :: Type -> Type)	Since: base-4.7.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Proxy a -> f (Proxy b) # sequenceA :: Applicative f => Proxy (f a) -> f (Proxy a) # mapM :: Monad m => (a -> m b) -> Proxy a -> m (Proxy b) # sequence :: Monad m => Proxy (m a) -> m (Proxy a) #
Alternative (Proxy :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Proxy Methods empty :: Proxy a # (<\|>) :: Proxy a -> Proxy a -> Proxy a # some :: Proxy a -> Proxy [a] # many :: Proxy a -> Proxy [a] #
MonadPlus (Proxy :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in Data.Proxy Methods mzero :: Proxy a # mplus :: Proxy a -> Proxy a -> Proxy a #
Hashable1 (Proxy :: Type -> Type)
Instance details Defined in Data.Hashable.Class Methods liftHashWithSalt :: (Int -> a -> Int) -> Int -> Proxy a -> Int #
Bounded (Proxy t)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods minBound :: Proxy t # maxBound :: Proxy t #
Enum (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods succ :: Proxy s -> Proxy s # pred :: Proxy s -> Proxy s # toEnum :: Int -> Proxy s # fromEnum :: Proxy s -> Int # enumFrom :: Proxy s -> [Proxy s] # enumFromThen :: Proxy s -> Proxy s -> [Proxy s] # enumFromTo :: Proxy s -> Proxy s -> [Proxy s] # enumFromThenTo :: Proxy s -> Proxy s -> Proxy s -> [Proxy s] #
Eq (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods (==) :: Proxy s -> Proxy s -> Bool # (/=) :: Proxy s -> Proxy s -> Bool #
Ord (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods compare :: Proxy s -> Proxy s -> Ordering # (<) :: Proxy s -> Proxy s -> Bool # (<=) :: Proxy s -> Proxy s -> Bool # (>) :: Proxy s -> Proxy s -> Bool # (>=) :: Proxy s -> Proxy s -> Bool # max :: Proxy s -> Proxy s -> Proxy s # min :: Proxy s -> Proxy s -> Proxy s #
Read (Proxy t)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods readsPrec :: Int -> ReadS (Proxy t) # readList :: ReadS [Proxy t] # readPrec :: ReadPrec (Proxy t) # readListPrec :: ReadPrec [Proxy t] #
Show (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods showsPrec :: Int -> Proxy s -> ShowS # show :: Proxy s -> String # showList :: [Proxy s] -> ShowS #
Ix (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods range :: (Proxy s, Proxy s) -> [Proxy s] # index :: (Proxy s, Proxy s) -> Proxy s -> Int # unsafeIndex :: (Proxy s, Proxy s) -> Proxy s -> Int # inRange :: (Proxy s, Proxy s) -> Proxy s -> Bool # rangeSize :: (Proxy s, Proxy s) -> Int # unsafeRangeSize :: (Proxy s, Proxy s) -> Int #
Generic (Proxy t)	Since: base-4.6.0.0
Instance details Defined in GHC.Generics Associated Types type Rep (Proxy t) :: Type -> Type # Methods from :: Proxy t -> Rep (Proxy t) x # to :: Rep (Proxy t) x -> Proxy t #
Semigroup (Proxy s)	Since: base-4.9.0.0
Instance details Defined in Data.Proxy Methods (<>) :: Proxy s -> Proxy s -> Proxy s # sconcat :: NonEmpty (Proxy s) -> Proxy s # stimes :: Integral b => b -> Proxy s -> Proxy s #
Monoid (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods mempty :: Proxy s # mappend :: Proxy s -> Proxy s -> Proxy s # mconcat :: [Proxy s] -> Proxy s #
Hashable (Proxy a)
Instance details Defined in Data.Hashable.Class Methods hashWithSalt :: Int -> Proxy a -> Int # hash :: Proxy a -> Int #
type Rep1 (Proxy :: k -> Type)
Instance details Defined in GHC.Generics type Rep1 (Proxy :: k -> Type) = D1 ('MetaData "Proxy" "Data.Proxy" "base" 'False) (C1 ('MetaCons "Proxy" 'PrefixI 'False) (U1 :: k -> Type))
type Rep (Proxy t)
Instance details Defined in GHC.Generics type Rep (Proxy t) = D1 ('MetaData "Proxy" "Data.Proxy" "base" 'False) (C1 ('MetaCons "Proxy" 'PrefixI 'False) (U1 :: Type -> Type))

type Parser = T Source #

pteraTHTokenToTerminal :: GrammarToken tokens elem => Proxy tokens -> elem -> Int Source #

pteraTHArrayIndex :: Array Int e -> Int -> e Source #

pteraTHArrayFromList :: Int -> [e] -> Array Int e Source #

pteraTHLookupTable8 :: Int -> Addr# -> Int -> Int -> Int Source #

pteraTHLookupTable16 :: Int -> Addr# -> Int -> Int -> Int Source #

pteraTHLookupTable32 :: Int -> Addr# -> Int -> Int -> Int Source #

pteraTHUnsafeExtractReduceArgument :: ReduceArgument -> a Source #

pteraTHUnsafeRunner :: RunnerParser ctx elem () -> Parser ctx rules elem initials Source #

pteraTHAction :: ([ReduceArgument] -> ActionTask ctx b) -> ActionM ctx Source #

pteraTHActionTaskPure :: a -> ActionTask ctx a Source #