+2001-12-10 Akim Demaille <akim@epita.fr>
+
+ 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.
+
+
2001-12-10 Akim Demaille <akim@epita.fr>
* src/options.c (OPTN, DRTV, BOTH): New.
#include "complain.h"
#include "closure.h"
#include "LR0.h"
+#include "lalr.h"
#include "reduce.h"
int nstates;
int final_state;
state_t *first_state = NULL;
shifts *first_shift = NULL;
-reductions *first_reduction = NULL;
static state_t *this_state = NULL;
static state_t *last_state = NULL;
static shifts *last_shift = NULL;
-static reductions *last_reduction = NULL;
static int nshifts;
static short *shift_symbol = NULL;
if (count)
{
reductions *p = REDUCTIONS_ALLOC (count);
-
- p->number = this_state->number;
p->nreds = count;
-
shortcpy (p->rules, redset, count);
- if (last_reduction)
- last_reduction->next = p;
- else
- first_reduction = p;
- last_reduction = p;
+ this_state->reductions = p;
}
}
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. */
{
static void
output_actions (void)
{
+ int i;
nvectors = nstates + nvars;
froms = XCALLOC (short *, nvectors);
width = XCALLOC (short, nvectors);
token_actions ();
- LIST_FREE (shifts, first_shift);
- LIST_FREE (reductions, first_reduction);
XFREE (LA);
XFREE (LAruleno);
output_table ();
output_check ();
- LIST_FREE (state_t, first_state);
+
+ for (i = 0; i < nstates; ++i)
+ {
+ XFREE (state_table[i]->shifts);
+ XFREE (state_table[i]->reductions);
+ XFREE (state_table[i]->errs);
+ free (state_table[i]);
+ }
XFREE (state_table);
}
typedef struct reductions
{
- struct reductions *next;
- short number;
short nreds;
short rules[1];
} reductions;