style: use %code for local function declarations in our parser

[bison.git] / src / reduce.c

diff --git a/src/reduce.c b/src/reduce.c
index 2d01255c375ec7647e99c850a046596afff76444..eea11b1e20345158c318f2403b2a33f039ce20a1 100644 (file)
--- a/src/reduce.c
+++ b/src/reduce.c
@@ -1,7 +1,7 @@
 /* Grammar reduction for Bison.
 
 /* Grammar reduction for Bison.
 

-   Copyright (C) 1988, 1989, 2000, 2001, 2002, 2003, 2005, 2006,
-   2007 Free Software Foundation, Inc.
+   Copyright (C) 1988-1989, 2000-2003, 2005-2013 Free Software
+   Foundation, Inc.

 
    This file is part of Bison, the GNU Compiler Compiler.
 
 
    This file is part of Bison, the GNU Compiler Compiler.
 


@@ -29,7 +29,6 @@
 #include "system.h"
 
 #include <bitset.h>
 #include "system.h"
 
 #include <bitset.h>

-#include <quotearg.h>

 
 #include "complain.h"
 #include "files.h"
 
 #include "complain.h"
 #include "files.h"


@@ -50,7 +49,7 @@ static bitset P;
 static bitset V;
 
 /* Set of symbols used to define rule precedence (so they are
 static bitset V;
 
 /* Set of symbols used to define rule precedence (so they are

-   `useless', but no warning should be issued).  */
+   'useless', but no warning should be issued).  */

 static bitset V1;
 
 static rule_number nuseful_productions;
 static bitset V1;
 
 static rule_number nuseful_productions;


@@ -115,14 +114,14 @@ useless_nonterminals (void)
     {
       bitset_copy (Np, N);
       for (r = 0; r < nrules; r++)
     {
       bitset_copy (Np, N);
       for (r = 0; r < nrules; r++)

-       if (!bitset_test (P, r)
-           && useful_production (r, N))
-         {
-           bitset_set (Np, rules[r].lhs->number - ntokens);
-           bitset_set (P, r);
-         }
+        if (!bitset_test (P, r)
+            && useful_production (r, N))
+          {
+            bitset_set (Np, rules[r].lhs->number - ntokens);
+            bitset_set (P, r);
+          }

       if (bitset_equal_p (N, Np))
       if (bitset_equal_p (N, Np))

-       break;
+        break;

       Ns = Np;
       Np = N;
       N = Ns;
       Ns = Np;
       Np = N;
       N = Ns;


@@ -169,37 +168,37 @@ inaccessable_symbols (void)
       bitset_set (V, accept->number);
 
       while (1)
       bitset_set (V, accept->number);
 
       while (1)

-       {
-         rule_number r;
-         bitset_copy (Vp, V);
-         for (r = 0; r < nrules; r++)
-           {
-             if (!bitset_test (Pp, r)
-                 && bitset_test (P, r)
-                 && bitset_test (V, rules[r].lhs->number))
-               {
-                 item_number *rhsp;
-                 for (rhsp = rules[r].rhs; *rhsp >= 0; rhsp++)
-                   if (ISTOKEN (*rhsp) || bitset_test (N, *rhsp - ntokens))
-                     bitset_set (Vp, *rhsp);
-                 bitset_set (Pp, r);
-               }
-           }
-         if (bitset_equal_p (V, Vp))
-           break;
-         Vs = Vp;
-         Vp = V;
-         V = Vs;
-       }
+        {
+          rule_number r;
+          bitset_copy (Vp, V);
+          for (r = 0; r < nrules; r++)
+            {
+              if (!bitset_test (Pp, r)
+                  && bitset_test (P, r)
+                  && bitset_test (V, rules[r].lhs->number))
+                {
+                  item_number *rhsp;
+                  for (rhsp = rules[r].rhs; *rhsp >= 0; rhsp++)
+                    if (ISTOKEN (*rhsp) || bitset_test (N, *rhsp - ntokens))
+                      bitset_set (Vp, *rhsp);
+                  bitset_set (Pp, r);
+                }
+            }
+          if (bitset_equal_p (V, Vp))
+            break;
+          Vs = Vp;
+          Vp = V;
+          V = Vs;
+        }

     }
 
   bitset_free (V);
   V = Vp;
 
   /* Tokens 0, 1, and 2 are internal to Bison.  Consider them useful. */
     }
 
   bitset_free (V);
   V = Vp;
 
   /* Tokens 0, 1, and 2 are internal to Bison.  Consider them useful. */

