32 template <
class SymbolType >
38 template <
class SymbolType >
44 template <
class SymbolType >
50 template <
class SymbolType >
56 template <
class SymbolType >
62 template <
class SymbolType >
65 template <
class SymbolType >
76 template <
class SymbolType >
90template <
class SymbolType >
92 return regexp.template accept<bool, RegExpEpsilon::Formal < SymbolType >>();
95template <
class SymbolType >
100template <
class SymbolType >
107template <
class SymbolType >
109 return regexp.template accept<bool, RegExpEpsilon::Unbounded < SymbolType >>();
112template <
class SymbolType >
117template <
class SymbolType >
124template <
class SymbolType >
127 return element.template accept < bool, RegExpEpsilon::Unbounded < SymbolType > > ( );
131template <
class SymbolType >
134 return element.template accept < bool, RegExpEpsilon::Unbounded < SymbolType > > ( );
138template <
class SymbolType >
143template <
class SymbolType >
148template <
class SymbolType >
153template <
class SymbolType >
160template <
class SymbolType >
162 return alternation.getLeftElement().template accept<bool, RegExpEpsilon::Formal < SymbolType >>() || alternation.getRightElement().template accept<bool, RegExpEpsilon::Formal < SymbolType >>();
165template <
class SymbolType >
167 return concatenation.getLeftElement().template accept<bool, RegExpEpsilon::Formal < SymbolType >>() && concatenation.getRightElement().template accept<bool, RegExpEpsilon::Formal < SymbolType >>();
170template <
class SymbolType >
175template <
class SymbolType >
180template <
class SymbolType >
185template <
class SymbolType >
Represents the alternation operator in the regular expression. The node can have 0 to n children in l...
Definition: UnboundedRegExpAlternation.h:44
Represents the concatenation operator in the regular expression. The node can have 0 to n children in...
Definition: UnboundedRegExpConcatenation.h:44
Definition: UnboundedRegExpElement.h:62
Represents the empty expression in the regular expression. The node can't have any children.
Definition: UnboundedRegExpEmpty.h:41
Represents the epsilon expression in the regular expression. The node can't have any children.
Definition: UnboundedRegExpEpsilon.h:41
Represents the iteration operator in the regular expression. The node has exactly one child.
Definition: UnboundedRegExpIteration.h:43
Represents unbounded regular expression structure. Regular expression is stored as a tree of Unbounde...
Definition: UnboundedRegExpStructure.h:47
Represents the symbol in the regular expression. The can't have any children.
Definition: UnboundedRegExpSymbol.h:42
Unbounded regular expression represents regular expression. It describes regular languages....
Definition: UnboundedRegExp.h:80
Definition: RegExpEpsilon.h:66
static bool visit(const regexp::UnboundedRegExpAlternation< SymbolType > &alternation)
Definition: RegExpEpsilon.h:125
Definition: RegExpEpsilon.h:21
static bool languageContainsEpsilon(const regexp::FormalRegExpElement< SymbolType > ®exp)
Definition: RegExpEpsilon.h:91
all_of(T &&...) -> all_of< T... >
any_of(T &&...) -> any_of< T... >
Definition: ToAutomaton.h:15