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

rm bad comment.

This commit is contained in:
Terence Parr 2013-02-18 10:27:58 -08:00
parent adf80e166a
commit c46bce3251
1 changed files with 1 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java
View File

@ -166,8 +166,7 @@ import java.util.Set;
When we start in the DFA and reach an accept state that's predicated, When we start in the DFA and reach an accept state that's predicated,
we test those and return the minimum semantically viable we test those and return the minimum semantically viable
alternative. If no alternatives are viable, we throw an exception. We alternative. If no alternatives are viable, we throw an exception.
don't report ambiguities in the DFA, but I'm not sure why anymore.
During full LL ATN simulation, closure always evaluates predicates and During full LL ATN simulation, closure always evaluates predicates and
on-the-fly. This is crucial to reducing the configuration set size on-the-fly. This is crucial to reducing the configuration set size