static unsigned *fderives;
static unsigned *firsts;
+#define FDERIVES(Symbol) (fderives + (Symbol) * rulesetsize)
+#define FIRSTS(Symbol) (firsts + (Symbol) * varsetsize)
+
/* number of words required to hold a bit for each rule */
static int rulesetsize;
{
short *isp;
- fprintf (stderr, "\n\nn = %d\n\n", n);
+ fprintf (stderr, "n = %d\n", n);
for (isp = itemset; isp < itemsetend; isp++)
fprintf (stderr, " %d\n", *isp);
+ fprintf (stderr, "\n\n");
}
int j;
unsigned *rowp;
- fprintf (stderr, "\n\n\nFIRSTS\n\n");
+ fprintf (stderr, "FIRSTS\n");
for (i = ntokens; i < nsyms; i++)
{
- fprintf (stderr, "\n\n%s firsts\n\n", tags[i]);
+ fprintf (stderr, "\t%s firsts\n", tags[i]);
- rowp = firsts + ((i - ntokens) * varsetsize);
+ rowp = FIRSTS (i - ntokens);
for (j = 0; j < nvars; j++)
if (BITISSET (rowp, j))
- fprintf (stderr, " %s\n", tags[j + ntokens]);
+ fprintf (stderr, "\t\t%d (%s)\n", j + ntokens, tags[j + ntokens]);
}
+ fprintf (stderr, "\n\n");
}
int j;
unsigned *rp;
- fprintf (stderr, "\n\n\nFDERIVES\n");
+ fprintf (stderr, "FDERIVES\n");
for (i = ntokens; i < nsyms; i++)
{
- fprintf (stderr, "\n\n%s derives\n\n", tags[i]);
- rp = fderives + i * rulesetsize;
+ fprintf (stderr, "\t%s derives\n", tags[i]);
+ rp = FDERIVES (i);
for (j = 0; j <= nrules; j++)
if (BITISSET (rp, j))
- fprintf (stderr, " %d\n", j);
+ fprintf (stderr, "\t\t%d (%s)\n", j, tags[j]);
}
+ fprintf (stderr, "\n\n");
}
\f
/*-------------------------------------------------------------------.
set_firsts ();
- rrow = fderives + ntokens * rulesetsize;
+ rrow = FDERIVES (ntokens);
for (i = ntokens; i < nsyms; i++)
{
- vrow = firsts + ((i - ntokens) * varsetsize);
+ vrow = FIRSTS (i - ntokens);
cword = *vrow++;
b = 0;
for (j = ntokens; j < nsyms; j++)
{
rp = derives[j];
while ((ruleno = *rp++) > 0)
- {
- SETBIT (rrow, ruleno);
- }
+ SETBIT (rrow, ruleno);
}
b++;
closure (short *core, int n)
{
int ruleno;
- unsigned word;
short *csp;
- unsigned *dsp;
- unsigned *rsp;
- short *csend;
- unsigned *rsend;
- int symbol;
int itemno;
+ int i;
- rsp = ruleset;
- rsend = ruleset + rulesetsize;
- csend = core + n;
+ if (trace_flag)
+ {
+ fprintf (stderr, "Entering closure (items = {");
+ for (i = 0; i < n; ++i)
+ fprintf (stderr, " %d ", core[i]);
+ fprintf (stderr, "}, nitems = %d)\n", n);
+ }
if (n == 0)
{
- dsp = fderives + start_symbol * rulesetsize;
- while (rsp < rsend)
- *rsp++ = *dsp++;
+ for (i = 0; i < rulesetsize; ++i)
+ ruleset[i] = FDERIVES (start_symbol)[i];
}
else
{
- while (rsp < rsend)
- *rsp++ = 0;
+ for (i = 0; i < rulesetsize; ++i)
+ ruleset[i] = 0;
- csp = core;
- while (csp < csend)
+ for (i = 0; i < n; ++i)
{
- symbol = ritem[*csp++];
+ int symbol = ritem[core[i]];
if (ISVAR (symbol))
{
- dsp = fderives + symbol * rulesetsize;
- rsp = ruleset;
- while (rsp < rsend)
- *rsp++ |= *dsp++;
+ int j;
+ for (j = 0; j < rulesetsize; ++j)
+ ruleset[j] |= FDERIVES (symbol)[j];
}
}
}
ruleno = 0;
itemsetend = itemset;
csp = core;
- rsp = ruleset;
- while (rsp < rsend)
+ for (i= 0; i < rulesetsize; ++i)
{
- word = *rsp++;
+ int word = ruleset[i];
if (word == 0)
{
ruleno += BITS_PER_WORD;
if (word & (1 << b))
{
itemno = rule_table[ruleno].rhs;
- while (csp < csend && *csp < itemno)
+ while (csp < (core + n ) && *csp < itemno)
*itemsetend++ = *csp++;
*itemsetend++ = itemno;
}
}
}
- while (csp < csend)
+ while (csp < (core + n))
*itemsetend++ = *csp++;
if (trace_flag)