/**************************************************************************** ** ** Copyright (C) 2014 Digia Plc and/or its subsidiary(-ies). ** Contact: http://www.qt-project.org/legal ** ** This file is part of the utils of the Qt Toolkit. ** ** $QT_BEGIN_LICENSE:LGPL$ ** Commercial License Usage ** Licensees holding valid commercial Qt licenses may use this file in ** accordance with the commercial license agreement provided with the ** Software or, alternatively, in accordance with the terms contained in ** a written agreement between you and Digia. For licensing terms and ** conditions see http://qt.digia.com/licensing. For further information ** use the contact form at http://qt.digia.com/contact-us. ** ** 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, Digia gives you certain additional ** rights. These rights are described in the Digia Qt 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 #include "lalr.h" #include "parsetable.h" 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; } }