Symantic.Parser.Grammar

Documentation

type Grammar tok repr = (Applicable repr, Alternable repr, Satisfiable tok repr, Letable Name repr, Selectable repr, Matchable repr, Foldable repr, Lookable repr)

grammar :: Grammar tok repr => ObserveSharing Name (OptimizeGrammar repr) a -> repr a

A usual pipeline to interpret Combinators: observeSharing then optimizeGrammar then a polymorphic (repr).

showGrammar :: ObserveSharing Name (OptimizeGrammar (ViewGrammar showName)) a -> String

An usual pipeline to show Combinators: observeSharing then optimizeGrammar then viewGrammar then show.

module Symantic.Parser.Grammar.Combinators

module Symantic.Parser.Grammar.Fixity

module Symantic.Parser.Grammar.Optimize

module Symantic.Parser.Grammar.ObserveSharing

module Symantic.Parser.Grammar.Write

module Symantic.Parser.Grammar.View

class Letable letName repr where

This class is not for end-users like usual symantic operators, here def and ref are introduced by observeSharing.

Minimal complete definition

Nothing

Methods

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

(def letName x) let-binds (letName) to be equal to (x).

ref :: Bool -> letName -> repr a

(ref isRec letName) is a reference to (letName). (isRec) is True iif. this reference is recursive, ie. is reachable within its definition.

def :: Liftable1 repr => Letable letName (Output repr) => letName -> repr a -> repr a

(def letName x) let-binds (letName) to be equal to (x).

ref :: Liftable repr => Letable letName (Output repr) => Bool -> letName -> repr a

(ref isRec letName) is a reference to (letName). (isRec) is True iif. this reference is recursive, ie. is reachable within its definition.

Instances

ShowLetName sN letName => Letable letName (WriteGrammar sN)

Defined in Symantic.Parser.Grammar.Write

Methods

def :: letName -> WriteGrammar sN a -> WriteGrammar sN a

ref :: Bool -> letName -> WriteGrammar sN a

ShowLetName sN letName => Letable letName (ViewGrammar sN)

Defined in Symantic.Parser.Grammar.View

Methods

def :: letName -> ViewGrammar sN a -> ViewGrammar sN a

ref :: Bool -> letName -> ViewGrammar sN a

(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

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

(Letable letName repr, Eq letName, Hashable letName) => Letable letName (CleanDefs letName repr)

Defined in Symantic.Univariant.Letable

Methods

def :: letName -> CleanDefs letName repr a -> CleanDefs letName repr a

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

(Letable letName repr, MakeLetName letName, Eq letName, Hashable letName) => Letable letName (ObserveSharing letName repr)

Defined in Symantic.Univariant.Letable

Methods

def :: letName -> ObserveSharing letName repr a -> ObserveSharing letName repr a

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

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

Defined in Symantic.Parser.Grammar.Optimize

Methods

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

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