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 #include "lalr.h"

    45 #include "parsetable.h"

    46 

    47 ParseTable::ParseTable (QTextStream &o):

    48   out (o)

    49 {

    50 }

    51 

    52 void ParseTable::operator () (Automaton *aut)

    53 {

    54   Grammar *g = aut->_M_grammar;

    55 

    56   int rindex = 1;

    57   for (RulePointer rule = g->rules.begin (); rule != g->rules.end (); ++rule)

    58     out << rindex++ << ")\t" << *rule << endl;

    59   out << endl << endl;

    60 

    61   int index = 0;

    62   for (StatePointer state = aut->states.begin (); state != aut->states.end (); ++state)

    63     {

    64       out << "state " << index++ << endl << endl;

    65 

    66       for (ItemPointer item = state->kernel.begin (); item != state->kernel.end (); ++item)

    67         {

    68           out << " *  " << *item;

    69 

    70           if (item->dot == item->end_rhs ())

    71             out << " " << aut->lookaheads [item];

    72 

    73           out << endl;

    74         }

    75 

    76       bool first = true;

    77       for (Bundle::iterator arrow = state->bundle.begin (); arrow != state->bundle.end (); ++arrow)

    78         {

    79           if (! g->isTerminal (arrow.key ()))

    80             continue;

    81 

    82           if (first)

    83             out << endl;

    84 

    85           first = false;

    86 

    87           out << "    " << *arrow.key () << " shift, and go to state " << std::distance (aut->states.begin (), *arrow) << endl;

    88         }

    89 

    90       first = true;

    91       for (ItemPointer item = state->closure.begin (); item != state->closure.end (); ++item)

    92         {

    93           if (item->dot != item->end_rhs () || item->rule == state->defaultReduce)

    94             continue;

    95 

    96           if (first)

    97             out << endl;

    98 

    99           first = false;

   100 

   101           foreach (Name la, aut->lookaheads.value (item))

   102             out << "    " << *la << " reduce using rule " << aut->id (item->rule) << " (" << *item->rule->lhs << ")" << endl;

   103         }

   104 

   105       first = true;

   106       for (Bundle::iterator arrow = state->bundle.begin (); arrow != state->bundle.end (); ++arrow)

   107         {

   108           if (! g->isNonTerminal (arrow.key ()))

   109             continue;

   110 

   111           if (first)

   112             out << endl;

   113 

   114           first = false;

   115 

   116           out << "    " << *arrow.key () << " go to state " << std::distance (aut->states.begin (), *arrow) << endl;

   117         }

   118 

   119       if (state->defaultReduce != g->rules.end ())

   120         {

   121           out << endl

   122               << "    $default reduce using rule " << aut->id (state->defaultReduce) << " (" << *state->defaultReduce->lhs << ")" << endl;

   123         }

   124 

   125       out << endl;

   126     }

   127 }