X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/32288c8cbd309b29dff45e81d78374a5eb9c006e..baa423bd59767a687ad742adc66a5b7428a41dee:/src/print_graph.c diff --git a/src/print_graph.c b/src/print_graph.c index 7b2afdb5..76d8b3fe 100644 --- a/src/print_graph.c +++ b/src/print_graph.c @@ -1,6 +1,6 @@ /* Output a graph of the generated parser, for Bison. - Copyright (C) 2001-2007, 2009-2012 Free Software Foundation, Inc. + Copyright (C) 2001-2007, 2009-2015 Free Software Foundation, Inc. This file is part of Bison, the GNU Compiler Compiler. @@ -18,7 +18,6 @@ along with this program. If not, see . */ #include -#include #include "system.h" #include "LR0.h" @@ -43,33 +42,15 @@ /* 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) { - item_number *sitems = s->items; - rule *previous_rule = NULL; + item_number const *sitems = s->items; + symbol *previous_lhs = NULL; size_t i; size_t snritems = s->nitems; - /* Output all the items of a state, not only its kernel. */ + /* Output all the items of a state, not just its kernel. */ if (report_flag & report_itemsets) { closure (sitems, snritems); @@ -78,31 +59,36 @@ print_core (struct obstack *oout, state *s) } obstack_printf (oout, _("State %d"), s->number); - obstack_sgrow (oout, "\\n"); + obstack_sgrow (oout, "\\n\\l"); for (i = 0; i < snritems; i++) { - item_number *sp; - item_number *sp1; - rule_number r; - - sp1 = sp = ritem + sitems[i]; + item_number const *sp1 = ritem + sitems[i]; + item_number const *sp = sp1; + rule *r; - while (*sp >= 0) + while (0 <= *sp) sp++; - r = item_number_as_rule_number (*sp); + r = &rules[item_number_as_rule_number (*sp)]; - obstack_printf (oout, "%3d ", r); - print_lhs (oout, previous_rule, &rules[r]); - previous_rule = &rules[r]; + obstack_printf (oout, "%3d ", r->number); + if (previous_lhs && UNIQSTR_EQ (previous_lhs->tag, r->lhs->tag)) + obstack_printf (oout, "%*s| ", + (int) strlen (previous_lhs->tag), ""); + else + obstack_printf (oout, "%s: ", escape (r->lhs->tag)); + previous_lhs = r->lhs; - for (sp = rules[r].rhs; sp < sp1; sp++) + for (sp = r->rhs; sp < sp1; sp++) obstack_printf (oout, "%s ", escape (symbols[*sp]->tag)); obstack_1grow (oout, '.'); - for (/* Nothing */; *sp >= 0; ++sp) - obstack_printf (oout, " %s", escape (symbols[*sp]->tag)); + if (0 <= *r->rhs) + for (/* Nothing */; *sp >= 0; ++sp) + obstack_printf (oout, " %s", escape (symbols[*sp]->tag)); + else + obstack_printf (oout, " %%empty"); /* Experimental feature: display the lookahead tokens. */ if (report_flag & report_lookahead_tokens @@ -110,7 +96,7 @@ print_core (struct obstack *oout, state *s) { /* Find the reduction we are handling. */ reductions *reds = s->reductions; - int redno = state_reduction_find (s, &rules[r]); + int redno = state_reduction_find (s, r); /* Print them if there are. */ if (reds->lookahead_tokens && redno != -1) @@ -144,9 +130,6 @@ print_actions (state const *s, FILE *fgraph) transitions const *trans = s->transitions; int i; - /* Display reductions. */ - output_red (s, s->reductions, fgraph); - if (!trans->num && !s->reductions) return; @@ -169,6 +152,8 @@ print_actions (state const *s, FILE *fgraph) TRANSITION_IS_ERROR (trans, i) ? NULL : symbols[sym]->tag, style, fgraph); } + /* Display reductions. */ + output_red (s, s->reductions, fgraph); }