-  bitset_set (V, endtoken->number);            /* end-of-input token */
-  bitset_set (V, errtoken->number);            /* error token */
-  bitset_set (V, undeftoken->number);          /* some undefined token */
+  bitset_set (V, endtoken->number);             /* end-of-input token */
+  bitset_set (V, errtoken->number);             /* error token */
+  bitset_set (V, undeftoken->number);           /* some undefined token */

 
   bitset_free (P);
   P = Pp;
 
   bitset_free (P);
   P = Pp;


@@ -212,7 +211,7 @@ inaccessable_symbols (void)
     symbol_number i;
     for (i = ntokens; i < nsyms; i++)
       if (bitset_test (V, i))
     symbol_number i;
     for (i = ntokens; i < nsyms; i++)
       if (bitset_test (V, i))

-       nuseful_nonterminals++;
+        nuseful_nonterminals++;

   }
   nuseless_nonterminals = nvars - nuseful_nonterminals;
 
   }
   nuseless_nonterminals = nvars - nuseful_nonterminals;
 


@@ -221,7 +220,7 @@ inaccessable_symbols (void)
     rule_number r;
     for (r = 0; r < nrules; ++r)
       if (rules[r].precsym != 0)
     rule_number r;
     for (r = 0; r < nrules; ++r)
       if (rules[r].precsym != 0)

-       bitset_set (V1, rules[r].precsym->number);
+        bitset_set (V1, rules[r].precsym->number);

   }
 }
 
   }
 }
 


@@ -257,11 +256,11 @@ reduce_grammar_tables (void)
     /* Renumber the rules markers in RITEMS.  */
     for (r = 0; r < nrules; ++r)
       {
     /* Renumber the rules markers in RITEMS.  */
     for (r = 0; r < nrules; ++r)
       {

-       item_number *rhsp = rules[r].rhs;
-       for (/* Nothing. */; *rhsp >= 0; ++rhsp)
-         /* Nothing. */;
-       *rhsp = rule_number_as_item_number (r);
-       rules[r].number = r;
+        item_number *rhsp = rules[r].rhs;
+        for (/* Nothing. */; *rhsp >= 0; ++rhsp)
+          /* Nothing. */;
+        *rhsp = rule_number_as_item_number (r);
+        rules[r].number = r;

       }
     nrules -= nuseless_productions;
   }
       }
     nrules -= nuseless_productions;
   }


@@ -272,8 +271,8 @@ reduce_grammar_tables (void)
     int length;
     for (r = nrules; r < nrules + nuseless_productions; ++r)
       {
     int length;
     for (r = nrules; r < nrules + nuseless_productions; ++r)
       {

-       length = rule_rhs_length (&rules[r]);
-       nritems -= length + 1;
+        length = rule_rhs_length (&rules[r]);
+        nritems -= length + 1;

       }
   }
 }
       }
   }
 }


