19 out <<
"digraph {" << Qt::endl << Qt::endl;
21 out <<
"subgraph Includes {" << Qt::endl;
22 for (Automaton::IncludesGraph::iterator incl = Automaton::IncludesGraph::begin_nodes ();
23 incl != Automaton::IncludesGraph::end_nodes (); ++incl)
25 for (Automaton::IncludesGraph::edge_iterator edge = incl->begin (); edge != incl->end (); ++edge)
27 out <<
"\t\"(" << aut->id (incl->data.state) <<
", " << incl->data.nt <<
")\"";
29 out <<
"\"(" << aut->id ((*edge)->data.state) <<
", " << (*edge)->data.nt <<
")\"\t";
30 out <<
"[label=\"" << incl->data.state->follows [incl->data.nt] <<
"\"]";
34 out <<
"}" << Qt::endl << Qt::endl;
37 out <<
"subgraph LRA {" << Qt::endl;
44 out <<
"\t" << state <<
"\t[shape=record,label=\"{";
46 out <<
"<0> State " << state;
49 for (ItemPointer item = q->kernel.begin (); item != q->kernel.end (); ++item)
50 out <<
"| <" << index++ <<
"> " << *item;
52 out <<
"}\"]" << Qt::endl;
54 for (Bundle::iterator a = q->bundle.begin (); a != q->bundle.end (); ++a)
57 out <<
"\t" << state <<
"\t->\t" << aut->id (*a) <<
"\t[color=\"" << clr <<
"\",label=\"" << a.key () <<
"\"]" << Qt::endl;
62 out <<
"}" << Qt::endl;
63 out << Qt::endl << Qt::endl <<
"}" << Qt::endl;