| EditableRE |
A EditableRE is an object that holds a string that is supposed to be
a regular expression.
|
| REAtomic |
This class represents atomic symbols in the regular expressions.
|
| REConcatenation |
This class represents the concatenation of two regular expressions.
|
| RECreator |
This is a creator that can create a string representing a regular expression.
|
| REEmpty |
This class represents a regular expression that contains no strings.
|
| REEpsilon |
This class represents the epsilon expression.
|
| REExtractor |
This class provides a method for extracting regular expressions between every
two states of an automaton.
|
| RegularExpression |
This class provides an abstraction of ω regular expressions.
|
| REParser |
This class provides methods for parsing regular expressions.
|
| REPlus |
This class represents the Kleene cross of a regular expression, denoted by a+
which is equivalent to a.a*.
|
| REQuestion |
This class represents the zero or one occurrence of a regular expression,
denoted by a? which is equivalent to (e|a).
|
| RERewritePattern |
A RERewritePattern object contains several syntactical rewrite
patterns represented as a map from a pattern to a replacement.
|
| RESimplifier |
This class provides methods for simplifying regular expressions.
|
| REStar |
This class represents the Kleene star of a regular expression.
|
| RETranslationOptions |
This class provides options for the naive translation of regular expressions.
|
| RETranslator |
This class provides a naive translation from regular expressions to classic
finite state automata.
|
| REUnifier |
A REUnifier can perform unification on two regular expressions:
source and target.
|
| REUnion |
This class represents the union of two regular expressions.
|