-/* Output a VCG description on generated parser, for Bison,
- Copyright 2001 Free Software Foundation, Inc.
+/* Output a graph of the generated parser, for Bison.
+
+ Copyright (C) 2001-2007, 2009-2012 Free Software Foundation, Inc.
This file is part of Bison, the GNU Compiler Compiler.
- Bison is free software; you can redistribute it and/or modify
+ This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
- the Free Software Foundation; either version 2, or (at your option)
- any later version.
+ the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
- Bison is distributed in the hope that it will be useful,
+ This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
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. */
+ along with this program. If not, see <http://www.gnu.org/licenses/>. */
+#include <config.h>
#include "system.h"
-#include "files.h"
-#include "gram.h"
+
#include "LR0.h"
-#include "lalr.h"
-#include "conflicts.h"
+#include "closure.h"
#include "complain.h"
+#include "conflicts.h"
+#include "files.h"
#include "getargs.h"
-#include "state.h"
-#include "reader.h"
-#include "obstack.h"
+#include "gram.h"
+#include "graphviz.h"
+#include "lalr.h"
#include "print_graph.h"
-#include "vcg.h"
+#include "reader.h"
+#include "state.h"
+#include "symtab.h"
-static graph_t graph;
-static FILE *fgraph = NULL;
-/* This part will construct the label of nodes. */
-static void
-print_core (int state, struct obstack *node_obstack)
-{
- int i;
- int k;
- int rule;
- core *statep;
- short *sp;
- short *sp1;
+/*----------------------------.
+| Construct the node labels. |
+`----------------------------*/
- statep = state_table[state].state;
- k = statep->nitems;
+/* Print the lhs of a rule in such a manner that there is no vertical
+ repetition, like in *.output files. */
- if (k == 0)
- return;
-
- for (i = 0; i < k; i++)
+static void
+print_lhs (struct obstack *oout, rule *previous_rule, rule *r)
+{
+ if (previous_rule && STREQ (previous_rule->lhs->tag, r->lhs->tag))
{
- if (i)
- obstack_1grow (node_obstack, '\n');
-
- sp1 = sp = ritem + statep->items[i];
-
- while (*sp > 0)
- sp++;
-
- rule = -(*sp);
-
- obstack_fgrow1 (node_obstack, "%d: ", rule);
- obstack_fgrow1 (node_obstack, " %s -> ",
- tags[rule_table[rule].lhs]);
+ 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, ':');
+ }
+}
- for (sp = ritem + rule_table[rule].rhs; sp < sp1; sp++)
- obstack_fgrow1 (node_obstack, "%s ", tags[*sp]);
+static void
+print_core (struct obstack *oout, state *s)
+{
+ item_number *sitems = s->items;
+ rule *previous_rule = NULL;
+ size_t i;
+ size_t snritems = s->nitems;
- obstack_1grow (node_obstack, '.');
+ /* Output all the items of a state, not only its kernel. */
+ if (report_flag & report_itemsets)
+ {
+ closure (sitems, snritems);
+ sitems = itemset;
+ snritems = nitemset;
+ }
- while (*sp > 0)
- obstack_fgrow1 (node_obstack, " %s", tags[*sp++]);
+ obstack_printf (oout, _("State %d"), s->number);
+ 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];
+
+ while (*sp >= 0)
+ sp++;
+
+ r = item_number_as_rule_number (*sp);
+
+ obstack_printf (oout, "%3d ", r);
+ print_lhs (oout, previous_rule, &rules[r]);
+ previous_rule = &rules[r];
+
+ for (sp = rules[r].rhs; sp < sp1; sp++)
+ obstack_printf (oout, " %s", escape (symbols[*sp]->tag));
+
+ obstack_sgrow (oout, " .");
+
+ for (/* Nothing */; *sp >= 0; ++sp)
+ obstack_printf (oout, " %s", escape (symbols[*sp]->tag));
+
+ /* Experimental feature: display the lookahead tokens. */
+ if (report_flag & report_lookahead_tokens
+ && item_number_is_rule_number (*sp1))
+ {
+ /* 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->lookahead_tokens && redno != -1)
+ {
+ bitset_iterator biter;
+ int k;
+ char const *sep = "";
+ obstack_sgrow (oout, " [");
+ BITSET_FOR_EACH (biter, reds->lookahead_tokens[redno], k, 0)
+ {
+ obstack_sgrow (oout, sep);
+ obstack_sgrow (oout, escape (symbols[k]->tag));
+ sep = ", ";
+ }
+ obstack_1grow (oout, ']');
+ }
+ }
+ obstack_sgrow (oout, "\\l");
}
}
`---------------------------------------------------------------*/
static void
-print_actions (int state, const char *node_name)
+print_actions (state const *s, FILE *fgraph)
{
+ transitions const *trans = s->transitions;
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];
-
- if (!shiftp && !redp)
- {
-#if 0
- if (final_state == state)
- obstack_sgrow (node_obstack, "$default: accept");
- else
- obstack_sgrow (node_obstack, "NO ACTIONS");
-#endif
- 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;
- edge.label = tags[symbol];
- output_edge (&edge, fgraph);
- close_edge (fgraph);
- }
- }
- }
- else
- {
- i = 0;
- k = 0;
- }
-
-#if 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_1grow (node_obstack, '\n');
- }
- 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]);
- }
-#endif
+ if (!trans->num && !s->reductions)
+ 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;
- edge.color = red;
- edge.label = tags[symbol];
- output_edge (&edge, fgraph);
- close_edge (fgraph);
- }
- }
+ for (i = 0; i < trans->num; i++)
+ if (!TRANSITION_IS_DISABLED (trans, i))
+ {
+ state *s1 = trans->states[i];
+ symbol_number sym = s1->accessing_symbol;
+
+ /* Shifts are solid, gotos are dashed, and error is dotted. */
+ char const *style =
+ (TRANSITION_IS_ERROR (trans, i) ? "dotted"
+ : TRANSITION_IS_SHIFT (trans, i) ? "solid"
+ : "dashed");
+
+ if (TRANSITION_IS_ERROR (trans, i)
+ && strcmp (symbols[sym]->tag, "error") != 0)
+ abort ();
+ output_edge (s->number, s1->number,
+ TRANSITION_IS_ERROR (trans, i) ? NULL : symbols[sym]->tag,
+ style, fgraph);
+ }
+ /* Display reductions. */
+ output_red (s, s->reductions, fgraph);
}
`-------------------------------------------------------------*/
static void
-print_state (int state)
+print_state (state *s, FILE *fgraph)
{
- static char name[10];
struct obstack node_obstack;
- node_t node;
- /* The labels of the nodes are their the items. */
+ /* A node's label contains its items. */
obstack_init (&node_obstack);
- new_node (&node);
- sprintf (name, "%d", state);
- node.title = name;
- print_core (state, &node_obstack);
+ print_core (&node_obstack, s);
obstack_1grow (&node_obstack, '\0');
- node.label = obstack_finish (&node_obstack);
-
- open_node (fgraph);
- output_node (&node, fgraph);
- close_node (fgraph);
+ output_node (s->number, obstack_finish (&node_obstack), fgraph);
+ obstack_free (&node_obstack, 0);
/* Output the edges. */
- print_actions (state, name);
-
- obstack_free (&node_obstack, 0);
+ print_actions (s, fgraph);
}
\f
void
print_graph (void)
{
- int i;
-
- if (!graph_flag)
- return;
-
- /* Output file. */
- fgraph = xfopen (spec_graph_file, "w");
-
- new_graph (&graph);
-
-#if 0
- graph.smanhattan_edges = yes;
- graph.manhattan_edges = yes;
-#endif
-
- graph.display_edge_labels = yes;
- graph.layoutalgorithm = normal;
-
- graph.port_sharing = no;
- graph.finetuning = yes;
- graph.straight_phase = yes;
- graph.priority_phase = yes;
- graph.splines = yes;
-
- graph.crossing_weight = median;
-
- /* Output graph options. */
- open_graph (fgraph);
- output_graph (&graph, fgraph);
+ state_number i;
+ FILE *fgraph = xfopen (spec_graph_file, "w");
+ start_graph (fgraph);
/* Output nodes and edges. */
+ new_closure (nritems);
for (i = 0; i < nstates; i++)
- print_state (i);
+ print_state (states[i], fgraph);
+ free_closure ();
- /* Close graph. */
- close_graph (&graph, fgraph);
+ finish_graph (fgraph);
xfclose (fgraph);
}
projects / bison.git / blobdiff