X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/5fbb0954b861b5bff653e1b87a1bd5e0b328445d..32e1e0a4865d64946a5497aff057d7be28c1cc3d:/src/print_graph.c diff --git a/src/print_graph.c b/src/print_graph.c index 15861f35..7d81e2fe 100644 --- a/src/print_graph.c +++ b/src/print_graph.c @@ -38,16 +38,13 @@ static graph_t graph; static FILE *fgraph = NULL; -static inline const char * -escape (const char *s) -{ - return quotearg_n_style (1, escape_quoting_style, s); -} +/*----------------------------. +| Construct the node labels. | +`----------------------------*/ -/* This part will construct the label of nodes. */ static void -print_core (state_t *state, struct obstack *node_obstack) +print_core (struct obstack *oout, state_t *state) { int i; item_number_t *sitems = state->items; @@ -61,7 +58,7 @@ print_core (state_t *state, struct obstack *node_obstack) snritems = nritemset; } - obstack_fgrow1 (node_obstack, "state %2d\n", state->number); + obstack_fgrow1 (oout, "state %2d\n", state->number); for (i = 0; i < snritems; i++) { item_number_t *sp; @@ -76,17 +73,42 @@ print_core (state_t *state, struct obstack *node_obstack) rule = -(*sp); if (i) - obstack_1grow (node_obstack, '\n'); - obstack_fgrow1 (node_obstack, " %s -> ", - escape (rules[rule].lhs->tag)); + obstack_1grow (oout, '\n'); + obstack_fgrow1 (oout, " %s -> ", + symbol_tag_get (rules[rule].lhs)); for (sp = rules[rule].rhs; sp < sp1; sp++) - obstack_fgrow1 (node_obstack, "%s ", escape (symbols[*sp]->tag)); + obstack_fgrow1 (oout, "%s ", symbol_tag_get (symbols[*sp])); - obstack_1grow (node_obstack, '.'); + obstack_1grow (oout, '.'); for (/* Nothing */; *sp >= 0; ++sp) - obstack_fgrow1 (node_obstack, " %s", escape (symbols[*sp]->tag)); + obstack_fgrow1 (oout, " %s", symbol_tag_get (symbols[*sp])); + + /* Experimental feature: display the lookaheads. */ + if (trace_flag && state->nlookaheads) + { + int j, k; + int nlookaheads = 0; + /* Look for lookaheads corresponding to this rule. */ + for (j = 0; j < state->nlookaheads; ++j) + for (k = 0; k < ntokens; ++k) + if (bitset_test (state->lookaheads[j], k) + && state->lookaheads_rule[j]->number == rule) + nlookaheads++; + if (nlookaheads) + { + obstack_sgrow (oout, " ["); + for (j = 0; j < state->nlookaheads; ++j) + for (k = 0; k < ntokens; ++k) + if (bitset_test (state->lookaheads[j], k) + && state->lookaheads_rule[j]->number == rule) + obstack_fgrow2 (oout, "%s%s", + symbol_tag_get (symbols[k]), + --nlookaheads ? ", " : ""); + obstack_sgrow (oout, "]"); + } + } } } @@ -101,7 +123,7 @@ print_actions (state_t *state, const char *node_name) { int i; - shifts *shiftp = state->shifts; + shifts_t *shiftp = state->shifts; reductions *redp = state->reductions; static char buff[10]; @@ -113,8 +135,8 @@ print_actions (state_t *state, const char *node_name) for (i = 0; i < shiftp->nshifts; i++) if (!SHIFT_IS_DISABLED (shiftp, i)) { - int state1 = shiftp->shifts[i]; - token_number_t symbol = states[state1]->accessing_symbol; + state_number_t state1 = shiftp->shifts[i]; + symbol_number_t symbol = states[state1]->accessing_symbol; new_edge (&edge); @@ -130,7 +152,7 @@ print_actions (state_t *state, const char *node_name) edge.color = red; else edge.color = SHIFT_IS_SHIFT(shiftp, i) ? blue : green; - edge.label = escape (symbols[symbol]->tag); + edge.label = symbol_tag_get (symbols[symbol]); output_edge (&edge, fgraph); close_edge (fgraph); } @@ -154,7 +176,7 @@ print_state (state_t *state) new_node (&node); sprintf (name, "%d", state->number); node.title = name; - print_core (state, &node_obstack); + print_core (&node_obstack, state); obstack_1grow (&node_obstack, '\0'); node.label = obstack_finish (&node_obstack); @@ -172,7 +194,7 @@ print_state (state_t *state) void print_graph (void) { - size_t i; + state_number_t i; /* Output file. */ fgraph = xfopen (spec_graph_file, "w");