FormalLanguage.CFG.Grammar.Types

The data types that define a CFG.

Documentation

newtype IndexName

Constructors

IndexName

Fields

• _getIndexName :: String

Instances

Eq IndexName

Methods

(==) :: IndexName -> IndexName -> Bool

(/=) :: IndexName -> IndexName -> Bool

Data IndexName

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> IndexName -> c IndexName

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c IndexName

toConstr :: IndexName -> Constr

dataTypeOf :: IndexName -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c IndexName)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c IndexName)

gmapT :: (forall b. Data b => b -> b) -> IndexName -> IndexName

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> IndexName -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> IndexName -> r

gmapQ :: (forall d. Data d => d -> u) -> IndexName -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> IndexName -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> IndexName -> m IndexName

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> IndexName -> m IndexName

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> IndexName -> m IndexName

Ord IndexName

Methods

compare :: IndexName -> IndexName -> Ordering

(<) :: IndexName -> IndexName -> Bool

(<=) :: IndexName -> IndexName -> Bool

(>) :: IndexName -> IndexName -> Bool

(>=) :: IndexName -> IndexName -> Bool

max :: IndexName -> IndexName -> IndexName

min :: IndexName -> IndexName -> IndexName

Show IndexName

Methods

showsPrec :: Int -> IndexName -> ShowS

show :: IndexName -> String

showList :: [IndexName] -> ShowS

IsString IndexName

Methods

fromString :: String -> IndexName

getIndexName :: Iso' IndexName String

data IOP

Constructors

IPlus

IMinus

IEq

INone

ISymbol

Instances

Eq IOP

Methods

(==) :: IOP -> IOP -> Bool

(/=) :: IOP -> IOP -> Bool

Data IOP

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> IOP -> c IOP

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c IOP

toConstr :: IOP -> Constr

dataTypeOf :: IOP -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c IOP)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c IOP)

gmapT :: (forall b. Data b => b -> b) -> IOP -> IOP

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> IOP -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> IOP -> r

gmapQ :: (forall d. Data d => d -> u) -> IOP -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> IOP -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> IOP -> m IOP

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> IOP -> m IOP

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> IOP -> m IOP

Ord IOP

Methods

compare :: IOP -> IOP -> Ordering

(<) :: IOP -> IOP -> Bool

(<=) :: IOP -> IOP -> Bool

(>) :: IOP -> IOP -> Bool

(>=) :: IOP -> IOP -> Bool

max :: IOP -> IOP -> IOP

min :: IOP -> IOP -> IOP

Show IOP

Methods

showsPrec :: Int -> IOP -> ShowS

show :: IOP -> String

showList :: [IOP] -> ShowS

data Index

Encode the index of the syntactic or terminal variable.

In case of grammar-based indexing, keep indexRange empty. The indexStep keeps track of any +k / -k given in the production rules.

We allow indexing terminals now, too. When glueing together terminals, one might want to be able to differentiate between terminals.

Constructors

Index

Fields

• _indexName :: IndexName
• _indexHere :: Integer
• _indexOp :: IOP
• _indexRange :: [Integer]
• _indexStep :: Integer

Instances

Eq Index

Methods

(==) :: Index -> Index -> Bool

(/=) :: Index -> Index -> Bool

Data Index

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Index -> c Index

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Index

toConstr :: Index -> Constr

dataTypeOf :: Index -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c Index)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Index)

gmapT :: (forall b. Data b => b -> b) -> Index -> Index

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Index -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Index -> r

gmapQ :: (forall d. Data d => d -> u) -> Index -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Index -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Index -> m Index

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Index -> m Index

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Index -> m Index

Ord Index

Methods

compare :: Index -> Index -> Ordering

(<) :: Index -> Index -> Bool

(<=) :: Index -> Index -> Bool

(>) :: Index -> Index -> Bool

(>=) :: Index -> Index -> Bool

