X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/1565b72064b66f8aa0e8bdb474cab810192537d0..f377f69fec28013c79db4efe12bbb9d48987fb2c:/src/closure.c diff --git a/src/closure.c b/src/closure.c index 928b6867..3d5ac28d 100644 --- a/src/closure.c +++ b/src/closure.c @@ -59,8 +59,7 @@ print_closure (const char *title, item_number_t *array, size_t size) item_number_t *rp; fprintf (stderr, " %2d: .", array[i]); for (rp = &ritem[array[i]]; *rp >= 0; ++rp) - fprintf (stderr, " %s", - quotearg_style (escape_quoting_style, symbols[*rp]->tag)); + fprintf (stderr, " %s", symbols[*rp]->tag); fprintf (stderr, " (rule %d)\n", -*rp - 1); } fputs ("\n\n", stderr); @@ -70,18 +69,18 @@ print_closure (const char *title, item_number_t *array, size_t size) static void print_firsts (void) { - int i, j; + symbol_number_t i, j; fprintf (stderr, "FIRSTS\n"); for (i = ntokens; i < nsyms; i++) { - fprintf (stderr, "\t%s firsts\n", - quotearg_style (escape_quoting_style, symbols[i]->tag)); - for (j = 0; j < nvars; j++) - if (bitset_test (FIRSTS (i), j)) + bitset_iterator iter; + fprintf (stderr, "\t%s firsts\n", symbols[i]->tag); + BITSET_FOR_EACH (iter, FIRSTS (i), j, 0) + { fprintf (stderr, "\t\t%s\n", - quotearg_style (escape_quoting_style, - symbols[j + ntokens]->tag)); + symbols[j + ntokens]->tag); + } } fprintf (stderr, "\n\n"); } @@ -90,24 +89,19 @@ print_firsts (void) static void print_fderives (void) { - int i, j; + int i; + rule_number_t r; fprintf (stderr, "FDERIVES\n"); for (i = ntokens; i < nsyms; i++) { - fprintf (stderr, "\t%s derives\n", - quotearg_style (escape_quoting_style, symbols[i]->tag)); - for (j = 0; j < nrules + 1; j++) - if (bitset_test (FDERIVES (i), j)) - { - item_number_t *rhsp; - fprintf (stderr, "\t\t%d:", j - 1); - for (rhsp = rules[j].rhs; *rhsp >= 0; ++rhsp) - fprintf (stderr, " %s", - quotearg_style (escape_quoting_style, - symbols[*rhsp]->tag)); - fputc ('\n', stderr); - } + bitset_iterator iter; + fprintf (stderr, "\t%s derives\n", symbols[i]->tag); + BITSET_FOR_EACH (iter, FDERIVES (i), r, 0) + { + fprintf (stderr, "\t\t%3d ", r); + rule_rhs_print (&rules[r], stderr); + } } fprintf (stderr, "\n\n"); } @@ -126,25 +120,25 @@ print_fderives (void) static void set_firsts (void) { - int i, j; + symbol_number_t i, j; firsts = bitsetv_create (nvars, nvars, BITSET_FIXED); for (i = ntokens; i < nsyms; i++) - for (j = 0; derives[i][j] >= 0; ++j) + for (j = 0; derives[i][j]; ++j) { - int symbol = rules[derives[i][j]].rhs[0]; + int symbol = derives[i][j]->rhs[0]; if (ISVAR (symbol)) bitset_set (FIRSTS (i), symbol - ntokens); } - if (trace_flag) + if (trace_flag & trace_sets) bitsetv_matrix_dump (stderr, "RTC: Firsts Input", firsts); bitsetv_reflexive_transitive_closure (firsts); - if (trace_flag) + if (trace_flag & trace_sets) bitsetv_matrix_dump (stderr, "RTC: Firsts Output", firsts); - if (trace_flag) + if (trace_flag & trace_sets) print_firsts (); } @@ -161,19 +155,20 @@ set_firsts (void) static void set_fderives (void) { - int i, j, k; + symbol_number_t i, j; + rule_number_t k; - fderives = bitsetv_create (nvars, nrules + 1, BITSET_FIXED); + fderives = bitsetv_create (nvars, nrules, BITSET_FIXED); set_firsts (); for (i = ntokens; i < nsyms; ++i) for (j = ntokens; j < nsyms; ++j) if (bitset_test (FIRSTS (i), j - ntokens)) - for (k = 0; derives[j][k] > 0; ++k) - bitset_set (FDERIVES (i), derives[j][k]); + for (k = 0; derives[j][k]; ++k) + bitset_set (FDERIVES (i), derives[j][k]->number); - if (trace_flag) + if (trace_flag & trace_sets) print_fderives (); bitsetv_free (firsts); @@ -186,7 +181,7 @@ new_closure (int n) { itemset = XCALLOC (item_number_t, n); - ruleset = bitset_create (nrules + 1, BITSET_FIXED); + ruleset = bitset_create (nrules, BITSET_FIXED); set_fderives (); } @@ -200,9 +195,11 @@ closure (item_number_t *core, int n) int c; /* A bit index over RULESET. */ - int ruleno; + rule_number_t ruleno; - if (trace_flag) + bitset_iterator iter; + + if (trace_flag & trace_sets) print_closure ("input", core, n); bitset_zero (ruleset); @@ -213,19 +210,18 @@ closure (item_number_t *core, int n) nritemset = 0; c = 0; - for (ruleno = 0; ruleno < nrules + 1; ++ruleno) - if (bitset_test (ruleset, ruleno)) - { - item_number_t itemno = rules[ruleno].rhs - ritem; - while (c < n && core[c] < itemno) - { - itemset[nritemset] = core[c]; - nritemset++; - c++; - } - itemset[nritemset] = itemno; - nritemset++; - } + BITSET_FOR_EACH (iter, ruleset, ruleno, 0) + { + item_number_t itemno = rules[ruleno].rhs - ritem; + while (c < n && core[c] < itemno) + { + itemset[nritemset] = core[c]; + nritemset++; + c++; + } + itemset[nritemset] = itemno; + nritemset++; + }; while (c < n) { @@ -234,7 +230,7 @@ closure (item_number_t *core, int n) c++; } - if (trace_flag) + if (trace_flag & trace_sets) print_closure ("output", itemset, nritemset); }