30 template <
class SymbolType >
36 template <
class SymbolType >
41template <
class SymbolType >
46template <
class SymbolType >
Right regular grammar in Chomsky hierarchy or type 3 in Chomsky hierarchy. Generates regular language...
Definition: RightRG.h:70
Unbounded regular expression represents regular expression. It describes regular languages....
Definition: UnboundedRegExp.h:80
static grammar::RightRG< SymbolType, ext::pair< SymbolType, unsigned > > convert(const regexp::FormalRegExp< SymbolType > ®exp)
Definition: ToGrammarRightRGGlushkov.h:110
Definition: ToGrammar.h:19
static grammar::RightRG< SymbolType, ext::pair< SymbolType, unsigned > > convert(const regexp::FormalRegExp< SymbolType > ®exp)
Definition: ToGrammar.h:42
Definition: converterCommon.hpp:8
Definition: ToAutomaton.h:15