| Package | Description |
|---|---|
| edu.washington.cs.knowitall.regex |
| Class and Description |
|---|
| 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.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.
|
| RegexException |
| RegularExpression
A regular expression engine that operates over sequences of user-specified
objects.
|
Copyright © 2010–2013 University of Washington CSE. All rights reserved.