Home
last modified time | relevance | path

Searched refs:getNumberOfTransitions (Results 1 – 16 of 16) sorted by relevance

/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/
DDFAOptimizer.java191 for (int i = 0; i < d.getNumberOfTransitions(); i++) { in optimizeExitBranches()
220 for (int i = 0; i < d.getNumberOfTransitions(); i++) { in optimizeEOTBranches()
231 d.getNumberOfTransitions()==1 && in optimizeEOTBranches()
DMachineProbe.java63 for (int i = 0; i < startState.getNumberOfTransitions(); i++) { in getAnyDFAPathToTarget()
86 for (int j = 0; j < d.getNumberOfTransitions(); j++) { in getEdgeLabels()
127 for (int j = 0; j < p.getNumberOfTransitions(); j++) { in getGrammarLocationsForInputSequence()
DDFA.java503 for (int j = 0; j < s.getNumberOfTransitions(); j++) {
554 for (int j = 0; j < s.getNumberOfTransitions(); j++) {
593 for (int j = 0; j < s.getNumberOfTransitions(); j++) {
627 for (int j = 0; j < s.getNumberOfTransitions(); j++) {
789 for (int i=0; i<d.getNumberOfTransitions(); i++) {
831 for (int i=0; i<d.getNumberOfTransitions(); i++) {
855 for (int i=0; i<d.getNumberOfTransitions(); i++) {
876 for (int i=0; i<d.getNumberOfTransitions(); i++) {
943 for (int i=0; i<d.getNumberOfTransitions(); i++) {
DState.java41 public abstract int getNumberOfTransitions(); in getNumberOfTransitions() method in State
DNFAConversionThread.java52 if ( decisionStartState.getNumberOfTransitions()>1 ) { in run()
DNFAState.java112 public int getNumberOfTransitions() { in getNumberOfTransitions() method in NFAState
DDecisionProbe.java727 for (int i=0; i<s.getNumberOfTransitions(); i++) { in reachesState()
780 for (int i=0; i<startState.getNumberOfTransitions(); i++) { in getSampleInputSequenceUsingStateSet()
834 for (int i=0; i<s.getNumberOfTransitions(); i++) { in getNFAPath()
DDFAState.java180 public int getNumberOfTransitions() { in getNumberOfTransitions() method in DFAState
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/
DFASerializer.java87 if ( s.getNumberOfTransitions()>0 ) { in serialize()
123 for (int i = 0; i < s.getNumberOfTransitions(); i++) { in walkFANormalizingStateNumbers()
151 for (int i = 0; i < s.getNumberOfTransitions(); i++) { in walkSerializingFA()
DRandomPhrase.java79 if ( state.getNumberOfTransitions()==0 ) { in randomPhrase()
94 if ( state.getNumberOfTransitions()==1 ) { in randomPhrase()
DDOTGenerator.java132 for (int i = 0; i < s.getNumberOfTransitions(); i++) { in walkCreatingDFADOT()
207 for (int i = 0; i < s.getNumberOfTransitions(); i++) { in walkRuleNFACreatingDOT()
DInterpreter.java406 for (int i=0; i<s.getNumberOfTransitions(); i++) { in predict()
DNFAFactory.java97 if ( t.label.isEpsilon() && !t.label.isAction() && s.getNumberOfTransitions()==1 ) { in optimizeAlternative()
DGrammar.java1061 if ( !externalAnalysisAbort && decisionStartState.getNumberOfTransitions()>1 ) { in createLookaheadDFAs()
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/codegen/
DACyclicDFACodeGenerator.java98 for (int i = 0; i < s.getNumberOfTransitions(); i++) { in walkFixedDFAGeneratingStateMachine()
162 else if ( EOTTarget!=null && EOTTarget.getNumberOfTransitions()>0 ) { in walkFixedDFAGeneratingStateMachine()
171 for (int i = 0; i < EOTTarget.getNumberOfTransitions(); i++) { in walkFixedDFAGeneratingStateMachine()
DCodeGenerator.java677 for (int i = 0; i < s.getNumberOfTransitions(); i++) { in generateSpecialState()
1283 for (int i = 0; i < s.getNumberOfTransitions(); i++) { in canGenerateSwitch()
1303 if ( s.getNumberOfTransitions()<MIN_SWITCH_ALTS || in canGenerateSwitch()