/** 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(); }
/** Simple constructor. Note: this should not be used until the number * of terminals in the grammar has been established. */ public parse_reduce_row() { /* make sure the size is set */ if (_size <= 0 ) _size = non_terminal.number(); /* allocate the array */ under_non_term = new lalr_state[size()]; }
emit.clear(); non_terminal.clear(); parse_reduce_row.clear(); parse_action_row.clear(); lalr_state.clear();
/** Simple constructor. Note: this should not be used until the number * of terminals in the grammar has been established. */ public parse_reduce_row() { /* make sure the size is set */ if (_size <= 0 ) _size = non_terminal.number(); /* allocate the array */ under_non_term = new lalr_state[size()]; }
/** 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(); }
/** Simple constructor. Note: this should not be used until the number * of terminals in the grammar has been established. */ public parse_reduce_row() { /* make sure the size is set */ if (_size <= 0 ) _size = non_terminal.number(); /* allocate the array */ under_non_term = new lalr_state[size()]; }
/** 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(); }
/** Simple constructor. Note: this should not be used until the number * of terminals in the grammar has been established. */ public parse_reduce_row() { /* make sure the size is set */ if (_size <= 0 ) _size = non_terminal.number(); /* allocate the array */ under_non_term = new lalr_state[size()]; }
/** 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(); }
/** Simple constructor. Note: this should not be used until the number * of terminals in the grammar has been established. */ public parse_reduce_row() { /* make sure the size is set */ if (_size <= 0 ) _size = non_terminal.number(); /* allocate the array */ under_non_term = new lalr_state[size()]; }
/** 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(); }
/** Simple constructor. Note: this should not be used until the number * of terminals in the grammar has been established. */ public parse_reduce_row() { /* make sure the size is set */ if (_size <= 0 ) _size = non_terminal.number(); /* allocate the array */ under_non_term = new lalr_state[size()]; }
/** 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(); }
/** Simple constructor. Note: this should not be used until the number * of terminals in the grammar has been established. */ public parse_reduce_row() { /* make sure the size is set */ if (_size <= 0 ) _size = non_terminal.number(); /* allocate the array */ under_non_term = new lalr_state[size()]; }
/** 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(); }
for (int j=0; j<red_tab.under_state[i].size(); j++)