Boston, MA 02111-1307, USA. */
#include "system.h"
-#include "xalloc.h"
#include "files.h"
#include "gram.h"
#include "LR0.h"
#include "vcg.h"
static graph_t graph;
+static FILE *fgraph = NULL;
/* This part will construct the label of nodes. */
static void
-print_core (int state)
+print_core (int state, struct obstack *node_obstack)
{
int i;
- int k;
- int rule;
- core *statep;
- short *sp;
- short *sp1;
+ core *statep = state_table[state].state;
- statep = state_table[state];
- k = statep->nitems;
-
- if (k == 0)
+ if (!statep->nitems)
return;
- obstack_sgrow(&graph_obstack, "\t\tlabel:\t\"");
-
- for (i = 0; i < k; i++)
+ for (i = 0; i < statep->nitems; i++)
{
+ short *sp;
+ short *sp1;
+ int rule;
+
sp1 = sp = ritem + statep->items[i];
while (*sp > 0)
rule = -(*sp);
- obstack_fgrow1(&graph_obstack, _("%d: "), rule);
- obstack_fgrow1(&graph_obstack, " %s -> ", tags[rlhs[rule]]);
+ if (i)
+ obstack_1grow (node_obstack, '\n');
+ obstack_fgrow1 (node_obstack, "%d: ", rule);
+ obstack_fgrow1 (node_obstack, " %s -> ",
+ tags[rule_table[rule].lhs]);
- for (sp = ritem + rrhs[rule]; sp < sp1; sp++)
- obstack_fgrow1(&graph_obstack, "%s ", tags[*sp]);
+ for (sp = ritem + rule_table[rule].rhs; sp < sp1; sp++)
+ obstack_fgrow1 (node_obstack, "%s ", tags[*sp]);
- obstack_1grow(&graph_obstack, '.');
+ obstack_1grow (node_obstack, '.');
- while (*sp > 0)
- obstack_fgrow1(&graph_obstack, " %s", tags[*sp++]);
-
- obstack_sgrow(&graph_obstack, "\\n");
+ for (/* Nothing */; *sp > 0; ++sp)
+ obstack_fgrow1 (node_obstack, " %s", tags[*sp]);
}
- obstack_sgrow(&graph_obstack, "\"\n");
}
+
+/*---------------------------------------------------------------.
+| Output in graph_obstack edges specifications in incidence with |
+| current node. |
+`---------------------------------------------------------------*/
+
static void
-print_actions (int state, node_t *node)
+print_actions (int state, const char *node_name)
{
int i;
- int k;
- int state1;
- int symbol;
- shifts *shiftp;
- errs *errp;
- reductions *redp;
- int rule;
+
+ shifts *shiftp = state_table[state].shifts;
+ reductions *redp = state_table[state].reductions;
+#if 0
+ errs *errp = err_table[state];
+#endif
+
static char buff[10];
edge_t edge;
- shiftp = shift_table[state];
- redp = reduction_table[state];
- errp = err_table[state];
-
- if (!shiftp && !redp)
+ if (!shiftp->nshifts && !redp)
{
+#if 0
if (final_state == state)
- ;//fprintf(f, " $default\taccept\n");
+ obstack_sgrow (node_obstack, "$default: accept");
else
- ;//fprintf(f, " NO ACTIONS\n");
+ 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 = accessing_symbol[state1];
-
- if (ISVAR (symbol))
- break;
-
- {
- new_edge (&edge);
-
- if (state > state1)
- edge.type = back_edge;
- open_edge (&edge, &graph_obstack);
- edge.sourcename = node->title;
- edge.targetname = buff;
- sprintf (edge.targetname, "%d", state1);
- edge.color = (symbol == 0) ? blue : red;
- edge.label = tags[symbol];
- output_edge (&edge, &graph_obstack);
- close_edge (&graph_obstack);
- }
- }
- }
- else
- {
- i = 0;
- k = 0;
- }
-
+ for (i = 0; i < shiftp->nshifts; i++)
+ if (!SHIFT_IS_DISABLED (shiftp, i))
+ {
+ int state1 = shiftp->shifts[i];
+ int symbol = state_table[state1].accessing_symbol;
+
+ 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);
+ }
+
+#if 0
if (errp)
{
int j, nerrs;
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 (consistent[state] && redp)
+ if (state_table[state].consistent && redp)
{
rule = redp->rules[0];
- symbol = rlhs[rule];
+ 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 (i < k)
- {
- for (; i < k; i++)
+ if (i < shiftp->nshifts)
+ for (; i < shiftp->nshifts; i++)
+ if (!SHIFT_IS_DISABLED (shiftp, i))
{
- if (!shiftp->shifts[i])
- continue;
- state1 = shiftp->shifts[i];
- symbol = accessing_symbol[state1];
+ int state1 = shiftp->shifts[i];
+ int symbol = state_table[state1].accessing_symbol;
new_edge (&edge);
- open_edge (&edge, &graph_obstack);
- edge.sourcename = node->title;
+ open_edge (&edge, fgraph);
+ edge.sourcename = node_name;
+ sprintf (buff, "%d", state1);
edge.targetname = buff;
edge.color = red;
- sprintf (edge.targetname, "%d", state1);
edge.label = tags[symbol];
- output_edge (&edge, &graph_obstack);
- close_edge (&graph_obstack);
+ output_edge (&edge, fgraph);
+ close_edge (fgraph);
}
- }
}
+
+/*-------------------------------------------------------------.
+| Output in FGRAPH the current node specifications and exiting |
+| edges. |
+`-------------------------------------------------------------*/
+
static void
print_state (int 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);
- open_node (&graph_obstack);
-
- sprintf(name, "%d", state);
+ sprintf (name, "%d", state);
node.title = name;
- output_node (&node, &graph_obstack);
+ print_core (state, &node_obstack);
+ obstack_1grow (&node_obstack, '\0');
+ node.label = obstack_finish (&node_obstack);
- print_core (state); /* node label */
+ open_node (fgraph);
+ output_node (&node, fgraph);
+ close_node (fgraph);
- close_node (&graph_obstack);
+ /* Output the edges. */
+ print_actions (state, name);
- print_actions (state, &node); /* edges */
+ obstack_free (&node_obstack, 0);
}
\f
int i;
if (!graph_flag)
- return ;
+ return;
+
+ /* Output file. */
+ fgraph = xfopen (spec_graph_file, "w");
+
new_graph (&graph);
- /* graph.smanhattan_edges = yes;
- graph.manhattan_edges = yes; */
+#if 0
+ graph.smanhattan_edges = yes;
+ graph.manhattan_edges = yes;
+#endif
graph.display_edge_labels = yes;
- graph.layoutalgorithm = 0;
+ graph.layoutalgorithm = normal;
graph.port_sharing = no;
graph.finetuning = yes;
graph.crossing_weight = median;
/* Output graph options. */
- open_graph (&graph_obstack);
- output_graph (&graph, &graph_obstack);
+ open_graph (fgraph);
+ output_graph (&graph, fgraph);
+ /* Output nodes and edges. */
for (i = 0; i < nstates; i++)
- /* Output nodes & edges. */
- print_state (i);
+ print_state (i);
/* Close graph. */
- close_graph (&graph, &graph_obstack);
+ close_graph (&graph, fgraph);
+ xfclose (fgraph);
}
projects / bison.git / blobdiff