240 |
| Use the information computed by new_itemsets to find the state | |
| Use the information computed by new_itemsets to find the state | |
241 |
| numbers reached by each shift transition from STATE. | |
| numbers reached by each shift transition from STATE. | |
242 |
| | |
| | |
243 |
| SHIFTSET is set up as a vector of state numbers of those states. | |
| TRANSITIONSET is set up as a vector of state numbers of those states. | |
244 |
`------------------------------------------------------------------*/ |
`------------------------------------------------------------------*/ |
245 |
|
|
246 |
static void |
static void |
336 |
reduced to 0. */ |
reduced to 0. */ |
337 |
state_t *state = this->state; |
state_t *state = this->state; |
338 |
if (!state->shifts) |
if (!state->shifts) |
339 |
state_shifts_set (state, 0, 0); |
state_transitions_set (state, 0, 0); |
340 |
if (!state->errs) |
if (!state->errs) |
341 |
state->errs = errs_new (0); |
state->errs = errs_new (0); |
342 |
if (!state->reductions) |
if (!state->reductions) |
387 |
|
|
388 |
/* Create the shifts structures for the shifts to those states, |
/* Create the shifts structures for the shifts to those states, |
389 |
now that the state numbers transitioning to are known. */ |
now that the state numbers transitioning to are known. */ |
390 |
state_shifts_set (state, nshifts, shiftset); |
state_transitions_set (state, nshifts, shiftset); |
391 |
|
|
392 |
/* States are queued when they are created; process them all. |
/* States are queued when they are created; process them all. |
393 |
*/ |
*/ |