Package | Description |
---|---|
com.nobigsoftware.dfalex |
Modifier and Type | Method and Description |
---|---|
DfaState<MATCHRESULT> |
DfaBuilder.build(DfaAmbiguityResolver<? super MATCHRESULT> ambiguityResolver)
Build DFA for a single language
|
DfaState<MATCHRESULT> |
DfaBuilder.build(java.util.Set<MATCHRESULT> language,
DfaAmbiguityResolver<? super MATCHRESULT> ambiguityResolver)
Build DFA for a single language
|
DfaState<java.lang.Boolean> |
DfaBuilder.buildReverseFinder()
Build the reverse finder DFA for all patterns that have been added to this builder
|
DfaState<java.lang.Boolean> |
DfaBuilder.buildReverseFinder(java.util.Set<MATCHRESULT> language)
Build the reverse finder DFA for a language
|
abstract DfaState<MATCHRESULT> |
DfaState.getNextState(char c)
Process a character and get the next state
|
Modifier and Type | Method and Description |
---|---|
java.util.List<DfaState<MATCHRESULT>> |
DfaBuilder.build(java.util.List<java.util.Set<MATCHRESULT>> languages,
DfaAmbiguityResolver<? super MATCHRESULT> ambiguityResolver)
Build DFAs for multiple languages simultaneously.
|
static <MR> java.util.List<DfaState<MR>> |
DfaBuilder.buildFromNfa(Nfa<MR> nfa,
int[] nfaStartStates,
DfaAmbiguityResolver<? super MR> ambiguityResolver,
BuilderCache cache)
Build DFAs from a provided NFA
|
java.util.List<DfaState<java.lang.Boolean>> |
DfaBuilder.buildReverseFinders(java.util.List<java.util.Set<MATCHRESULT>> languages)
Build reverse finder DFAs for multiple languages simultaneously.
|
java.util.List<DfaState<MATCHRESULT>> |
DfaAuxiliaryInformation.getStatesByNumber()
Get a list of all states reachable from the start states.
|
abstract java.lang.Iterable<DfaState<MATCHRESULT>> |
DfaState.getSuccessorStates()
Get an
Iterable of all the successor states of this state. |
Modifier and Type | Method and Description |
---|---|
void |
DfaTransitionConsumer.acceptTransition(char firstChar,
char lastChar,
DfaState<MATCHRESULT> target)
Accept a DFA transition
|
<MATCHRESULT> |
StringMatcher.findNext(DfaState<MATCHRESULT> state)
Find the next non-empty match
|
<MATCHRESULT> |
StringMatcher.matchAt(DfaState<MATCHRESULT> state,
int startPos)
Find the longest match starting at a given position.
|
static <MATCHRESULT> |
StringMatcher.matchWholeString(DfaState<MATCHRESULT> state,
java.lang.String str)
See if a whole string matches a DFA
|
Modifier and Type | Method and Description |
---|---|
void |
DfaAuxiliaryInformation.depthFirstSearch(java.util.function.BiConsumer<DfaState<MATCHRESULT>,DfaState<MATCHRESULT>> onEnter,
java.util.function.BiConsumer<DfaState<MATCHRESULT>,DfaState<MATCHRESULT>> onSkip,
java.util.function.BiConsumer<DfaState<MATCHRESULT>,DfaState<MATCHRESULT>> onLeave)
Perform a depth first search of all states, starting at the start states
|
void |
DfaAuxiliaryInformation.depthFirstSearch(java.util.function.BiConsumer<DfaState<MATCHRESULT>,DfaState<MATCHRESULT>> onEnter,
java.util.function.BiConsumer<DfaState<MATCHRESULT>,DfaState<MATCHRESULT>> onSkip,
java.util.function.BiConsumer<DfaState<MATCHRESULT>,DfaState<MATCHRESULT>> onLeave)
Perform a depth first search of all states, starting at the start states
|
void |
DfaAuxiliaryInformation.depthFirstSearch(java.util.function.BiConsumer<DfaState<MATCHRESULT>,DfaState<MATCHRESULT>> onEnter,
java.util.function.BiConsumer<DfaState<MATCHRESULT>,DfaState<MATCHRESULT>> onSkip,
java.util.function.BiConsumer<DfaState<MATCHRESULT>,DfaState<MATCHRESULT>> onLeave)
Perform a depth first search of all states, starting at the start states
|
void |
DfaAuxiliaryInformation.depthFirstSearch(java.util.function.BiConsumer<DfaState<MATCHRESULT>,DfaState<MATCHRESULT>> onEnter,
java.util.function.BiConsumer<DfaState<MATCHRESULT>,DfaState<MATCHRESULT>> onSkip,
java.util.function.BiConsumer<DfaState<MATCHRESULT>,DfaState<MATCHRESULT>> onLeave)
Perform a depth first search of all states, starting at the start states
|
void |
DfaAuxiliaryInformation.depthFirstSearch(java.util.function.BiConsumer<DfaState<MATCHRESULT>,DfaState<MATCHRESULT>> onEnter,
java.util.function.BiConsumer<DfaState<MATCHRESULT>,DfaState<MATCHRESULT>> onSkip,
java.util.function.BiConsumer<DfaState<MATCHRESULT>,DfaState<MATCHRESULT>> onLeave)
Perform a depth first search of all states, starting at the start states
|
void |
DfaAuxiliaryInformation.depthFirstSearch(java.util.function.BiConsumer<DfaState<MATCHRESULT>,DfaState<MATCHRESULT>> onEnter,
java.util.function.BiConsumer<DfaState<MATCHRESULT>,DfaState<MATCHRESULT>> onSkip,
java.util.function.BiConsumer<DfaState<MATCHRESULT>,DfaState<MATCHRESULT>> onLeave)
Perform a depth first search of all states, starting at the start states
|
Constructor and Description |
---|
StringSearcher(DfaState<MATCHRESULT> matcher,
DfaState<?> reverseFinder)
Create a new StringSearcher.
|
StringSearcher(DfaState<MATCHRESULT> matcher,
DfaState<?> reverseFinder)
Create a new StringSearcher.
|
Constructor and Description |
---|
DfaAuxiliaryInformation(java.util.Collection<DfaState<MATCHRESULT>> startStates)
Create a new DfaAuxiliaryInformation.
|