diff -r 000000000000 -r 1918ee327afb util/qlalr/dotgraph.cpp
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/util/qlalr/dotgraph.cpp	Mon Jan 11 14:00:40 2010 +0000
@@ -0,0 +1,102 @@
+/****************************************************************************
+**
+** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies).
+** All rights reserved.
+** Contact: Nokia Corporation (qt-info@nokia.com)
+**
+** This file is part of the utils of the Qt Toolkit.
+**
+** $QT_BEGIN_LICENSE:LGPL$
+** No Commercial Usage
+** This file contains pre-release code and may not be distributed.
+** You may use this file in accordance with the terms and conditions
+** contained in the Technology Preview License Agreement accompanying
+** this package.
+**
+** GNU Lesser General Public License Usage
+** Alternatively, this file may be used under the terms of the GNU Lesser
+** General Public License version 2.1 as published by the Free Software
+** Foundation and appearing in the file LICENSE.LGPL included in the
+** packaging of this file.  Please review the following information to
+** ensure the GNU Lesser General Public License version 2.1 requirements
+** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
+**
+** In addition, as a special exception, Nokia gives you certain additional
+** rights.  These rights are described in the Nokia Qt LGPL Exception
+** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
+**
+** If you have questions regarding the use of this file, please contact
+** Nokia at qt-info@nokia.com.
+**
+**
+**
+**
+**
+**
+**
+**
+** $QT_END_LICENSE$
+**
+****************************************************************************/
+
+
+#include <QtCore/QTextStream>
+
+#include "lalr.h"
+#include "dotgraph.h"
+
+DotGraph::DotGraph(QTextStream &o):
+  out (o)
+{
+}
+
+void DotGraph::operator () (Automaton *aut)
+{
+  Grammar *g = aut->_M_grammar;
+
+  out << "digraph {" << endl << endl;
+
+  out << "subgraph Includes {" << endl;
+  for (Automaton::IncludesGraph::iterator incl = Automaton::IncludesGraph::begin_nodes ();
+       incl != Automaton::IncludesGraph::end_nodes (); ++incl)
+    {
+      for (Automaton::IncludesGraph::edge_iterator edge = incl->begin (); edge != incl->end (); ++edge)
+        {
+          out << "\t\"(" << aut->id (incl->data.state) << ", " << incl->data.nt << ")\"";
+          out << "\t->\t";
+          out << "\"(" << aut->id ((*edge)->data.state) << ", " << (*edge)->data.nt << ")\"\t";
+          out << "[label=\"" << incl->data.state->follows [incl->data.nt] << "\"]";
+          out << endl;
+        }
+    }
+  out << "}" << endl << endl;
+
+
+  out << "subgraph LRA {" << endl;
+  //out << "node [shape=record];" << endl << endl;
+
+  for (StatePointer q = aut->states.begin (); q != aut->states.end (); ++q)
+    {
+      int state = aut->id (q);
+
+      out << "\t" << state << "\t[shape=record,label=\"{";
+
+      out << "<0> State " << state;
+
+      int index = 1;
+      for (ItemPointer item = q->kernel.begin (); item != q->kernel.end (); ++item)
+        out << "| <" << index++ << "> " << *item;
+
+      out << "}\"]" << endl;
+
+      for (Bundle::iterator a = q->bundle.begin (); a != q->bundle.end (); ++a)
+        {
+          const char *clr = g->isTerminal (a.key ()) ? "blue" : "red";
+          out << "\t" << state << "\t->\t" << aut->id (*a) << "\t[color=\"" << clr << "\",label=\"" << a.key () << "\"]" << endl;
+        }
+      out << endl;
+    }
+
+  out << "}" << endl;
+  out << endl << endl << "}" << endl;
+}