forgetest1
/
antlr
forked from jasder/antlr
1
0
Fork 0
Code Issues Pull Requests 1 Releases Wiki Activity

clean up comment 

[git-p4: depot-paths = "//depot/code/antlr4/main/": change = 9553]
This commit is contained in:
parrt 2011-12-10 18:54:52 -08:00
parent b89d7c0932
commit 1923242b37
1 changed files with 4 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
runtime/Java/src/org/antlr/v4/runtime/dfa/DFAState.java
View File

@ -75,8 +75,6 @@ public class DFAState {
@Nullable @Nullable
public DFAState[] edges; public DFAState[] edges;
// public IntervalSet viableChars;
public boolean isAcceptState = false; public boolean isAcceptState = false;
public int prediction; // if accept state, what ttype do we match? is "else" clause if predicated public int prediction; // if accept state, what ttype do we match? is "else" clause if predicated
@ -107,13 +105,14 @@ public class DFAState {
* *
* As an example, we might have: * As an example, we might have:
* *
* predicates = [(p,2), (q,3), (null, 1)] * predicates = [(p,3), (q,4), (null, 2)]
* *
* This means that there are 2 predicates for 3 ambiguous alternatives. * This means that there are 2 predicates for 3 ambiguous alternatives.
* If the first 2 predicates fail, then we default to the last * If the first 2 predicates fail, then we default to the last
* preds value, which is alt 1. This comes from: * PredPrediction pair, which predicts alt 2. This comes from:
* *
* r : A * r : B
* | A
* | {p}? A * | {p}? A
* | {q}? A * | {q}? A
* ; * ;