Merge remote-tracking branch 'origin/maint'

[bison.git] / src / print_graph.c

diff --git a/src/print_graph.c b/src/print_graph.c
index 61aa1e3cc29a6ca2029af328ce5bb9513522c64e..918a3df8937e94686c5f9d4efb3b90a90896d538 100644 (file)
--- a/src/print_graph.c
+++ b/src/print_graph.c
@@ -18,7 +18,6 @@
    along with this program.  If not, see <http://www.gnu.org/licenses/>.  */
 
 #include <config.h>
    along with this program.  If not, see <http://www.gnu.org/licenses/>.  */
 
 #include <config.h>

-#include <quotearg.h>

 #include "system.h"
 
 #include "LR0.h"
 #include "system.h"
 
 #include "LR0.h"


@@ -40,11 +39,33 @@
 | Construct the node labels.  |
 `----------------------------*/
 
 | Construct the node labels.  |
 `----------------------------*/
 

+/* Print the lhs of a rule in such a manner that there is no vertical
+   repetition, like in *.output files. */
+
+static void
+print_lhs (struct obstack *oout, rule *previous_rule, rule *r)
+{
+  if (previous_rule && STREQ (previous_rule->lhs->tag, r->lhs->tag))
+    {
+      int i;
+      for (i = 0; i < strlen (r->lhs->tag); ++i)
+        obstack_1grow (oout, ' ');
+      obstack_1grow (oout, '|');
+    }
+  else
+    {
+      obstack_sgrow (oout, escape (r->lhs->tag));
+      obstack_1grow (oout, ':');
+    }
+  obstack_1grow (oout, ' ');
+}
+

 static void
 print_core (struct obstack *oout, state *s)
 {
 static void
 print_core (struct obstack *oout, state *s)
 {

-  size_t i;

   item_number *sitems = s->items;
   item_number *sitems = s->items;

+  rule *previous_rule = NULL;
+  size_t i;

   size_t snritems = s->nitems;
 
   /* Output all the items of a state, not only its kernel.  */
   size_t snritems = s->nitems;
 
   /* Output all the items of a state, not only its kernel.  */


@@ -70,12 +91,14 @@ print_core (struct obstack *oout, state *s)
 
       r = item_number_as_rule_number (*sp);
 
 
       r = item_number_as_rule_number (*sp);
 

-      obstack_printf (oout, "%d: %s ->", r, escape (rules[r].lhs->tag));
+      obstack_printf (oout, "%3d ", r);
+      print_lhs (oout, previous_rule, &rules[r]);
+      previous_rule = &rules[r];

 
       for (sp = rules[r].rhs; sp < sp1; sp++)
 
       for (sp = rules[r].rhs; sp < sp1; sp++)

-        obstack_printf (oout, " %s", escape (symbols[*sp]->tag));
+        obstack_printf (oout, "%s ", escape (symbols[*sp]->tag));

 
 

-      obstack_sgrow (oout, " .");
+      obstack_1grow (oout, '.');

 
       for (/* Nothing */; *sp >= 0; ++sp)
         obstack_printf (oout, " %s", escape (symbols[*sp]->tag));
 
       for (/* Nothing */; *sp >= 0; ++sp)
         obstack_printf (oout, " %s", escape (symbols[*sp]->tag));


@@ -129,21 +152,21 @@ print_actions (state const *s, FILE *fgraph)
   for (i = 0; i < trans->num; i++)
     if (!TRANSITION_IS_DISABLED (trans, i))
       {
   for (i = 0; i < trans->num; i++)
     if (!TRANSITION_IS_DISABLED (trans, i))
       {

-       state *s1 = trans->states[i];
-       symbol_number sym = s1->accessing_symbol;
-
-       /* Shifts are solid, gotos are dashed, and error is dotted.  */
-       char const *style =
-         (TRANSITION_IS_ERROR (trans, i) ? "dotted"
-          : TRANSITION_IS_SHIFT (trans, i) ? "solid"
-          : "dashed");
-
-       if (TRANSITION_IS_ERROR (trans, i)
-           && strcmp (symbols[sym]->tag, "error") != 0)
-         abort ();
-       output_edge (s->number, s1->number,
-                    TRANSITION_IS_ERROR (trans, i) ? NULL : symbols[sym]->tag,
-                    style, fgraph);
+        state *s1 = trans->states[i];
+        symbol_number sym = s1->accessing_symbol;
+
+        /* Shifts are solid, gotos are dashed, and error is dotted.  */
+        char const *style =
+          (TRANSITION_IS_ERROR (trans, i) ? "dotted"
+           : TRANSITION_IS_SHIFT (trans, i) ? "solid"
+           : "dashed");
+
+        if (TRANSITION_IS_ERROR (trans, i)
+            && STRNEQ (symbols[sym]->tag, "error"))
+          abort ();
+        output_edge (s->number, s1->number,
+                     TRANSITION_IS_ERROR (trans, i) ? NULL : symbols[sym]->tag,
+                     style, fgraph);

       }
 }
 
       }
 }
 


@@ -161,8 +184,7 @@ print_state (state *s, FILE *fgraph)
   /* A node's label contains its items.  */
   obstack_init (&node_obstack);
   print_core (&node_obstack, s);
   /* A node's label contains its items.  */
   obstack_init (&node_obstack);
   print_core (&node_obstack, s);

-  obstack_1grow (&node_obstack, '\0');
-  output_node (s->number, obstack_finish (&node_obstack), fgraph);
+  output_node (s->number, obstack_finish0 (&node_obstack), fgraph);

   obstack_free (&node_obstack, 0);
 
   /* Output the edges.  */
   obstack_free (&node_obstack, 0);
 
   /* Output the edges.  */