All Classes and Interfaces

Class	Description
ArgFactory<E>	An abstract factory class that converts the string representation of an argument into a token.
Expression<E>	Superclass for expressions in a Logic Expression.
Expression<E>	Interface for a component of a regular expression.
Expression.Apply<E>	An expression that can be applied.
Expression.Arg<E>	An expression that evaluates to true or false.
Expression.Arg.Pred<E>	An expression that evaluates to true or false by applying a predicate to the supplied entity.
Expression.Arg.Value<E>	An expression that is a constant value--either true or false.
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.
Expression.BaseExpression<E>	An expression with no subexpression that is evaluated against a token using the supplied delegate.
Expression.EndAssertion<E>	A non-consuming expression that matches the end of a line.
Expression.MatchingGroup<E>	Represents a matching group that is referred to by order number.
Expression.MinMax<E>	A minimum to maximum number of occurrences of the enclosed expression.
Expression.NamedGroup<E>	Represents a matching group that is referred to by name.
Expression.NonMatchingGroup<E>	Represents a non-matching group.
Expression.Op<E>	An operator expression.
Expression.Op.Bin<E>	An operator that takes two arguments, such as disjunction.
Expression.Op.Bin.And<E>	The conjunction (logical and) operator.
Expression.Op.Bin.Or<E>	The disjunction (logical or) operator.
Expression.Op.Mon<E>	An operator that takes a single argument, such as negation.
Expression.Op.Mon.Not<E>	The negation operator.
Expression.Option<E>	Zero or one of the enclosed expression.
Expression.Or<E>	Disjunction of two experssions.
Expression.Paren<E>	A parenthesis, used for grouping.
Expression.Paren.L<E>	A left parenthesis.
Expression.Paren.R<E>	A right parenthesis.
Expression.Plus<E>	One or more of the enclosed expression.
Expression.Star<E>	Kleene-star: zero or more of the enclosed expression.
Expression.StartAssertion<E>	A non-consuming expression that matches the start of a line.
ExpressionFactory<E>	Wrapper class for a Guava Function.
FiniteAutomaton	A finite automaton implementation.
FiniteAutomaton.AbstractEdge<E>	An abstract representation of an edge.
FiniteAutomaton.Automaton<E>	A component automaton with a single start state and a single end state.
FiniteAutomaton.Automaton.Step<E>	A representation of a movement from a state to another, with a backreference to the previous state.
FiniteAutomaton.Edge<E>	An edge with cost expression.
FiniteAutomaton.EndState<E>	An end state.
FiniteAutomaton.Epsilon<E>	An edge without cost, an epsilon transition.
FiniteAutomaton.StartState<E>	A start state.
FiniteAutomaton.State<E>	Representation of a state in the automaton.
FiniteAutomaton.TerminusState<E>	A start or end state.
LogicException
LogicException.ApplyLogicException	Exception while applying an expression to an object.
LogicException.CompileLogicException	Exception while converting the tokens into a valid expression.
LogicException.TokenizeLogicException	Exception while tokenizing the logic expression string.
LogicExpression<E>	A logic expression engine that operates over user specified objects.
LogicExpressionParser<E>	A logic expression engine that operates over user specified objects.
LogicExpressionParsers	Static factories for logic expressions over basic objects.
Match<E>	A class to represent a match.
Match.FinalMatch<E>	A match representation that has efficient method calls but is immutable.
Match.Group<E>	A captured group in a matched expression.
Match.Group.Token<E>
Match.IntermediateMatch<E>	A match representation that is mutable but many method calls compute values instead of returning stored values.
RegexException
RegexException.TokenizationRegexException
RegularExpression<E>	A regular expression engine that operates over sequences of user-specified objects.
RegularExpressionParser<E>	A regular expression parser turns strings into RegularExpression objects.
RegularExpressionParsers	Static factories for regular expressions over some basic sequences.