Symantic.Parser.Grammar.Optimize

Bottom-up optimization of Combinators, reexamining downward as needed after each optimization.

Type OptimizeGrammar

type OptimizeGrammar = SomeComb

optimizeGrammar :: Trans (SomeComb repr) repr => SomeComb repr a -> repr a

Data family Comb

data family Comb (comb :: ReprComb -> Constraint) (repr :: ReprComb) :: ReprComb infixl 4 :*>:, :<*:, :<*>:infixl 3 :<|>:

Combinators of the Grammar. This is an extensible data-type.

Instances

Letable letName repr => Trans (Comb (Letable letName) repr) repr

Defined in Symantic.Parser.Grammar.Optimize

Methods

trans :: Comb (Letable letName) repr a -> repr a

Lookable repr => Trans (Comb Lookable repr) repr

Defined in Symantic.Parser.Grammar.Optimize

Methods

trans :: Comb Lookable repr a -> repr a

Satisfiable tok repr => Trans (Comb (Satisfiable tok) repr) repr

Defined in Symantic.Parser.Grammar.Optimize

Methods

trans :: Comb (Satisfiable tok) repr a -> repr a

Foldable repr => Trans (Comb Foldable repr) repr

Defined in Symantic.Parser.Grammar.Optimize

Methods

trans :: Comb Foldable repr a -> repr a

Matchable repr => Trans (Comb Matchable repr) repr

Defined in Symantic.Parser.Grammar.Optimize

Methods

trans :: Comb Matchable repr a -> repr a

Selectable repr => Trans (Comb Selectable repr) repr

Defined in Symantic.Parser.Grammar.Optimize

Methods

trans :: Comb Selectable repr a -> repr a

Alternable repr => Trans (Comb Alternable repr) repr

Defined in Symantic.Parser.Grammar.Optimize

Methods

trans :: Comb Alternable repr a -> repr a

Applicable repr => Trans (Comb Applicable repr) repr

Defined in Symantic.Parser.Grammar.Optimize

Methods

trans :: Comb Applicable repr a -> repr a

data Comb Lookable repr

Defined in Symantic.Parser.Grammar.Optimize

data Comb Lookable repr where

• Look :: forall (repr :: ReprComb) a. SomeComb repr a -> Comb Lookable repr a
• NegLook :: forall (repr :: ReprComb) a. SomeComb repr a -> Comb Lookable repr ()
• Eof :: forall (repr :: ReprComb). Comb Lookable repr ()

data Comb Foldable repr

Defined in Symantic.Parser.Grammar.Optimize

data Comb Foldable repr where

• ChainPreC :: forall (repr :: ReprComb) a. SomeComb repr (a -> a) -> SomeComb repr a -> Comb Foldable repr a
• ChainPostC :: forall (repr :: ReprComb) a. SomeComb repr a -> SomeComb repr (a -> a) -> Comb Foldable repr a

data Comb Matchable repr

Defined in Symantic.Parser.Grammar.Optimize

data Comb Matchable repr where

• Conditional :: forall a (repr :: ReprComb) b. Eq a => SomeComb repr a -> [TermGrammar (a -> Bool)] -> [SomeComb repr b] -> SomeComb repr b -> Comb Matchable repr b

data Comb Selectable repr

Defined in Symantic.Parser.Grammar.Optimize

data Comb Selectable repr where

• Branch :: forall (repr :: ReprComb) a b c. SomeComb repr (Either a b) -> SomeComb repr (a -> c) -> SomeComb repr (b -> c) -> Comb Selectable repr c

data Comb Alternable repr

Defined in Symantic.Parser.Grammar.Optimize

data Comb Alternable repr where

• Empty :: forall (repr :: ReprComb) a. Comb Alternable repr a
• (:<|>:) :: forall (repr :: ReprComb) a. SomeComb repr a -> SomeComb repr a -> Comb Alternable repr a
• Try :: forall (repr :: ReprComb) a. SomeComb repr a -> Comb Alternable repr a

data Comb Applicable repr

Defined in Symantic.Parser.Grammar.Optimize

data Comb Applicable repr where

• Pure :: forall a (repr :: ReprComb). TermGrammar a -> Comb Applicable repr a
• (:<*>:) :: forall (repr :: ReprComb) a b. SomeComb repr (a -> b) -> SomeComb repr a -> Comb Applicable repr b
• (:<*:) :: forall (repr :: ReprComb) a b. SomeComb repr a -> SomeComb repr b -> Comb Applicable repr a
• (:*>:) :: forall (repr :: ReprComb) a b. SomeComb repr a -> SomeComb repr b -> Comb Applicable repr b

data Comb (Letable letName) repr

Defined in Symantic.Parser.Grammar.Optimize

data Comb (Letable letName) repr where

• Def :: forall letName (repr :: ReprComb) a. letName -> SomeComb repr a -> Comb (Letable letName) repr a
• Ref :: forall letName (repr :: ReprComb) a. Bool -> letName -> Comb (Letable letName) repr a

data Comb (Satisfiable tok) repr

