/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
D | DFA.java | 68 public DFAState startState; 86 protected Map<DFAState, DFAState> uniqueStates = new HashMap<DFAState, DFAState>(); 99 protected Vector<DFAState> states = new Vector<DFAState>(); 146 protected DFAState[] altToAcceptState; 293 DFAState s = getState(i); in resetStateNumbersToBeContiguous() 427 DFAState s = (DFAState)it.next(); 448 DFAState ss = (DFAState) specialStates.get(i); 500 protected void createMinMaxTables(DFAState s) { 543 protected void createTransitionTableEntryForState(DFAState s) { 592 protected void createEOTAndEOFTables(DFAState s) { [all …]
|
D | MachineProbe.java | 48 List<DFAState> getAnyDFAPathToTarget(DFAState targetState) { in getAnyDFAPathToTarget() 49 Set<DFAState> visited = new HashSet<DFAState>(); in getAnyDFAPathToTarget() 53 public List<DFAState> getAnyDFAPathToTarget(DFAState startState, in getAnyDFAPathToTarget() 54 DFAState targetState, Set<DFAState> visited) { in getAnyDFAPathToTarget() 55 List<DFAState> dfaStates = new ArrayList<DFAState>(); in getAnyDFAPathToTarget() 66 List<DFAState> path = getAnyDFAPathToTarget( in getAnyDFAPathToTarget() 67 (DFAState) e.target, targetState, visited); in getAnyDFAPathToTarget() 79 public List<IntSet> getEdgeLabels(DFAState targetState) { in getEdgeLabels() 80 List<DFAState> dfaStates = getAnyDFAPathToTarget(targetState); in getEdgeLabels() 83 DFAState d = dfaStates.get(i); in getEdgeLabels() [all …]
|
D | DecisionProbe.java | 82 protected Set<DFAState> statesWithSyntacticallyAmbiguousAltsSet = new HashSet<DFAState>(); 89 protected Map<DFAState, Set<Integer>> stateToSyntacticallyAmbiguousTokensRuleAltsMap = 90 new HashMap<DFAState, Set<Integer>>(); 96 protected Set<DFAState> statesResolvedWithSemanticPredicatesSet = new HashSet<DFAState>(); 103 protected Map<DFAState, Map<Integer,SemanticContext>> stateToAltSetWithSemanticPredicatesMap = 104 new HashMap<DFAState, Map<Integer,SemanticContext>>(); 110 protected Map<DFAState,Map<Integer, Set<Token>>> stateToIncompletelyCoveredAltsMap = 111 new HashMap<DFAState,Map<Integer, Set<Token>>>(); 114 protected Set<DFAState> danglingStates = new HashSet<DFAState>(); 204 DFAState d = (DFAState) it.next(); in isDeterministic() [all …]
|
D | NFAToDFAConverter.java | 86 DFAState d = (DFAState) work.get(0); in convert() 139 protected DFAState computeStartState() { in computeStartState() 141 DFAState startState = dfa.newState(); in computeStartState() 201 protected void findNewDFAStatesAndAddDFATransitions(DFAState d) { in findNewDFAStatesAndAddDFATransitions() 275 DFAState t = reach(d, label); in findNewDFAStatesAndAddDFATransitions() 306 DFAState targetState = addDFAStateToWorkList(t); in findNewDFAStatesAndAddDFATransitions() 408 protected static int addTransition(DFAState d, in addTransition() 410 DFAState targetState, in addTransition() 457 public void closure(DFAState d) { in closure() 595 DFAState d, in closure() [all …]
|
D | DFAOptimizer.java | 184 protected void optimizeExitBranches(DFAState d) { in optimizeExitBranches() 193 DFAState edgeTarget = ((DFAState)edge.target); in optimizeExitBranches() 214 protected void optimizeEOTBranches(DFAState d) { in optimizeEOTBranches() 222 DFAState edgeTarget = ((DFAState)edge.target); in optimizeEOTBranches()
|
D | LL1DFA.java | 52 DFAState s0 = newState(); in LL1DFA() 61 DFAState acceptAltState = newState(); in LL1DFA() 78 DFAState s0 = newState(); in LL1DFA() 91 DFAState s = newState(); in LL1DFA() 108 DFAState predDFATarget = getAcceptState(alt); in LL1DFA()
|
D | AnalysisRecursionOverflowException.java | 32 public DFAState ovfState; 34 public AnalysisRecursionOverflowException(DFAState ovfState, in AnalysisRecursionOverflowException()
|
D | DFAState.java | 65 public class DFAState extends State { class 165 public DFAState(DFA dfa) { in DFAState() method in DFAState 191 public int addTransition(DFAState target, Label label) { in addTransition() 414 DFAState other = (DFAState)o; in equals()
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
D | DOTGenerator.java | 74 if ( startState instanceof DFAState ) { in getDOT() 80 walkCreatingDFADOT(dot, (DFAState)startState); in getDOT() 112 DFAState s) in walkCreatingDFADOT() 139 if ( edge.target instanceof DFAState && in walkCreatingDFADOT() 140 ((DFAState)edge.target).getAcceptStateReachable()!=DFA.REACHABLE_YES ) in walkCreatingDFADOT() 151 walkCreatingDFADOT(dot, (DFAState)edge.target); // keep walkin' in walkCreatingDFADOT() 294 if ( !edge.isSemanticPredicate() && target instanceof DFAState ) { in getEdgeLabel() 297 ((DFAState)target).getGatedPredicatesInNFAConfigurations(); in getEdgeLabel() 315 if ( s instanceof DFAState ) { in getStateLabel() 320 if ( s instanceof DFAState ) { in getStateLabel() [all …]
|
D | GrammarDanglingStateMessage.java | 30 import org.antlr.analysis.DFAState; 43 public DFAState problemState; 46 DFAState problemState) in GrammarDanglingStateMessage()
|
D | RecursionOverflowMessage.java | 30 import org.antlr.analysis.DFAState; 42 public DFAState sampleBadState; 48 DFAState sampleBadState, in RecursionOverflowMessage()
|
D | GrammarInsufficientPredicatesMessage.java | 30 import org.antlr.analysis.DFAState; 41 public DFAState problemState; 44 DFAState problemState, in GrammarInsufficientPredicatesMessage()
|
D | FASerializer.java | 166 if ( edge.target instanceof DFAState ) { in walkSerializingFA() 169 ((DFAState)edge.target).getGatedPredicatesInNFAConfigurations(); in walkSerializingFA() 206 if ( s instanceof DFAState ) { in getStateString() 207 stateStr = ":s"+n+"=>"+((DFAState)s).getUniquelyPredictedAlt(); in getStateString()
|
D | GrammarNonDeterminismMessage.java | 30 import org.antlr.analysis.DFAState; 45 public DFAState problemState; 48 DFAState problemState) in GrammarNonDeterminismMessage()
|
D | ErrorManager.java | 31 import org.antlr.analysis.DFAState; 616 DFAState d) in nondeterminism() 625 DFAState d) in danglingState() 656 DFAState d, in insufficientPredicates() 673 DFAState sampleBadState, in recursionOverflow()
|
D | Interpreter.java | 396 DFAState s = dfa.startState; in predict() 411 s = (DFAState)t.target; in predict() 421 s = (DFAState)eotTransition.target; in predict()
|
D | Grammar.java | 1338 for (DFAState s : lookaheadDFA.getUniqueStates().values()) { in createLookaheadDFA()
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/codegen/ |
D | ACyclicDFACodeGenerator.java | 53 DFAState s, in walkFixedDFAGeneratingStateMachine() 96 DFAState EOTTarget = null; in walkFixedDFAGeneratingStateMachine() 104 EOTTarget = (DFAState)edge.target; in walkFixedDFAGeneratingStateMachine() 132 DFAState target = (DFAState)edge.target; in walkFixedDFAGeneratingStateMachine() 147 (DFAState)edge.target, in walkFixedDFAGeneratingStateMachine() 181 (DFAState)predEdge.target, in walkFixedDFAGeneratingStateMachine()
|
D | CodeGenerator.java | 666 public ST generateSpecialState(DFAState s) { in generateSpecialState() 697 DFAState t = (DFAState)edge.target; in generateSpecialState() 745 DFA dfa = ((DFAState)edge.target).dfa; // which DFA are we in in genSemanticPredicateExpr() 1278 protected boolean canGenerateSwitch(DFAState s) { in canGenerateSwitch() 1290 int EOTPredicts = ((DFAState)edge.target).getUniquelyPredictedAlt(); in canGenerateSwitch() 1298 if ( ((DFAState)edge.target).getGatedPredicatesInNFAConfigurations()!=null ) { in canGenerateSwitch()
|
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Ruby/ |
D | Ruby.stg | 879 /** Generate the tables and support code needed for the DFAState
|
/external/antlr/antlr-3.4/runtime/C/ |
D | README | 1244 The DFAState.equals() method was messed up.
|
/external/antlr/antlr-3.4/tool/ |
D | CHANGES.txt | 2814 The DFAState.equals() method was messed up.
|