mirror of
https://bitbucket.org/smil3y/katie.git
synced 2025-02-23 18:32:55 +00:00
98 lines
3.2 KiB
C++
98 lines
3.2 KiB
C++
/****************************************************************************
|
|
**
|
|
** Copyright (C) 2015 The Qt Company Ltd.
|
|
** Copyright (C) 2016-2020 Ivailo Monev
|
|
**
|
|
** This file is part of the utils of the Katie Toolkit.
|
|
**
|
|
** $QT_BEGIN_LICENSE:LGPL$
|
|
**
|
|
** GNU Lesser General Public License Usage
|
|
** 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.
|
|
**
|
|
** As a special exception, The Qt Company gives you certain additional
|
|
** rights. These rights are described in The Qt Company LGPL Exception
|
|
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
|
|
**
|
|
** GNU General Public License Usage
|
|
** Alternatively, this file may be used under the terms of the GNU
|
|
** General Public License version 3.0 as published by the Free Software
|
|
** Foundation and appearing in the file LICENSE.GPL included in the
|
|
** packaging of this file. Please review the following information to
|
|
** ensure the GNU General Public License version 3.0 requirements will be
|
|
** met: http://www.gnu.org/copyleft/gpl.html.
|
|
**
|
|
** $QT_END_LICENSE$
|
|
**
|
|
****************************************************************************/
|
|
|
|
|
|
#include <QtCore/QTextStream>
|
|
|
|
#include "lalr.h"
|
|
#include "dotgraph.h"
|
|
|
|
QT_BEGIN_NAMESPACE
|
|
|
|
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;
|
|
}
|
|
|
|
QT_END_NAMESPACE
|