int i;
for (i = sp->num - 1; i >= 0 && TRANSITION_IS_GOTO (sp, i); --i)
{
- if (ngotos == GOTO_NUMBER_MAX)
- fatal (_("too many gotos (max %d)"), GOTO_NUMBER_MAX);
-
+ if (ngotos >= GOTO_NUMBER_MAX)
+ abort ();
ngotos++;
goto_map[TRANSITION_SYMBOL (sp, i)]++;
}
low = goto_map[symbol];
high = goto_map[symbol + 1] - 1;
- while (low <= high)
+ for (;;)
{
+ if (high < low)
+ abort ();
middle = (low + high) / 2;
s = from_state[middle];
if (s == state)
else
high = middle - 1;
}
-
- assert (0);
- /* NOTREACHED */
- return 0;
}
{
state_number_t i;
int j, k;
- fprintf (out, _("Lookaheads: BEGIN\n"));
+ fprintf (out, "Lookaheads: BEGIN\n");
for (i = 0; i < nstates; ++i)
{
reductions_t *reds = states[i]->reductions;
if (reds->lookaheads[k])
++nlookaheads;
- fprintf (out, _("State %d: %d lookaheads\n"),
+ fprintf (out, "State %d: %d lookaheads\n",
i, nlookaheads);
if (reds->lookaheads)
for (j = 0; j < reds->num; ++j)
BITSET_FOR_EACH (iter, reds->lookaheads[j], k, 0)
{
- fprintf (out, _(" on %d (%s) -> rule %d\n"),
+ fprintf (out, " on %d (%s) -> rule %d\n",
k, symbols[k]->tag,
reds->rules[j]->number);
};
}
- fprintf (out, _("Lookaheads: END\n"));
+ fprintf (out, "Lookaheads: END\n");
}
void