State - public class ConcreteCondensedTreeAutomaton<State> extends CondensedTreeAutomaton<State>
TreeAutomaton.BottomUpStateVisitorD, DEBUG_STORE| Constructor and Description |
|---|
ConcreteCondensedTreeAutomaton()
Creates a new instance which will have its own signature and contains no
rules or final states.
|
ConcreteCondensedTreeAutomaton(Signature sig)
Constructs a new instance which is backed by the given signature.
|
| Modifier and Type | Method and Description |
|---|---|
void |
absorbTreeAutomaton(TreeAutomaton<State> auto)
Copies all rules from a TreeAutomaton to this automaton.
|
void |
addFinalState(int state) |
void |
addRule(CondensedRule rule) |
int |
addState(State state) |
static <E> ConcreteCondensedTreeAutomaton<E> |
fromTreeAutomaton(TreeAutomaton<E> origin)
Creates a new CondensedTreeAutomaton based on the rules and final states of another TreeAutomaton.
|
Iterable<CondensedRule> |
getCondensedRulesBottomUp(IntSet labelId,
int[] childStates) |
Set<CondensedRule> |
getCondensedRulesTopDown(IntSet labelId,
int parentState) |
void |
makeAllRulesCondensedExplicit()
Stores all information about CondensedRules in the ruleTrie and
topDownRules structures.
|
addLabelSetID, addLabelSetID, createRule, createRule, createRule, createRule, createRuleRaw, getCondensedRulesBottomUpFromExplicit, getCondensedRulesByParentState, getCondensedRuleSet, getCondensedRulesForRhsState, getLabelsForID, getRulesBottomUp, getRulesTopDown, isBottomUpDeterministic, toString, toStringFullaccepts, acceptsRaw, analyze, asConcreteTreeAutomaton, asConcreteTreeAutomatonBottomUp, asConcreteTreeAutomatonWithStringStates, countTrees, createRule, createRule, createRule, createRule, createRule, createRule, determinize, determinize, dumpToFile, equals, evaluateInSemiring, evaluateInSemiring, evaluateInSemiringTopDown, foreachRuleBottomUpForSets, foreachRuleTopDown, foreachStateInBottomUpOrder, getAllLabels, getAllRulesTopDown, getAllStates, getFinalStates, getIdForState, getLabelsTopDown, getNumberOfRules, getNumberOfSeenStates, getRandomRuleTree, getRandomRuleTreeFromInside, getRandomTree, getRandomTreeFromInside, getReachableStates, getRulesBottomUp, getRulesBottomUp, getRuleSet, getRulesForRhsState, getRulesTopDown, getRuleTree, getSignature, getStateForId, getStateInterner, getStatesInBottomUpOrder, getStoredConstantsForID, getWeight, getWeightRaw, hasRuleWithPrefix, hasStoredConstants, homomorphism, inside, intersect, intersect, intersectBottomUp, intersectCondensed, intersectCondensed, intersectCondensed, intersectCondensedBottomUp, intersectCondensedBottomUp, intersectEarley, intersectViterbi, intersectViterbi, inverseCondensedHomomorphism, inverseHomomorphism, isCyclic, isEmpty, isStoring, language, languageIterable, languageIterator, languageIteratorRaw, languageRaw, makeAllRulesExplicit, newSiblingFinder, normalizeRuleWeights, outside, processAllRulesBottomUp, processAllRulesTopDown, reduceTopDown, run, run, runRaw, setRulePrintingFilter, setSkipFail, setStoring, sortedLanguageIterator, supportsBottomUpQueries, supportsTopDownQueries, toStringBottomUp, useSiblingFinder, viterbi, viterbiRaw, writepublic ConcreteCondensedTreeAutomaton(Signature sig)
sig - public ConcreteCondensedTreeAutomaton()
public static <E> ConcreteCondensedTreeAutomaton<E> fromTreeAutomaton(TreeAutomaton<E> origin)
E - origin - public int addState(State state)
addState in class CondensedTreeAutomaton<State>public void addFinalState(int state)
public void addRule(CondensedRule rule)
public Iterable<CondensedRule> getCondensedRulesBottomUp(IntSet labelId, int[] childStates)
getCondensedRulesBottomUp in class CondensedTreeAutomaton<State>public Set<CondensedRule> getCondensedRulesTopDown(IntSet labelId, int parentState)
getCondensedRulesTopDown in class CondensedTreeAutomaton<State>public void absorbTreeAutomaton(TreeAutomaton<State> auto)
auto - public void makeAllRulesCondensedExplicit()
CondensedTreeAutomatonmakeAllRulesCondensedExplicit in class CondensedTreeAutomaton<State>Copyright © 2017. All rights reserved.