+2001-12-10 Akim Demaille <akim@epita.fr>
+
+ * src/LR0.c (augment_automaton): Call `insert_eof_shifting_state'
+ only when appropriate: when insert_start_shifting_state' is not
+ invoked.
+ * tests/regression.at (Rule Line Numbers): Adjust.
+
+
2001-12-10 Akim Demaille <akim@epita.fr>
* src/LR0.c (augment_automaton): Now that all states have shifts,
else
{
state_t *statep = first_state->next;
- shifts *sp = first_shift;
+ shifts *sp = first_state->shifts;
shifts *sp1 = NULL;
/* The states reached by shifts from FIRST_STATE are numbered
- 1..(SP->NSHIFTS). Look for one reached by START_SYMBOL. */
+ 1..(SP->NSHIFTS). Look for one reached by START_SYMBOL.
+ This is typical of `start: start ... ;': there is a state
+ with the item `start: start . ...'. We want to add a `shift
+ on EOF to eof-shifting state here. */
while (statep->accessing_symbol != start_symbol
&& statep->number < sp->nshifts)
statep = statep->next;
if (statep->accessing_symbol == start_symbol)
{
- /* We already have a next-to-final state.
- Make sure it has a shift to what will be the final state. */
+ /* We already have a next-to-final state, i.e., for `start:
+ start . ...'. Make sure it has a shift to what will be
+ the final state. */
while (sp && sp->number < statep->number)
{
sp1 = sp;
if (sp == 0)
last_shift = sp2;
}
+ insert_eof_shifting_state ();
}
else
{
+ /* There is no state for `start: start . ...'. */
int i, k;
shifts *sp2;
sp = first_shift;
XFREE (sp);
- /* Create the next-to-final state, with shift to
- what will be the final state. */
+ /* Create the next-to-final state, with shift to what will
+ be the final state. Corresponds to `start: start . ...'. */
insert_start_shifting_state ();
}
}
- insert_eof_shifting_state ();
insert_accepting_state ();
}