All Classes and Interfaces
Class
Description
An abstract factory class that converts the string representation of
an argument into a token.
Superclass for expressions in a Logic Expression.
Interface for a component of a regular expression.
An expression that can be applied.
An expression that evaluates to true or false.
An expression that evaluates to true or false by applying a
predicate to the supplied entity.
An expression that is a constant value--either true or false.
A non-consuming expression that matches a token against a property of
the text, such as the start or end of a line.
An expression with no subexpression that is evaluated against a token
using the supplied delegate.
A non-consuming expression that matches the end of a line.
Represents a matching group that is referred to by order number.
A minimum to maximum number of occurrences of the enclosed expression.
Represents a matching group that is referred to by name.
Represents a non-matching group.
An operator expression.
An operator that takes two arguments, such as disjunction.
The conjunction (logical and) operator.
The disjunction (logical or) operator.
An operator that takes a single argument, such as negation.
The negation operator.
Zero or one of the enclosed expression.
Disjunction of two experssions.
A parenthesis, used for grouping.
A left parenthesis.
A right parenthesis.
One or more of the enclosed expression.
Kleene-star: zero or more of the enclosed expression.
A non-consuming expression that matches the start of a line.
Wrapper class for a Guava Function.
A finite automaton implementation.
An abstract representation of an edge.
A component automaton with a single start state and a single end
state.
A representation of a movement from a state to another, with a
backreference to the previous state.
An edge with cost
expression
.An end state.
An edge without cost, an epsilon transition.
A start state.
Representation of a state in the automaton.
A start or end state.
Exception while applying an expression to an object.
Exception while converting the tokens into a valid expression.
Exception while tokenizing the logic expression string.
A logic expression engine that operates over user specified objects.
A logic expression engine that operates over user specified objects.
Static factories for logic expressions over basic objects.
A class to represent a match.
A match representation that has efficient method calls but is immutable.
A captured group in a matched expression.
A match representation that is mutable but many method calls compute
values instead of returning stored values.
A regular expression engine that operates over sequences of user-specified
objects.
A regular expression parser turns strings into RegularExpression
objects.
Static factories for regular expressions over some basic sequences.