Package | Description |
---|---|
monq.jfa |
Implements Finite Automata, deterministic and
nondeterministic, with an engine for high throughput filtering of
text.
|
monq.jfa.ctx |
adds support for recursive parsing to jfa that in particular
allows easy XML parsing as an alternative to SAX.
|
Modifier and Type | Method and Description |
---|---|
Nfa |
Nfa.addAction(FaAction a)
adds an action to the Nfa (expert only).
|
Nfa |
Nfa.completeToSkip(FaAction noMatchAction)
extends the automaton with an additonal automaton which matches
everything but all non-empty prefixes of this automaton.
|
Nfa |
Nfa.copy()
creates a copy of this Nfa where all the states are duplicated, but the
actions are kept such that both Nfas referernce the same actions.
|
Nfa |
Nfa.invert()
inverts the automaton, such that the resulting automaton will
match the set-complement of the set of strings matched by the
given automaton.
|
Nfa |
Nfa.not()
implements the request match everthing but X.
|
Nfa |
Nfa.optional()
transforms this finite automaton to match the empty string
too.
|
Nfa |
Nfa.or(java.lang.CharSequence re)
adds the given regular expression to the automaton (expert
only).
|
Nfa |
Nfa.or(java.lang.CharSequence regex,
FaAction action)
adds the given regular expression
re to the
automaton and associates it with the given action. |
Nfa |
Nfa.or(Nfa other)
joins the other
Nfa into this automaton while
keeping all stop states and assigned actions. |
Nfa |
Nfa.plus()
applies the
+ operator to the NFA. |
Nfa |
Nfa.seq(java.lang.CharSequence s)
calls
seq(CharSequence,FaAction) with
null as the 2nd parameter. |
Nfa |
Nfa.seq(java.lang.CharSequence regex,
FaAction a)
extend the current automaton to recognize
regex
as a suffix of the strings already recognized and arrange for the
given action to be called if the suffix was recognized. |
Nfa |
Nfa.seq(Nfa other)
Concatenates
other to this such that a
sequence of characters vw is matched where v is
matched by this and w is matched by
other . |
Nfa |
Nfa.setReParser(ReParser reParser)
sets the parser to be used by this
Nfa . |
Nfa |
Nfa.shortest()
transforms the Nfa into an Nfa which only matches the
shortest matches of the given Nfa.
|
Nfa |
Nfa.star()
applies the Kleene closure (
* ) operator to the NFA. |
Nfa |
Dfa.toNfa()
converts the
Dfa back into an Nfa in a way
that this is totally useless afterwards. |
Modifier and Type | Method and Description |
---|---|
static Statistics |
Statistics.getStatistics(Nfa nfa,
java.io.Writer w)
compute statistical data for a
Nfa . |
Nfa |
Nfa.or(Nfa other)
joins the other
Nfa into this automaton while
keeping all stop states and assigned actions. |
Nfa |
Nfa.seq(Nfa other)
Concatenates
other to this such that a
sequence of characters vw is matched where v is
matched by this and w is matched by
other . |
static Dfa |
Misc.wrapRoi(java.lang.CharSequence reStart,
FaAction startAction,
DfaRun.FailedMatchBehaviour inRoi,
java.lang.CharSequence reEnd,
FaAction endAction,
DfaRun.FailedMatchBehaviour outsideRoi,
Nfa client)
wraps a
Nfa into another one which defines a region
of interest (ROI). |
Constructor and Description |
---|
ContextManager(Nfa nfa)
creates an object to populate the given
Nfa with
regex/action pairs for context matching. |