/*
* STANDARD ML OF NEW JERSEY COPYRIGHT NOTICE, LICENSE AND DISCLAIMER.
*
* Copyright (c) 1989-1998 by Lucent Technologies
*
* Permission to use, copy, modify, and distribute this software and its
* documentation for any purpose and without fee is hereby granted, provided
* that the above copyright notice appear in all copies and that both the
* copyright notice and this permission notice and warranty disclaimer appear
* in supporting documentation, and that the name of Lucent Technologies, Bell
* Labs or any Lucent entity not be used in advertising or publicity pertaining
* to distribution of the software without specific, written prior permission.
*
* Lucent disclaims all warranties with regard to this software, including all
* implied warranties of merchantability and fitness. In no event shall Lucent
* be liable for any special, indirect or consequential damages or any damages
* whatsoever resulting from loss of use, data or profits, whether in an action
* of contract, negligence or other tortious action, arising out of or in
* connection with the use or performance of this software.
*
* Taken from this URL:
* http://www.smlnj.org/license.html
*
* This license is compatible with the GNU GPL (see section "Standard ML of New
* Jersey Copyright License"):
* http://www.gnu.org/licenses/license-list.html#StandardMLofNJ
*/
/*
* Copyright 1996-1999 by Scott Hudson, Frank Flannery, C. Scott Ananian
*/
package weka.core.parser.java_cup;
import java.util.Enumeration;
/** This class represents the complete "reduce-goto" table of the parser.
* It has one row for each state in the parse machines, and a column for
* each terminal symbol. Each entry contains a state number to shift to
* as the last step of a reduce.
*
* @see weka.core.parser.java_cup.parse_reduce_row
* @version last updated: 11/25/95
* @author Scott Hudson
*/
public class parse_reduce_table {
/*-----------------------------------------------------------*/
/*--- Constructor(s) ----------------------------------------*/
/*-----------------------------------------------------------*/
/** Simple constructor. Note: all terminals, non-terminals, and productions
* must already have been entered, and the viable prefix recognizer should
* have been constructed before this is called.
*/
public parse_reduce_table()
{
/* determine how many states we are working with */
_num_states = lalr_state.number();
/* allocate the array and fill it in with empty rows */
under_state = new parse_reduce_row[_num_states];
for (int i=0; i<_num_states; i++)
under_state[i] = new parse_reduce_row();
}
/*-----------------------------------------------------------*/
/*--- (Access to) Instance Variables ------------------------*/
/*-----------------------------------------------------------*/
/** How many rows/states in the machine/table. */
protected int _num_states;
/** How many rows/states in the machine/table. */
public int num_states() {return _num_states;}
/*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
/** Actual array of rows, one per state */
public parse_reduce_row[] under_state;
/*-----------------------------------------------------------*/
/*--- General Methods ---------------------------------------*/
/*-----------------------------------------------------------*/
/** Convert to a string. */
public String toString()
{
String result;
lalr_state goto_st;
int cnt;
result = "-------- REDUCE_TABLE --------\n";
for (int row = 0; row < num_states(); row++)
{
result += "From state #" + row + "\n";
cnt = 0;
for (int col = 0; col < parse_reduce_row.size(); col++)
{
/* pull out the table entry */
goto_st = under_state[row].under_non_term[col];
/* if it has action in it, print it */
if (goto_st != null)
{
result += " [non term " + col + "->";
result += "state " + goto_st.index() + "]";
/* end the line after the 3rd one */
cnt++;
if (cnt == 3)
{
result += "\n";
cnt = 0;
}
}
}
/* finish the line if we haven't just done that */
if (cnt != 0) result += "\n";
}
result += "-----------------------------";
return result;
}
/*-----------------------------------------------------------*/
}