| Package | Description |
|---|---|
| edu.washington.cs.knowitall.regex |
| Modifier and Type | Class and Description |
|---|---|
static class |
Expression.AssertionExpression<E>
A non-consuming expression that matches a token against a property of
the text, such as the start or end of a line.
|
static class |
Expression.BaseExpression<E>
An expression with no subexpression that is evaluated against a token
using the supplied delegate.
|
static class |
Expression.EndAssertion<E>
A non-consuming expression that matches the end of a line.
|
static class |
Expression.MatchingGroup<E>
Represents a matching group that is referred to by order number.
|
static class |
Expression.MinMax<E>
A minimum to maximum number of occurrences of the enclosed expression.
|
static class |
Expression.NamedGroup<E>
Represents a matching group that is referred to by name.
|
static class |
Expression.NonMatchingGroup<E>
Represents a non-matching group.
|
static class |
Expression.Option<E>
Zero or one of the enclosed expression.
|
static class |
Expression.Or<E>
Disjunction of two experssions.
|
static class |
Expression.Plus<E>
One or more of the enclosed expression.
|
static class |
Expression.Star<E>
Kleene-star: zero or more of the enclosed expression.
|
static class |
Expression.StartAssertion<E>
A non-consuming expression that matches the start of a line.
|
| Modifier and Type | Field and Description |
|---|---|
Expression<E> |
Match.Group.expr |
Expression<E> |
Expression.Star.expr |
Expression<E> |
Expression.Plus.expr |
Expression<E> |
Expression.Or.expr1 |
Expression<E> |
Expression.Or.expr2 |
Expression<E> |
FiniteAutomaton.TerminusState.expression |
Expression<E> |
FiniteAutomaton.Edge.expression |
| Modifier and Type | Field and Description |
|---|---|
List<Expression<E>> |
RegularExpression.expressions |
List<Expression<E>> |
Expression.MatchingGroup.expressions |
| Modifier and Type | Method and Description |
|---|---|
List<Expression<E>> |
RegularExpressionParser.tokenize(String string)
Convert a list of tokens (<...>) to a list of expressions.
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
Match.add(Expression<E> expr,
E token,
int pos)
Convenience method for add(new Group
|
void |
FiniteAutomaton.State.connect(FiniteAutomaton.State<E> dest,
Expression<E> cost)
Add an edge between this state and dest.
|
| Modifier and Type | Method and Description |
|---|---|
static <E> FiniteAutomaton.Automaton<E> |
RegularExpression.build(List<Expression<E>> exprs)
Build an NFA from the list of expressions.
|
static <E> RegularExpression<E> |
RegularExpression.compile(List<Expression<E>> expressions)
Create a regular expression without tokenization support.
|
| Constructor and Description |
|---|
Expression.MinMax(Expression<E> expr,
int minOccurrences,
int maxOccurrences) |
Expression.Option(Expression<E> expr) |
Expression.Or(Expression<E> expr1,
Expression<E> expr2) |
Expression.Or(Expression<E> expr1,
Expression<E> expr2) |
Expression.Plus(Expression<E> expr) |
Expression.Star(Expression<E> expr) |
FiniteAutomaton.Automaton(Expression<E> expr) |
FiniteAutomaton.Edge(FiniteAutomaton.State<E> dest,
Expression<E> base) |
FiniteAutomaton.EndState(Expression<E> expression) |
FiniteAutomaton.StartState(Expression<E> expression) |
FiniteAutomaton.TerminusState(Expression<E> expression) |
Match.Group(Expression<E> expr) |
Match.Group(Expression<E> expr,
E token,
int pos) |
Match.Group(Expression<E> expr,
List<edu.washington.cs.knowitall.regex.Match.Group.Token<E>> tokens) |
| Constructor and Description |
|---|
Expression.MatchingGroup(List<Expression<E>> expressions) |
Expression.NamedGroup(String name,
List<Expression<E>> expressions) |
Expression.NonMatchingGroup(List<Expression<E>> expressions) |
RegularExpression(List<Expression<E>> expressions) |
Copyright © 2010–2013 University of Washington CSE. All rights reserved.