* src/closure.c (print_firsts, print_fderives, closure):

[bison.git] / src / print.c

diff --git a/src/print.c b/src/print.c
index 927d2beec7c5849230905fdb04c8363d08c7e3fc..021cb4837ac6fcc12e638417f84827e94f2de159 100644 (file)
--- a/src/print.c
+++ b/src/print.c
@@ -208,13 +208,13 @@ print_reductions (FILE *out, state_t *state)
 
       bitset_and (lookaheadset, state->lookaheads[0], shiftset);
 
-      for (i = 0; i < ntokens; i++)
-       if (bitset_test (lookaheadset, i))
-         fprintf (out, _("    %-4s\t[reduce using rule %d (%s)]\n"),
-                  symbol_tag_get (symbols[i]),
-                  default_rule->number - 1,
-                  symbol_tag_get_n (default_rule->lhs, 1));
-
+      BITSET_EXECUTE (lookaheadset, 0, i,
+      {
+       fprintf (out, _("    %-4s\t[reduce using rule %d (%s)]\n"),
+                symbol_tag_get (symbols[i]),
+                default_rule->number - 1,
+                symbol_tag_get_n (default_rule->lhs, 1));
+      });
       fprintf (out, _("    $default\treduce using rule %d (%s)\n\n"),
               default_rule->number - 1,
               symbol_tag_get (default_rule->lhs));
@@ -229,13 +229,9 @@ print_reductions (FILE *out, state_t *state)
        for (i = 0; i < state->nlookaheads; ++i)
          {
            int count = 0;
-           int j;
 
            bitset_andn (lookaheadset, state->lookaheads[i], shiftset);
-
-           for (j = 0; j < ntokens; j++)
-             if (bitset_test (lookaheadset, j))
-               count++;
+           count = bitset_count (lookaheadset);
 
            if (count > cmax)
              {
@@ -354,7 +350,6 @@ static void
 print_grammar (FILE *out)
 {
   symbol_number_t i;
-  item_number_t *rule;
   char buffer[90];
   int column = 0;
 
@@ -366,7 +361,9 @@ print_grammar (FILE *out)
     if (token_translations[i] != undeftoken->number)
       {
        const char *tag = symbol_tag_get (symbols[token_translations[i]]);
-       int r;
+       rule_number_t r;
+       item_number_t *rhsp;
+
        buffer[0] = 0;
        column = strlen (tag);
        fputs (tag, out);
@@ -374,8 +371,8 @@ print_grammar (FILE *out)
        sprintf (buffer, " (%d)", i);
 
        for (r = 1; r < nrules + 1; r++)
-         for (rule = rules[r].rhs; *rule >= 0; rule++)
-           if (item_number_as_symbol_number (*rule) == token_translations[i])
+         for (rhsp = rules[r].rhs; *rhsp >= 0; rhsp++)
+           if (item_number_as_symbol_number (*rhsp) == token_translations[i])
              {
                END_TEST (65);
                sprintf (buffer + strlen (buffer), " %d", r - 1);
@@ -390,15 +387,16 @@ print_grammar (FILE *out)
   for (i = ntokens; i < nsyms; i++)
     {
       int left_count = 0, right_count = 0;
-      int r;
+      rule_number_t r;
       const char *tag = symbol_tag_get (symbols[i]);
 
       for (r = 1; r < nrules + 1; r++)
        {
+         item_number_t *rhsp;
          if (rules[r].lhs->number == i)
            left_count++;
-         for (rule = rules[r].rhs; *rule >= 0; rule++)
-           if (item_number_as_symbol_number (*rule) == i)
+         for (rhsp = rules[r].rhs; *rhsp >= 0; rhsp++)
+           if (item_number_as_symbol_number (*rhsp) == i)
              {
                right_count++;
                break;
@@ -432,8 +430,9 @@ print_grammar (FILE *out)
          sprintf (buffer + strlen (buffer), _(" on right:"));
          for (r = 1; r < nrules + 1; r++)
            {
-             for (rule = rules[r].rhs; *rule >= 0; rule++)
-               if (item_number_as_symbol_number (*rule) == i)
+             item_number_t *rhsp;
+             for (rhsp = rules[r].rhs; *rhsp >= 0; rhsp++)
+               if (item_number_as_symbol_number (*rhsp) == i)
                  {
                    END_TEST (65);
                    sprintf (buffer + strlen (buffer), " %d", r - 1);