Searched defs:startState (Results 1 - 11 of 11) sorted by relevance

/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/
H A DMachineProbe.java50 return getAnyDFAPathToTarget(dfa.startState, targetState, visited);
53 public List<DFAState> getAnyDFAPathToTarget(DFAState startState, argument
56 visited.add(startState);
57 if (startState.equals(targetState)) {
61 // for (Edge e : startState.edges) { // walk edges looking for valid
63 for (int i = 0; i < startState.getNumberOfTransitions(); i++) {
64 Transition e = startState.getTransition(i);
69 dfaStates.add(startState);
H A DDecisionProbe.java305 if ( dfa==null || dfa.startState==null ) {
308 getSampleInputSequenceUsingStateSet(dfa.startState,
710 protected boolean reachesState(DFAState startState, argument
713 if ( startState==targetState ) {
716 stateReachable.put(startState.stateNumber, REACHABLE_YES);
720 DFAState s = startState;
756 if ( dfa==null || dfa.startState==null ) {
759 boolean reaches = reachesState(dfa.startState, targetState, dfaStates);
768 * from startState to targetState and no others so this algorithm doesn't
772 protected void getSampleInputSequenceUsingStateSet(State startState, argument
[all...]
H A DDFA.java68 public DFAState startState; field in class:DFA
751 NFAState TokensRuleStart = r.startState;
782 return _getMaxLookaheadDepth(startState, 0);
817 boolean has = _hasSynPred(startState, new HashSet<DFAState>());
821 // String result = serializer.serialize(startState);
849 boolean has = _hasSemPred(startState, new HashSet<DFAState>());
870 boolean cyclic = _hasCycle(startState, new HashMap<DFAState, Integer>());
910 doesStateReachAcceptState(startState);
1107 if ( startState==null ) {
1110 return serializer.serialize(startState, fals
[all...]
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/
H A DDOTGenerator.java65 * from startState will be included.
67 public String getDOT(State startState) { argument
68 if ( startState==null ) {
74 if ( startState instanceof DFAState ) {
76 dot.add("startState",
77 Utils.integer(startState.stateNumber));
80 walkCreatingDFADOT(dot, (DFAState)startState);
84 dot.add("startState",
85 Utils.integer(startState.stateNumber));
86 walkRuleNFACreatingDOT(dot, startState);
[all...]
H A DRule.java43 public NFAState startState; field in class:Rule
H A DGrammar.java157 public NFAState startState; field in class:Grammar.Decision
981 r.startState = ruleBeginState;
1080 if ( dfa.startState==null ) {
1087 String result = serializer.serialize(dfa.startState);
1126 String enclosingRule = d.startState.enclosingRule.name;
1127 Rule r = d.startState.enclosingRule;
1301 String enclosingRule = d.startState.enclosingRule.name;
1302 Rule r = d.startState.enclosingRule;
2716 //System.out.println("getRuleStartState("+scopeName+", "+ruleName+")="+r.startState);
2717 return r.startState;
[all...]
/external/svox/pico/lib/
H A Dpicokfst.c342 extern void picokfst_kfstGetTrans (picokfst_FST this, picokfst_state_t startState, picokfst_class_t transClass, argument
351 if ((startState < 1) || (startState > fst->nrStates) || (transClass < 1) || (transClass > fst->nrClasses)) {
354 index = (startState - 1) * fst->nrClasses + transClass - 1;
363 extern void picokfst_kfstStartInEpsTransSearch (picokfst_FST this, picokfst_state_t startState, argument
373 if ((startState > 0) && (startState <= fst->nrStates)) {
374 pos = fst->inEpsStateTabPos + (startState - 1) * 4;
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
H A Dorg.eclipse.help.base_3.5.2.v201011171123.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...
H A Dorg.apache.commons.el_1.0.0.v201004212143.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...
H A Dorg.apache.lucene_1.9.1.v20100518-1140.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...
/external/antlr/antlr-3.4/lib/
H A Dantlr-3.4-complete.jarMETA-INF/ META-INF/MANIFEST.MF org/ org/antlr/ org/antlr/analysis/ org/antlr/codegen/ org/ ...

Completed in 242 milliseconds