Symantic.Parser.Machine.Optimize

Initial encoding with bottom-up optimizations of Instructions, re-optimizing downward as needed after each optimization. There is only one optimization (for push) so far, but the introspection enabled by the Instr data-type is also useful to optimize with more context in the Machine.

Data family Instr

data family Instr (instr :: ReprInstr -> Constraint) (repr :: ReprInstr) :: ReprInstr

Instructions of the Machine. This is an extensible data-type.

Instances

(Readable tok repr, tok ~ InputToken inp) => Trans (Instr (Readable tok) repr inp vs es) (repr inp vs es)

Defined in Symantic.Parser.Machine.Optimize

Methods

trans :: Instr (Readable tok) repr inp vs es a -> repr inp vs es a

Joinable repr => Trans (Instr Joinable repr inp vs es) (repr inp vs es)

Defined in Symantic.Parser.Machine.Optimize

Methods

trans :: Instr Joinable repr inp vs es a -> repr inp vs es a

Inputable repr => Trans (Instr Inputable repr inp vs es) (repr inp vs es)

Defined in Symantic.Parser.Machine.Optimize

Methods

trans :: Instr Inputable repr inp vs es a -> repr inp vs es a

Failable repr => Trans (Instr Failable repr inp vs es) (repr inp vs es)

Defined in Symantic.Parser.Machine.Optimize

Methods

trans :: Instr Failable repr inp vs es a -> repr inp vs es a

Branchable repr => Trans (Instr Branchable repr inp vs es) (repr inp vs es)

Defined in Symantic.Parser.Machine.Optimize

Methods

trans :: Instr Branchable repr inp vs es a -> repr inp vs es a

Routinable repr => Trans (Instr Routinable repr inp vs es) (repr inp vs es)

Defined in Symantic.Parser.Machine.Optimize

Methods

trans :: Instr Routinable repr inp vs es a -> repr inp vs es a

Stackable repr => Trans (Instr Stackable repr inp vs es) (repr inp vs es)

Defined in Symantic.Parser.Machine.Optimize

Methods

trans :: Instr Stackable repr inp vs es a -> repr inp vs es a

data Instr Joinable repr

Defined in Symantic.Parser.Machine.Optimize

data Instr Joinable repr where

