X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/2c5f66eda72bb8b158bccf0a528d9dbb2c839f0c..ae4048011562c250d2f3c96687422d99a38745ce:/src/derives.c?ds=sidebyside diff --git a/src/derives.c b/src/derives.c index ec7173d9..795bc08e 100644 --- a/src/derives.c +++ b/src/derives.c @@ -19,47 +19,45 @@ Boston, MA 02111-1307, USA. */ -/* set_derives finds, for each variable (nonterminal), which rules can - derive it. It sets up the value of derives so that derives[i - - ntokens] points to a vector of rule numbers, terminated with -1. - */ - #include "system.h" +#include "getargs.h" +#include "symtab.h" #include "types.h" #include "reader.h" #include "gram.h" #include "derives.h" -short **derives; - -#if TRACE +short **derives = NULL; static void print_derives (void) { int i; - short *sp; - fputs ("\n\n\nDERIVES\n\n", stderr); + fputs ("DERIVES\n", stderr); for (i = ntokens; i < nsyms; i++) { - fprintf (stderr, "%s derives", tags[i]); + short *sp; + fprintf (stderr, "\t%s derives\n", symbols[i]->tag); for (sp = derives[i]; *sp > 0; sp++) - fprintf (stderr, " %d", *sp); - putc ('\n', stderr); + { + short *rhsp; + fprintf (stderr, "\t\t%d:", *sp); + for (rhsp = &ritem[rules[*sp].rhs]; *rhsp >= 0; ++rhsp) + fprintf (stderr, " %s", symbols[*rhsp]->tag); + fprintf (stderr, " (rule %d)\n", -*rhsp - 1); + } } - putc ('\n', stderr); + fputs ("\n\n", stderr); } -#endif void set_derives (void) { int i; - int lhs; shorts *p; short *q; shorts **dset; @@ -70,16 +68,14 @@ set_derives (void) p = delts; for (i = nrules; i > 0; i--) - { - lhs = rule_table[i].lhs; - if (lhs >= 0) - { - p->next = dset[lhs]; - p->value = i; - dset[lhs] = p; - p++; - } - } + if (rules[i].useful) + { + int lhs = rules[i].lhs; + p->next = dset[lhs]; + p->value = i; + dset[lhs] = p; + p++; + } derives = XCALLOC (short *, nvars) - ntokens; q = XCALLOC (short, nvars + nrules); @@ -96,9 +92,8 @@ set_derives (void) *q++ = -1; } -#if TRACE - print_derives (); -#endif + if (trace_flag) + print_derives (); XFREE (dset + ntokens); XFREE (delts);