Data.Cfg.Cfg

Context-free grammars.

Class

class Cfg cfg t nt where

Represents a context-free grammar with its nonterminal and terminal types.

Methods

nonterminals

Arguments

:: cfg t nt

-> Set nt

the nonterminals of the grammar

terminals

Arguments

:: cfg t nt

-> Set t

the terminals of the grammar

productionRules

Arguments

:: cfg t nt

-> nt

-> Set (Vs t nt)

the productions of the grammar

startSymbol

Arguments

:: cfg t nt

-> nt

the start symbol of the grammar; must be an element of nonterminals cfg

Instances

(Ord nt, Ord t) => Cfg Grammar t nt

Defined in Data.Cfg.Bnf.Syntax

Methods

nonterminals :: Grammar t nt -> Set nt

terminals :: Grammar t nt -> Set t

productionRules :: Grammar t nt -> nt -> Set (Vs t nt)

startSymbol :: Grammar t nt -> nt

Cfg FreeCfg t nt

Defined in Data.Cfg.FreeCfg

Methods

nonterminals :: FreeCfg t nt -> Set nt

terminals :: FreeCfg t nt -> Set t

productionRules :: FreeCfg t nt -> nt -> Set (Vs t nt)

startSymbol :: FreeCfg t nt -> nt

Vocabulary

data V t nt

Vocabulary symbols of the grammar.

Constructors

T t

a terminal

NT nt

a nonterminal

Instances

Functor (V t)

Defined in Data.Cfg.Cfg

Methods

fmap :: (a -> b) -> V t a -> V t b

(<$) :: a -> V t b -> V t a

(Eq t, Eq nt) => Eq (V t nt)

Defined in Data.Cfg.Cfg

Methods

(==) :: V t nt -> V t nt -> Bool

(/=) :: V t nt -> V t nt -> Bool

(Data t, Data nt) => Data (V t nt)

Defined in Data.Cfg.Cfg

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> V t nt -> c (V t nt)

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (V t nt)

toConstr :: V t nt -> Constr

dataTypeOf :: V t nt -> DataType

dataCast1 :: Typeable t0 => (forall d. Data d => c (t0 d)) -> Maybe (c (V t nt))

dataCast2 :: Typeable t0 => (forall d e. (Data d, Data e) => c (t0 d e)) -> Maybe (c (V t nt))

gmapT :: (forall b. Data b => b -> b) -> V t nt -> V t nt

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> V t nt -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> V t nt -> r

gmapQ :: (forall d. Data d => d -> u) -> V t nt -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> V t nt -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> V t nt -> m (V t nt)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> V t nt -> m (V t nt)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> V t nt -> m (V t nt)

(Ord t, Ord nt) => Ord (V t nt)

Defined in Data.Cfg.Cfg

Methods

compare :: V t nt -> V t nt -> Ordering

(<) :: V t nt -> V t nt -> Bool

(<=) :: V t nt -> V t nt -> Bool

(>) :: V t nt -> V t nt -> Bool

(>=) :: V t nt -> V t nt -> Bool

max :: V t nt -> V t nt -> V t nt

min :: V t nt -> V t nt -> V t nt

(Show t, Show nt) => Show (V t nt)

Defined in Data.Cfg.Cfg

Methods

showsPrec :: Int -> V t nt -> ShowS

show :: V t nt -> String

showList :: [V t nt] -> ShowS

Cfg cfg t nt => CPretty (cfg t nt) (V t nt -> Doc)

Defined in Data.Cfg.Cfg

Methods

cpretty :: MonadReader (V t nt -> Doc) m => cfg t nt -> m Doc

type Vs t nt = [V t nt]

Synonym for lists of vocabulary symbols.

isNT :: V t nt -> Bool

Returns True iff the vocabularly symbols is a nonterminal.

isT :: V t nt -> Bool

Returns True iff the vocabularly symbols is a terminal.

bimapV :: (t -> t') -> (nt -> nt') -> V t nt -> V t' nt'

Maps over the terminal and nonterminal symbols in a V.

bimapVs :: (t -> t') -> (nt -> nt') -> Vs t nt -> Vs t' nt'

Maps over the terminal and nonterminal symbols in a list of Vs.

vocabulary :: (Cfg cfg t nt, Ord nt, Ord t) => cfg t nt -> Set (V t nt)

Returns the vocabulary symbols of the grammar: elements of terminals and nonterminals.

usedVocabulary :: (Cfg cfg t nt, Ord nt, Ord t) => cfg t nt -> Set (V t nt)

Returns all vocabulary used in the productions plus the start symbol.

undeclaredVocabulary :: (Cfg cfg t nt, Ord nt, Ord t) => cfg t nt -> Set (V t nt)

Returns all vocabulary used in the productions plus the start symbol but not declared in nonterminals or terminals.

isFullyDeclared :: (Cfg cfg t nt, Ord nt, Ord t) => cfg t nt -> Bool

Returns True all the vocabulary used in the grammar is declared.

Productions

type Production t nt = (nt, Vs t nt)

Productions over vocabulary symbols

productions :: Cfg cfg t nt => cfg t nt -> [Production t nt]

Returns the productions of the grammar.

Utility functions

eqCfg :: forall cfg cfg' t nt. (Cfg cfg t nt, Cfg cfg' t nt, Eq nt, Eq t) => cfg t nt -> cfg' t nt -> Bool

Returns True iff the two inhabitants of Cfg are equal.