mirror of
https://bitbucket.org/smil3y/katie.git
synced 2025-02-23 18:32:55 +00:00
111 lines
3.2 KiB
C++
111 lines
3.2 KiB
C++
/****************************************************************************
|
|
**
|
|
** Copyright (C) 2015 The Qt Company Ltd.
|
|
** Copyright (C) 2016 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.
|
|
**
|
|
** $QT_END_LICENSE$
|
|
**
|
|
****************************************************************************/
|
|
|
|
|
|
#include <QtCore/QTextStream>
|
|
#include "lalr.h"
|
|
#include "parsetable.h"
|
|
|
|
QT_BEGIN_NAMESPACE
|
|
|
|
ParseTable::ParseTable (QTextStream &o):
|
|
out (o)
|
|
{
|
|
}
|
|
|
|
void ParseTable::operator () (Automaton *aut)
|
|
{
|
|
Grammar *g = aut->_M_grammar;
|
|
|
|
int rindex = 1;
|
|
for (RulePointer rule = g->rules.begin (); rule != g->rules.end (); ++rule)
|
|
out << rindex++ << ")\t" << *rule << endl;
|
|
out << endl << endl;
|
|
|
|
int index = 0;
|
|
for (StatePointer state = aut->states.begin (); state != aut->states.end (); ++state)
|
|
{
|
|
out << "state " << index++ << endl << endl;
|
|
|
|
for (ItemPointer item = state->kernel.begin (); item != state->kernel.end (); ++item)
|
|
{
|
|
out << " * " << *item;
|
|
|
|
if (item->dot == item->end_rhs ())
|
|
out << " " << aut->lookaheads [item];
|
|
|
|
out << endl;
|
|
}
|
|
|
|
bool first = true;
|
|
for (Bundle::iterator arrow = state->bundle.begin (); arrow != state->bundle.end (); ++arrow)
|
|
{
|
|
if (! g->isTerminal (arrow.key ()))
|
|
continue;
|
|
|
|
if (first)
|
|
out << endl;
|
|
|
|
first = false;
|
|
|
|
out << " " << *arrow.key () << " shift, and go to state " << std::distance (aut->states.begin (), *arrow) << endl;
|
|
}
|
|
|
|
first = true;
|
|
for (ItemPointer item = state->closure.begin (); item != state->closure.end (); ++item)
|
|
{
|
|
if (item->dot != item->end_rhs () || item->rule == state->defaultReduce)
|
|
continue;
|
|
|
|
if (first)
|
|
out << endl;
|
|
|
|
first = false;
|
|
|
|
foreach (Name la, aut->lookaheads.value (item))
|
|
out << " " << *la << " reduce using rule " << aut->id (item->rule) << " (" << *item->rule->lhs << ")" << endl;
|
|
}
|
|
|
|
first = true;
|
|
for (Bundle::iterator arrow = state->bundle.begin (); arrow != state->bundle.end (); ++arrow)
|
|
{
|
|
if (! g->isNonTerminal (arrow.key ()))
|
|
continue;
|
|
|
|
if (first)
|
|
out << endl;
|
|
|
|
first = false;
|
|
|
|
out << " " << *arrow.key () << " go to state " << std::distance (aut->states.begin (), *arrow) << endl;
|
|
}
|
|
|
|
if (state->defaultReduce != g->rules.end ())
|
|
{
|
|
out << endl
|
|
<< " $default reduce using rule " << aut->id (state->defaultReduce) << " (" << *state->defaultReduce->lhs << ")" << endl;
|
|
}
|
|
|
|
out << endl;
|
|
}
|
|
}
|
|
|
|
QT_END_NAMESPACE
|