86 |
for (i = 0; i < nstates; i++) |
for (i = 0; i < nstates; i++) |
87 |
if (!states[i]->consistent) |
if (!states[i]->consistent) |
88 |
for (j = 0; j < states[i]->reductions->num; j++) |
for (j = 0; j < states[i]->reductions->num; j++) |
89 |
*np++ = &rules[states[i]->reductions->rules[j]]; |
*np++ = states[i]->reductions->rules[j]; |
90 |
} |
} |
91 |
|
|
92 |
|
|
141 |
{ |
{ |
142 |
int k = temp_map[TRANSITION_SYMBOL (sp, i)]++; |
int k = temp_map[TRANSITION_SYMBOL (sp, i)]++; |
143 |
from_state[k] = state; |
from_state[k] = state; |
144 |
to_state[k] = sp->states[i]; |
to_state[k] = sp->states[i]->number; |
145 |
} |
} |
146 |
} |
} |
147 |
|
|
200 |
transitions_t *sp = states[stateno]->transitions; |
transitions_t *sp = states[stateno]->transitions; |
201 |
|
|
202 |
int j; |
int j; |
203 |
for (j = 0; j < sp->num && TRANSITION_IS_SHIFT (sp, j); j++) |
FOR_EACH_SHIFT (sp, j) |
204 |
bitset_set (F[i], TRANSITION_SYMBOL (sp, j)); |
bitset_set (F[i], TRANSITION_SYMBOL (sp, j)); |
205 |
|
|
206 |
for (; j < sp->num; j++) |
for (; j < sp->num; j++) |
375 |
reduction from a shift. Otherwise, it is straightforward, |
reduction from a shift. Otherwise, it is straightforward, |
376 |
and the state is `consistent'. */ |
and the state is `consistent'. */ |
377 |
if (rp->num > 1 |
if (rp->num > 1 |
378 |
|| (rp->num == 1 && sp->num && TRANSITION_IS_SHIFT (sp, 0))) |
|| (rp->num == 1 && sp->num && |
379 |
|
!TRANSITION_IS_DISABLED (sp, 0) && TRANSITION_IS_SHIFT (sp, 0))) |
380 |
nlookaheads += rp->num; |
nlookaheads += rp->num; |
381 |
else |
else |
382 |
states[i]->consistent = 1; |
states[i]->consistent = 1; |
383 |
|
|
384 |
for (k = 0; k < sp->num; k++) |
for (k = 0; k < sp->num; k++) |
385 |
if (TRANSITION_IS_ERROR (sp, k)) |
if (!TRANSITION_IS_DISABLED (sp, k) && TRANSITION_IS_ERROR (sp, k)) |
386 |
{ |
{ |
387 |
states[i]->consistent = 0; |
states[i]->consistent = 0; |
388 |
break; |
break; |