X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/b2ed6e5826e772162719db595446b2c58e4ac5d6..5b7f88c7f24c3ca04bbb00860f5c429096ee8ce7:/src/print_graph.c?ds=inline diff --git a/src/print_graph.c b/src/print_graph.c index 4266375a..fe0ee76d 100644 --- a/src/print_graph.c +++ b/src/print_graph.c @@ -19,7 +19,9 @@ Boston, MA 02111-1307, USA. */ #include "system.h" +#include "quotearg.h" #include "files.h" +#include "symtab.h" #include "gram.h" #include "LR0.h" #include "lalr.h" @@ -28,227 +30,160 @@ #include "getargs.h" #include "state.h" #include "reader.h" +#include "closure.h" #include "obstack.h" #include "print_graph.h" #include "vcg.h" -#include "quotearg.h" static graph_t graph; static FILE *fgraph = NULL; -static size_t node_output_size = 0; -/* Return an unambiguous printable representated, allocated in slot 0, - for NAME, suitable for C strings. */ -static char const * -quote (char const *name) -{ - return quotearg_n_style (0, escape_quoting_style, name); -} +/*----------------------------. +| Construct the node labels. | +`----------------------------*/ -/* This part will construct the label of nodes. */ static void -print_core (int state, struct obstack *node_obstack) +print_core (struct obstack *oout, state_t *state) { int i; - int k; - int rule; - core *statep; - short *sp; - short *sp1; + item_number_t *sitems = state->items; + int snritems = state->nitems; - statep = state_table[state].state; - k = statep->nitems; - - if (k == 0) - return; + /* Output all the items of a state, not only its kernel. */ + if (report_flag & report_itemsets) + { + closure (sitems, snritems); + sitems = itemset; + snritems = nritemset; + } - for (i = 0; i < k; i++) + obstack_fgrow1 (oout, "state %2d\n", state->number); + for (i = 0; i < snritems; i++) { - if (i) - obstack_sgrow (node_obstack, "\\n"); + item_number_t *sp; + item_number_t *sp1; + rule_number_t rule; - sp1 = sp = ritem + statep->items[i]; + sp1 = sp = ritem + sitems[i]; - while (*sp > 0) + while (*sp >= 0) sp++; - rule = -(*sp); + rule = item_number_as_rule_number (*sp); + + if (i) + obstack_1grow (oout, '\n'); + obstack_fgrow1 (oout, " %s -> ", + rules[rule].lhs->tag); - obstack_fgrow1 (node_obstack, "%d: ", rule); - obstack_fgrow1 (node_obstack, " %s -> ", - quote (tags[rule_table[rule].lhs])); + for (sp = rules[rule].rhs; sp < sp1; sp++) + obstack_fgrow1 (oout, "%s ", symbols[*sp]->tag); - for (sp = ritem + rule_table[rule].rhs; sp < sp1; sp++) - obstack_fgrow1 (node_obstack, "%s ", quote (tags[*sp])); + obstack_1grow (oout, '.'); - obstack_1grow (node_obstack, '.'); + for (/* Nothing */; *sp >= 0; ++sp) + obstack_fgrow1 (oout, " %s", symbols[*sp]->tag); - while (*sp > 0) - obstack_fgrow1 (node_obstack, " %s", quote (tags[*sp++])); + /* Experimental feature: display the lookaheads. */ + if (report_flag & report_lookaheads) + { + /* Find the reduction we are handling. */ + reductions_t *reds = state->reductions; + int redno = state_reduction_find (state, &rules[rule]); + + /* Print them if there are. */ + if (reds->lookaheads && redno != -1) + { + bitset_iterator biter; + int k; + int not_first = 0; + obstack_sgrow (oout, "["); + BITSET_FOR_EACH (biter, reds->lookaheads[redno], k, 0) + obstack_fgrow2 (oout, "%s%s", + not_first++ ? ", " : "", + symbols[k]->tag); + obstack_sgrow (oout, "]"); + } + } } } -/* Output in graph_obstack edges specifications in incidence with current - node. */ + +/*---------------------------------------------------------------. +| Output in graph_obstack edges specifications in incidence with | +| current node. | +`---------------------------------------------------------------*/ + static void -print_actions (int state, const char *node_name, struct obstack *node_obstack) +print_actions (state_t *state, const char *node_name) { int i; - int k; - int state1; - int symbol; - shifts *shiftp; - errs *errp; - reductions *redp; - int rule; - static char buff[10]; - edge_t edge; - shiftp = state_table[state].shift_table; - redp = state_table[state].reduction_table; - errp = err_table[state]; + transitions_t *transitions = state->transitions; + reductions_t *redp = state->reductions; - if (!shiftp && !redp) - { - if (final_state == state) - obstack_sgrow (node_obstack, "$default: accept"); - else - obstack_sgrow (node_obstack, "NO ACTIONS"); - return; - } - - if (shiftp) - { - k = shiftp->nshifts; - - for (i = 0; i < k; i++) - { - if (!shiftp->shifts[i]) - continue; - state1 = shiftp->shifts[i]; - symbol = state_table[state1].accessing_symbol; - - if (ISVAR (symbol)) - break; - - { - new_edge (&edge); - - if (state > state1) - edge.type = back_edge; - open_edge (&edge, fgraph); - /* The edge source is the current node. */ - edge.sourcename = node_name; - sprintf (buff, "%d", state1); - edge.targetname = buff; - edge.color = (symbol == 0) ? red : blue; - /* FIXME: Be aware that quote uses static memory. The string - must be output immediately (which is the case here). */ - edge.label = tags[symbol] ? quote (tags[symbol]) : NULL; - output_edge (&edge, fgraph); - close_edge (fgraph); - } - } - } - else - { - i = 0; - k = 0; - } - - if (errp) - { - int j, nerrs; - - nerrs = errp->nerrs; - - for (j = 0; j < nerrs; j++) - { - if (!errp->errs[j]) - continue; - symbol = errp->errs[j]; - /* If something has been added in the NODE_OBSTACK after - the declaration of the label, then we need a `\n'. */ - if (obstack_object_size (node_obstack) > node_output_size) - obstack_sgrow (node_obstack, "\\n"); - obstack_fgrow1 (node_obstack, _("%-4s\terror (nonassociative)"), - tags[symbol]); - } - if (j > 0) - obstack_sgrow (node_obstack, "\\n"); - } + static char buff[10]; + edge_t edge; - if (state_table[state].consistent && redp) - { - rule = redp->rules[0]; - symbol = rule_table[rule].lhs; - if (obstack_object_size (node_obstack) > node_output_size) - obstack_sgrow (node_obstack, "\\n"); - obstack_fgrow2 (node_obstack, _("$default\treduce using rule %d (%s)"), - rule, tags[symbol]); - } + if (!transitions->num && !redp) + return; - if (i < k) - { - for (; i < k; i++) - { - if (!shiftp->shifts[i]) - continue; - state1 = shiftp->shifts[i]; - symbol = state_table[state1].accessing_symbol; - - new_edge (&edge); - open_edge (&edge, fgraph); - edge.sourcename = node_name; - sprintf (buff, "%d", state1); - edge.targetname = buff; + for (i = 0; i < transitions->num; i++) + if (!TRANSITION_IS_DISABLED (transitions, i)) + { + state_t *state1 = transitions->states[i]; + symbol_number_t symbol = state1->accessing_symbol; + + new_edge (&edge); + + if (state->number > state1->number) + edge.type = back_edge; + open_edge (&edge, fgraph); + /* The edge source is the current node. */ + edge.sourcename = node_name; + sprintf (buff, "%d", state1->number); + edge.targetname = buff; + /* Shifts are blue, gotos are green, and error is red. */ + if (TRANSITION_IS_ERROR (transitions, i)) edge.color = red; - edge.label = tags[symbol] ? quote (tags[symbol]) : NULL; - output_edge (&edge, fgraph); - close_edge (fgraph); - } - } + else + edge.color = TRANSITION_IS_SHIFT(transitions, i) ? blue : green; + edge.label = symbols[symbol]->tag; + output_edge (&edge, fgraph); + close_edge (fgraph); + } } -/* Output in GRAPH_OBSTACK the current node specifications and edges - which go out from that node. */ + +/*-------------------------------------------------------------. +| Output in FGRAPH the current node specifications and exiting | +| edges. | +`-------------------------------------------------------------*/ + static void -print_state (int state) +print_state (state_t *state) { static char name[10]; struct obstack node_obstack; node_t node; + /* The labels of the nodes are their the items. */ obstack_init (&node_obstack); - new_node (&node); /* Set node attributs default value. */ - sprintf (name, "%d", state); - node.title = name; /* Give a name to the node. */ - - { - /* Here we begin to compute the node label. */ - obstack_sgrow (&node_obstack, "\t\tlabel:\t\""); /* Open Label */ - - /* Keep the size of NODE_OBSTACK before computing the label. It is - useful to format the label. */ - node_output_size = obstack_object_size (&node_obstack); - - /* Compute the labels of nodes on the fly. */ - print_core (state, &node_obstack); - /* Compute edges and additionnal parts of node label. */ - print_actions (state, node.title, &node_obstack); - - obstack_sgrow (&node_obstack, "\"\n"); /* Close Label. */ - } + new_node (&node); + sprintf (name, "%d", state->number); + node.title = name; + print_core (&node_obstack, state); + obstack_1grow (&node_obstack, '\0'); + node.label = obstack_finish (&node_obstack); open_node (fgraph); - /* Output a VCG formatted attributs list. */ output_node (&node, fgraph); - /* Save the node label. */ - fwrite (obstack_base (&node_obstack), - obstack_object_size (&node_obstack), 1, fgraph); close_node (fgraph); + /* Output the edges. */ + print_actions (state, name); + obstack_free (&node_obstack, 0); } @@ -256,10 +191,7 @@ print_state (int state) void print_graph (void) { - int i; - - if (!graph_flag) - return; + state_number_t i; /* Output file. */ fgraph = xfopen (spec_graph_file, "w"); @@ -286,9 +218,11 @@ print_graph (void) open_graph (fgraph); output_graph (&graph, fgraph); + /* Output nodes and edges. */ + new_closure (nritems); for (i = 0; i < nstates; i++) - /* Output nodes & edges. */ - print_state (i); + print_state (states[i]); + free_closure (); /* Close graph. */ close_graph (&graph, fgraph);