From d67e0d6a56117b4f9c9ad3d32ac464f4fd533364 Mon Sep 17 00:00:00 2001
From: parrt <parrt@antlr.org>
Date: Thu, 1 Apr 2010 15:50:59 -0800
Subject: [PATCH] removed unused recursion errors

[git-p4: depot-paths = "//depot/code/antlr4/main/": change = 6785]
---
 .../org/antlr/v4/tool/templates/messages/languages/en.stg     | 4 ++++
 1 file changed, 4 insertions(+)

diff --git a/tool/resources/org/antlr/v4/tool/templates/messages/languages/en.stg b/tool/resources/org/antlr/v4/tool/templates/messages/languages/en.stg
index c33bf3a0a..1017e1c86 100644
--- a/tool/resources/org/antlr/v4/tool/templates/messages/languages/en.stg
+++ b/tool/resources/org/antlr/v4/tool/templates/messages/languages/en.stg
@@ -276,17 +276,21 @@ ANALYSIS_TIMEOUT(arg) ::= <<
 ANTLR could not analyze this decision in rule <arg.enclosingRule>; often this is because of recursive rule references visible from the left edge of alternatives.  ANTLR will re-analyze the decision with a fixed lookahead of k=1.  Consider using "options {k=1;}" for that decision and possibly adding a syntactic predicate 
 >>
 
+/*
 RECURSION_OVERFLOW(arg) ::= <<
 Recursion overflow to <arg.targetRule.name> from alternative <arg.alt> of <arg.sourceRule.name> after matching input such as <arg.input>
 >>
+*/
 
 LEFT_RECURSION_CYCLES(arg) ::= <<
 The following sets of rules are mutually left-recursive <arg:{c| [<c:{r|<r.name>}; separator=", ">]}; separator=" and ">
 >>
 
+/*
 MULTIPLE_RECURSIVE_ALTS(arg) ::= <<
 [fatal] rule <arg.ruleName> has non-LL(*) decision due to recursive rule invocations reachable from alts <arg.alts; separator=",">.  Resolve by left-factoring or using syntactic predicates or using backtrack=true option.
 >>
+*/
 
 UNREACHABLE_TOKENS(tokens) ::= <<
 The following token definitions can never be matched because prior tokens match the same input: <tokens; separator=",">