Uses of Class
edu.washington.cs.knowitall.regex.FiniteAutomaton.Automaton.Step
-
Packages that use FiniteAutomaton.Automaton.Step Package Description edu.washington.cs.knowitall.regex -
-
Uses of FiniteAutomaton.Automaton.Step in edu.washington.cs.knowitall.regex
Fields in edu.washington.cs.knowitall.regex declared as FiniteAutomaton.Automaton.Step Modifier and Type Field Description FiniteAutomaton.Automaton.Step<E>
FiniteAutomaton.Automaton.Step. prev
Methods in edu.washington.cs.knowitall.regex that return FiniteAutomaton.Automaton.Step Modifier and Type Method Description private FiniteAutomaton.Automaton.Step<E>
FiniteAutomaton.Automaton. evaluate(java.util.List<E> tokens, boolean hasStart)
private FiniteAutomaton.Automaton.Step<E>
FiniteAutomaton.Automaton. evaluate(java.util.List<E> tokens, java.util.List<FiniteAutomaton.Automaton.Step<E>> steps, boolean hasStart)
Evaluate the NFA against the list of tokens using the Thompson NFA algorithm.Methods in edu.washington.cs.knowitall.regex with parameters of type FiniteAutomaton.Automaton.Step Modifier and Type Method Description private void
FiniteAutomaton.Automaton. expandEpsilon(FiniteAutomaton.Automaton.Step<E> step, java.util.List<FiniteAutomaton.Automaton.Step<E>> steps)
Expand all epsilon transitions for the specified step.Method parameters in edu.washington.cs.knowitall.regex with type arguments of type FiniteAutomaton.Automaton.Step Modifier and Type Method Description private void
FiniteAutomaton.Automaton. expandAssertions(java.util.List<FiniteAutomaton.Automaton.Step<E>> steps, java.util.List<FiniteAutomaton.Automaton.Step<E>> newsteps, boolean hasStart, java.util.List<E> tokens, int totalTokens)
Expand any state that has an assertion edge if the assertion passes given the present state.private void
FiniteAutomaton.Automaton. expandEpsilon(FiniteAutomaton.Automaton.Step<E> step, java.util.List<FiniteAutomaton.Automaton.Step<E>> steps)
Expand all epsilon transitions for the specified step.private void
FiniteAutomaton.Automaton. expandEpsilons(java.util.List<FiniteAutomaton.Automaton.Step<E>> steps)
Expand all epsilon transitions for the supplied steps.Constructors in edu.washington.cs.knowitall.regex with parameters of type FiniteAutomaton.Automaton.Step Constructor Description Step(FiniteAutomaton.State<E> state, FiniteAutomaton.Automaton.Step<E> prev, FiniteAutomaton.AbstractEdge<E> path)
-