* src/system.h: Use canonical definition for PARAMS (avoids clash with macro from...

[bison.git] / src / print_graph.c

diff --git a/src/print_graph.c b/src/print_graph.c
index dd271d78bfbc16a1976bbfb4ef0689d17e28169e..f9bec77d4c81638a110f0e0b2527d27687c1f19b 100644 (file)
--- a/src/print_graph.c
+++ b/src/print_graph.c
@@ -78,9 +78,9 @@ print_core (state_t *state, struct obstack *node_obstack)
       if (i)
        obstack_1grow (node_obstack, '\n');
       obstack_fgrow1 (node_obstack, " %s -> ",
-                     escape (symbols[rule_table[rule].lhs]->tag));
+                     escape (symbols[rules[rule].lhs]->tag));
 
-      for (sp = ritem + rule_table[rule].rhs; sp < sp1; sp++)
+      for (sp = ritem + rules[rule].rhs; sp < sp1; sp++)
        obstack_fgrow1 (node_obstack, "%s ", escape (symbols[*sp]->tag));
 
       obstack_1grow (node_obstack, '.');
@@ -114,7 +114,7 @@ print_actions (state_t *state, const char *node_name)
     if (!SHIFT_IS_DISABLED (shiftp, i))
       {
        int state1 = shiftp->shifts[i];
-       int symbol = state_table[state1]->accessing_symbol;
+       int symbol = states[state1]->accessing_symbol;
 
        new_edge (&edge);
 
@@ -202,7 +202,7 @@ print_graph (void)
   /* Output nodes and edges. */
   new_closure (nritems);
   for (i = 0; i < nstates; i++)
-    print_state (state_table[i]);
+    print_state (states[i]);
   free_closure ();
 
   /* Close graph. */