Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
Static Public Member Functions
core::ElementConstraint< grammar::UnrestrictedGrammar< SymbolType >, SymbolType, grammar::InitialSymbol > Class Template Reference

#include <UnrestrictedGrammar.h>

Static Public Member Functions

static bool available (const grammar::UnrestrictedGrammar< SymbolType > &grammar, const SymbolType &symbol)
 
static void valid (const grammar::UnrestrictedGrammar< SymbolType > &, const SymbolType &)
 

Detailed Description

template<class SymbolType>
class core::ElementConstraint< grammar::UnrestrictedGrammar< SymbolType >, SymbolType, grammar::InitialSymbol >

Helper class specifying constraints for the grammar's internal initial symbol element.

Template Parameters
SymbolTypeused for the initial symbol of the grammar.

Member Function Documentation

◆ available()

template<class SymbolType >
static bool core::ElementConstraint< grammar::UnrestrictedGrammar< SymbolType >, SymbolType, grammar::InitialSymbol >::available ( const grammar::UnrestrictedGrammar< SymbolType > &  grammar,
const SymbolType &  symbol 
)
inlinestatic

Returns true if the symbol requested to be initial is available in nonterminal alphabet.

Parameters
grammarthe tested grammar
symbolthe tested symbol
Returns
true if the tested symbol is in nonterminal alphabet

◆ valid()

template<class SymbolType >
static void core::ElementConstraint< grammar::UnrestrictedGrammar< SymbolType >, SymbolType, grammar::InitialSymbol >::valid ( const grammar::UnrestrictedGrammar< SymbolType > &  ,
const SymbolType &   
)
inlinestatic

All symbols are valid as initial symbols.

Parameters
grammarthe tested grammar
symbolthe tested symbol

The documentation for this class was generated from the following file: