403 |
{ |
{ |
404 |
state_number_t i; |
state_number_t i; |
405 |
int j, k; |
int j, k; |
406 |
fprintf (out, _("Lookaheads: BEGIN\n")); |
fprintf (out, "Lookaheads: BEGIN\n"); |
407 |
for (i = 0; i < nstates; ++i) |
for (i = 0; i < nstates; ++i) |
408 |
{ |
{ |
409 |
reductions_t *reds = states[i]->reductions; |
reductions_t *reds = states[i]->reductions; |
415 |
if (reds->lookaheads[k]) |
if (reds->lookaheads[k]) |
416 |
++nlookaheads; |
++nlookaheads; |
417 |
|
|
418 |
fprintf (out, _("State %d: %d lookaheads\n"), |
fprintf (out, "State %d: %d lookaheads\n", |
419 |
i, nlookaheads); |
i, nlookaheads); |
420 |
|
|
421 |
if (reds->lookaheads) |
if (reds->lookaheads) |
422 |
for (j = 0; j < reds->num; ++j) |
for (j = 0; j < reds->num; ++j) |
423 |
BITSET_FOR_EACH (iter, reds->lookaheads[j], k, 0) |
BITSET_FOR_EACH (iter, reds->lookaheads[j], k, 0) |
424 |
{ |
{ |
425 |
fprintf (out, _(" on %d (%s) -> rule %d\n"), |
fprintf (out, " on %d (%s) -> rule %d\n", |
426 |
k, symbols[k]->tag, |
k, symbols[k]->tag, |
427 |
reds->rules[j]->number); |
reds->rules[j]->number); |
428 |
}; |
}; |
429 |
} |
} |
430 |
fprintf (out, _("Lookaheads: END\n")); |
fprintf (out, "Lookaheads: END\n"); |
431 |
} |
} |
432 |
|
|
433 |
void |
void |