X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/29d29c8fff612552f253342caa5fcee70b713490..2cbd078f5153288a39cbf046231a3870df8170cb:/src/derives.c?ds=inline diff --git a/src/derives.c b/src/derives.c index 80e430bf..24fde5d2 100644 --- a/src/derives.c +++ b/src/derives.c @@ -1,5 +1,7 @@ /* Match rules with nonterminals for bison, - Copyright 1984, 1989, 2000, 2001 Free Software Foundation, Inc. + + Copyright (C) 1984, 1989, 2000, 2001, 2002, 2003 Free Software + Foundation, Inc. This file is part of Bison, the GNU Compiler Compiler. @@ -15,18 +17,27 @@ You should have received a copy of the GNU General Public License along with Bison; see the file COPYING. If not, write to - the Free Software Foundation, Inc., 59 Temple Place - Suite 330, - Boston, MA 02111-1307, USA. */ + the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, + Boston, MA 02110-1301, USA. */ #include "system.h" + #include "getargs.h" -#include "types.h" -#include "reader.h" -#include "gram.h" + #include "derives.h" +#include "gram.h" +#include "reader.h" +#include "symtab.h" + +/* Linked list of rule numbers. */ +typedef struct rule_list +{ + struct rule_list *next; + rule *value; +} rule_list; -short **derives = NULL; +rule ***derives; static void print_derives (void) @@ -37,15 +48,12 @@ print_derives (void) for (i = ntokens; i < nsyms; i++) { - short *sp; - fprintf (stderr, "\t%s derives\n", tags[i]); - for (sp = derives[i]; *sp > 0; sp++) + rule **rp; + fprintf (stderr, "\t%s derives\n", symbols[i]->tag); + for (rp = derives[i - ntokens]; *rp; ++rp) { - short *rhsp; - fprintf (stderr, "\t\t%d:", *sp); - for (rhsp = &ritem[rule_table[*sp].rhs]; *rhsp >= 0; ++rhsp) - fprintf (stderr, " %s", tags[*rhsp]); - fprintf (stderr, " (rule %d)\n", -*rhsp - 1); + fprintf (stderr, "\t\t%3d ", (*rp)->user_number); + rule_rhs_print (*rp, stderr); } } @@ -54,53 +62,60 @@ print_derives (void) void -set_derives (void) +derives_compute (void) { - int i; - shorts *p; - short *q; - shorts **dset; - shorts *delts; - - dset = XCALLOC (shorts *, nvars) - ntokens; - delts = XCALLOC (shorts, nrules + 1); - - p = delts; - for (i = nrules; i > 0; i--) - if (rule_table[i].useful) - { - int lhs = rule_table[i].lhs; - p->next = dset[lhs]; - p->value = i; - dset[lhs] = p; - p++; - } - - derives = XCALLOC (short *, nvars) - ntokens; - q = XCALLOC (short, nvars + nrules); + symbol_number i; + rule_number r; + rule **q; + + /* DSET[NTERM - NTOKENS] -- A linked list of the numbers of the rules + whose LHS is NTERM. */ + rule_list **dset = xcalloc (nvars, sizeof *dset); + + /* DELTS[RULE] -- There are NRULES rule number to attach to nterms. + Instead of performing NRULES allocations for each, have an array + indexed by rule numbers. */ + rule_list *delts = xnmalloc (nrules, sizeof *delts); + + for (r = nrules - 1; r >= 0; --r) + { + symbol_number lhs = rules[r].lhs->number; + rule_list *p = &delts[r]; + /* A new LHS is found. */ + p->next = dset[lhs - ntokens]; + p->value = &rules[r]; + dset[lhs - ntokens] = p; + } + + /* DSET contains what we need under the form of a linked list. Make + it a single array. */ + + derives = xnmalloc (nvars, sizeof *derives); + q = xnmalloc (nvars + nrules, sizeof *q); for (i = ntokens; i < nsyms; i++) { - derives[i] = q; - p = dset[i]; + rule_list *p = dset[i - ntokens]; + derives[i - ntokens] = q; while (p) { *q++ = p->value; p = p->next; } - *q++ = -1; + *q++ = NULL; } - if (trace_flag) + if (trace_flag & trace_sets) print_derives (); - XFREE (dset + ntokens); - XFREE (delts); + free (dset); + free (delts); } + void -free_derives (void) +derives_free (void) { - XFREE (derives[ntokens]); - XFREE (derives + ntokens); + free (derives[0]); + free (derives); }