• DefJoin :: forall v (repr :: ReprInstr) inp (vs :: [Type]) (es :: Peano) a. LetName v -> SomeInstr repr inp (v ': vs) es a -> SomeInstr repr inp vs es a -> Instr Joinable repr inp vs es a
• RefJoin :: forall v (repr :: ReprInstr) inp (vs :: [Type]) (es :: Peano) a. LetName v -> Instr Joinable repr inp (v ': vs) es a

data Instr Inputable repr

Defined in Symantic.Parser.Machine.Optimize

data Instr Inputable repr where

• LoadInput :: forall (repr :: ReprInstr) inp (vs :: [Type]) (es :: Peano) a. SomeInstr repr inp vs es a -> Instr Inputable repr inp (Cursor inp ': vs) es a
• PushInput :: forall (repr :: ReprInstr) inp (vs :: [Type]) (es :: Peano) a. SomeInstr repr inp (Cursor inp ': vs) es a -> Instr Inputable repr inp vs es a

data Instr Failable repr

Defined in Symantic.Parser.Machine.Optimize

data Instr Failable repr where

• Fail :: forall inp (repr :: ReprInstr) (vs :: [Type]) (es :: Peano) a. [ErrorItem (InputToken inp)] -> Instr Failable repr inp vs ('Succ es) a
• PopFail :: forall (repr :: ReprInstr) inp (vs :: [Type]) (es :: Peano) ret. SomeInstr repr inp vs es ret -> Instr Failable repr inp vs ('Succ es) ret
• CatchFail :: forall (repr :: ReprInstr) inp (vs :: [Type]) (es :: Peano) ret. SomeInstr repr inp vs ('Succ es) ret -> SomeInstr repr inp (Cursor inp ': vs) es ret -> Instr Failable repr inp vs es ret

data Instr Branchable repr

Defined in Symantic.Parser.Machine.Optimize

data Instr Branchable repr where

• Case :: forall (repr :: ReprInstr) inp x (vs :: [Type]) (es :: Peano) a y. SomeInstr repr inp (x ': vs) es a -> SomeInstr repr inp (y ': vs) es a -> Instr Branchable repr inp (Either x y ': vs) es a
• Choices :: forall v (repr :: ReprInstr) inp (vs :: [Type]) (es :: Peano) a. [TermInstr (v -> Bool)] -> [SomeInstr repr inp vs es a] -> SomeInstr repr inp vs es a -> Instr Branchable repr inp (v ': vs) es a

data Instr Routinable repr

Defined in Symantic.Parser.Machine.Optimize

data Instr Routinable repr where

• Subroutine :: forall v (repr :: ReprInstr) inp (vs :: [Type]) (es :: Peano) a. LetName v -> SomeInstr repr inp ('[] :: [Type]) ('Succ 'Zero) v -> SomeInstr repr inp vs ('Succ es) a -> Instr Routinable repr inp vs ('Succ es) a
• Jump :: forall a (repr :: ReprInstr) inp (es :: Peano). LetName a -> Instr Routinable repr inp ('[] :: [Type]) ('Succ es) a
• Call :: forall v (repr :: ReprInstr) inp (vs :: [Type]) (es :: Peano) a. LetName v -> SomeInstr repr inp (v ': vs) ('Succ es) a -> Instr Routinable repr inp vs ('Succ es) a
• Ret :: forall (repr :: ReprInstr) inp a (es :: Peano). Instr Routinable repr inp '[a] es a

data Instr Stackable repr

Defined in Symantic.Parser.Machine.Optimize

data Instr Stackable repr where

• Push :: forall v (repr :: ReprInstr) inp (vs :: [Type]) (es :: Peano) a. TermInstr v -> SomeInstr repr inp (v ': vs) es a -> Instr Stackable repr inp vs es a
• Pop :: forall (repr :: ReprInstr) inp (vs :: [Type]) (es :: Peano) a v. SomeInstr repr inp vs es a -> Instr Stackable repr inp (v ': vs) es a
• LiftI2 :: forall x y z (repr :: ReprInstr) inp (vs :: [Type]) (es :: Peano) a. TermInstr (x -> y -> z) -> SomeInstr repr inp (z ': vs) es a -> Instr Stackable repr inp (y ': (x ': vs)) es a
• Swap :: forall (repr :: ReprInstr) inp x y (vs :: [Type]) (es :: Peano) a. SomeInstr repr inp (x ': (y ': vs)) es a -> Instr Stackable repr inp (y ': (x ': vs)) es a

data Instr (Readable tok) repr

Defined in Symantic.Parser.Machine.Optimize

data Instr (Readable tok) repr where

• Read :: forall inp (repr :: ReprInstr) (vs :: [Type]) (es :: Peano) a tok. [ErrorItem (InputToken inp)] -> TermInstr (InputToken inp -> Bool) -> SomeInstr repr inp (InputToken inp ': vs) ('Succ es) a -> Instr (Readable tok) repr inp vs ('Succ es) a

pattern Instr :: Typeable comb => Instr comb repr inp vs es a -> SomeInstr repr inp vs es a

Convenient utility to pattern-match a SomeInstr.

Type SomeInstr

data SomeInstr repr inp vs es a

Some Instruction existantialized over the actual instruction symantic class. Useful to handle a list of Instructions without requiring impredicative quantification. Must be used by pattern-matching on the SomeInstr data-constructor, to bring the constraints in scope.

As in SomeComb, a first pass of optimizations is directly applied in it to avoid introducing an extra newtype, this also give a more comprehensible code.

Constructors

(Trans (Instr instr repr inp vs es) (repr inp vs es), Typeable instr) => SomeInstr (Instr instr repr inp vs es a)

Instances

(Readable tok repr, Typeable tok) => Readable tok (SomeInstr repr)

Defined in Symantic.Parser.Machine.Optimize

Methods

read :: forall inp (vs :: [Type]) (es :: Peano) a. tok ~ InputToken inp => [ErrorItem tok] -> TermInstr (tok -> Bool) -> SomeInstr repr inp (tok ': vs) ('Succ es) a -> SomeInstr repr inp vs ('Succ es) a

Joinable repr => Joinable (SomeInstr repr)

Defined in Symantic.Parser.Machine.Optimize

Methods

defJoin :: forall v inp (vs :: [Type]) (es :: Peano) a. LetName v -> SomeInstr repr inp (v ': vs) es a -> SomeInstr repr inp vs es a -> SomeInstr repr inp vs es a

refJoin :: forall v inp (vs :: [Type]) (es :: Peano) a. LetName v -> SomeInstr repr inp (v ': vs) es a

Inputable repr => Inputable (SomeInstr repr)

Defined in Symantic.Parser.Machine.Optimize

Methods

loadInput :: forall inp (vs :: [Type]) (es :: Peano) a. SomeInstr repr inp vs es a -> SomeInstr repr inp (Cursor inp ': vs) es a

pushInput :: forall inp (vs :: [Type]) (es :: Peano) a. SomeInstr repr inp (Cursor inp ': vs) es a -> SomeInstr repr inp vs es a

Failable repr => Failable (SomeInstr repr)

Defined in Symantic.Parser.Machine.Optimize

Methods

fail :: forall inp (vs :: [Type]) (es :: Peano) a. [ErrorItem (InputToken inp)] -> SomeInstr repr inp vs ('Succ es) a

popFail :: forall inp (vs :: [Type]) (es :: Peano) a. SomeInstr repr inp vs es a -> SomeInstr repr inp vs ('Succ es) a

catchFail :: forall inp (vs :: [Type]) (es :: Peano) a. SomeInstr repr inp vs ('Succ es) a -> SomeInstr repr inp (Cursor inp ': vs) es a -> SomeInstr repr inp vs es a

Branchable repr => Branchable (SomeInstr repr)

Defined in Symantic.Parser.Machine.Optimize

Methods

caseI :: forall inp x (vs :: [Type]) (es :: Peano) r y. SomeInstr repr inp (x ': vs) es r -> SomeInstr repr inp (y ': vs) es r -> SomeInstr repr inp (Either x y ': vs) es r

choices :: forall v inp (vs :: [Type]) (es :: Peano) a. [TermInstr (v -> Bool)] -> [SomeInstr repr inp vs es a] -> SomeInstr repr inp vs es a -> SomeInstr repr inp (v ': vs) es a

ifI :: forall inp (vs :: [Type]) (es :: Peano) a. SomeInstr repr inp vs es a -> SomeInstr repr inp vs es a -> SomeInstr repr inp (Bool ': vs) es a

Routinable repr => Routinable (SomeInstr repr)

Defined in Symantic.Parser.Machine.Optimize

Methods

subroutine :: forall v inp (vs :: [Type]) (es :: Peano) a. LetName v -> SomeInstr repr inp '[] ('Succ 'Zero) v -> SomeInstr repr inp vs ('Succ es) a -> SomeInstr repr inp vs ('Succ es) a

call :: forall v inp (vs :: [Type]) (es :: Peano) a. LetName v -> SomeInstr repr inp (v ': vs) ('Succ es) a -> SomeInstr repr inp vs ('Succ es) a

ret :: forall inp a (es :: Peano). SomeInstr repr inp '[a] es a

jump :: forall a inp (es :: Peano). LetName a -> SomeInstr repr inp '[] ('Succ es) a

Stackable repr => Stackable (SomeInstr repr)

Defined in Symantic.Parser.Machine.Optimize

Methods

push :: forall v inp (vs :: [Type]) (es :: Peano) a. TermInstr v -> SomeInstr repr inp (v ': vs) es a -> SomeInstr repr inp vs es a

pop :: forall inp (vs :: [Type]) (es :: Peano) a v. SomeInstr repr inp vs es a -> SomeInstr repr inp (v ': vs) es a

liftI2 :: forall x y z inp (vs :: [Type]) (es :: Peano) a. TermInstr (x -> y -> z) -> SomeInstr repr inp (z ': vs) es a -> SomeInstr repr inp (y ': (x ': vs)) es a

swap :: forall inp x y (vs :: [Type]) (es :: Peano) a. SomeInstr repr inp (x ': (y ': vs)) es a -> SomeInstr repr inp (y ': (x ': vs)) es a

mapI :: forall x y inp (vs :: [Type]) (es :: Peano) a. TermInstr (x -> y) -> SomeInstr repr inp (y ': vs) es a -> SomeInstr repr inp (x ': vs) es a

appI :: forall inp y (vs :: [Type]) (es :: Peano) a x. SomeInstr repr inp (y ': vs) es a -> SomeInstr repr inp (x ': ((x -> y) ': vs)) es a

Trans (SomeInstr repr inp vs es) (repr inp vs es)

Defined in Symantic.Parser.Machine.Optimize

Methods

trans :: SomeInstr repr inp vs es a -> repr inp vs es a

unSomeInstr :: forall instr repr inp vs es a. Typeable instr => SomeInstr repr inp vs es a -> Maybe (Instr instr repr inp vs es a)

(unSomeInstr i :: Maybe (Instr comb repr inp vs es a)) extract the data-constructor from the given SomeInstr iif. it belongs to the (Instr comb repr a) data-instance.