#include "system.h"
#include "getargs.h"
+#include "symtab.h"
#include "gram.h"
#include "reader.h"
#include "closure.h"
{
short *rp;
fprintf (stderr, " %2d: .", array[i]);
- for (rp = &ritem[array[i]]; *rp > 0; ++rp)
- fprintf (stderr, " %s", tags[*rp]);
- fprintf (stderr, " (rule %d)\n", -*rp);
+ for (rp = &ritem[array[i]]; *rp >= 0; ++rp)
+ fprintf (stderr, " %s", symbols[*rp]->tag);
+ fprintf (stderr, " (rule %d)\n", -*rp - 1);
}
fputs ("\n\n", stderr);
}
fprintf (stderr, "FIRSTS\n");
for (i = ntokens; i < nsyms; i++)
{
- fprintf (stderr, "\t%s firsts\n", tags[i]);
+ fprintf (stderr, "\t%s firsts\n", symbols[i]->tag);
for (j = 0; j < nvars; j++)
if (BITISSET (FIRSTS (i), j))
- fprintf (stderr, "\t\t%d (%s)\n", j + ntokens, tags[j + ntokens]);
+ fprintf (stderr, "\t\t%d (%s)\n",
+ j + ntokens, symbols[j + ntokens]->tag);
}
fprintf (stderr, "\n\n");
}
for (i = ntokens; i < nsyms; i++)
{
- fprintf (stderr, "\t%s derives\n", tags[i]);
+ fprintf (stderr, "\t%s derives\n", symbols[i]->tag);
for (j = 0; j <= nrules; j++)
if (BITISSET (FDERIVES (i), j))
{
short *rhsp;
- fprintf (stderr, "\t\t%d:", j);
- for (rhsp = ritem + rule_table[j].rhs; *rhsp > 0; ++rhsp)
- fprintf (stderr, " %s", tags[*rhsp]);
+ fprintf (stderr, "\t\t%d:", j - 1);
+ for (rhsp = &ritem[rules[j].rhs]; *rhsp >= 0; ++rhsp)
+ fprintf (stderr, " %s", symbols[*rhsp]->tag);
fputc ('\n', stderr);
}
}
for (i = ntokens; i < nsyms; i++)
for (j = 0; derives[i][j] >= 0; ++j)
{
- int symbol = ritem[rule_table[derives[i][j]].rhs];
+ int symbol = ritem[rules[derives[i][j]].rhs];
if (ISVAR (symbol))
SETBIT (FIRSTS (i), symbol - ntokens);
}
for (ruleno = 0; ruleno < nrules + 1; ++ruleno)
if (BITISSET (ruleset, ruleno))
{
- int itemno = rule_table[ruleno].rhs;
+ int itemno = rules[ruleno].rhs;
while (c < n && core[c] < itemno)
{
itemset[nitemset] = core[c];