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

[bison.git] / src / gram.c

diff --git a/src/gram.c b/src/gram.c
index f58ac3b5aea2fc1964e4cb566f8284e9140127f6..f6cc3c5d87a86a4fc86a90c9025cb8170e01daee 100644 (file)
--- a/src/gram.c
+++ b/src/gram.c
@@ -1,6 +1,6 @@
 /* Allocate input grammar variables for Bison.
 
 /* Allocate input grammar variables for Bison.
 

-   Copyright (C) 1984, 1986, 1989, 2001-2003, 2005-2012 Free Software
+   Copyright (C) 1984, 1986, 1989, 2001-2003, 2005-2013 Free Software

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


@@ -47,48 +47,41 @@ symbol_number *token_translations = NULL;
 int max_user_token_number = 256;
 
 bool
 int max_user_token_number = 256;
 
 bool

-rule_useful_in_grammar_p (rule *r)
+rule_useful_in_grammar_p (rule const *r)

 {
   return r->number < nrules;
 }
 
 bool
 {
   return r->number < nrules;
 }
 
 bool

-rule_useless_in_grammar_p (rule *r)
+rule_useless_in_grammar_p (rule const *r)

 {
   return !rule_useful_in_grammar_p (r);
 }
 
 bool
 {
   return !rule_useful_in_grammar_p (r);
 }
 
 bool

-rule_useless_in_parser_p (rule *r)
+rule_useless_in_parser_p (rule const *r)

 {
   return !r->useful && rule_useful_in_grammar_p (r);
 }
 
 void
 {
   return !r->useful && rule_useful_in_grammar_p (r);
 }
 
 void

-rule_lhs_print (rule *r, symbol *previous_lhs, FILE *out)
+rule_lhs_print (rule const *r, symbol const *previous_lhs, FILE *out)

 {
   fprintf (out, "  %3d ", r->number);
   if (previous_lhs != r->lhs)
 {
   fprintf (out, "  %3d ", r->number);
   if (previous_lhs != r->lhs)

-    {
-      fprintf (out, "%s:", r->lhs->tag);
-    }
+    fprintf (out, "%s:", r->lhs->tag);

   else
   else

-    {
-      int n;
-      for (n = strlen (previous_lhs->tag); n > 0; --n)
-        fputc (' ', out);
-      fputc ('|', out);
-    }
+    fprintf (out, "%*s|", (int) strlen (previous_lhs->tag), "");

 }
 
 void
 }
 
 void

-rule_lhs_print_xml (rule *r, FILE *out, int level)
+rule_lhs_print_xml (rule const *r, FILE *out, int level)

 {
   xml_printf (out, level, "<lhs>%s</lhs>", r->lhs->tag);
 }
 
 size_t
 {
   xml_printf (out, level, "<lhs>%s</lhs>", r->lhs->tag);
 }
 
 size_t

-rule_rhs_length (rule *r)
+rule_rhs_length (rule const *r)

 {
   size_t res = 0;
   item_number *rhsp;
 {
   size_t res = 0;
   item_number *rhsp;


@@ -98,22 +91,20 @@ rule_rhs_length (rule *r)
 }
 
 void
 }
 
 void

-rule_rhs_print (rule *r, FILE *out)
+rule_rhs_print (rule const *r, FILE *out)

 {
 {

-  if (*r->rhs >= 0)
+  if (0 <= *r->rhs)

     {
       item_number *rp;
       for (rp = r->rhs; *rp >= 0; rp++)
         fprintf (out, " %s", symbols[*rp]->tag);
     }
   else
     {
       item_number *rp;
       for (rp = r->rhs; *rp >= 0; rp++)
         fprintf (out, " %s", symbols[*rp]->tag);
     }
   else

-    {
-      fprintf (out, " /* %s */", _("empty"));
-    }
+    fputs (" %empty", out);

 }
 
 static void
 }
 
 static void

-rule_rhs_print_xml (rule *r, FILE *out, int level)
+rule_rhs_print_xml (rule const *r, FILE *out, int level)

 {
   if (*r->rhs >= 0)
     {
 {
   if (*r->rhs >= 0)
     {


@@ -132,13 +123,6 @@ rule_rhs_print_xml (rule *r, FILE *out, int level)
     }
 }
 
     }
 }
 

-static void
-rule_print (rule *r, FILE *out)
-{
-  fprintf (out, "%s:", r->lhs->tag);
-  rule_rhs_print (r, out);
-}
-

 void
 ritem_print (FILE *out)
 {
 void
 ritem_print (FILE *out)
 {


@@ -263,10 +247,12 @@ grammar_dump (FILE *out, const char *title)
   fprintf (out, "Rules\n-----\n\n");
   {
     rule_number i;
   fprintf (out, "Rules\n-----\n\n");
   {
     rule_number i;

-    fprintf (out, "Num (Prec, Assoc, Useful, Ritem Range) Lhs -> Rhs (Ritem range) [Num]\n");
+    fprintf (out,
+             "Num (Prec, Assoc, Useful, Ritem Range) Lhs"
+             " -> Rhs (Ritem range) [Num]\n");

     for (i = 0; i < nrules + nuseless_productions; i++)
       {
     for (i = 0; i < nrules + nuseless_productions; i++)
       {

-        rule *rule_i = &rules[i];
+        rule const *rule_i = &rules[i];

         item_number *rp = NULL;
         unsigned int rhs_itemno = rule_i->rhs - ritem;
         unsigned int rhs_count = 0;
         item_number *rp = NULL;
         unsigned int rhs_itemno = rule_i->rhs - ritem;
         unsigned int rhs_count = 0;


@@ -294,8 +280,8 @@ grammar_dump (FILE *out, const char *title)
     rule_number r;
     for (r = 0; r < nrules + nuseless_productions; r++)
       {
     rule_number r;
     for (r = 0; r < nrules + nuseless_productions; r++)
       {

-        fprintf (out, "%-5d  ", r);
-        rule_print (&rules[r], out);
+        fprintf (out, "%-5d  %s:", r, rules[r].lhs->tag);
+        rule_rhs_print (&rules[r], out);

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


@@ -305,19 +291,10 @@ grammar_dump (FILE *out, const char *title)
 void
 grammar_rules_useless_report (const char *message)
 {
 void
 grammar_rules_useless_report (const char *message)
 {

-  warnings w = Wother;
-  if (warnings_flag & w)
-    {
-      rule_number r;
-      for (r = 0; r < nrules ; ++r)
-        if (!rules[r].useful)
-          {
-            complain (&rules[r].location, w | silent, "%s: ", message);
-            rule_print (&rules[r], stderr);
-            warnings_print_categories (w);
-            fprintf (stderr, "\n");
-          }
-    }
+  rule_number r;
+  for (r = 0; r < nrules ; ++r)
+    if (!rules[r].useful)
+      complain (&rules[r].location, Wother, "%s", message);

 }
 
 void
 }
 
 void