String |
PdaListFormatter.apply(Pda<STATE,STACKITEM> pda) |
<S,P> boolean |
PdaUtil.canReach(Pda<S,P> pda,
S state,
Iterator<P> stack,
com.google.common.base.Predicate<S> matches,
com.google.common.base.Predicate<S> canPass) |
protected <S,P,T,D extends Pda<S,P>> S |
PdaUtil.clone(S state,
Pda<S,P> src,
D target,
com.google.common.base.Function<S,T> tokens,
PdaFactory<D,S,P,T> fact,
PdaUtil.Identity<S> identity) |
protected GraphvizDotBuilder.Node |
PdaToDot.create(GraphvizDotBuilder.Digraph result,
Pda<STATE,STACKITEM> pda,
STATE state) |
protected GraphvizDotBuilder.Edge |
PdaToDot.create(GraphvizDotBuilder.Digraph result,
Pda<STATE,STACKITEM> pda,
STATE from,
STATE to) |
<S,P> long |
PdaUtil.distanceTo(Pda<S,P> pda,
Iterable<S> starts,
Iterator<P> stack,
com.google.common.base.Predicate<S> matches,
com.google.common.base.Predicate<S> canPass) |
protected void |
PdaToDot.draw(GraphvizDotBuilder.Digraph result,
Pda<STATE,STACKITEM> pda) |
PdaUtil.CyclicStackItem<P> |
PdaUtil.CyclicStackTraverser.enter(Pda<S,P> pda,
S state,
PdaUtil.CyclicStackItem<P> previous) |
<S,P,T,D extends Pda<S,P>> D |
PdaUtil.expand(Pda<S,P> pda,
com.google.common.base.Function<S,Pda<S,P>> expand,
com.google.common.base.Function<S,T> tokens,
PdaFactory<D,S,P,T> fact) |
<S,P,R,D extends Pda<S,P>> D |
PdaUtil.filterEdges(Pda<S,P> pda,
Traverser<? super Pda<S,P>,S,R> traverser,
PdaFactory<D,S,P,S> factory) |
<S,P,D extends Pda<S,P>> D |
PdaUtil.filterOrphans(Pda<S,P> pda,
PdaFactory<D,S,P,S> factory) |
<S,P> Nfa<S> |
PdaUtil.filterUnambiguousPaths(Pda<S,P> pda) |
protected <S,P> void |
PdaUtil.filterUnambiguousPaths(Pda<S,P> pda,
S state,
Map<S,Integer> dist,
Map<S,List<S>> followers) |
String |
PdaListFormatter.format(Pda<STATE,STACKITEM> pda) |
String |
PdaListFormatter.format(Pda<STATE,STACKITEM> pda,
STATE state) |
protected <S,R,P> PdaUtil.TraversalItem<S,R> |
PdaUtil.newItem(Pda<S,P> pda,
NfaUtil.MappedComparator<S,Integer> comp,
Map<S,Integer> distances,
S next,
R item) |
<S,P> List<S> |
PdaUtil.shortestPathTo(Pda<S,P> pda,
Iterable<S> starts,
Iterator<P> stack,
com.google.common.base.Predicate<S> matches,
com.google.common.base.Predicate<S> canPass) |
<S,P> List<S> |
PdaUtil.shortestPathTo(Pda<S,P> pda,
Iterator<P> stack,
com.google.common.base.Predicate<S> matches) |
<S,P> List<S> |
PdaUtil.shortestPathTo(Pda<S,P> pda,
Iterator<P> stack,
com.google.common.base.Predicate<S> matches,
com.google.common.base.Predicate<S> canPass) |
<S,P> List<S> |
PdaUtil.shortestPathTo(Pda<S,P> pda,
Iterator<P> stack,
S match) |
<S,P> List<S> |
PdaUtil.shortestPathTo(Pda<S,P> pda,
S start,
Iterator<P> stack,
com.google.common.base.Predicate<S> matches,
com.google.common.base.Predicate<S> canPass) |
<S,P> List<S> |
PdaUtil.shortestPathToFinalState(Pda<S,P> pda,
Iterator<P> stack) |
<S,P> List<S> |
PdaUtil.shortestStackpruningPathTo(Pda<S,P> pda,
Iterable<S> starts,
Iterator<P> stack,
com.google.common.base.Predicate<S> matches,
com.google.common.base.Predicate<S> canPass) |
<S,P> List<S> |
PdaUtil.shortestStackpruningPathTo(Pda<S,P> pda,
Iterator<P> stack,
com.google.common.base.Predicate<S> matches) |
<S,P> List<S> |
PdaUtil.shortestStackpruningPathTo(Pda<S,P> pda,
Iterator<P> stack,
S matches) |
<S,P> List<S> |
PdaUtil.shortestStackpruningPathTo(Pda<S,P> pda,
S start,
Iterator<P> stack,
com.google.common.base.Predicate<S> matches,
com.google.common.base.Predicate<S> canPass) |
protected String |
PdaToDot.stateToString(Pda<STATE,STACKITEM> pda,
STATE state) |
protected String |
PdaListFormatter.title(Pda<STATE,STACKITEM> pda,
STATE state) |
protected <S,P> PdaUtil.TraceItem<S,P> |
PdaUtil.trace(Pda<S,P> pda,
Iterable<S> starts,
Iterator<P> stack,
com.google.common.base.Predicate<S> matches,
com.google.common.base.Predicate<S> canPass) |
protected <S,P> PdaUtil.TraceItem<S,P> |
PdaUtil.traceToWithPruningStack(Pda<S,P> pda,
Iterable<S> starts,
Iterator<P> stack,
com.google.common.base.Predicate<S> matches,
com.google.common.base.Predicate<S> canPass) |