34 template <
class SymbolType >
40 template <
class SymbolType >
46 template <
class SymbolType >
52 template <
class SymbolType >
56template <
class SymbolType >
61template <
class SymbolType >
66template <
class SymbolType >
71template <
class SymbolType >
Represents the alternation operator in the regular expression. The node can have 0 to n children in l...
Definition: UnboundedRegExpAlternation.h:44
void appendElement(UnboundedRegExpElement< SymbolType > &&element)
Definition: UnboundedRegExpAlternation.h:195
Represents unbounded regular expression structure. Regular expression is stored as a tree of Unbounde...
Definition: UnboundedRegExpStructure.h:47
const UnboundedRegExpElement< SymbolType > & getStructure() const
Definition: UnboundedRegExpStructure.h:171
Unbounded regular expression represents regular expression. It describes regular languages....
Definition: UnboundedRegExp.h:80
const UnboundedRegExpStructure< SymbolType > & getRegExp() const &
Definition: UnboundedRegExp.h:210
p second
Definition: ToRegExpAlgebraic.h:126
ContainerType< ResType > transform(const ContainerType< InType, Ts ... > &in, Callback transform)
In container tranformation of all elements according to the tranform.
Definition: algorithm.hpp:150
Definition: ToAutomaton.h:15