From c46bce3251e6f57d8b6c85199e476c06c35ecf7a Mon Sep 17 00:00:00 2001 From: Terence Parr Date: Mon, 18 Feb 2013 10:27:58 -0800 Subject: [PATCH] rm bad comment. --- .../Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java | 3 +-- 1 file changed, 1 insertion(+), 2 deletions(-) diff --git a/runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java b/runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java index 3a91b2f95..632158722 100755 --- a/runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java +++ b/runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java @@ -166,8 +166,7 @@ import java.util.Set; When we start in the DFA and reach an accept state that's predicated, we test those and return the minimum semantically viable - alternative. If no alternatives are viable, we throw an exception. We - don't report ambiguities in the DFA, but I'm not sure why anymore. + alternative. If no alternatives are viable, we throw an exception. During full LL ATN simulation, closure always evaluates predicates and on-the-fly. This is crucial to reducing the configuration set size