All Classes and Interfaces
Class
Description
An action to be stored in a DFA to be invoked on the match.
Static methods to create trival standard actions, as well as a handler to be used with
DfaFilter for invoking an action on a match.Convenience wrapper to run a list of
Actions in sequence.is a collection of static methods to manipulate arrays.
asd;kfj alsdkjf lasdkjf laksdjf laksjdf laksjdf laskjdf lakdsjfalsdjf laskdjf lasdkjf lasdkfj alsdjkf alsdfjk asldfjk asdlfkj
Thrown by
Action.invoke(StringBuilder, int) in case things go wrong.defines the the character source from which automaton matching reads the data.
Interface of a data structure to map non-overlapping character ranges
like 'a'-'f' to non-
null objects.A function to map one
char to another.Represents things that go wrong during compilation of an Nfa into a
Dfa.
A writer which keeps a pre- and and a post-context of a marked "line" and writes the "line" out
in the context as soon as the required context has been seen.
An action which counts its invocations.
A deterministic finite automaton, with convenience methods to match text and/or lookup values
stored for a matching text.
Uses a
Dfa to match the start of some input and calls a handler on the match.Strategy for handling the next character of the input stream if no match is possible.
Basic example use of the software.
Contains a static function to output a finite automaton as a graph
to be printed by the dot utility.
defines the interface to classes which rearrange text parts stored in a
TextStore and/or
in a java.util.Map append them to a StringBuilder.
Used to construct
CharTrans objects of different implementations.The action, when called, will call the bi-consumer defined in the constructor with
the key defined there and the current match.
The type of handler called by
DfaFilter to handle a match.Miscellaneous static functions.
Merely a holder for a start and a stop state as produced by
NfaBuilder.pop().A builder for non-deterministic finite automata along the lines of
Thompson's Construction and a
compilation method to get a deterministic finite automaton.
is the exception thrown by methods trying to match with a Dfa but don't find a match.
This could well be a lambda, but those look unreadable if the DFA is dumped to a dot-file.
A program similar to grep/sed/awk.
Called right after the partitioning regex was matched and its template handled.
an implementation of
Set based on a simple hashing
scheme.Abstraction over the type of key/value pair stored in a
CharTrans where the key is
a character range given by its inclusive borders.Wraps a Reader or an input stream to provide a CharSource.
Implements the regular
expression syntax classically used by
monq.jfa.A matcher looping on
Dfa.transition(monq.jfa.CharSource), recording character positions when traversing a
state which tests true for a given predicate.Convenience class for matching regular expressions with a
Dfa.Defines the interface of a regular expression parser used by
NfaBuilder.matchRegex(java.lang.CharSequence) and configured with
NfaBuilder(ReParser, StateValueMerger, double)is thrown whenever a syntax error is found in a regular
expression.
This class is merely a container to wrap some very simple
Formatters into one source file.estimator for the size of data structures.
Merges a list of values into one result.
A
CharSource for a String or a part of it.defines the interface of a method which separates a string into
parts and stores them in a
TextStore.stores a text and parts of it in a (hopefully) efficient
manner.