X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/4bc30f78dc54b245896dd04724019b9b767a7b33..78af9bbcd3cc7904cf304a3da91b45fe9528dd3c:/src/print.c diff --git a/src/print.c b/src/print.c index 2c2b8420..013b5780 100644 --- a/src/print.c +++ b/src/print.c @@ -30,6 +30,7 @@ #include "reader.h" #include "print.h" #include "reduce.h" +#include "closure.h" #if 0 static void @@ -48,57 +49,60 @@ static void print_core (FILE *out, int state) { int i; - core *statep = state_table[state].state; + short *sitems = state_table[state]->items; + int snitems = state_table[state]->nitems; - if (!statep->nitems) - return; + /* New experimental feature: if TRACE_FLAGS output all the items of + a state, not only its kernel. */ + if (trace_flag) + { + closure (sitems, snitems); + sitems = itemset; + snitems = nitemset; + } - for (i = 0; i < statep->nitems; i++) + if (snitems) { - short *sp; - short *sp1; - int rule; + for (i = 0; i < snitems; i++) + { + short *sp; + short *sp1; + int rule; - sp1 = sp = ritem + statep->items[i]; + sp1 = sp = ritem + sitems[i]; - while (*sp > 0) - sp++; + while (*sp > 0) + sp++; - rule = -(*sp); - fprintf (out, " %s -> ", tags[rule_table[rule].lhs]); + rule = -(*sp); + fprintf (out, " %s -> ", tags[rule_table[rule].lhs]); - for (sp = ritem + rule_table[rule].rhs; sp < sp1; sp++) - fprintf (out, "%s ", tags[*sp]); + for (sp = ritem + rule_table[rule].rhs; sp < sp1; sp++) + fprintf (out, "%s ", tags[*sp]); - fputc ('.', out); + fputc ('.', out); - for (/* Nothing */; *sp > 0; ++sp) - fprintf (out, " %s", tags[*sp]); + for (/* Nothing */; *sp > 0; ++sp) + fprintf (out, " %s", tags[*sp]); + + fprintf (out, _(" (rule %d)"), rule); + fputc ('\n', out); + } - fprintf (out, _(" (rule %d)"), rule); fputc ('\n', out); } - - fputc ('\n', out); } static void print_actions (FILE *out, int state) { int i; - int k; - int state1; - int symbol; - shifts *shiftp; - errs *errp; - reductions *redp; - int rule; - - shiftp = state_table[state].shift_table; - redp = state_table[state].reduction_table; - errp = err_table[state]; - - if (!shiftp && !redp) + + shifts *shiftp = state_table[state]->shifts; + reductions *redp = state_table[state]->reductions; + errs *errp = state_table[state]->errs; + + if (!shiftp->nshifts && !redp) { if (final_state == state) fprintf (out, _(" $default\taccept\n")); @@ -107,48 +111,34 @@ print_actions (FILE *out, int state) return; } - if (shiftp) - { - k = shiftp->nshifts; - - for (i = 0; i < k; i++) - { - if (!shiftp->shifts[i]) - continue; - state1 = shiftp->shifts[i]; - symbol = state_table[state1].accessing_symbol; - /* The following line used to be turned off. */ - if (ISVAR (symbol)) - break; - if (symbol == 0) /* I.e. strcmp(tags[symbol],"$")==0 */ - fprintf (out, - _(" $ \tgo to state %d\n"), state1); - else - fprintf (out, - _(" %-4s\tshift, and go to state %d\n"), - tags[symbol], state1); - } + for (i = 0; i < shiftp->nshifts; i++) + if (!SHIFT_IS_DISABLED (shiftp, i)) + { + int state1 = shiftp->shifts[i]; + int symbol = state_table[state1]->accessing_symbol; + /* The following line used to be turned off. */ + if (ISVAR (symbol)) + break; + if (symbol == 0) /* I.e. strcmp(tags[symbol],"$")==0 */ + fprintf (out, + _(" $ \tgo to state %d\n"), state1); + else + fprintf (out, + _(" %-4s\tshift, and go to state %d\n"), + tags[symbol], state1); + } - if (i > 0) - fputc ('\n', out); - } - else - { - i = 0; - k = 0; - } + if (i > 0) + fputc ('\n', out); if (errp) { - int j, nerrs; - - nerrs = errp->nerrs; - - for (j = 0; j < nerrs; j++) + int j; + for (j = 0; j < errp->nerrs; j++) { - if (!errp->errs[j]) + int symbol = errp->errs[j]; + if (!symbol) continue; - symbol = errp->errs[j]; fprintf (out, _(" %-4s\terror (nonassociative)\n"), tags[symbol]); } @@ -157,10 +147,10 @@ print_actions (FILE *out, int state) fputc ('\n', out); } - if (state_table[state].consistent && redp) + if (state_table[state]->consistent && redp) { - rule = redp->rules[0]; - symbol = rule_table[rule].lhs; + int rule = redp->rules[0]; + int symbol = rule_table[rule].lhs; fprintf (out, _(" $default\treduce using rule %d (%s)\n\n"), rule, tags[symbol]); } @@ -169,17 +159,16 @@ print_actions (FILE *out, int state) print_reductions (out, state); } - if (i < k) + if (i < shiftp->nshifts) { - for (; i < k; i++) - { - if (!shiftp->shifts[i]) - continue; - state1 = shiftp->shifts[i]; - symbol = state_table[state1].accessing_symbol; - fprintf (out, _(" %-4s\tgo to state %d\n"), - tags[symbol], state1); - } + for (; i < shiftp->nshifts; i++) + if (!SHIFT_IS_DISABLED (shiftp, i)) + { + int state1 = shiftp->shifts[i]; + int symbol = state_table[state1]->accessing_symbol; + fprintf (out, _(" %-4s\tgo to state %d\n"), + tags[symbol], state1); + } fputc ('\n', out); } @@ -188,11 +177,11 @@ print_actions (FILE *out, int state) static void print_state (FILE *out, int state) { - fputs ("\n\n", out); fprintf (out, _("state %d"), state); fputs ("\n\n", out); print_core (out, state); print_actions (out, state); + fputs ("\n\n", out); } /*-----------------------------------------. @@ -219,23 +208,27 @@ print_grammar (FILE *out) int column = 0; /* rule # : LHS -> RHS */ - fprintf (out, "\n%s\n\n", _("Grammar")); + fprintf (out, "%s\n\n", _("Grammar")); + fprintf (out, " %s\n", _("Number, Line, Rule")); for (i = 1; i <= nrules; i++) /* Don't print rules disabled in reduce_grammar_tables. */ - if (rule_table[i].lhs >= 0) + if (rule_table[i].useful) { - fprintf (out, _("rule %-4d %s ->"), i, tags[rule_table[i].lhs]); + fprintf (out, _(" %3d %3d %s ->"), + i, rule_table[i].line, tags[rule_table[i].lhs]); rule = &ritem[rule_table[i].rhs]; if (*rule > 0) while (*rule > 0) fprintf (out, " %s", tags[*rule++]); else - fprintf (out, " /* %s */", _("empty")); + fprintf (out, " /* %s */", _("empty")); fputc ('\n', out); } + fputs ("\n\n", out); + /* TERMINAL (type #) : rule #s terminal is on RHS */ - fprintf (out, "\n%s\n\n", _("Terminals, with rules where they appear")); + fprintf (out, "%s\n\n", _("Terminals, with rules where they appear")); fprintf (out, "%s (-1)\n", tags[0]); for (i = 0; i <= max_user_token_number; i++) @@ -257,9 +250,10 @@ print_grammar (FILE *out) } fprintf (out, "%s\n", buffer); } + fputs ("\n\n", out); - fprintf (out, "\n%s\n\n", - _("Nonterminals, with rules where they appear")); + + fprintf (out, "%s\n\n", _("Nonterminals, with rules where they appear")); for (i = ntokens; i <= nsyms - 1; i++) { int left_count = 0, right_count = 0; @@ -314,6 +308,7 @@ print_grammar (FILE *out) } fprintf (out, "%s\n", buffer); } + fputs ("\n\n", out); } void @@ -323,20 +318,29 @@ print_results (void) { int i; - /* We used to use just .out if spec_name_prefix (-p) was used, but + /* We used to use just .out if SPEC_NAME_PREFIX (-p) was used, but that conflicts with Posix. */ FILE *out = xfopen (spec_verbose_file, "w"); size_t size = obstack_object_size (&output_obstack); fwrite (obstack_finish (&output_obstack), 1, size, out); + if (size) + fputs ("\n\n", out); reduce_output (out); conflicts_output (out); print_grammar (out); + /* New experimental feature: output all the items of a state, + not only its kernel. Requires to run closure, which need + memory allocation/deallocation. */ + if (trace_flag) + new_closure (nitems); for (i = 0; i < nstates; i++) print_state (out, i); + if (trace_flag) + free_closure (); xfclose (out); }