FormalLanguage.GrammarProduct.Op.Linear

Direct product of two grammars.

Currently implemented for linear grammars. Once we move to context-free grammars with more than one non-terminal on the RHS, things become interesting.

Documentation

directProduct :: Semigroup (Linear a) => a -> a -> a

newtype Linear a

Constructors

Linear

Fields

• runLinear :: a

Instances

Semigroup (Linear Grammar)

Defined in FormalLanguage.GrammarProduct.Op.Linear

Methods

(<>) :: Linear Grammar -> Linear Grammar -> Linear Grammar

sconcat :: NonEmpty (Linear Grammar) -> Linear Grammar

stimes :: Integral b => b -> Linear Grammar -> Linear Grammar

Monoid (Linear Grammar)

Defined in FormalLanguage.GrammarProduct.Op.Linear

Methods

mempty :: Linear Grammar

mappend :: Linear Grammar -> Linear Grammar -> Linear Grammar

mconcat :: [Linear Grammar] -> Linear Grammar

mergeRHS :: [Symbol] -> [Symbol] -> [Symbol]

Merges right-hand sides in a linear direct product. For full-fledged CFGs in different normal forms, see the GNF and CNF implementations.

TODO get prefix, get single NT, get suffix ;;; merge prefixes, merge single NTs, merge suffixes ;;; and in case of no NTs? prefer prefixes?

groupRHS :: [Symbol] -> [[Symbol]]