| Expression |
Interface for a component of a regular expression.
|
| Expression.AssertionExpression |
A non-consuming expression that matches a token against a property of
the text, such as the start or end of a line.
|
| Expression.BaseExpression |
An expression with no subexpression that is evaluated against a token
using the supplied delegate.
|
| Expression.MatchingGroup |
Represents a matching group that is referred to by order number.
|
| FiniteAutomaton.AbstractEdge |
An abstract representation of an edge.
|
| FiniteAutomaton.Automaton |
A component automaton with a single start state and a single end
state.
|
| FiniteAutomaton.Automaton.Step |
A representation of a movement from a state to another, with a
backreference to the previous state.
|
| FiniteAutomaton.Edge |
An edge with cost expression.
|
| FiniteAutomaton.EndState |
An end state.
|
| FiniteAutomaton.Epsilon |
An edge without cost, an epsilon transition.
|
| FiniteAutomaton.StartState |
A start state.
|
| FiniteAutomaton.State |
Representation of a state in the automaton.
|
| FiniteAutomaton.TerminusState |
A start or end state.
|
| Match |
A class to represent a match.
|
| Match.FinalMatch |
A match representation that has efficient method calls but is immutable.
|
| Match.Group |
A captured group in a matched expression.
|
| Match.Group.Token |
|
| Match.IntermediateMatch |
A match representation that is mutable but many method calls compute
values instead of returning stored values.
|
| RegexException |
|
| RegularExpression |
A regular expression engine that operates over sequences of user-specified
objects.
|
| RegularExpressionParser |
A regular expression parser turns strings into RegularExpression
objects.
|