Now that states have a complete set of members, the linked list of

reductions is useless: just fill directly the state's reductions
member.
* src/state.h (struct reductions): Remove member `number' and
`next'.
* src/LR0.c (first_reduction, last_reduction): Remove.
(save_reductions): Don't link the new reductions, store them in
this_state.
* src/lalr.c (set_state_table): No need to attach reductions to
states, it's already done.
* src/output.c (output_actions): No longer free the shifts, then
the reductions, then the states: free all the states and their
members.
This commit is contained in:
Akim Demaille
2001-12-10 09:06:48 +00:00
parent 0edad74997
commit 49701457c2
5 changed files with 29 additions and 21 deletions

View File

@@ -156,12 +156,6 @@ set_state_table (void)
state_table[sp->number]->shifts = sp;
}
{
reductions *rp;
for (rp = first_reduction; rp; rp = rp->next)
state_table[rp->number]->reductions = rp;
}
/* Pessimization, but simplification of the code: make sure all the
states have a shifts, even if reduced to 0 shifts. */
{