X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/ea0a767697594d2eda37daf5ecbf2fdaf60d2189..86649705b4dc7a12e753405a3946ec36ba6a0bb9:/src/print_graph.c?ds=inline diff --git a/src/print_graph.c b/src/print_graph.c index 155ffaf5..f5695a7a 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-2011 Free Software Foundation, Inc. + Copyright (C) 2001-2007, 2009-2012 Free Software Foundation, Inc. This file is part of Bison, the GNU Compiler Compiler. @@ -20,8 +20,6 @@ #include #include "system.h" -#include - #include "LR0.h" #include "closure.h" #include "complain.h" @@ -56,7 +54,7 @@ print_core (struct obstack *oout, state *s) snritems = nitemset; } - obstack_fgrow1 (oout, "%d", s->number); + obstack_printf (oout, "%d", s->number); for (i = 0; i < snritems; i++) { item_number *sp; @@ -70,15 +68,15 @@ print_core (struct obstack *oout, state *s) r = item_number_as_rule_number (*sp); - obstack_fgrow1 (oout, "\n%s -> ", rules[r].lhs->tag); + obstack_printf (oout, "\n%s -> ", rules[r].lhs->tag); for (sp = rules[r].rhs; sp < sp1; sp++) - obstack_fgrow1 (oout, "%s ", symbols[*sp]->tag); + obstack_printf (oout, "%s ", symbols[*sp]->tag); obstack_1grow (oout, '.'); for (/* Nothing */; *sp >= 0; ++sp) - obstack_fgrow1 (oout, " %s", symbols[*sp]->tag); + obstack_printf (oout, " %s", symbols[*sp]->tag); /* Experimental feature: display the lookahead tokens. */ if (report_flag & report_lookahead_tokens @@ -97,7 +95,7 @@ print_core (struct obstack *oout, state *s) obstack_sgrow (oout, "["); BITSET_FOR_EACH (biter, reds->lookahead_tokens[redno], k, 0) { - obstack_fgrow2 (oout, "%s%s", sep, symbols[k]->tag); + obstack_printf (oout, "%s%s", sep, symbols[k]->tag); sep = ", "; } obstack_sgrow (oout, "]");