max :: Index -> Index -> Index

min :: Index -> Index -> Index

Show Index

Methods

showsPrec :: Int -> Index -> ShowS

show :: Index -> String

showList :: [Index] -> ShowS

indexStep :: Lens' Index Integer

indexRange :: Lens' Index [Integer]

indexOp :: Lens' Index IOP

indexName :: Lens' Index IndexName

indexHere :: Lens' Index Integer

newtype SymbolName

Newtype wrapper for symbol names.

Constructors

SymbolName

Fields

• _getSteName :: String

Instances

Eq SymbolName

Methods

(==) :: SymbolName -> SymbolName -> Bool

(/=) :: SymbolName -> SymbolName -> Bool

Data SymbolName

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> SymbolName -> c SymbolName

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c SymbolName

toConstr :: SymbolName -> Constr

dataTypeOf :: SymbolName -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c SymbolName)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c SymbolName)

gmapT :: (forall b. Data b => b -> b) -> SymbolName -> SymbolName

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> SymbolName -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> SymbolName -> r

gmapQ :: (forall d. Data d => d -> u) -> SymbolName -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> SymbolName -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> SymbolName -> m SymbolName

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> SymbolName -> m SymbolName

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> SymbolName -> m SymbolName

Ord SymbolName

Methods

compare :: SymbolName -> SymbolName -> Ordering

(<) :: SymbolName -> SymbolName -> Bool

(<=) :: SymbolName -> SymbolName -> Bool

(>) :: SymbolName -> SymbolName -> Bool

(>=) :: SymbolName -> SymbolName -> Bool

max :: SymbolName -> SymbolName -> SymbolName

min :: SymbolName -> SymbolName -> SymbolName

Show SymbolName

Methods

showsPrec :: Int -> SymbolName -> ShowS

show :: SymbolName -> String

showList :: [SymbolName] -> ShowS

IsString SymbolName

Methods

fromString :: String -> SymbolName

getSteName :: Iso' SymbolName String

newtype Tape

The tape, a terminal operates on. Terminals on different tapes could still have the same SymbolName but different type and input!

Constructors

Tape

Fields

• _getTape :: Int

Instances

Enum Tape

Methods

succ :: Tape -> Tape

pred :: Tape -> Tape

toEnum :: Int -> Tape

fromEnum :: Tape -> Int

enumFrom :: Tape -> [Tape]

enumFromThen :: Tape -> Tape -> [Tape]

enumFromTo :: Tape -> Tape -> [Tape]

enumFromThenTo :: Tape -> Tape -> Tape -> [Tape]

Eq Tape

Methods

(==) :: Tape -> Tape -> Bool

(/=) :: Tape -> Tape -> Bool

Data Tape

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Tape -> c Tape

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Tape

toConstr :: Tape -> Constr

dataTypeOf :: Tape -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c Tape)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Tape)

gmapT :: (forall b. Data b => b -> b) -> Tape -> Tape

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Tape -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Tape -> r

gmapQ :: (forall d. Data d => d -> u) -> Tape -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Tape -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Tape -> m Tape

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Tape -> m Tape

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Tape -> m Tape

Num Tape

Methods

(+) :: Tape -> Tape -> Tape

(-) :: Tape -> Tape -> Tape

(*) :: Tape -> Tape -> Tape

negate :: Tape -> Tape

abs :: Tape -> Tape

signum :: Tape -> Tape

fromInteger :: Integer -> Tape

Ord Tape

Methods

compare :: Tape -> Tape -> Ordering

(<) :: Tape -> Tape -> Bool

(<=) :: Tape -> Tape -> Bool

(>) :: Tape -> Tape -> Bool

(>=) :: Tape -> Tape -> Bool

max :: Tape -> Tape -> Tape

min :: Tape -> Tape -> Tape

Show Tape

Methods

showsPrec :: Int -> Tape -> ShowS

show :: Tape -> String

