X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/f6fbd3da9d1366ccaa0163c6c93dde11e5720262..300a193064f024d1fe1f78f03f626232206d1bac:/src/print_graph.c diff --git a/src/print_graph.c b/src/print_graph.c index 0eecd460..0ba50b8e 100644 --- a/src/print_graph.c +++ b/src/print_graph.c @@ -1,6 +1,6 @@ /* Output a VCG description on generated parser, for Bison, - Copyright (C) 2001, 2002, 2003, 2004 Free Software Foundation, Inc. + Copyright (C) 2001, 2002, 2003, 2004, 2005 Free Software Foundation, Inc. This file is part of Bison, the GNU Compiler Compiler. @@ -16,12 +16,12 @@ You should have received a copy of the GNU General Public License along with Bison; see the file COPYING. If not, write to - the Free Software Foundation, Inc., 59 Temple Place - Suite 330, - Boston, MA 02111-1307, USA. */ + the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, + Boston, MA 02110-1301, USA. */ +#include #include "system.h" -#include #include #include "LR0.h" @@ -88,21 +88,21 @@ print_core (struct obstack *oout, state *s) for (/* Nothing */; *sp >= 0; ++sp) obstack_fgrow1 (oout, " %s", symbols[*sp]->tag); - /* Experimental feature: display the look-ahead tokens. */ - if (report_flag & report_look_ahead_tokens) + /* Experimental feature: display the lookahead tokens. */ + if (report_flag & report_lookahead_tokens) { /* Find the reduction we are handling. */ reductions *reds = s->reductions; int redno = state_reduction_find (s, &rules[r]); /* Print them if there are. */ - if (reds->look_ahead_tokens && redno != -1) + if (reds->lookahead_tokens && redno != -1) { bitset_iterator biter; int k; char const *sep = ""; obstack_sgrow (oout, "["); - BITSET_FOR_EACH (biter, reds->look_ahead_tokens[redno], k, 0) + BITSET_FOR_EACH (biter, reds->lookahead_tokens[redno], k, 0) { obstack_fgrow2 (oout, "%s%s", sep, symbols[k]->tag); sep = ", ";