@@ -286,22 +285,23 @@ reduce_grammar_tables (void)
 static void
 nonterminals_reduce (void)
 {
 static void
 nonterminals_reduce (void)
 {

-  symbol_number i, n;
-

   /* Map the nonterminals to their new index: useful first, useless
      afterwards.  Kept for later report.  */
 
   symbol_number *nontermmap = xnmalloc (nvars, sizeof *nontermmap);
   /* Map the nonterminals to their new index: useful first, useless
      afterwards.  Kept for later report.  */
 
   symbol_number *nontermmap = xnmalloc (nvars, sizeof *nontermmap);

-  n = ntokens;
+  symbol_number n = ntokens;
+  symbol_number i;

   for (i = ntokens; i < nsyms; i++)
     if (bitset_test (V, i))
       nontermmap[i - ntokens] = n++;
   for (i = ntokens; i < nsyms; i++)
     if (!bitset_test (V, i))
       {
   for (i = ntokens; i < nsyms; i++)
     if (bitset_test (V, i))
       nontermmap[i - ntokens] = n++;
   for (i = ntokens; i < nsyms; i++)
     if (!bitset_test (V, i))
       {

-       nontermmap[i - ntokens] = n++;
-       warn_at (symbols[i]->location, _("nonterminal useless in grammar: %s"),
-                symbols[i]->tag);
+        nontermmap[i - ntokens] = n++;
+        if (symbols[i]->status != used)
+          complain (&symbols[i]->location, Wother,
+                    _("nonterminal useless in grammar: %s"),
+                    symbols[i]->tag);

       }
 
 
       }
 
 


@@ -322,11 +322,11 @@ nonterminals_reduce (void)
     rule_number r;
     for (r = 0; r < nrules; ++r)
       {
     rule_number r;
     for (r = 0; r < nrules; ++r)
       {

-       item_number *rhsp;
-       for (rhsp = rules[r].rhs; *rhsp >= 0; ++rhsp)
-         if (ISVAR (*rhsp))
-           *rhsp =  symbol_number_as_item_number (nontermmap[*rhsp
-                                                             - ntokens]);
+        item_number *rhsp;
+        for (rhsp = rules[r].rhs; *rhsp >= 0; ++rhsp)
+          if (ISVAR (*rhsp))
+            *rhsp =  symbol_number_as_item_number (nontermmap[*rhsp
+                                                              - ntokens]);

       }
     accept->number = nontermmap[accept->number - ntokens];
   }
       }
     accept->number = nontermmap[accept->number - ntokens];
   }


@@ -350,7 +350,7 @@ reduce_output (FILE *out)
       int i;
       fprintf (out, "%s\n\n", _("Nonterminals useless in grammar"));
       for (i = 0; i < nuseless_nonterminals; ++i)
       int i;
       fprintf (out, "%s\n\n", _("Nonterminals useless in grammar"));
       for (i = 0; i < nuseless_nonterminals; ++i)

-       fprintf (out, "   %s\n", symbols[nsyms + i]->tag);
+        fprintf (out, "   %s\n", symbols[nsyms + i]->tag);

       fputs ("\n\n", out);
     }
 
       fputs ("\n\n", out);
     }
 


@@ -358,78 +358,20 @@ reduce_output (FILE *out)
     bool b = false;
     int i;
     for (i = 0; i < ntokens; i++)
     bool b = false;
     int i;
     for (i = 0; i < ntokens; i++)

-      if (!bitset_test (V, i) && !bitset_test (V1, i))
-       {
-         if (!b)
-           fprintf (out, "%s\n\n", _("Terminals which are not used"));
-         b = true;
-         fprintf (out, "   %s\n", symbols[i]->tag);
-       }
+      if (reduce_token_unused_in_grammar (i))
+        {
+          if (!b)
+            fprintf (out, "%s\n\n", _("Terminals unused in grammar"));
+          b = true;
+          fprintf (out, "   %s\n", symbols[i]->tag);
+        }

     if (b)
       fputs ("\n\n", out);
   }
 
   if (nuseless_productions > 0)
     grammar_rules_partial_print (out, _("Rules useless in grammar"),
     if (b)
       fputs ("\n\n", out);
   }
 
   if (nuseless_productions > 0)
     grammar_rules_partial_print (out, _("Rules useless in grammar"),

-                                rule_useless_in_grammar_p);
-}
-\f
-
-/*--------------------------------------------------------------.
-| Output the detailed results of the reductions.  For FILE.xml. |
-`---------------------------------------------------------------*/
-
-void
-reduce_xml (FILE *out, int level)
-{
-  fputc ('\n', out);
-  xml_puts (out, level, "<reductions>");
-  xml_puts (out, level + 1, "<useless-in-grammar>");
-
-  if (nuseless_nonterminals > 0)
-    {
-      int i;
-      xml_puts (out, level + 2, "<nonterminals>");
-      for (i = 0; i < nuseless_nonterminals; ++i)
-       xml_printf (out, level + 3,
-                   "<nonterminal>%s</nonterminal>",
-                   symbols[nsyms + i]->tag);
-      xml_puts (out, level + 2, "</nonterminals>");
-    }
-  else
-    xml_puts (out, level + 2, "<nonterminals/>");
-
-  if (nuseless_productions > 0)
-    grammar_rules_partial_print_xml (out, level + 1, true,
-                                     rule_useless_in_grammar_p);
-  else
-    xml_puts (out, level + 2, "<rules/>");
-
-  xml_puts (out, level + 1, "</useless-in-grammar>");
-  xml_puts (out, level + 1, "<unused>");
-
-  {
-    bool b = false;
-    int i;
-    for (i = 0; i < ntokens; i++)
-      if (!bitset_test (V, i) && !bitset_test (V1, i))
-       {
-         if (!b)
-           xml_puts (out, level + 2, "<terminals>");
-         b = true;
-         xml_printf (out, level + 3,
-                     "<terminal>%s</terminal>",
-                     xml_escape (symbols[i]->tag));
-       }
-    if (b)
-      xml_puts (out, level + 2, "</terminals>");
-    else
-      xml_puts (out, level + 2, "<terminals/>");
-  }
-
-  xml_puts (out, level + 1, "</unused>");
-  xml_puts (out, level, "</reductions>");
-  fputc ('\n', out);
+                                 rule_useless_in_grammar_p);

 }
 \f
 
 }
 \f
 


