/** Simple constructor. 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_action_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_action_row[_num_states]; for (int i=0; i<_num_states; i++) under_state[i] = new parse_action_row(); }
/** Simple constructor. Note: this should not be used until the number of * terminals in the grammar has been established. */ public parse_action_row() { /* make sure the size is set */ if (_size <= 0 ) _size = terminal.number(); /* allocate the array */ under_term = new parse_action[size()]; /* set each element to an error action */ for (int i=0; i<_size; i++) under_term[i] = new parse_action(); }
row.compute_default(); else row.default_reduce = -1; for (int j = 0; j < row.size(); j++)
row.compute_default(); else row.default_reduce = -1;
non_terminal.clear(); parse_reduce_row.clear(); parse_action_row.clear(); lalr_state.clear();
row.compute_default(); else row.default_reduce = -1; short[] temp_table = new short[2*row.size()]; int nentries = 0; for (int j = 0; j < row.size(); j++)
/** Simple constructor. Note: this should not be used until the number of * terminals in the grammar has been established. */ public parse_action_row() { /* make sure the size is set */ if (_size <= 0 ) _size = terminal.number(); /* allocate the array */ under_term = new parse_action[size()]; /* set each element to an error action */ for (int i=0; i<_size; i++) under_term[i] = new parse_action(); }
row.compute_default(); else row.default_reduce = -1; short[] temp_table = new short[2*row.size()]; int nentries = 0; for (int j = 0; j < row.size(); j++)
/** Simple constructor. 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_action_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_action_row[_num_states]; for (int i=0; i<_num_states; i++) under_state[i] = new parse_action_row(); }
/** Simple constructor. Note: this should not be used until the number of * terminals in the grammar has been established. */ public parse_action_row() { /* make sure the size is set */ if (_size <= 0 ) _size = terminal.number(); /* allocate the array */ under_term = new parse_action[size()]; /* set each element to an error action */ for (int i=0; i<_size; i++) under_term[i] = new parse_action(); }
row.compute_default(); else row.default_reduce = -1; short[] temp_table = new short[2*parse_action_row.size()]; int nentries = 0; for (int j = 0; j < parse_action_row.size(); j++)
/** Simple constructor. 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_action_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_action_row[_num_states]; for (int i=0; i<_num_states; i++) under_state[i] = new parse_action_row(); }
/** Simple constructor. Note: this should not be used until the number of * terminals in the grammar has been established. */ public parse_action_row() { /* make sure the size is set */ if (_size <= 0 ) _size = terminal.number(); /* allocate the array */ under_term = new parse_action[size()]; /* set each element to an error action */ for (int i=0; i<_size; i++) under_term[i] = new parse_action(); }
row.compute_default(); else row.default_reduce = -1; short[] temp_table = new short[2*row.size()]; int nentries = 0; for (int j = 0; j < row.size(); j++)
/** Simple constructor. 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_action_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_action_row[_num_states]; for (int i=0; i<_num_states; i++) under_state[i] = new parse_action_row(); }
/** Simple constructor. Note: this should not be used until the number of * terminals in the grammar has been established. */ public parse_action_row() { /* make sure the size is set */ if (_size <= 0 ) _size = terminal.number(); /* allocate the array */ under_term = new parse_action[size()]; /* set each element to an error action */ for (int i=0; i<_size; i++) under_term[i] = new parse_action(); }
row.compute_default(); else row.default_reduce = -1; short[] temp_table = new short[2*row.size()]; int nentries = 0; for (int j = 0; j < row.size(); j++)
/** Simple constructor. 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_action_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_action_row[_num_states]; for (int i=0; i<_num_states; i++) under_state[i] = new parse_action_row(); }
/** Simple constructor. Note: this should not be used until the number of * terminals in the grammar has been established. */ public parse_action_row() { /* make sure the size is set */ if (_size <= 0 ) _size = terminal.number(); /* allocate the array */ under_term = new parse_action[size()]; /* set each element to an error action */ for (int i=0; i<_size; i++) under_term[i] = new parse_action(); }
/** Simple constructor. 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_action_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_action_row[_num_states]; for (int i=0; i<_num_states; i++) under_state[i] = new parse_action_row(); }