ptera-th-0.6.0.0: A parser generator
Safe HaskellNone
LanguageHaskell2010

Language.Parser.Ptera.TH.Syntax

Documentation

type T ctx = GrammarM ctx Source #

class KnownSymbol v => HasRuleExprField rules (v :: Symbol) where #

Minimal complete definition

getExprField

Associated Types

type RuleExprReturnType rules (v :: Symbol) #

Methods

getExprField :: rules -> proxy v -> RuleExprType rules (RuleExprReturnType rules v) #

nonTerminalName :: rules -> proxy v -> String #

type family TokensTag tokens :: [Symbol] #

type family RulesTag rules :: [Symbol] #

type family RuleExprType rules :: Type -> Type #

type GrammarM ctx = Grammar (SemActM ctx) Source #

class MemberInitials rules (initials :: [Symbol]) where #

Methods

memberInitials :: T (DictF (HasRuleExprField rules)) initials #

class Rules rules where #

Methods

generateRules :: T (DictF (HasRuleExprField rules)) (RulesTag rules) #

class GrammarToken tokens elem where #

Methods

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

type RuleExprM ctx = RuleExpr (SemActM ctx) Source #

type AltM ctx = Alt (SemActM ctx) Source #

data TypedExpr rules tokens elem us Source #

newtype SemActM ctx us a Source #

Constructors

UnsafeSemActM 

semActM :: forall ctx us a. T ctx => T a => (HTExpList us -> Q (TExp (ActionTask ctx a))) -> T TTypeQ us -> SemActM ctx us a Source #

data HFList (a :: k -> Type) (b :: [k]) where #

Constructors

HFNil :: forall k (a :: k -> Type). HFList a ('[] :: [k]) 
HFCons :: forall k (a :: k -> Type) (x :: k) (xs :: [k]). a x -> HFList a xs -> HFList a (x ': xs) 

data DictF (a :: k -> Constraint) (b :: k) where #

Constructors

DictF :: forall k (a :: k -> Constraint) (b :: k). a b => DictF a b 

pattern HNil :: HTExpList '[] Source #

pattern (:*) :: Q (TExp u) -> HTExpList us -> HTExpList (u ': us) infixr 6 Source #

newtype TExpQ a Source #

Constructors

TExpQ 

Fields

newtype ActionTask ctx a #

Constructors

ActionTask 

Fields

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 #

data ActionTaskResult ctx a #

Instances

Instances details
Functor (ActionTaskResult ctx) 
Instance details

Defined in Language.Parser.Ptera.Syntax

Methods

fmap :: (a -> b) -> ActionTaskResult ctx a -> ActionTaskResult ctx b #

(<$) :: a -> ActionTaskResult ctx b -> ActionTaskResult ctx a #

(Eq a, Eq ctx) => Eq (ActionTaskResult ctx a) 
Instance details

Defined in Language.Parser.Ptera.Syntax

Methods

(==) :: ActionTaskResult ctx a -> ActionTaskResult ctx a -> Bool #

(/=) :: ActionTaskResult ctx a -> ActionTaskResult ctx a -> Bool #

(Show a, Show ctx) => Show (ActionTaskResult ctx a) 
Instance details

Defined in Language.Parser.Ptera.Syntax

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

type Alt = AltM () Source #

semAct :: T ctx => T a => (HTExpList us -> Q (TExp a)) -> T TTypeQ us -> SemActM ctx us a Source #

fixGrammar :: forall (initials :: [Symbol]) (action :: [Type] -> Type -> Type) rules tokens elem. (MemberInitials rules initials, Rules rules, RuleExprType rules ~ RuleExpr action rules tokens elem) => rules -> Grammar action rules tokens elem initials #

ruleExpr :: forall (action :: [Type] -> Type -> Type) rules tokens elem a. [Alt action rules tokens elem a] -> RuleExpr action rules tokens elem a #

(<^>) :: TypedExpr rules tokens elem us1 -> TypedExpr rules tokens elem us2 -> TypedExpr rules tokens elem (Concat us1 us2) infixr 5 Source #

eps :: TypedExpr rules tokens elem '[] Source #

(<:>) :: T ctx => T a => TypedExpr rules tokens elem us -> (HTExpList us -> Q (TExp a)) -> AltM ctx rules tokens elem a infixl 4 Source #

(<::>) :: T ctx => T a => TypedExpr rules tokens elem us -> (HTExpList us -> Q (TExp (ActionTask ctx a))) -> AltM ctx rules tokens elem a infixl 4 Source #

var :: forall v rules tokens elem proxy1 proxy2 a. KnownSymbol v => a ~ RuleExprReturnType rules v => T a => proxy1 rules -> proxy2 v -> TypedExpr rules tokens elem '[a] Source #

varA :: forall v rules tokens elem a. KnownSymbol v => a ~ RuleExprReturnType rules v => T a => TypedExpr rules tokens elem '[a] Source #

tok :: forall t rules tokens elem proxy. T elem => proxy elem -> Membership (TokensTag tokens) t -> TypedExpr rules tokens elem '[elem] Source #

class TokensMember tokens (t :: Symbol) where #

Methods

tokensMembership :: Proxy# '(tokens, t) -> Membership (TokensTag tokens) t #

tokA :: forall t rules tokens elem. T elem => TokensMember tokens t => TypedExpr rules tokens elem '[elem] Source #