#include "complain.h"
#include "closure.h"
#include "LR0.h"
+#include "lalr.h"
#include "reduce.h"
int nstates;
int final_state;
-core *first_state = NULL;
+state_t *first_state = NULL;
shifts *first_shift = NULL;
-reductions *first_reduction = NULL;
-static core *this_state = NULL;
-static core *last_state = 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;
/* hash table for states, to recognize equivalent ones. */
-#define STATE_TABLE_SIZE 1009
-static core **state_table = NULL;
+#define STATE_HASH_SIZE 1009
+static state_t **state_hash = NULL;
\f
static void
shiftset = XCALLOC (short, nsyms);
redset = XCALLOC (short, nrules + 1);
- state_table = XCALLOC (core *, STATE_TABLE_SIZE);
+ state_hash = XCALLOC (state_t *, STATE_HASH_SIZE);
}
free (kernel_base);
free (kernel_size);
XFREE (kernel_items);
- free (state_table);
+ free (state_hash);
}
new_itemsets (void)
{
int i;
- int shiftcount;
if (trace_flag)
fprintf (stderr, "Entering new_itemsets, state = %d\n",
kernel_size[i] = 0;
shift_symbol = XCALLOC (short, nsyms);
- shiftcount = 0;
+ nshifts = 0;
- for (i = 0; i < itemsetsize; ++i)
+ for (i = 0; i < nitemset; ++i)
{
int symbol = ritem[itemset[i]];
if (symbol > 0)
{
if (!kernel_size[symbol])
{
- shift_symbol[shiftcount] = symbol;
- shiftcount++;
+ shift_symbol[nshifts] = symbol;
+ nshifts++;
}
kernel_base[symbol][kernel_size[symbol]] = itemset[i] + 1;
kernel_size[symbol]++;
}
}
-
- nshifts = shiftcount;
}
| necessary. |
`-----------------------------------------------------------------*/
-static core *
+static state_t *
new_state (int symbol)
{
- core *p;
+ state_t *p;
if (trace_flag)
fprintf (stderr, "Entering new_state, state = %d, symbol = %d (%s)\n",
if (nstates >= MAXSHORT)
fatal (_("too many states (max %d)"), MAXSHORT);
- p = CORE_ALLOC (kernel_size[symbol]);
+ p = STATE_ALLOC (kernel_size[symbol]);
p->accessing_symbol = symbol;
p->number = nstates;
p->nitems = kernel_size[symbol];
{
int key;
int i;
- core *sp;
+ state_t *sp;
if (trace_flag)
fprintf (stderr, "Entering get_state, state = %d, symbol = %d (%s)\n",
key = 0;
for (i = 0; i < kernel_size[symbol]; ++i)
key += kernel_base[symbol][i];
- key = key % STATE_TABLE_SIZE;
- sp = state_table[key];
+ key = key % STATE_HASH_SIZE;
+ sp = state_hash[key];
if (sp)
{
}
else /* bucket is empty */
{
- state_table[key] = sp = new_state (symbol);
+ state_hash[key] = sp = new_state (symbol);
}
if (trace_flag)
static void
new_states (void)
{
- first_state = last_state = this_state = CORE_ALLOC (0);
+ first_state = last_state = this_state = STATE_ALLOC (0);
nstates = 1;
}
shifts *p = shifts_new (nshifts);
p->number = this_state->number;
-
shortcpy (p->shifts, shiftset, nshifts);
+ this_state->shifts = p;
if (last_shift)
last_shift->next = p;
/*------------------------------------------------------------------.
| Subroutine of augment_automaton. Create the next-to-final state, |
| to which a shift has already been made in the initial state. |
+| |
+| The task of this state consists in shifting (actually, it's a |
+| goto, but shifts and gotos are both stored in SHIFTS) the start |
+| symbols, hence the name. |
`------------------------------------------------------------------*/
static void
-insert_start_shift (void)
+insert_start_shifting_state (void)
{
- core *statep;
+ state_t *statep;
shifts *sp;
- statep = CORE_ALLOC (0);
+ statep = STATE_ALLOC (0);
statep->number = nstates;
+
+ /* The distinctive feature of this state from the
+ eof_shifting_state, is that it is labeled as post-start-symbol
+ shifting. I fail to understand why this state, and the
+ post-start-start can't be merged into one. But it does fail if
+ you try. --akim */
statep->accessing_symbol = start_symbol;
last_state->next = statep;
/* Make a shift from this state to (what will be) the final state. */
sp = shifts_new (1);
+ statep->shifts = sp;
+ sp->number = nstates++;
+ sp->shifts[0] = nstates;
+
+ last_shift->next = sp;
+ last_shift = sp;
+}
+
+
+/*-----------------------------------------------------------------.
+| Subroutine of augment_automaton. Create the final state, which |
+| shifts `0', the end of file. The initial state shifts the start |
+| symbol, and goes to here. |
+`-----------------------------------------------------------------*/
+
+static void
+insert_eof_shifting_state (void)
+{
+ state_t *statep;
+ shifts *sp;
+
+ /* Make the final state--the one that follows a shift from the
+ next-to-final state.
+ The symbol for that shift is 0 (end-of-file). */
+ statep = STATE_ALLOC (0);
+ statep->number = nstates;
+
+ last_state->next = statep;
+ last_state = statep;
+
+ /* Make the shift from the final state to the termination state. */
+ sp = shifts_new (1);
+ statep->shifts = sp;
sp->number = nstates++;
sp->shifts[0] = nstates;
}
+/*---------------------------------------------------------------.
+| Subroutine of augment_automaton. Create the accepting state. |
+`---------------------------------------------------------------*/
+
+static void
+insert_accepting_state (void)
+{
+ state_t *statep;
+
+ /* Note that the variable `final_state' refers to what we sometimes
+ call the termination state. */
+ final_state = nstates;
+
+ /* Make the termination state. */
+ statep = STATE_ALLOC (0);
+ statep->number = nstates++;
+ last_state->next = statep;
+ last_state = statep;
+}
+
+
+
+
+
/*------------------------------------------------------------------.
| Make sure that the initial state has a shift that accepts the |
| grammar's start symbol and goes to the next-to-final state, which |
static void
augment_automaton (void)
{
- core *statep;
- shifts *sp;
- shifts *sp1 = NULL;
-
- sp = first_shift;
-
- if (!sp->nshifts)
+ if (!first_shift->nshifts)
{
/* There are no shifts for any state. Make one shift, from the
initial state to the next-to-final state. */
- sp = shifts_new (1);
+ shifts *sp = shifts_new (1);
+ first_state->shifts = sp;
sp->shifts[0] = nstates;
/* Initialize the chain of shifts with sp. */
/* Create the next-to-final state, with shift to
what will be the final state. */
- insert_start_shift ();
+ insert_start_shifting_state ();
}
- else if (sp->number == 0)
+ else if (first_shift->number == 0)
{
- statep = first_state->next;
-
+ state_t *statep = first_state->next;
+ shifts *sp = first_shift;
+ shifts *sp1 = NULL;
/* The states reached by shifts from FIRST_STATE are numbered
1..(SP->NSHIFTS). Look for one reached by START_SYMBOL. */
- while (statep->accessing_symbol < start_symbol
+ while (statep->accessing_symbol != start_symbol
&& statep->number < sp->nshifts)
statep = statep->next;
int i;
shifts *sp2 = shifts_new (sp->nshifts + 1);
sp2->number = statep->number;
+ statep->shifts = sp2;
sp2->shifts[0] = nstates;
for (i = sp->nshifts; i > 0; i--)
sp2->shifts[i] = sp->shifts[i - 1];
{
shifts *sp2 = shifts_new (1);
sp2->number = statep->number;
+ statep->shifts = sp2;
sp2->shifts[0] = nstates;
/* Patch sp2 into the chain of shifts between sp1 and sp. */
{
int i, k;
shifts *sp2;
+ sp = first_shift;
/* There is no next-to-final state as yet. */
/* Add one more shift in first_shift,
going to the next-to-final state (yet to be made). */
- sp = first_shift;
-
sp2 = shifts_new (sp->nshifts + 1);
-
+ first_state->shifts = sp2;
/* Stick this shift into the vector at the proper place. */
statep = first_state->next;
for (k = 0, i = 0; i < sp->nshifts; k++, i++)
/* Create the next-to-final state, with shift to
what will be the final state. */
- insert_start_shift ();
+ insert_start_shifting_state ();
}
}
else
{
/* The initial state didn't even have any shifts.
Give it one shift, to the next-to-final state. */
- sp = shifts_new (1);
+ shifts *sp = shifts_new (1);
+ first_state->shifts = sp;
sp->shifts[0] = nstates;
/* Patch sp into the chain of shifts at the beginning. */
/* Create the next-to-final state, with shift to
what will be the final state. */
- insert_start_shift ();
+ insert_start_shifting_state ();
}
- /* Make the final state--the one that follows a shift from the
- next-to-final state.
- The symbol for that shift is 0 (end-of-file). */
- statep = CORE_ALLOC (0);
- statep->number = nstates;
- last_state->next = statep;
- last_state = statep;
-
- /* Make the shift from the final state to the termination state. */
- sp = shifts_new (1);
- sp->number = nstates++;
- sp->shifts[0] = nstates;
- last_shift->next = sp;
- last_shift = sp;
-
- /* Note that the variable `final_state' refers to what we sometimes call
- the termination state. */
- final_state = nstates;
-
- /* Make the termination state. */
- statep = CORE_ALLOC (0);
- statep->number = nstates++;
- last_state->next = statep;
- last_state = statep;
+ insert_eof_shifting_state ();
+ insert_accepting_state ();
}
/* Find and count the active items that represent ends of rules. */
count = 0;
- for (i = 0; i < itemsetsize; ++i)
+ for (i = 0; i < nitemset; ++i)
{
int item = ritem[itemset[i]];
if (item < 0)
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;
}
}
projects / bison.git / blobdiff