/** 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. 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. 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. 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. 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. 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. 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(); }