showList :: [Tape] -> ShowS

getTape :: Iso' Tape Int

data SynTermEps

Symbols, potentially with an index or more than one.

Constructors

SynVar

Syntactic variables.

Fields

• _name :: SymbolName
• _index :: [Index]
• _splitN :: Integer
• _splitK :: Integer

SynTerm

Fields

• _name :: SymbolName
• _index :: [Index]

Term

Regular old terminal symbol -- reads stuff from the input.

Fields

• _name :: SymbolName
• _index :: [Index]

Deletion

This sym denotes the case, where we have an Deletion terminal, i.e. something is matched to nothing. This is actually just a regular terminal symbol, we just treat it differently.

Epsilon

Finally, a real epsilon. Again, these are somewhat regular terminal symbols, but it is important to be able to recognize these, when trying to create outside variants of our algorithms.

Instances

Eq SynTermEps

Methods

(==) :: SynTermEps -> SynTermEps -> Bool

(/=) :: SynTermEps -> SynTermEps -> Bool

Data SynTermEps

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> SynTermEps -> c SynTermEps

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c SynTermEps

toConstr :: SynTermEps -> Constr

dataTypeOf :: SynTermEps -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c SynTermEps)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c SynTermEps)

gmapT :: (forall b. Data b => b -> b) -> SynTermEps -> SynTermEps

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> SynTermEps -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> SynTermEps -> r

gmapQ :: (forall d. Data d => d -> u) -> SynTermEps -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> SynTermEps -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> SynTermEps -> m SynTermEps

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> SynTermEps -> m SynTermEps

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> SynTermEps -> m SynTermEps

Ord SynTermEps

Methods

compare :: SynTermEps -> SynTermEps -> Ordering

(<) :: SynTermEps -> SynTermEps -> Bool

(<=) :: SynTermEps -> SynTermEps -> Bool

(>) :: SynTermEps -> SynTermEps -> Bool

(>=) :: SynTermEps -> SynTermEps -> Bool

max :: SynTermEps -> SynTermEps -> SynTermEps

min :: SynTermEps -> SynTermEps -> SynTermEps

Show SynTermEps

Methods

showsPrec :: Int -> SynTermEps -> ShowS

show :: SynTermEps -> String

showList :: [SynTermEps] -> ShowS

splitN :: Traversal' SynTermEps Integer

splitK :: Traversal' SynTermEps Integer

name :: Traversal' SynTermEps SymbolName

index :: Traversal' SynTermEps [Index]

_Epsilon :: Prism' SynTermEps ()

_Deletion :: Prism' SynTermEps ()

_Term :: Prism' SynTermEps (SymbolName, [Index])

_SynTerm :: Prism' SynTermEps (SymbolName, [Index])

_SynVar :: Prism' SynTermEps (SymbolName, [Index], Integer, Integer)

newtype Symbol

The length of the list encodes the dimension of the symbol. Forms a monoid over dimensional concatenation.

Constructors

Symbol

Fields

• _getSymbolList :: [SynTermEps]

Instances

Eq Symbol

Methods

(==) :: Symbol -> Symbol -> Bool

(/=) :: Symbol -> Symbol -> Bool

Data Symbol

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Symbol -> c Symbol

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Symbol

toConstr :: Symbol -> Constr

dataTypeOf :: Symbol -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c Symbol)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Symbol)

gmapT :: (forall b. Data b => b -> b) -> Symbol -> Symbol

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Symbol -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Symbol -> r

gmapQ :: (forall d. Data d => d -> u) -> Symbol -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Symbol -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Symbol -> m Symbol

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Symbol -> m Symbol

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Symbol -> m Symbol

Ord Symbol

Methods

compare :: Symbol -> Symbol -> Ordering

(<) :: Symbol -> Symbol -> Bool

(<=) :: Symbol -> Symbol -> Bool

(>) :: Symbol -> Symbol -> Bool

