* src/closure.c, src/print.c, src/reader.c, src/reduce.c:

[bison.git] / src / reduce.c

diff --git a/src/reduce.c b/src/reduce.c
index bef2ae90307d279f78161917446f4ebca66482b6..c5e9381d853fa87146cd64ba026cf19a3de9ad41 100644 (file)
--- a/src/reduce.c
+++ b/src/reduce.c
@@ -72,7 +72,7 @@ useful_production (int i, bitset N0)
   /* A production is useful if all of the nonterminals in its appear
      in the set of useful nonterminals.  */
 
-  for (r = &ritem[rules[i].rhs]; *r >= 0; r++)
+  for (r = rules[i].rhs; *r >= 0; r++)
     if (ISVAR (n = *r) && !bitset_test (N0, n - ntokens))
       return FALSE;
   return TRUE;
@@ -114,7 +114,7 @@ useless_nonterminals (void)
   while (1)
     {
       bitset_copy (Np, N);
-      for (i = 1; i <= nrules; i++)
+      for (i = 1; i < nrules + 1; i++)
        if (!bitset_test (P, i)
            && useful_production (i, N))
          {
@@ -174,13 +174,13 @@ inaccessable_symbols (void)
       while (1)
        {
          bitset_copy (Vp, V);
-         for (i = 1; i <= nrules; i++)
+         for (i = 1; i < nrules + 1; i++)
            {
              if (!bitset_test (Pp, i)
                  && bitset_test (P, i)
                  && bitset_test (V, rules[i].lhs))
                {
-                 for (r = &ritem[rules[i].rhs]; *r >= 0; r++)
+                 for (r = rules[i].rhs; *r >= 0; r++)
                    if (ISTOKEN (t = *r) || bitset_test (N, t - ntokens))
                      bitset_set (Vp, t);
                  bitset_set (Pp, i);
@@ -241,7 +241,7 @@ reduce_grammar_tables (void)
 
        np = 0;
        ni = 0;
-       for (pn = 1; pn <= nrules; pn++)
+       for (pn = 1; pn < nrules + 1; pn++)
          if (bitset_test (P, pn))
            {
              np++;
@@ -252,10 +252,10 @@ reduce_grammar_tables (void)
                  rules[np].prec  = rules[pn].prec;
                  rules[np].assoc = rules[pn].assoc;
                  rules[np].rhs   = rules[pn].rhs;
-                 if (rules[np].rhs != ni)
+                 if (rules[np].rhs - ritem != ni)
                    {
-                     pi = rules[np].rhs;
-                     rules[np].rhs = ni;
+                     pi = rules[np].rhs - ritem;
+                     rules[np].rhs = ritem + ni;
                      while (ritem[pi] >= 0)
                        ritem[ni++] = ritem[pi++];
                      ritem[ni++] = -np;
@@ -281,7 +281,7 @@ reduce_grammar_tables (void)
   if (nuseless_productions > 0)
     {
       int pn;
-      for (pn = 1; pn <= nrules; pn++)
+      for (pn = 1; pn < nrules + 1; pn++)
        rules[pn].useful = bitset_test (P, pn);
     }
 }
@@ -322,7 +322,7 @@ nonterminals_reduce (void)
 
   /* Replace all symbol numbers in valid data structures.  */
 
-  for (i = 1; i <= nrules; i++)
+  for (i = 1; i < nrules + 1; i++)
     {
       rules[i].lhs = nontermmap[rules[i].lhs];
       if (ISVAR (rules[i].precsym))
@@ -378,13 +378,13 @@ reduce_output (FILE *out)
     {
       int i;
       fprintf (out, "%s\n\n", _("Useless rules:"));
-      for (i = 1; i <= nrules; i++)
+      for (i = 1; i < nrules + 1; i++)
        if (!rules[i].useful)
          {
            rule r;
            fprintf (out, "#%-4d  ", i - 1);
            fprintf (out, "%s:", symbols[rules[i].lhs]->tag);
-           for (r = &ritem[rules[i].rhs]; *r >= 0; r++)
+           for (r = rules[i].rhs; *r >= 0; r++)
              fprintf (out, " %s", symbols[*r]->tag);
            fputs (";\n", out);
          }
@@ -411,28 +411,28 @@ dump_grammar (FILE *out)
   fprintf (out, "\n\n");
   fprintf (out, "Rules\n-----\n\n");
   fprintf (out, "Num (Prec, Assoc, Useful, Ritem Range) Lhs -> Rhs (Ritem range) [Num]\n");
-  for (i = 1; i <= nrules; i++)
+  for (i = 1; i < nrules + 1; i++)
     {
       int rhs_count = 0;
       /* Find the last RHS index in ritems. */
-      for (r = &ritem[rules[i].rhs]; *r >= 0; ++r)
+      for (r = rules[i].rhs; *r >= 0; ++r)
        ++rhs_count;
       fprintf (out, "%3d (%2d, %2d, %2d, %2d-%2d)   %2d ->",
               i - 1,
               rules[i].prec, rules[i].assoc, rules[i].useful,
-              rules[i].rhs, rules[i].rhs + rhs_count - 1,
+              rules[i].rhs - ritem, rules[i].rhs - ritem + rhs_count - 1,
               rules[i].lhs);
       /* Dumped the RHS. */
-      for (r = &ritem[rules[i].rhs]; *r >= 0; r++)
+      for (r = rules[i].rhs; *r >= 0; r++)
        fprintf (out, "%3d", *r);
       fprintf (out, "  [%d]\n", -(*r) - 1);
     }
   fprintf (out, "\n\n");
   fprintf (out, "Rules interpreted\n-----------------\n\n");
-  for (i = 1; i <= nrules; i++)
+  for (i = 1; i < nrules + 1; i++)
     {
       fprintf (out, "%-5d  %s :", i, symbols[rules[i].lhs]->tag);
-      for (r = &ritem[rules[i].rhs]; *r >= 0; r++)
+      for (r = rules[i].rhs; *r >= 0; r++)
        fprintf (out, " %s", symbols[*r]->tag);
       fputc ('\n', out);
     }
@@ -490,7 +490,6 @@ reduce_grammar (void)
   inaccessable_symbols ();
 
   reduced = (bool) (nuseless_nonterminals + nuseless_productions > 0);
-
   if (!reduced)
     return;