Safe Haskell	None
Language	Haskell2010

Language.Parser.Ptera.TH

Synopsis

class HasField (x :: k) r a | x r -> a where
- getField :: r -> a
failAction :: ActionTask ctx a
modifyAction :: (ctx -> ctx) -> ActionTask ctx ()
getAction :: ActionTask ctx ctx
newtype ActionTask ctx a = ActionTask {
- runActionTask :: ctx -> ActionTaskResult ctx a
}
data ActionTaskResult ctx a
- = ActionTaskFail
- | ActionTaskResult a
- | ActionTaskModifyResult ctx a
tokA :: forall (t :: Symbol) rules tokens elem. TokensMember tokens t => Expr rules tokens elem '[elem]
tok :: forall tokens (t :: Symbol) rules elem. Membership (TokensTag tokens) t -> Expr rules tokens elem '[elem]
varA :: forall (v :: Symbol) rules tokens elem. KnownSymbol v => Expr rules tokens elem '[RuleExprReturnType rules v]
var :: forall (v :: Symbol) proxy rules tokens elem. KnownSymbol v => proxy v -> Expr rules tokens elem '[RuleExprReturnType rules v]
(<^>) :: forall rules tokens elem (us1 :: [Type]) (us2 :: [Type]). Expr rules tokens elem us1 -> Expr rules tokens elem us2 -> Expr rules tokens elem (Concat us1 us2)
ruleExpr :: forall (action :: [Type] -> Type -> Type) rules tokens elem a. [Alt action rules tokens elem a] -> RuleExpr action rules tokens elem a
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
type family TokensTag tokens :: [Symbol]
type family RulesTag rules :: [Symbol]
type family RuleExprType rules :: Type -> Type
class GrammarToken tokens elem where
- tokenToTerminal :: Proxy tokens -> elem -> T (TokensTag tokens)
type family RuleExprReturnType rules (v :: Symbol)
class (KnownSymbol v, HasField v rules (RuleExprType rules (RuleExprReturnType rules v))) => HasRuleExprField rules (v :: Symbol) where
- type RuleExprReturnType rules (v :: Symbol)
- nonTerminalName :: rules -> proxy v -> String
class MemberInitials rules (initials :: [Symbol]) where
- memberInitials :: T (DictF (HasRuleExprField rules)) initials
class Rules rules where
- generateRules :: T (DictF (HasRuleExprField rules)) (RulesTag rules)
data Expr rules tokens elem (us :: [Type])
class TokensMember tokens (t :: Symbol) where
- tokensMembership :: Proxy# '(tokens, t) -> Membership (TokensTag tokens) t
data DictF (a :: k -> Constraint) (b :: k) where
- DictF :: forall k (a :: k -> Constraint) (b :: k). a b => DictF a b
data HFList (a :: k -> Type) (b :: [k]) where
- 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)
type SemAct = SemActM ()
data SemActM ctx us a
newtype TExpQ a = TExpQ {
- unTExpQ :: Q (TExp a)
}
type HTExpList = T TExpQ
type Alt = AltM ()
type RuleExpr = RuleExprM ()
type Grammar = GrammarM ()
type AltM ctx = Alt (SemActM ctx)
type RuleExprM ctx = RuleExpr (SemActM ctx)
type GrammarM ctx = Grammar (SemActM ctx)
pattern (:*) :: Q (TExp u) -> HTExpList us -> HTExpList (u ': us)
pattern HNil :: HTExpList '[]
(<:>) :: Expr rules tokens elem us -> (HTExpList us -> Q (TExp a)) -> AltM ctx rules tokens elem a
eps :: (HTExpList '[] -> Q (TExp a)) -> AltM ctx rules tokens elem a
(<::>) :: Expr rules tokens elem us -> (HTExpList us -> Q (TExp (ActionTask ctx a))) -> AltM ctx rules tokens elem a
epsM :: (HTExpList '[] -> Q (TExp (ActionTask ctx a))) -> AltM ctx rules tokens elem a
runListScanner :: ListScanner e a -> [e] -> a
class Monad m => Scanner posMark elem (m :: Type -> Type) | m -> posMark, m -> elem where
- consumeInput :: m (Maybe elem)
- getPosMark :: m posMark
- seekToPosMark :: posMark -> m ()
- scanMode :: ScanMode posMark -> m ()
data ScanMode posMark
- = ScanModeNoBack
- | ScanModeNeedBack posMark
newtype ListScanner e a = ListScanner {
- unListScanner :: State [e] a
}
runParser :: forall (v :: Symbol) (initials :: [Symbol]) posMark m rules elem proxy. (Member initials v, T posMark elem m) => proxy v -> Runner rules elem initials -> m (Result posMark (RuleExprReturnType rules v))
runParserM :: forall (v :: Symbol) (initials :: [Symbol]) ctx posMark m rules elem proxy. (Member initials v, T posMark elem m) => proxy v -> RunnerM ctx rules elem initials -> ctx -> m (Result posMark (RuleExprReturnType rules v))
type Result posMark = ParseResult posMark ()
data ParseResult posMark altHelp a
- = Parsed a
- | ParseFailed posMark (FailedReason altHelp)
module Language.Parser.Ptera.TH.ParserLib
data GenRulesTypes = GenRulesTypes {
- genRulesCtxTy :: Q Type
- genRulesTokensTy :: Q Type
- genRulesTokenTy :: Q Type
}
genGrammarToken :: Name -> Q Type -> [(String, Q Pat)] -> Q [Dec]
genRules :: Name -> GenRulesTypes -> [(Name, String, Q Type)] -> Q [Dec]
genParsePoints :: Name -> Name -> [String] -> Q [Dec]
genRunner :: forall initials rules tokens ctx elem. GrammarToken tokens elem => Generate (TokensTag tokens) => GenParam -> GrammarM ctx rules tokens elem initials -> Q [Dec]
data GenParam = GenParam {
- startsTy :: Q Type
- rulesTy :: Q Type
- tokensTy :: Q Type
- tokenTy :: Q Type
- customCtxTy :: Q Type
}
defaultCustomCtxTy :: Q Type

Documentation

class HasField (x :: k) r a | x r -> a where #

Constraint representing the fact that the field x belongs to the record type r and has field type a. This will be solved automatically, but manual instances may be provided as well.

Methods

getField :: r -> a #

Selector function to extract the field from the record.

failAction :: ActionTask ctx a #

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

getAction :: ActionTask ctx ctx #

newtype ActionTask ctx a #

Constructors

ActionTask
Fields runActionTask :: ctx -> ActionTaskResult 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 #

data ActionTaskResult ctx a #

Constructors

ActionTaskFail
ActionTaskResult a
ActionTaskModifyResult 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 Methods showsPrec :: Int -> ActionTaskResult ctx a -> ShowS # show :: ActionTaskResult ctx a -> String # showList :: [ActionTaskResult ctx a] -> ShowS #

tokA :: forall (t :: Symbol) rules tokens elem. TokensMember tokens t => Expr rules tokens elem '[elem] #

tok :: forall tokens (t :: Symbol) rules elem. Membership (TokensTag tokens) t -> Expr rules tokens elem '[elem] #

varA :: forall (v :: Symbol) rules tokens elem. KnownSymbol v => Expr rules tokens elem '[RuleExprReturnType rules v] #

var :: forall (v :: Symbol) proxy rules tokens elem. KnownSymbol v => proxy v -> Expr rules tokens elem '[RuleExprReturnType rules v] #

(<^>) :: forall rules tokens elem (us1 :: [Type]) (us2 :: [Type]). Expr rules tokens elem us1 -> Expr rules tokens elem us2 -> Expr rules tokens elem (Concat us1 us2) infixr 5 #

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

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 #

type family TokensTag tokens :: [Symbol] #

type family RulesTag rules :: [Symbol] #

type family RuleExprType rules :: Type -> Type #

class GrammarToken tokens elem where #

Methods

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

type family RuleExprReturnType rules (v :: Symbol) #

class (KnownSymbol v, HasField v rules (RuleExprType rules (RuleExprReturnType rules v))) => HasRuleExprField rules (v :: Symbol) where #

Minimal complete definition

Nothing

Associated Types

type RuleExprReturnType rules (v :: Symbol) #

Methods

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

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

data Expr rules tokens elem (us :: [Type]) #

class TokensMember tokens (t :: Symbol) where #

Methods

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

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

Constructors

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

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)

type SemAct = SemActM () Source #

data SemActM ctx us a Source #

newtype TExpQ a Source #

Constructors

TExpQ
Fields unTExpQ :: Q (TExp a)

type HTExpList = T TExpQ Source #

type Alt = AltM () Source #

type RuleExpr = RuleExprM () Source #

type Grammar = GrammarM () Source #

type AltM ctx = Alt (SemActM ctx) Source #

type RuleExprM ctx = RuleExpr (SemActM ctx) Source #

type GrammarM ctx = Grammar (SemActM ctx) Source #

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

pattern HNil :: HTExpList '[] Source #

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

eps :: (HTExpList '[] -> Q (TExp a)) -> AltM ctx rules tokens elem a Source #

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

epsM :: (HTExpList '[] -> Q (TExp (ActionTask ctx a))) -> AltM ctx rules tokens elem a Source #

runListScanner :: ListScanner e a -> [e] -> a #

class Monad m => Scanner posMark elem (m :: Type -> Type) | m -> posMark, m -> elem where #

Methods

consumeInput :: m (Maybe elem) #

getPosMark :: m posMark #

seekToPosMark :: posMark -> m () #

scanMode :: ScanMode posMark -> m () #

Instances

Instances details

Scanner [e] e (ListScanner e)
Instance details Defined in Language.Parser.Ptera.Scanner Methods consumeInput :: ListScanner e (Maybe e) # getPosMark :: ListScanner e [e] # seekToPosMark :: [e] -> ListScanner e () # scanMode :: ScanMode [e] -> ListScanner e () #

data ScanMode posMark #

Constructors

ScanModeNoBack
ScanModeNeedBack posMark

Instances

Instances details

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

newtype ListScanner e a #

Constructors

ListScanner
Fields unListScanner :: State [e] a

Instances

Instances details

Monad (ListScanner e)
Instance details Defined in Language.Parser.Ptera.Scanner Methods (>>=) :: ListScanner e a -> (a -> ListScanner e b) -> ListScanner e b # (>>) :: ListScanner e a -> ListScanner e b -> ListScanner e b # return :: a -> ListScanner e a #
Functor (ListScanner e)
Instance details Defined in Language.Parser.Ptera.Scanner Methods fmap :: (a -> b) -> ListScanner e a -> ListScanner e b # (<$) :: a -> ListScanner e b -> ListScanner e a #
Applicative (ListScanner e)
Instance details Defined in Language.Parser.Ptera.Scanner Methods pure :: a -> ListScanner e a # (<>) :: ListScanner e (a -> b) -> ListScanner e a -> ListScanner e b # liftA2 :: (a -> b -> c) -> ListScanner e a -> ListScanner e b -> ListScanner e c # (>) :: ListScanner e a -> ListScanner e b -> ListScanner e b # (<*) :: ListScanner e a -> ListScanner e b -> ListScanner e a #
Scanner [e] e (ListScanner e)
Instance details Defined in Language.Parser.Ptera.Scanner Methods consumeInput :: ListScanner e (Maybe e) # getPosMark :: ListScanner e [e] # seekToPosMark :: [e] -> ListScanner e () # scanMode :: ScanMode [e] -> ListScanner e () #

runParser :: forall (v :: Symbol) (initials :: [Symbol]) posMark m rules elem proxy. (Member initials v, T posMark elem m) => proxy v -> Runner rules elem initials -> m (Result posMark (RuleExprReturnType rules v)) #

runParserM :: forall (v :: Symbol) (initials :: [Symbol]) ctx posMark m rules elem proxy. (Member initials v, T posMark elem m) => proxy v -> RunnerM ctx rules elem initials -> ctx -> m (Result posMark (RuleExprReturnType rules v)) #

type Result posMark = ParseResult posMark () #

data ParseResult posMark altHelp a #

Constructors

Parsed a
ParseFailed posMark (FailedReason altHelp)

Instances

Instances details

Functor (ParseResult posMark altHelp)
Instance details Defined in Language.Parser.Ptera.Runner.RunT Methods fmap :: (a -> b) -> ParseResult posMark altHelp a -> ParseResult posMark altHelp b # (<$) :: a -> ParseResult posMark altHelp b -> ParseResult posMark altHelp a #
(Show a, Show posMark, Show altHelp) => Show (ParseResult posMark altHelp a)
Instance details Defined in Language.Parser.Ptera.Runner.RunT Methods showsPrec :: Int -> ParseResult posMark altHelp a -> ShowS # show :: ParseResult posMark altHelp a -> String # showList :: [ParseResult posMark altHelp a] -> ShowS #

module Language.Parser.Ptera.TH.ParserLib

data GenRulesTypes Source #

Constructors

GenRulesTypes
Fields genRulesCtxTy :: Q Type genRulesTokensTy :: Q Type genRulesTokenTy :: Q Type

genGrammarToken :: Name -> Q Type -> [(String, Q Pat)] -> Q [Dec] Source #

genRules :: Name -> GenRulesTypes -> [(Name, String, Q Type)] -> Q [Dec] Source #

genParsePoints :: Name -> Name -> [String] -> Q [Dec] Source #

genRunner :: forall initials rules tokens ctx elem. GrammarToken tokens elem => Generate (TokensTag tokens) => GenParam -> GrammarM ctx rules tokens elem initials -> Q [Dec] Source #

data GenParam Source #

Constructors

GenParam
Fields startsTy :: Q Type rulesTy :: Q Type tokensTy :: Q Type tokenTy :: Q Type customCtxTy :: Q Type

defaultCustomCtxTy :: Q Type Source #