(>=) :: Symbol -> Symbol -> Bool

max :: Symbol -> Symbol -> Symbol

min :: Symbol -> Symbol -> Symbol

Show Symbol

Methods

showsPrec :: Int -> Symbol -> ShowS

show :: Symbol -> String

showList :: [Symbol] -> ShowS

Semigroup Symbol

Methods

(<>) :: Symbol -> Symbol -> Symbol

sconcat :: NonEmpty Symbol -> Symbol

stimes :: Integral b => b -> Symbol -> Symbol

Monoid Symbol

Methods

mempty :: Symbol

mappend :: Symbol -> Symbol -> Symbol

mconcat :: [Symbol] -> Symbol

getSymbolList :: Iso' Symbol [SynTermEps]

newtype AttributeFunction

The name of an attribute function

Constructors

Attr

Fields

• _getAttr :: String

Instances

Eq AttributeFunction

Methods

(==) :: AttributeFunction -> AttributeFunction -> Bool

(/=) :: AttributeFunction -> AttributeFunction -> Bool

Data AttributeFunction

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> AttributeFunction -> c AttributeFunction

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c AttributeFunction

toConstr :: AttributeFunction -> Constr

dataTypeOf :: AttributeFunction -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c AttributeFunction)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c AttributeFunction)

gmapT :: (forall b. Data b => b -> b) -> AttributeFunction -> AttributeFunction

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> AttributeFunction -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> AttributeFunction -> r

gmapQ :: (forall d. Data d => d -> u) -> AttributeFunction -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> AttributeFunction -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> AttributeFunction -> m AttributeFunction

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> AttributeFunction -> m AttributeFunction

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> AttributeFunction -> m AttributeFunction

Ord AttributeFunction

Methods

compare :: AttributeFunction -> AttributeFunction -> Ordering

(<) :: AttributeFunction -> AttributeFunction -> Bool

(<=) :: AttributeFunction -> AttributeFunction -> Bool

(>) :: AttributeFunction -> AttributeFunction -> Bool

(>=) :: AttributeFunction -> AttributeFunction -> Bool

max :: AttributeFunction -> AttributeFunction -> AttributeFunction

min :: AttributeFunction -> AttributeFunction -> AttributeFunction

Show AttributeFunction

Methods

showsPrec :: Int -> AttributeFunction -> ShowS

show :: AttributeFunction -> String

showList :: [AttributeFunction] -> ShowS

IsString AttributeFunction

Methods

fromString :: String -> AttributeFunction

getAttr :: Iso' AttributeFunction String

data Rule

Production rules for at-most CFGs.

Constructors

Rule

Fields

• _lhs :: Symbol

  the left-hand side of the rule

• _attr :: [AttributeFunction]

  the attribute for this rule

• _rhs :: [Symbol]

  the right-hand side with a collection of terminals and syntactic variables

Instances

Eq Rule

Methods

(==) :: Rule -> Rule -> Bool

(/=) :: Rule -> Rule -> Bool

Data Rule

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Rule -> c Rule

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Rule

toConstr :: Rule -> Constr

dataTypeOf :: Rule -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c Rule)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Rule)

gmapT :: (forall b. Data b => b -> b) -> Rule -> Rule

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Rule -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Rule -> r

gmapQ :: (forall d. Data d => d -> u) -> Rule -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Rule -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Rule -> m Rule

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Rule -> m Rule

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Rule -> m Rule

Ord Rule

Methods

compare :: Rule -> Rule -> Ordering

(<) :: Rule -> Rule -> Bool

(<=) :: Rule -> Rule -> Bool

(>) :: Rule -> Rule -> Bool

(>=) :: Rule -> Rule -> Bool

max :: Rule -> Rule -> Rule

min :: Rule -> Rule -> Rule

Show Rule

Methods

showsPrec :: Int -> Rule -> ShowS

show :: Rule -> String

showList :: [Rule] -> ShowS

