static short *shiftset = NULL;
static short **kernel_base = NULL;
-static size_t *kernel_size = NULL;
+static int *kernel_size = NULL;
static short *kernel_items = NULL;
/* hash table for states, to recognize equivalent ones. */
}
shift_symbol = symbol_count;
- kernel_size = XCALLOC (size_t, nsyms);
+ kernel_size = XCALLOC (int, nsyms);
}
shiftcount = 0;
- for (i = 0; i < itemsetend - itemset; ++i)
+ for (i = 0; i < itemsetsize; ++i)
{
int symbol = ritem[itemset[i]];
if (symbol > 0)
get_state (int symbol)
{
int key;
- short *isp2;
int i;
core *sp;
{
if (sp->nitems == kernel_size[symbol])
{
- int i;
found = 1;
for (i = 0; i < kernel_size[symbol]; ++i)
if (kernel_base[symbol][i] != sp->items[i])
static void
save_reductions (void)
{
- short *isp;
- int item;
int count;
- reductions *p;
-
- short *rend;
+ int i;
/* Find and count the active items that represent ends of rules. */
count = 0;
- for (isp = itemset; isp < itemsetend; isp++)
+ for (i = 0; i < itemsetsize; ++i)
{
- item = ritem[*isp];
+ int item = ritem[itemset[i]];
if (item < 0)
redset[count++] = -item;
}
if (count)
{
- p = REDUCTIONS_ALLOC (count);
+ reductions *p = REDUCTIONS_ALLOC (count);
p->number = this_state->number;
p->nreds = count;