X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/7612000cb004ae5b8516e3a34a79ab32050d688e..5a670b1ed96b92ef0440c06c89b01cf1688db370:/src/conflicts.c diff --git a/src/conflicts.c b/src/conflicts.c index c2521909..2dc1cc5c 100644 --- a/src/conflicts.c +++ b/src/conflicts.c @@ -1,753 +1,408 @@ /* Find and resolve or report look-ahead conflicts for bison, - Copyright (C) 1984, 1989, 1992 Free Software Foundation, Inc. + Copyright 1984, 1989, 1992, 2000, 2001 Free Software Foundation, Inc. -This file is part of Bison, the GNU Compiler Compiler. + This file is part of Bison, the GNU Compiler Compiler. -Bison is free software; you can redistribute it and/or modify -it under the terms of the GNU General Public License as published by -the Free Software Foundation; either version 2, or (at your option) -any later version. + Bison is free software; you can redistribute it and/or modify it + under the terms of the GNU General Public License as published by + the Free Software Foundation; either version 2, or (at your option) + any later version. -Bison is distributed in the hope that it will be useful, -but WITHOUT ANY WARRANTY; without even the implied warranty of -MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -GNU General Public License for more details. + Bison is distributed in the hope that it will be useful, but + WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + General Public License for more details. -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, 675 Mass Ave, Cambridge, MA 02139, USA. */ + 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. */ -#include #include "system.h" -#include "machine.h" -#include "alloc.h" +#include "complain.h" +#include "getargs.h" +#include "symtab.h" #include "files.h" #include "gram.h" #include "state.h" +#include "lalr.h" +#include "conflicts.h" +#include "reader.h" +#include "LR0.h" +/* -1 stands for not specified. */ +int expected_conflicts = -1; +static char *conflicts = NULL; -extern char **tags; -extern int tokensetsize; -extern char *consistent; -extern short *accessing_symbol; -extern shifts **shift_table; -extern unsigned *LA; -extern short *LAruleno; -extern short *lookaheads; -extern int verboseflag; +static unsigned *shiftset = NULL; +static unsigned *lookaheadset = NULL; + -void set_conflicts(); -void resolve_sr_conflict(); -void flush_shift(); -void log_resolution(); -void total_conflicts(); -void count_sr_conflicts(); -void count_rr_conflicts(); - -char any_conflicts; -char *conflicts; -errs **err_table; -int expected_conflicts; - - -static unsigned *shiftset; -static unsigned *lookaheadset; -static int src_total; -static int rrc_total; -static int src_count; -static int rrc_count; - - -void -initialize_conflicts() +static inline void +log_resolution (state_t *state, int LAno, int token, char *resolution) { - register int i; -/* register errs *sp; JF unused */ + if (verbose_flag) + obstack_fgrow4 (&output_obstack, + _("\ +Conflict in state %d between rule %d and token %s resolved as %s.\n"), + state->number, LAruleno[LAno], symbols[token]->tag, + resolution); +} - conflicts = NEW2(nstates, char); - shiftset = NEW2(tokensetsize, unsigned); - lookaheadset = NEW2(tokensetsize, unsigned); - err_table = NEW2(nstates, errs *); +/*------------------------------------------------------------------. +| Turn off the shift recorded for the specified token in the | +| specified state. Used when we resolve a shift-reduce conflict in | +| favor of the reduction. | +`------------------------------------------------------------------*/ - any_conflicts = 0; +static void +flush_shift (state_t *state, int token) +{ + shifts *shiftp = state->shifts; + int i; - for (i = 0; i < nstates; i++) - set_conflicts(i); + RESETBIT (lookaheadset, token); + for (i = 0; i < shiftp->nshifts; i++) + if (!SHIFT_IS_DISABLED (shiftp, i) && SHIFT_SYMBOL (shiftp, i) == token) + SHIFT_DISABLE (shiftp, i); } -void -set_conflicts(state) -int state; -{ - register int i; - register int k; - register shifts *shiftp; - register unsigned *fp2; - register unsigned *fp3; - register unsigned *fp4; - register unsigned *fp1; - register int symbol; - - if (consistent[state]) return; +/*-------------------------------------------------------------------. +| Turn off the reduce recorded for the specified token for the | +| specified lookahead. Used when we resolve a shift-reduce conflict | +| in favor of the shift. | +`-------------------------------------------------------------------*/ - for (i = 0; i < tokensetsize; i++) - lookaheadset[i] = 0; +static void +flush_reduce (int lookahead, int token) +{ + RESETBIT (LA (lookahead), token); +} - shiftp = shift_table[state]; - if (shiftp) - { - k = shiftp->nshifts; - for (i = 0; i < k; i++) - { - symbol = accessing_symbol[shiftp->shifts[i]]; - if (ISVAR(symbol)) break; - SETBIT(lookaheadset, symbol); - } - } - k = lookaheads[state + 1]; - fp4 = lookaheadset + tokensetsize; +/*------------------------------------------------------------------. +| Attempt to resolve shift-reduce conflict for one rule by means of | +| precedence declarations. It has already been checked that the | +| rule has a precedence. A conflict is resolved by modifying the | +| shift or reduce tables so that there is no longer a conflict. | +`------------------------------------------------------------------*/ - /* loop over all rules which require lookahead in this state */ - /* first check for shift-reduce conflict, and try to resolve using precedence */ +static void +resolve_sr_conflict (state_t *state, int lookahead) +{ + int i; + /* find the rule to reduce by to get precedence of reduction */ + int redprec = rule_table[LAruleno[lookahead]].prec; + errs *errp = errs_new (ntokens + 1); + errp->nerrs = 0; - for (i = lookaheads[state]; i < k; i++) - if (rprec[LAruleno[i]]) + for (i = 0; i < ntokens; i++) + if (BITISSET (LA (lookahead), i) + && BITISSET (lookaheadset, i) + && symbols[i]->prec) { - fp1 = LA + i * tokensetsize; - fp2 = fp1; - fp3 = lookaheadset; - - while (fp3 < fp4) + /* Shift-reduce conflict occurs for token number i + and it has a precedence. + The precedence of shifting is that of token i. */ + if (symbols[i]->prec < redprec) { - if (*fp2++ & *fp3++) - { - resolve_sr_conflict(state, i); - break; - } + log_resolution (state, lookahead, i, _("reduce")); + flush_shift (state, i); } - } - - /* loop over all rules which require lookahead in this state */ - /* Check for conflicts not resolved above. */ - - for (i = lookaheads[state]; i < k; i++) - { - fp1 = LA + i * tokensetsize; - fp2 = fp1; - fp3 = lookaheadset; + else if (symbols[i]->prec > redprec) + { + log_resolution (state, lookahead, i, _("shift")); + flush_reduce (lookahead, i); + } + else + /* Matching precedence levels. + For left association, keep only the reduction. + For right association, keep only the shift. + For nonassociation, keep neither. */ - while (fp3 < fp4) - { - if (*fp2++ & *fp3++) + switch (symbols[i]->assoc) { - conflicts[state] = 1; - any_conflicts = 1; + case right_assoc: + log_resolution (state, lookahead, i, _("shift")); + flush_reduce (lookahead, i); + break; + + case left_assoc: + log_resolution (state, lookahead, i, _("reduce")); + flush_shift (state, i); + break; + + case non_assoc: + log_resolution (state, lookahead, i, _("an error")); + flush_shift (state, i); + flush_reduce (lookahead, i); + /* Record an explicit error for this token. */ + errp->errs[errp->nerrs++] = i; + break; } - } - - fp2 = fp1; - fp3 = lookaheadset; + } - while (fp3 < fp4) - *fp3++ |= *fp2++; - } + /* Some tokens have been explicitly made errors. Allocate a + permanent errs structure for this state, to record them. */ + state->errs = errs_dup (errp); + free (errp); } +static void +set_conflicts (state_t *state) +{ + int i, j; + shifts *shiftp; -/* Attempt to resolve shift-reduce conflict for one rule -by means of precedence declarations. -It has already been checked that the rule has a precedence. -A conflict is resolved by modifying the shift or reduce tables -so that there is no longer a conflict. */ + if (state->consistent) + return; -void -resolve_sr_conflict(state, lookaheadnum) -int state; -int lookaheadnum; -{ - register int i; - register int mask; - register unsigned *fp1; - register unsigned *fp2; - register int redprec; - errs *errp = (errs *) xmalloc (sizeof(errs) + ntokens * sizeof(short)); - short *errtokens = errp->errs; + for (i = 0; i < tokensetsize; i++) + lookaheadset[i] = 0; - /* find the rule to reduce by to get precedence of reduction */ - redprec = rprec[LAruleno[lookaheadnum]]; + shiftp = state->shifts; + for (i = 0; i < shiftp->nshifts && SHIFT_IS_SHIFT (shiftp, i); i++) + if (!SHIFT_IS_DISABLED (shiftp, i)) + SETBIT (lookaheadset, SHIFT_SYMBOL (shiftp, i)); + + /* Loop over all rules which require lookahead in this state. First + check for shift-reduce conflict, and try to resolve using + precedence */ + for (i = 0; i < state->nlookaheads; ++i) + if (rule_table[LAruleno[state->lookaheadsp + i]].prec) + for (j = 0; j < tokensetsize; ++j) + if (LA (state->lookaheadsp + i)[j] & lookaheadset[j]) + { + resolve_sr_conflict (state, state->lookaheadsp + i); + break; + } - mask = 1; - fp1 = LA + lookaheadnum * tokensetsize; - fp2 = lookaheadset; - for (i = 0; i < ntokens; i++) - { - if ((mask & *fp2 & *fp1) && sprec[i]) - /* Shift-reduce conflict occurs for token number i - and it has a precedence. - The precedence of shifting is that of token i. */ - { - if (sprec[i] < redprec) - { - if (verboseflag) log_resolution(state, lookaheadnum, i, _("reduce")); - *fp2 &= ~mask; /* flush the shift for this token */ - flush_shift(state, i); - } - else if (sprec[i] > redprec) - { - if (verboseflag) log_resolution(state, lookaheadnum, i, _("shift")); - *fp1 &= ~mask; /* flush the reduce for this token */ - } - else - { - /* Matching precedence levels. - For left association, keep only the reduction. - For right association, keep only the shift. - For nonassociation, keep neither. */ - - switch (sassoc[i]) - { - - case RIGHT_ASSOC: - if (verboseflag) log_resolution(state, lookaheadnum, i, _("shift")); - break; - - case LEFT_ASSOC: - if (verboseflag) log_resolution(state, lookaheadnum, i, _("reduce")); - break; - - case NON_ASSOC: - if (verboseflag) log_resolution(state, lookaheadnum, i, _("an error")); - break; - } - - if (sassoc[i] != RIGHT_ASSOC) - { - *fp2 &= ~mask; /* flush the shift for this token */ - flush_shift(state, i); - } - if (sassoc[i] != LEFT_ASSOC) - { - *fp1 &= ~mask; /* flush the reduce for this token */ - } - if (sassoc[i] == NON_ASSOC) - { - /* Record an explicit error for this token. */ - *errtokens++ = i; - } - } - } - - mask <<= 1; - if (mask == 0) - { - mask = 1; - fp2++; fp1++; - } - } - errp->nerrs = errtokens - errp->errs; - if (errp->nerrs) + + /* Loop over all rules which require lookahead in this state. Check + for conflicts not resolved above. */ + for (i = 0; i < state->nlookaheads; ++i) { - /* Some tokens have been explicitly made errors. Allocate - a permanent errs structure for this state, to record them. */ - i = (char *) errtokens - (char *) errp; - err_table[state] = (errs *) xmalloc ((unsigned int)i); - bcopy (errp, err_table[state], i); + for (j = 0; j < tokensetsize; ++j) + if (LA (state->lookaheadsp + i)[j] & lookaheadset[j]) + conflicts[state->number] = 1; + + for (j = 0; j < tokensetsize; ++j) + lookaheadset[j] |= LA (state->lookaheadsp + i)[j]; } - else - err_table[state] = 0; - free(errp); } - - -/* turn off the shift recorded for the specified token in the specified state. -Used when we resolve a shift-reduce conflict in favor of the reduction. */ - void -flush_shift(state, token) -int state; -int token; +solve_conflicts (void) { - register shifts *shiftp; - register int k, i; -/* register unsigned symbol; JF unused */ + int i; - shiftp = shift_table[state]; + conflicts = XCALLOC (char, nstates); + shiftset = XCALLOC (unsigned, tokensetsize); + lookaheadset = XCALLOC (unsigned, tokensetsize); - if (shiftp) - { - k = shiftp->nshifts; - for (i = 0; i < k; i++) - { - if (shiftp->shifts[i] && token == accessing_symbol[shiftp->shifts[i]]) - (shiftp->shifts[i]) = 0; - } - } + for (i = 0; i < nstates; i++) + set_conflicts (state_table[i]); } -void -log_resolution(state, LAno, token, resolution) -int state, LAno, token; -char *resolution; -{ - fprintf(foutput, - _("Conflict in state %d between rule %d and token %s resolved as %s.\n"), - state, LAruleno[LAno], tags[token], resolution); -} - +/*---------------------------------------------. +| Count the number of shift/reduce conflicts. | +`---------------------------------------------*/ -void -conflict_log() +static int +count_sr_conflicts (state_t *state) { - register int i; + int i, k; + int src_count = 0; + shifts *shiftp = state->shifts; - src_total = 0; - rrc_total = 0; + if (!shiftp) + return 0; - for (i = 0; i < nstates; i++) + for (i = 0; i < tokensetsize; i++) { - if (conflicts[i]) - { - count_sr_conflicts(i); - count_rr_conflicts(i); - src_total += src_count; - rrc_total += rrc_count; - } + shiftset[i] = 0; + lookaheadset[i] = 0; } - total_conflicts(); -} - + for (i = 0; i < shiftp->nshifts && SHIFT_IS_SHIFT (shiftp, i); i++) + if (!SHIFT_IS_DISABLED (shiftp, i)) + SETBIT (shiftset, SHIFT_SYMBOL (shiftp, i)); -void -verbose_conflict_log() -{ - register int i; + for (i = 0; i < state->nlookaheads; ++i) + for (k = 0; k < tokensetsize; ++k) + lookaheadset[k] |= LA (state->lookaheadsp + i)[k]; - src_total = 0; - rrc_total = 0; + for (k = 0; k < tokensetsize; ++k) + lookaheadset[k] &= shiftset[k]; - for (i = 0; i < nstates; i++) - { - if (conflicts[i]) - { - count_sr_conflicts(i); - count_rr_conflicts(i); - src_total += src_count; - rrc_total += rrc_count; - - fprintf(foutput, _("State %d contains"), i); - - if (src_count == 1) - fprintf(foutput, _(" 1 shift/reduce conflict")); - else if (src_count > 1) - fprintf(foutput, _(" %d shift/reduce conflicts"), src_count); - - if (src_count > 0 && rrc_count > 0) - fprintf(foutput, _(" and")); - - if (rrc_count == 1) - fprintf(foutput, _(" 1 reduce/reduce conflict")); - else if (rrc_count > 1) - fprintf(foutput, _(" %d reduce/reduce conflicts"), rrc_count); - - putc('.', foutput); - putc('\n', foutput); - } - } + for (i = 0; i < ntokens; i++) + if (BITISSET (lookaheadset, i)) + src_count++; - total_conflicts(); + return src_count; } -void -total_conflicts() +/*----------------------------------------------. +| Count the number of reduce/reduce conflicts. | +`----------------------------------------------*/ + +static int +count_rr_conflicts (state_t *state) { - extern int fixed_outfiles; + int i; + int rrc_count = 0; - if (src_total == expected_conflicts && rrc_total == 0) - return; + if (state->nlookaheads < 2) + return 0; - if (fixed_outfiles) + for (i = 0; i < ntokens; i++) { - /* If invoked under the name `yacc', use the output format - specified by POSIX. */ - fprintf(stderr, _("conflicts: ")); - if (src_total > 0) - fprintf(stderr, _(" %d shift/reduce"), src_total); - if (src_total > 0 && rrc_total > 0) - fprintf(stderr, ","); - if (rrc_total > 0) - fprintf(stderr, _(" %d reduce/reduce"), rrc_total); - putc('\n', stderr); + int count = 0; + int j; + for (j = 0; j < state->nlookaheads; ++j) + if (BITISSET (LA (state->lookaheadsp), state->lookaheadsp + j)) + count++; + + if (count >= 2) + rrc_count++; } - else - { - fprintf(stderr, _("%s contains"), infile); - if (src_total == 1) - fprintf(stderr, _(" 1 shift/reduce conflict")); - else if (src_total > 1) - fprintf(stderr, _(" %d shift/reduce conflicts"), src_total); - - if (src_total > 0 && rrc_total > 0) - fprintf(stderr, _(" and")); - - if (rrc_total == 1) - fprintf(stderr, _(" 1 reduce/reduce conflict")); - else if (rrc_total > 1) - fprintf(stderr, _(" %d reduce/reduce conflicts"), rrc_total); - - putc('.', stderr); - putc('\n', stderr); - } + return rrc_count; } +/*--------------------------------------------------------------. +| Return a human readable string which reports shift/reduce and | +| reduce/reduce conflict numbers (SRC_NUM, RRC_NUM). | +`--------------------------------------------------------------*/ -void -count_sr_conflicts(state) -int state; +static const char * +conflict_report (int src_num, int rrc_num) { - register int i; - register int k; - register int mask; - register shifts *shiftp; - register unsigned *fp1; - register unsigned *fp2; - register unsigned *fp3; - register int symbol; - - src_count = 0; - - shiftp = shift_table[state]; - if (!shiftp) return; + static char res[4096]; + char *cp = res; - for (i = 0; i < tokensetsize; i++) + if (src_num >= 1) { - shiftset[i] = 0; - lookaheadset[i] = 0; + sprintf (cp, ngettext ("%d shift/reduce conflict", + "%d shift/reduce conflicts", src_num), src_num); + cp += strlen (cp); } - k = shiftp->nshifts; - for (i = 0; i < k; i++) + if (src_num > 0 && rrc_num > 0) { - if (! shiftp->shifts[i]) continue; - symbol = accessing_symbol[shiftp->shifts[i]]; - if (ISVAR(symbol)) break; - SETBIT(shiftset, symbol); + sprintf (cp, " %s ", _("and")); + cp += strlen (cp); } - k = lookaheads[state + 1]; - fp3 = lookaheadset + tokensetsize; - - for (i = lookaheads[state]; i < k; i++) + if (rrc_num >= 1) { - fp1 = LA + i * tokensetsize; - fp2 = lookaheadset; - - while (fp2 < fp3) - *fp2++ |= *fp1++; + sprintf (cp, ngettext ("%d reduce/reduce conflict", + "%d reduce/reduce conflicts", rrc_num), rrc_num); + cp += strlen (cp); } - fp1 = shiftset; - fp2 = lookaheadset; + *cp++ = '.'; + *cp++ = '\n'; + *cp++ = '\0'; - while (fp2 < fp3) - *fp2++ &= *fp1++; - - mask = 1; - fp2 = lookaheadset; - for (i = 0; i < ntokens; i++) - { - if (mask & *fp2) - src_count++; - - mask <<= 1; - if (mask == 0) - { - mask = 1; - fp2++; - } - } + return res; } +/*-----------------------------------------------------------. +| Output the detailed description of states with conflicts. | +`-----------------------------------------------------------*/ + void -count_rr_conflicts(state) -int state; +conflicts_output (FILE *out) { - register int i; - register int j; - register int count; - register unsigned mask; - register unsigned *baseword; - register unsigned *wordp; - register int m; - register int n; - - rrc_count = 0; - - m = lookaheads[state]; - n = lookaheads[state + 1]; + bool printed_sth = FALSE; + int i; + for (i = 0; i < nstates; i++) + if (conflicts[i]) + { + fprintf (out, _("State %d contains "), i); + fputs (conflict_report (count_sr_conflicts (state_table[i]), + count_rr_conflicts (state_table[i])), out); + printed_sth = TRUE; + } + if (printed_sth) + fputs ("\n\n", out); +} - if (n - m < 2) return; - mask = 1; - baseword = LA + m * tokensetsize; - for (i = 0; i < ntokens; i++) - { - wordp = baseword; - - count = 0; - for (j = m; j < n; j++) - { - if (mask & *wordp) - count++; +/*------------------------------------------. +| Reporting the total number of conflicts. | +`------------------------------------------*/ - wordp += tokensetsize; - } +void +conflicts_print (void) +{ + int i; - if (count >= 2) rrc_count++; + /* Is the number of SR conflicts OK? Either EXPECTED_CONFLICTS is + not set, and then we want 0 SR, or else it is specified, in which + case we want equality. */ + int src_ok = 0; - mask <<= 1; - if (mask == 0) - { - mask = 1; - baseword++; - } - } -} + int src_total = 0; + int rrc_total = 0; + /* Conflicts by state. */ + for (i = 0; i < nstates; i++) + if (conflicts[i]) + { + src_total += count_sr_conflicts (state_table[i]); + rrc_total += count_rr_conflicts (state_table[i]); + } -void -print_reductions(state) -int state; -{ - register int i; - register int j; - register int k; - register unsigned *fp1; - register unsigned *fp2; - register unsigned *fp3; - register unsigned *fp4; - register int rule; - register int symbol; - register unsigned mask; - register int m; - register int n; - register int default_LA; - register int default_rule; - register int cmax; - register int count; - register shifts *shiftp; - register errs *errp; - int nodefault = 0; + src_ok = src_total == (expected_conflicts == -1 ? 0 : expected_conflicts); - for (i = 0; i < tokensetsize; i++) - shiftset[i] = 0; + /* If there are no RR conflicts, and as many SR conflicts as + expected, then there is nothing to report. */ + if (!rrc_total && src_ok) + return; - shiftp = shift_table[state]; - if (shiftp) + /* Report the total number of conflicts on STDERR. */ + if (yacc_flag) { - k = shiftp->nshifts; - for (i = 0; i < k; i++) - { - if (! shiftp->shifts[i]) continue; - symbol = accessing_symbol[shiftp->shifts[i]]; - if (ISVAR(symbol)) break; - /* if this state has a shift for the error token, - don't use a default rule. */ - if (symbol == error_token_number) nodefault = 1; - SETBIT(shiftset, symbol); - } + /* If invoked with `--yacc', use the output format specified by + POSIX. */ + fprintf (stderr, _("conflicts: ")); + if (src_total > 0) + fprintf (stderr, _(" %d shift/reduce"), src_total); + if (src_total > 0 && rrc_total > 0) + fprintf (stderr, ","); + if (rrc_total > 0) + fprintf (stderr, _(" %d reduce/reduce"), rrc_total); + putc ('\n', stderr); } - - errp = err_table[state]; - if (errp) + else { - k = errp->nerrs; - for (i = 0; i < k; i++) - { - if (! errp->errs[i]) continue; - symbol = errp->errs[i]; - SETBIT(shiftset, symbol); - } + fprintf (stderr, _("%s contains "), infile); + fputs (conflict_report (src_total, rrc_total), stderr); } - m = lookaheads[state]; - n = lookaheads[state + 1]; - - if (n - m == 1 && ! nodefault) + if (expected_conflicts != -1 && !src_ok) { - default_rule = LAruleno[m]; - - fp1 = LA + m * tokensetsize; - fp2 = shiftset; - fp3 = lookaheadset; - fp4 = lookaheadset + tokensetsize; - - while (fp3 < fp4) - *fp3++ = *fp1++ & *fp2++; - - mask = 1; - fp3 = lookaheadset; - - for (i = 0; i < ntokens; i++) - { - if (mask & *fp3) - fprintf(foutput, _(" %-4s\t[reduce using rule %d (%s)]\n"), - tags[i], default_rule, tags[rlhs[default_rule]]); - - mask <<= 1; - if (mask == 0) - { - mask = 1; - fp3++; - } - } - - fprintf(foutput, _(" $default\treduce using rule %d (%s)\n\n"), - default_rule, tags[rlhs[default_rule]]); - } - else if (n - m >= 1) - { - cmax = 0; - default_LA = -1; - fp4 = lookaheadset + tokensetsize; - - if (! nodefault) - for (i = m; i < n; i++) - { - fp1 = LA + i * tokensetsize; - fp2 = shiftset; - fp3 = lookaheadset; - - while (fp3 < fp4) - *fp3++ = *fp1++ & (~(*fp2++)); - - count = 0; - mask = 1; - fp3 = lookaheadset; - for (j = 0; j < ntokens; j++) - { - if (mask & *fp3) - count++; - - mask <<= 1; - if (mask == 0) - { - mask = 1; - fp3++; - } - } - - if (count > cmax) - { - cmax = count; - default_LA = i; - default_rule = LAruleno[i]; - } - - fp2 = shiftset; - fp3 = lookaheadset; - - while (fp3 < fp4) - *fp2++ |= *fp3++; - } - - for (i = 0; i < tokensetsize; i++) - shiftset[i] = 0; - - if (shiftp) - { - k = shiftp->nshifts; - for (i = 0; i < k; i++) - { - if (! shiftp->shifts[i]) continue; - symbol = accessing_symbol[shiftp->shifts[i]]; - if (ISVAR(symbol)) break; - SETBIT(shiftset, symbol); - } - } - - mask = 1; - fp1 = LA + m * tokensetsize; - fp2 = shiftset; - for (i = 0; i < ntokens; i++) - { - int defaulted = 0; - - if (mask & *fp2) - count = 1; - else - count = 0; - - fp3 = fp1; - for (j = m; j < n; j++) - { - if (mask & *fp3) - { - if (count == 0) - { - if (j != default_LA) - { - rule = LAruleno[j]; - fprintf(foutput, _(" %-4s\treduce using rule %d (%s)\n"), - tags[i], rule, tags[rlhs[rule]]); - } - else defaulted = 1; - - count++; - } - else - { - if (defaulted) - { - rule = LAruleno[default_LA]; - fprintf(foutput, _(" %-4s\treduce using rule %d (%s)\n"), - tags[i], rule, tags[rlhs[rule]]); - defaulted = 0; - } - rule = LAruleno[j]; - fprintf(foutput, _(" %-4s\t[reduce using rule %d (%s)]\n"), - tags[i], rule, tags[rlhs[rule]]); - } - } - - fp3 += tokensetsize; - } - - mask <<= 1; - if (mask == 0) - { - mask = 1; - /* We tried incrementing just fp1, and just fp2; both seem wrong. - It seems necessary to increment both in sync. */ - fp1++; - fp2++; - } - } - - if (default_LA >= 0) - { - fprintf(foutput, _(" $default\treduce using rule %d (%s)\n"), - default_rule, tags[rlhs[default_rule]]); - } - - putc('\n', foutput); + complain_message_count++; + fprintf (stderr, ngettext ("expected %d shift/reduce conflict\n", + "expected %d shift/reduce conflicts\n", + expected_conflicts), + expected_conflicts); } } void -finalize_conflicts() +free_conflicts (void) { - FREE(conflicts); - FREE(shiftset); - FREE(lookaheadset); + XFREE (conflicts); + XFREE (shiftset); + XFREE (lookaheadset); }