rhs :: Lens' Rule [Symbol]

lhs :: Lens' Rule Symbol

attr :: Lens' Rule [AttributeFunction]

data DerivedGrammar

Constructors

Inside

Outside String

Instances

Eq DerivedGrammar

Methods

(==) :: DerivedGrammar -> DerivedGrammar -> Bool

(/=) :: DerivedGrammar -> DerivedGrammar -> Bool

Data DerivedGrammar

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> DerivedGrammar -> c DerivedGrammar

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c DerivedGrammar

toConstr :: DerivedGrammar -> Constr

dataTypeOf :: DerivedGrammar -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c DerivedGrammar)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c DerivedGrammar)

gmapT :: (forall b. Data b => b -> b) -> DerivedGrammar -> DerivedGrammar

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DerivedGrammar -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DerivedGrammar -> r

gmapQ :: (forall d. Data d => d -> u) -> DerivedGrammar -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> DerivedGrammar -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> DerivedGrammar -> m DerivedGrammar

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> DerivedGrammar -> m DerivedGrammar

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> DerivedGrammar -> m DerivedGrammar

Show DerivedGrammar

Methods

showsPrec :: Int -> DerivedGrammar -> ShowS

show :: DerivedGrammar -> String

showList :: [DerivedGrammar] -> ShowS

Default DerivedGrammar

Methods

def :: DerivedGrammar

isOutside :: DerivedGrammar -> Bool

data Grammar

Complete descrition of a grammar. In principle it would be enough to hold _rules and the _start symbol name. We also store dimensionless names for syntactiv variables, and terminals. This makes certain checks easier or possible.

We store all single-tape symbol names dimensionless. This means that, for terminals, symbols with the same name have the same tape. This is slightly inconvenient for special applications (say Protein-DNA alignment) but one can easily rename terminals.

TODO better way to handle indexed symbols?

Constructors

Grammar

Fields

• _synvars :: Map SymbolName SynTermEps

  regular syntactic variables, without dimension

• _synterms :: Map SymbolName SynTermEps

  Terminal synvars are somewhat weird. They are used in Outside grammars, and hold previously calculated inside values.

• _termvars :: Map SymbolName SynTermEps

  regular terminal symbols

• _outside :: DerivedGrammar

  Is this an automatically derived outside grammar

• _rules :: Set Rule

  set of production rules

• _start :: Symbol

  start symbol

• _params :: Map IndexName Index

  any global variables

• _indices :: Map IndexName Index

  active indices

• _grammarName :: String

  grammar name

• _write :: Bool

  some grammar file requested this grammar to be expanded into code

  TODO remove, we have an emission queue

Instances

Data Grammar

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Grammar -> c Grammar

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Grammar

toConstr :: Grammar -> Constr

dataTypeOf :: Grammar -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c Grammar)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Grammar)

gmapT :: (forall b. Data b => b -> b) -> Grammar -> Grammar

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Grammar -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Grammar -> r

gmapQ :: (forall d. Data d => d -> u) -> Grammar -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Grammar -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Grammar -> m Grammar

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Grammar -> m Grammar

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Grammar -> m Grammar

Show Grammar

Methods

showsPrec :: Int -> Grammar -> ShowS

show :: Grammar -> String

showList :: [Grammar] -> ShowS

Default Grammar

Methods

def :: Grammar

write :: Lens' Grammar Bool

termvars :: Lens' Grammar (Map SymbolName SynTermEps)

synvars :: Lens' Grammar (Map SymbolName SynTermEps)

synterms :: Lens' Grammar (Map SymbolName SynTermEps)

start :: Lens' Grammar Symbol

rules :: Lens' Grammar (Set Rule)

params :: Lens' Grammar (Map IndexName Index)

outside :: Lens' Grammar DerivedGrammar

indices :: Lens' Grammar (Map IndexName Index)

grammarName :: Lens' Grammar String