Defined in Symantic.Parser.Grammar.Optimize

data Comb (Satisfiable tok) repr where

• Satisfy :: forall tok (repr :: Type -> Type). Satisfiable tok repr => [ErrorItem tok] -> TermGrammar (tok -> Bool) -> Comb (Satisfiable tok) repr tok
• Item :: forall tok (repr :: Type -> Type). Satisfiable tok repr => Comb (Satisfiable tok) repr tok

pattern Comb :: Typeable comb => Comb comb repr a -> SomeComb repr a

Convenient utility to pattern-match a SomeComb.

Type ReprComb

type ReprComb = Type -> Type

Type SomeComb

data SomeComb repr a

Some Combinator existentialized over the actual combinator symantic class. Useful to handle a list of Combinators without requiring impredicative quantification. Must be used by pattern-matching on the SomeComb data-constructor, to bring the constraints in scope.

The optimizations are directly applied within it, to avoid introducing an extra newtype, this also give a more comprehensible code.

Constructors

(Trans (Comb comb repr) repr, Typeable comb) => SomeComb (Comb comb repr a)

Instances

(Letable letName repr, Typeable letName) => Letable letName (SomeComb repr)

Defined in Symantic.Parser.Grammar.Optimize

Methods

def :: letName -> SomeComb repr a -> SomeComb repr a

ref :: Bool -> letName -> SomeComb repr a

(Satisfiable tok repr, Typeable tok) => Satisfiable tok (SomeComb repr)

Defined in Symantic.Parser.Grammar.Optimize

Methods

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

item :: SomeComb repr tok

(Alternable repr, Applicable repr, Lookable repr, Selectable repr, Matchable repr) => Lookable (SomeComb repr)

Defined in Symantic.Parser.Grammar.Optimize

Methods

look :: SomeComb repr a -> SomeComb repr a

negLook :: SomeComb repr a -> SomeComb repr ()

eof :: SomeComb repr ()

Foldable repr => Foldable (SomeComb repr)

Defined in Symantic.Parser.Grammar.Optimize

Methods

chainPre :: SomeComb repr (a -> a) -> SomeComb repr a -> SomeComb repr a

chainPost :: SomeComb repr a -> SomeComb repr (a -> a) -> SomeComb repr a

(Applicable repr, Alternable repr, Lookable repr, Selectable repr, Matchable repr) => Matchable (SomeComb repr)

Defined in Symantic.Parser.Grammar.Optimize

Methods

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

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

(Applicable repr, Alternable repr, Lookable repr, Selectable repr, Matchable repr) => Selectable (SomeComb repr)

Defined in Symantic.Parser.Grammar.Optimize

Methods

branch :: SomeComb repr (Either a b) -> SomeComb repr (a -> c) -> SomeComb repr (b -> c) -> SomeComb repr c

(Alternable repr, Applicable repr, Lookable repr, Matchable repr, Selectable repr) => Alternable (SomeComb repr)

Defined in Symantic.Parser.Grammar.Optimize

Methods

(<|>) :: SomeComb repr a -> SomeComb repr a -> SomeComb repr a

empty :: SomeComb repr a

try :: SomeComb repr a -> SomeComb repr a

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

(Applicable repr, Alternable repr, Lookable repr, Matchable repr, Selectable repr) => Applicable (SomeComb repr)

Defined in Symantic.Parser.Grammar.Optimize

Methods

(<$>) :: TermGrammar (a -> b) -> SomeComb repr a -> SomeComb repr b

(<&>) :: SomeComb repr a -> TermGrammar (a -> b) -> SomeComb repr b

(<$) :: TermGrammar a -> SomeComb repr b -> SomeComb repr a

($>) :: SomeComb repr a -> TermGrammar b -> SomeComb repr b

pure :: TermGrammar a -> SomeComb repr a

(<*>) :: SomeComb repr (a -> b) -> SomeComb repr a -> SomeComb repr b

liftA2 :: TermGrammar (a -> b -> c) -> SomeComb repr a -> SomeComb repr b -> SomeComb repr c

(<*) :: SomeComb repr a -> SomeComb repr b -> SomeComb repr a

(*>) :: SomeComb repr a -> SomeComb repr b -> SomeComb repr b

(<**>) :: SomeComb repr a -> SomeComb repr (a -> b) -> SomeComb repr b

Trans (SomeComb repr) repr

Defined in Symantic.Parser.Grammar.Optimize

Methods

trans :: SomeComb repr a -> repr a

unSomeComb :: forall comb repr a. Typeable comb => SomeComb repr a -> Maybe (Comb comb repr a)

(unSomeComb c :: Maybe (Comb comb repr a)) extract the data-constructor from the given SomeComb iif. it belongs to the (Comb comb repr a) data-instance.

pattern (:<$>:) :: TermGrammar (a -> b) -> SomeComb repr a -> Comb Applicable repr b

pattern (:$>:) :: SomeComb repr a -> TermGrammar b -> Comb Applicable repr b

Orphan instances

MakeLetName Name

Methods

makeLetName :: SharingName -> IO Name