| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| H A D | AnalysisRecursionOverflowException.java | 32 public DFAState ovfState;
34 public AnalysisRecursionOverflowException(DFAState ovfState,
|
| H A D | MachineProbe.java | 48 List<DFAState> getAnyDFAPathToTarget(DFAState targetState) {
49 Set<DFAState> visited = new HashSet<DFAState>();
53 public List<DFAState> getAnyDFAPathToTarget(DFAState startState,
54 DFAState targetState, Set<DFAState> visited) {
55 List<DFAState> dfaStates = new ArrayList<DFAState>();
[all...] |
| H A D | DecisionProbe.java | 57 * as having multiple flaws each one uniquely identified by a DFAState.
65 * getSampleNonDeterministicInputSequence() require a DFAState. This state
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, Ma
[all...] |
| H A D | DFA.java | 68 public DFAState startState;
79 /** A set of all uniquely-numbered DFA states. Maps hash of DFAState
80 * to the actual DFAState object. We use this to detect
81 * existing DFA states. Map<DFAState,DFAState>. Use Map so
86 protected Map<DFAState, DFAState> uniqueStates = new HashMap<DFAState, DFAState>();
88 /** Maps the state number to the actual DFAState
[all...] |
| H A D | DFAOptimizer.java | 184 protected void optimizeExitBranches(DFAState d) {
193 DFAState edgeTarget = ((DFAState)edge.target);
214 protected void optimizeEOTBranches(DFAState d) {
222 DFAState edgeTarget = ((DFAState)edge.target);
250 protected void unlinkUnneededStateData(DFAState d) {
259 DFAState edgeTarget = ((DFAState)edge.target);
|
| H A D | NFAToDFAConverter.java | 86 DFAState d = (DFAState) work.get(0);
139 protected DFAState computeStartState() {
141 DFAState startState = dfa.newState();
201 protected void findNewDFAStatesAndAddDFATransitions(DFAState d) {
256 DFAState t = reach(d, EOTLabel);
275 DFAState t = reach(d, label);
306 DFAState targetState = addDFAStateToWorkList(t);
408 protected static int addTransition(DFAState d,
410 DFAState targetStat
[all...] |
| H A D | LL1DFA.java | 52 DFAState s0 = newState();
61 DFAState acceptAltState = newState();
78 DFAState s0 = newState();
91 DFAState s = newState();
108 DFAState predDFATarget = getAcceptState(alt);
|
| H A D | DFAState.java | 65 public class DFAState extends State { class in inherits:State
165 public DFAState(DFA dfa) { method in class:DFAState
191 public int addTransition(DFAState target, Label label) {
389 * This is used when we add DFAState objects to the DFA.states Map and
410 * configurations. The DFAState state number is irrelevant.
414 DFAState other = (DFAState)o;
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| H A D | DOTGenerator.java | 74 if ( startState instanceof DFAState ) {
80 walkCreatingDFADOT(dot, (DFAState)startState);
112 DFAState s)
139 if ( edge.target instanceof DFAState &&
140 ((DFAState)edge.target).getAcceptStateReachable()!=DFA.REACHABLE_YES )
151 walkCreatingDFADOT(dot, (DFAState)edge.target); // keep walkin'
294 if ( !edge.isSemanticPredicate() && target instanceof DFAState ) {
297 ((DFAState)target).getGatedPredicatesInNFAConfigurations();
315 if ( s instanceof DFAState ) {
320 if ( s instanceof DFAState ) {
[all...] |
| H A D | GrammarDanglingStateMessage.java | 30 import org.antlr.analysis.DFAState;
43 public DFAState problemState;
46 DFAState problemState)
|
| H A D | RecursionOverflowMessage.java | 30 import org.antlr.analysis.DFAState;
42 public DFAState sampleBadState;
48 DFAState sampleBadState,
|
| H A D | GrammarInsufficientPredicatesMessage.java | 30 import org.antlr.analysis.DFAState;
41 public DFAState problemState;
44 DFAState problemState,
|
| H A D | GrammarNonDeterminismMessage.java | 30 import org.antlr.analysis.DFAState;
45 public DFAState problemState;
48 DFAState problemState)
|
| H A D | FASerializer.java | 166 if ( edge.target instanceof DFAState ) {
169 ((DFAState)edge.target).getGatedPredicatesInNFAConfigurations();
206 if ( s instanceof DFAState ) {
207 stateStr = ":s"+n+"=>"+((DFAState)s).getUniquelyPredictedAlt();
|
| H A D | ErrorManager.java | 31 import org.antlr.analysis.DFAState;
616 DFAState d)
625 DFAState d)
656 DFAState d,
673 DFAState sampleBadState,
|
| H A D | Interpreter.java | 396 DFAState s = dfa.startState;
411 s = (DFAState)t.target;
421 s = (DFAState)eotTransition.target;
|
| H A D | Grammar.java | 1338 for (DFAState s : lookaheadDFA.getUniqueStates().values()) {
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/codegen/ |
| H A D | ACyclicDFACodeGenerator.java | 53 DFAState s,
96 DFAState EOTTarget = null;
104 EOTTarget = (DFAState)edge.target;
132 DFAState target = (DFAState)edge.target;
147 (DFAState)edge.target,
167 // rather than the current DFAState s so the error message
181 (DFAState)predEdge.target,
|
| H A D | CodeGenerator.java | 666 public ST generateSpecialState(DFAState s) {
697 DFAState t = (DFAState)edge.target;
745 DFA dfa = ((DFAState)edge.target).dfa; // which DFA are we in
1278 protected boolean canGenerateSwitch(DFAState s) {
1290 int EOTPredicts = ((DFAState)edge.target).getUniquelyPredictedAlt();
1298 if ( ((DFAState)edge.target).getGatedPredicatesInNFAConfigurations()!=null ) {
|
| /external/antlr/antlr-3.4/lib/ |
| H A D | antlr-3.4-complete.jar | META-INF/ META-INF/MANIFEST.MF org/ org/antlr/ org/antlr/analysis/ org/antlr/codegen/ org/ ... |