@@ -440,26 +382,16 @@ reduce_xml (FILE *out, int level)
 static void
 reduce_print (void)
 {
 static void
 reduce_print (void)
 {

-  fprintf (stderr, "%s: %s: ", grammar_file, _("warning"));
-

   if (nuseless_nonterminals > 0)
   if (nuseless_nonterminals > 0)

-    fprintf (stderr, ngettext ("%d nonterminal",
-                              "%d nonterminals",
-                              nuseless_nonterminals),
-            nuseless_nonterminals);
-
-  if (nuseless_nonterminals > 0 && nuseless_productions > 0)
-    fprintf (stderr, _(" and "));
-
+    complain (NULL, Wother, ngettext ("%d nonterminal useless in grammar",
+                                      "%d nonterminals useless in grammar",
+                                      nuseless_nonterminals),
+              nuseless_nonterminals);

   if (nuseless_productions > 0)
   if (nuseless_productions > 0)

-    fprintf (stderr, ngettext ("%d rule",
-                              "%d rules",
-                              nuseless_productions),
-            nuseless_productions);
-
-  if (nuseless_nonterminals > 0 || nuseless_productions > 0)
-    fprintf (stderr, _(" useless in grammar"));
-  fprintf (stderr, "\n");
+    complain (NULL, Wother, ngettext ("%d rule useless in grammar",
+                                      "%d rules useless in grammar",
+                                      nuseless_productions),
+              nuseless_productions);

 }
 \f
 void
 }
 \f
 void


@@ -484,9 +416,9 @@ reduce_grammar (void)
   reduce_print ();
 
   if (!bitset_test (N, accept->number - ntokens))
   reduce_print ();
 
   if (!bitset_test (N, accept->number - ntokens))

-    fatal_at (startsymbol_location,
-             _("start symbol %s does not derive any sentence"),
-             startsymbol->tag);
+    complain (&startsymbol_location, fatal,
+              _("start symbol %s does not derive any sentence"),
+              startsymbol->tag);

 
   /* First reduce the nonterminals, as they renumber themselves in the
      whole grammar.  If you change the order, nonterms would be
 
   /* First reduce the nonterminals, as they renumber themselves in the
      whole grammar.  If you change the order, nonterms would be


@@ -500,12 +432,25 @@ reduce_grammar (void)
     {
       grammar_dump (stderr, "Reduced Grammar");
 
     {
       grammar_dump (stderr, "Reduced Grammar");
 

-      fprintf (stderr, "reduced %s defines %d terminals, %d nonterminals\
-, and %d productions.\n",
-              grammar_file, ntokens, nvars, nrules);
+      fprintf (stderr, "reduced %s defines %d terminals, %d nonterminals"
+               ", and %d productions.\n",
+               grammar_file, ntokens, nvars, nrules);

     }
 }
 
     }
 }
 

+bool
+reduce_token_unused_in_grammar (symbol_number i)
+{
+  aver (i < ntokens);
+  return !bitset_test (V, i) && !bitset_test (V1, i);
+}
+
+bool
+reduce_nonterminal_useless_in_grammar (symbol_number i)
+{
+  aver (ntokens <= i && i < nsyms + nuseless_nonterminals);
+  return nsyms <= i;
+}

 
 /*-----------------------------------------------------------.
 | Free the global sets used to compute the reduced grammar.  |
 
 /*-----------------------------------------------------------.
 | Free the global sets used to compute the reduced grammar.  |