X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/cd08e51edafa326fd8a6327f0b659fdbceb24dda..f377f69fec28013c79db4efe12bbb9d48987fb2c:/src/conflicts.c

diff --git a/src/conflicts.c b/src/conflicts.c
index 1c24d7e2..24f27cc8 100644
--- a/src/conflicts.c
+++ b/src/conflicts.c
@@ -451,15 +451,10 @@ void
 conflicts_output (FILE *out)
 {
   bool printed_sth = FALSE;
-  bool *used_rules = XCALLOC (bool, nrules);
   state_number_t i;
   for (i = 0; i < nstates; i++)
     {
       state_t *s = states[i];
-      reductions_t *reds = s->reductions;
-      int j;
-      for (j = 0; j < reds->num; ++j)
-	used_rules[reds->rules[j]->number] = TRUE;
       if (conflicts[i])
 	{
 	  fprintf (out, _("State %d contains "), i);
@@ -471,23 +466,6 @@ conflicts_output (FILE *out)
     }
   if (printed_sth)
     fputs ("\n\n", out);
-
-  for (i = 0; i < nstates; i++)
-    {
-      state_t *s = states[i];
-      reductions_t *r = s->reductions;
-      int j;
-      for (j = 0; j < r->num; ++j)
-	if (!used_rules[r->rules[j]->number])
-	  {
-	    LOCATION_PRINT (stderr, r->rules[j]->location);
-	    fprintf (stderr, ": %s: %s: ",
-		     _("warning"),
-		     _("rule never reduced because of conflicts"));
-	    rule_print (r->rules[j], stderr);
-	  }
-    }
-  free (used_rules);
 }
 
 /*--------------------------------------------------------.