|
1 /**************************************************************************** |
|
2 ** |
|
3 ** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies). |
|
4 ** All rights reserved. |
|
5 ** Contact: Nokia Corporation (qt-info@nokia.com) |
|
6 ** |
|
7 ** This file is part of the utils of the Qt Toolkit. |
|
8 ** |
|
9 ** $QT_BEGIN_LICENSE:LGPL$ |
|
10 ** No Commercial Usage |
|
11 ** This file contains pre-release code and may not be distributed. |
|
12 ** You may use this file in accordance with the terms and conditions |
|
13 ** contained in the Technology Preview License Agreement accompanying |
|
14 ** this package. |
|
15 ** |
|
16 ** GNU Lesser General Public License Usage |
|
17 ** Alternatively, this file may be used under the terms of the GNU Lesser |
|
18 ** General Public License version 2.1 as published by the Free Software |
|
19 ** Foundation and appearing in the file LICENSE.LGPL included in the |
|
20 ** packaging of this file. Please review the following information to |
|
21 ** ensure the GNU Lesser General Public License version 2.1 requirements |
|
22 ** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html. |
|
23 ** |
|
24 ** In addition, as a special exception, Nokia gives you certain additional |
|
25 ** rights. These rights are described in the Nokia Qt LGPL Exception |
|
26 ** version 1.1, included in the file LGPL_EXCEPTION.txt in this package. |
|
27 ** |
|
28 ** If you have questions regarding the use of this file, please contact |
|
29 ** Nokia at qt-info@nokia.com. |
|
30 ** |
|
31 ** |
|
32 ** |
|
33 ** |
|
34 ** |
|
35 ** |
|
36 ** |
|
37 ** |
|
38 ** $QT_END_LICENSE$ |
|
39 ** |
|
40 ****************************************************************************/ |
|
41 |
|
42 |
|
43 #include <QtCore/QTextStream> |
|
44 |
|
45 #include "lalr.h" |
|
46 #include "dotgraph.h" |
|
47 |
|
48 DotGraph::DotGraph(QTextStream &o): |
|
49 out (o) |
|
50 { |
|
51 } |
|
52 |
|
53 void DotGraph::operator () (Automaton *aut) |
|
54 { |
|
55 Grammar *g = aut->_M_grammar; |
|
56 |
|
57 out << "digraph {" << endl << endl; |
|
58 |
|
59 out << "subgraph Includes {" << endl; |
|
60 for (Automaton::IncludesGraph::iterator incl = Automaton::IncludesGraph::begin_nodes (); |
|
61 incl != Automaton::IncludesGraph::end_nodes (); ++incl) |
|
62 { |
|
63 for (Automaton::IncludesGraph::edge_iterator edge = incl->begin (); edge != incl->end (); ++edge) |
|
64 { |
|
65 out << "\t\"(" << aut->id (incl->data.state) << ", " << incl->data.nt << ")\""; |
|
66 out << "\t->\t"; |
|
67 out << "\"(" << aut->id ((*edge)->data.state) << ", " << (*edge)->data.nt << ")\"\t"; |
|
68 out << "[label=\"" << incl->data.state->follows [incl->data.nt] << "\"]"; |
|
69 out << endl; |
|
70 } |
|
71 } |
|
72 out << "}" << endl << endl; |
|
73 |
|
74 |
|
75 out << "subgraph LRA {" << endl; |
|
76 //out << "node [shape=record];" << endl << endl; |
|
77 |
|
78 for (StatePointer q = aut->states.begin (); q != aut->states.end (); ++q) |
|
79 { |
|
80 int state = aut->id (q); |
|
81 |
|
82 out << "\t" << state << "\t[shape=record,label=\"{"; |
|
83 |
|
84 out << "<0> State " << state; |
|
85 |
|
86 int index = 1; |
|
87 for (ItemPointer item = q->kernel.begin (); item != q->kernel.end (); ++item) |
|
88 out << "| <" << index++ << "> " << *item; |
|
89 |
|
90 out << "}\"]" << endl; |
|
91 |
|
92 for (Bundle::iterator a = q->bundle.begin (); a != q->bundle.end (); ++a) |
|
93 { |
|
94 const char *clr = g->isTerminal (a.key ()) ? "blue" : "red"; |
|
95 out << "\t" << state << "\t->\t" << aut->id (*a) << "\t[color=\"" << clr << "\",label=\"" << a.key () << "\"]" << endl; |
|
96 } |
|
97 out << endl; |
|
98 } |
|
99 |
|
100 out << "}" << endl; |
|
101 out << endl << endl << "}" << endl; |
|
102 } |