Symantic.Parser.Machine.Program

Build the Instruction Program of a Machine from the Combinators of a Grammar. Instructions are kept introspectable to enable more optimizations now possible because of a broader knowledge of the Instructions around those generated (eg. by using joinNext).

Type Program

data Program repr inp a

A Program is a tree of Instructions, where each Instruction is built by a continuation to be able to introspect, duplicate and/or change the next Instruction.

Constructors

Program

Fields

• unProgram :: forall vs es ret. SomeInstr repr inp (a ': vs) ('Succ es) ret -> SomeInstr repr inp vs ('Succ es) ret

Instances

Routinable repr => Letable Name (Program repr inp)

Defined in Symantic.Parser.Machine.Program

Methods

def :: Name -> Program repr inp a -> Program repr inp a

ref :: Bool -> Name -> Program repr inp a

(tok ~ InputToken inp, Readable tok repr, Typeable tok) => Satisfiable tok (Program repr inp)

Defined in Symantic.Parser.Machine.Program

Methods

satisfy :: [ErrorItem tok] -> TermGrammar (tok -> Bool) -> Program repr inp tok

item :: Program repr inp tok

(Ord (InputToken inp), Cursorable (Cursor inp), Branchable repr, Failable repr, Inputable repr, Joinable repr, Readable (InputToken inp) repr, Typeable (InputToken inp), Stackable repr) => Lookable (Program repr inp)

Defined in Symantic.Parser.Machine.Program

Methods

look :: Program repr inp a -> Program repr inp a

negLook :: Program repr inp a -> Program repr inp ()

eof :: Program repr inp ()

(Cursorable (Cursor inp), Branchable repr, Failable repr, Inputable repr, Joinable repr, Stackable repr) => Foldable (Program repr inp)

Defined in Symantic.Parser.Machine.Program

Methods

chainPre :: Program repr inp (a -> a) -> Program repr inp a -> Program repr inp a

chainPost :: Program repr inp a -> Program repr inp (a -> a) -> Program repr inp a

(Branchable repr, Joinable repr) => Matchable (Program repr inp)

Defined in Symantic.Parser.Machine.Program

Methods

conditional :: Eq a => Program repr inp a -> [TermGrammar (a -> Bool)] -> [Program repr inp b] -> Program repr inp b -> Program repr inp b

match :: Eq a => Program repr inp a -> [TermGrammar a] -> (TermGrammar a -> Program repr inp b) -> Program repr inp b -> Program repr inp b

(Branchable repr, Joinable repr, Stackable repr) => Selectable (Program repr inp)

Defined in Symantic.Parser.Machine.Program

Methods

branch :: Program repr inp (Either a b) -> Program repr inp (a -> c) -> Program repr inp (b -> c) -> Program repr inp c

(Cursorable (Cursor inp), Branchable repr, Failable repr, Inputable repr, Joinable repr, Stackable repr) => Alternable (Program repr inp)

Defined in Symantic.Parser.Machine.Program

Methods

(<|>) :: Program repr inp a -> Program repr inp a -> Program repr inp a

empty :: Program repr inp a

try :: Program repr inp a -> Program repr inp a

(<+>) :: (Applicable (Program repr inp), Alternable (Program repr inp)) => Program repr inp a -> Program repr inp b -> Program repr inp (Either a b)

Stackable repr => Applicable (Program repr inp)

Defined in Symantic.Parser.Machine.Program

Methods

(<$>) :: TermGrammar (a -> b) -> Program repr inp a -> Program repr inp b

(<&>) :: Program repr inp a -> TermGrammar (a -> b) -> Program repr inp b

(<$) :: TermGrammar a -> Program repr inp b -> Program repr inp a

($>) :: Program repr inp a -> TermGrammar b -> Program repr inp b

pure :: TermGrammar a -> Program repr inp a

(<*>) :: Program repr inp (a -> b) -> Program repr inp a -> Program repr inp b

liftA2 :: TermGrammar (a -> b -> c) -> Program repr inp a -> Program repr inp b -> Program repr inp c

(<*) :: Program repr inp a -> Program repr inp b -> Program repr inp a

(*>) :: Program repr inp a -> Program repr inp b -> Program repr inp b

(<**>) :: Program repr inp a -> Program repr inp (a -> b) -> Program repr inp b

optimizeMachine :: forall inp es repr a. Machine (InputToken inp) repr => Program repr inp a -> repr inp '[] ('Succ es) a

Build an interpreter of the Program of the given Machine.

failIfConsumed :: Cursorable (Cursor inp) => Branchable repr => Failable repr => Inputable repr => Stackable repr => SomeInstr repr inp vs ('Succ es) ret -> SomeInstr repr inp (Cursor inp ': vs) ('Succ es) ret

If no input has been consumed by the failing alternative then continue with the given continuation. Otherwise, propagate the Failure.

joinNext :: Joinable repr => Program repr inp v -> Program repr inp v

(joinNext m) factorize the next Instruction to be able to reuse it multiple times without duplication. It does so by introducing a defJoin and passing the corresponding refJoin as next Instruction to (m), unless factorizing is useless because the next Instruction is already a refJoin or a ret. It should be used each time the next Instruction is used multiple times.