src/conflicts.c

   1 /* Find and resolve or report look-ahead conflicts for bison,
   2    Copyright 1984, 1989, 1992, 2000, 2001 Free Software Foundation, Inc.
   3
   4    This file is part of Bison, the GNU Compiler Compiler.
   5
   6    Bison is free software; you can redistribute it and/or modify it
   7    under the terms of the GNU General Public License as published by
   8    the Free Software Foundation; either version 2, or (at your option)
   9    any later version.
  10
  11    Bison is distributed in the hope that it will be useful, but
  12    WITHOUT ANY WARRANTY; without even the implied warranty of
  13    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  14    General Public License for more details.
  15
  16    You should have received a copy of the GNU General Public License
  17    along with Bison; see the file COPYING.  If not, write to the Free
  18    Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
  19    02111-1307, USA.  */
  20
  21 #include "system.h"
  22 #include "getargs.h"
  23 #include "xalloc.h"
  24 #include "files.h"
  25 #include "gram.h"
  26 #include "state.h"
  27 #include "lalr.h"
  28 #include "conflicts.h"
  29 #include "reader.h"
  30 #include "LR0.h"
  31
  32 int any_conflicts = 0;
  33 errs **err_table;
  34 int expected_conflicts;
  35 static char *conflicts;
  36
  37 static unsigned *shiftset;
  38 static unsigned *lookaheadset;
  39 static int src_total;
  40 static int rrc_total;
  41 static int src_count;
  42 static int rrc_count;
  43 \f
  44
  45 static inline void
  46 log_resolution (int state, int LAno, int token, char *resolution)
  47 {
  48   obstack_fgrow4 (&output_obstack,
  49                   _("\
  50 Conflict in state %d between rule %d and token %s resolved as %s.\n"),
  51                   state, LAruleno[LAno], tags[token], resolution);
  52 }
  53
  54
  55 /*------------------------------------------------------------------.
  56 | Turn off the shift recorded for the specified token in the        |
  57 | specified state.  Used when we resolve a shift-reduce conflict in |
  58 | favor of the reduction.                                           |
  59 `------------------------------------------------------------------*/
  60
  61 static void
  62 flush_shift (int state, int token)
  63 {
  64   shifts *shiftp;
  65   int k, i;
  66
  67   shiftp = shift_table[state];
  68
  69   if (shiftp)
  70     {
  71       k = shiftp->nshifts;
  72       for (i = 0; i < k; i++)
  73         {
  74           if (shiftp->shifts[i]
  75               && token == accessing_symbol[shiftp->shifts[i]])
  76             (shiftp->shifts[i]) = 0;
  77         }
  78     }
  79 }
  80
  81
  82 /*------------------------------------------------------------------.
  83 | Attempt to resolve shift-reduce conflict for one rule by means of |
  84 | precedence declarations.  It has already been checked that the    |
  85 | rule has a precedence.  A conflict is resolved by modifying the   |
  86 | shift or reduce tables so that there is no longer a conflict.     |
  87 `------------------------------------------------------------------*/
  88
  89 static void
  90 resolve_sr_conflict (int state, int lookaheadnum)
  91 {
  92   int i;
  93   int mask;
  94   unsigned *fp1;
  95   unsigned *fp2;
  96   int redprec;
  97   errs *errp = (errs *) xcalloc (sizeof (errs) + ntokens * sizeof (short), 1);
  98   short *errtokens = errp->errs;
  99
 100   /* find the rule to reduce by to get precedence of reduction  */
 101   redprec = rprec[LAruleno[lookaheadnum]];
 102
 103   mask = 1;
 104   fp1 = LA + lookaheadnum * tokensetsize;
 105   fp2 = lookaheadset;
 106   for (i = 0; i < ntokens; i++)
 107     {
 108       if ((mask & *fp2 & *fp1) && sprec[i])
 109         /* Shift-reduce conflict occurs for token number i
 110            and it has a precedence.
 111            The precedence of shifting is that of token i.  */
 112         {
 113           if (sprec[i] < redprec)
 114             {
 115               log_resolution (state, lookaheadnum, i, _("reduce"));
 116               *fp2 &= ~mask;    /* flush the shift for this token */
 117               flush_shift (state, i);
 118             }
 119           else if (sprec[i] > redprec)
 120             {
 121               log_resolution (state, lookaheadnum, i, _("shift"));
 122               *fp1 &= ~mask;    /* flush the reduce for this token */
 123             }
 124           else
 125             {
 126               /* Matching precedence levels.
 127                  For left association, keep only the reduction.
 128                  For right association, keep only the shift.
 129                  For nonassociation, keep neither.  */
 130
 131               switch (sassoc[i])
 132                 {
 133                 case right_assoc:
 134                   log_resolution (state, lookaheadnum, i, _("shift"));
 135                   break;
 136
 137                 case left_assoc:
 138                   log_resolution (state, lookaheadnum, i, _("reduce"));
 139                   break;
 140
 141                 case non_assoc:
 142                   log_resolution (state, lookaheadnum, i, _("an error"));
 143                   break;
 144                 }
 145
 146               if (sassoc[i] != right_assoc)
 147                 {
 148                   *fp2 &= ~mask;        /* flush the shift for this token */
 149                   flush_shift (state, i);
 150                 }
 151               if (sassoc[i] != left_assoc)
 152                 {
 153                   *fp1 &= ~mask;        /* flush the reduce for this token */
 154                 }
 155               if (sassoc[i] == non_assoc)
 156                 {
 157                   /* Record an explicit error for this token.  */
 158                   *errtokens++ = i;
 159                 }
 160             }
 161         }
 162
 163       mask <<= 1;
 164       if (mask == 0)
 165         {
 166           mask = 1;
 167           fp2++;
 168           fp1++;
 169         }
 170     }
 171   errp->nerrs = errtokens - errp->errs;
 172   if (errp->nerrs)
 173     {
 174       /* Some tokens have been explicitly made errors.  Allocate
 175          a permanent errs structure for this state, to record them.  */
 176       i = (char *) errtokens - (char *) errp;
 177       err_table[state] = (errs *) xcalloc ((unsigned int) i, 1);
 178       bcopy (errp, err_table[state], i);
 179     }
 180   else
 181     err_table[state] = 0;
 182   free (errp);
 183 }
 184
 185
 186 static void
 187 set_conflicts (int state)
 188 {
 189   int i;
 190   int k;
 191   shifts *shiftp;
 192   unsigned *fp2;
 193   unsigned *fp3;
 194   unsigned *fp4;
 195   unsigned *fp1;
 196   int symbol;
 197
 198   if (consistent[state])
 199     return;
 200
 201   for (i = 0; i < tokensetsize; i++)
 202     lookaheadset[i] = 0;
 203
 204   shiftp = shift_table[state];
 205   if (shiftp)
 206     {
 207       k = shiftp->nshifts;
 208       for (i = 0; i < k; i++)
 209         {
 210           symbol = accessing_symbol[shiftp->shifts[i]];
 211           if (ISVAR (symbol))
 212             break;
 213           SETBIT (lookaheadset, symbol);
 214         }
 215     }
 216
 217   k = lookaheads[state + 1];
 218   fp4 = lookaheadset + tokensetsize;
 219
 220   /* Loop over all rules which require lookahead in this state.  First
 221      check for shift-reduce conflict, and try to resolve using
 222      precedence */
 223   for (i = lookaheads[state]; i < k; i++)
 224     if (rprec[LAruleno[i]])
 225       {
 226         fp1 = LA + i * tokensetsize;
 227         fp2 = fp1;
 228         fp3 = lookaheadset;
 229
 230         while (fp3 < fp4)
 231           {
 232             if (*fp2++ & *fp3++)
 233               {
 234                 resolve_sr_conflict (state, i);
 235                 break;
 236               }
 237           }
 238       }
 239
 240
 241   /* Loop over all rules which require lookahead in this state.  Check
 242      for conflicts not resolved above.  */
 243   for (i = lookaheads[state]; i < k; i++)
 244     {
 245       fp1 = LA + i * tokensetsize;
 246       fp2 = fp1;
 247       fp3 = lookaheadset;
 248
 249       while (fp3 < fp4)
 250         {
 251           if (*fp2++ & *fp3++)
 252             {
 253               conflicts[state] = 1;
 254               any_conflicts = 1;
 255             }
 256         }
 257
 258       fp2 = fp1;
 259       fp3 = lookaheadset;
 260
 261       while (fp3 < fp4)
 262         *fp3++ |= *fp2++;
 263     }
 264 }
 265
 266 void
 267 initialize_conflicts (void)
 268 {
 269   int i;
 270
 271   conflicts = XCALLOC (char, nstates);
 272   shiftset = XCALLOC (unsigned, tokensetsize);
 273   lookaheadset = XCALLOC (unsigned, tokensetsize);
 274
 275   err_table = XCALLOC (errs *, nstates);
 276
 277   any_conflicts = 0;
 278
 279   for (i = 0; i < nstates; i++)
 280     set_conflicts (i);
 281 }
 282
 283
 284 /*---------------------------------------------.
 285 | Count the number of shift/reduce conflicts.  |
 286 `---------------------------------------------*/
 287
 288 static void
 289 count_sr_conflicts (int state)
 290 {
 291   int i;
 292   int k;
 293   int mask;
 294   shifts *shiftp;
 295   unsigned *fp1;
 296   unsigned *fp2;
 297   unsigned *fp3;
 298   int symbol;
 299
 300   src_count = 0;
 301
 302   shiftp = shift_table[state];
 303   if (!shiftp)
 304     return;
 305
 306   for (i = 0; i < tokensetsize; i++)
 307     {
 308       shiftset[i] = 0;
 309       lookaheadset[i] = 0;
 310     }
 311
 312   k = shiftp->nshifts;
 313   for (i = 0; i < k; i++)
 314     {
 315       if (!shiftp->shifts[i])
 316         continue;
 317       symbol = accessing_symbol[shiftp->shifts[i]];
 318       if (ISVAR (symbol))
 319         break;
 320       SETBIT (shiftset, symbol);
 321     }
 322
 323   k = lookaheads[state + 1];
 324   fp3 = lookaheadset + tokensetsize;
 325
 326   for (i = lookaheads[state]; i < k; i++)
 327     {
 328       fp1 = LA + i * tokensetsize;
 329       fp2 = lookaheadset;
 330
 331       while (fp2 < fp3)
 332         *fp2++ |= *fp1++;
 333     }
 334
 335   fp1 = shiftset;
 336   fp2 = lookaheadset;
 337
 338   while (fp2 < fp3)
 339     *fp2++ &= *fp1++;
 340
 341   mask = 1;
 342   fp2 = lookaheadset;
 343   for (i = 0; i < ntokens; i++)
 344     {
 345       if (mask & *fp2)
 346         src_count++;
 347
 348       mask <<= 1;
 349       if (mask == 0)
 350         {
 351           mask = 1;
 352           fp2++;
 353         }
 354     }
 355 }
 356
 357
 358 /*----------------------------------------------.
 359 | Count the number of reduce/reduce conflicts.  |
 360 `----------------------------------------------*/
 361
 362 static void
 363 count_rr_conflicts (int state)
 364 {
 365   int i;
 366   int j;
 367   int count;
 368   unsigned mask;
 369   unsigned *baseword;
 370   unsigned *wordp;
 371   int m;
 372   int n;
 373
 374   rrc_count = 0;
 375
 376   m = lookaheads[state];
 377   n = lookaheads[state + 1];
 378
 379   if (n - m < 2)
 380     return;
 381
 382   mask = 1;
 383   baseword = LA + m * tokensetsize;
 384   for (i = 0; i < ntokens; i++)
 385     {
 386       wordp = baseword;
 387
 388       count = 0;
 389       for (j = m; j < n; j++)
 390         {
 391           if (mask & *wordp)
 392             count++;
 393
 394           wordp += tokensetsize;
 395         }
 396
 397       if (count >= 2)
 398         rrc_count++;
 399
 400       mask <<= 1;
 401       if (mask == 0)
 402         {
 403           mask = 1;
 404           baseword++;
 405         }
 406     }
 407 }
 408
 409 /*--------------------------------------------------------------.
 410 | Return a human readable string which reports shift/reduce and |
 411 | reduce/reduce conflict numbers (SRC_NUM, RRC_NUM).            |
 412 `--------------------------------------------------------------*/
 413
 414 static const char *
 415 conflict_report (int src_num, int rrc_num)
 416 {
 417   static char res[4096];
 418   char *cp = res;
 419
 420   if (src_num == 1)
 421     {
 422       sprintf (cp, _(" 1 shift/reduce conflict"));
 423       cp += strlen (cp);
 424     }
 425   else if (src_num > 1)
 426     {
 427       sprintf (cp, _(" %d shift/reduce conflicts"), src_num);
 428       cp += strlen (cp);
 429     }
 430
 431   if (src_num > 0 && rrc_num > 0)
 432     {
 433       sprintf (cp, _(" and"));
 434       cp += strlen (cp);
 435     }
 436
 437   if (rrc_num == 1)
 438     {
 439       sprintf (cp, _(" 1 reduce/reduce conflict"));
 440       cp += strlen (cp);
 441     }
 442   else if (rrc_num > 1)
 443     {
 444       sprintf (cp, _(" %d reduce/reduce conflicts"), rrc_num);
 445       cp += strlen (cp);
 446     }
 447
 448   *cp++ = '.';
 449   *cp++ = '\n';
 450   *cp++ = '\0';
 451
 452   return res;
 453 }
 454
 455
 456 /*---------------------------------------------.
 457 | Compute and give a report on the conflicts.  |
 458 `---------------------------------------------*/
 459
 460 void
 461 print_conflicts (void)
 462 {
 463   int i;
 464
 465   src_total = 0;
 466   rrc_total = 0;
 467
 468   /* Count the total number of conflicts, and if wanted, give a
 469      detailed report in FOUTPUT.  */
 470   for (i = 0; i < nstates; i++)
 471     {
 472       if (conflicts[i])
 473         {
 474           count_sr_conflicts (i);
 475           count_rr_conflicts (i);
 476           src_total += src_count;
 477           rrc_total += rrc_count;
 478
 479           if (verbose_flag)
 480             {
 481               obstack_fgrow1 (&output_obstack, _("State %d contains"), i);
 482               obstack_sgrow (&output_obstack,
 483                              conflict_report (src_count, rrc_count));
 484             }
 485         }
 486     }
 487
 488   /* Report the total number of conflicts on STDERR.  */
 489   if (yacc_flag)
 490     {
 491       /* If invoked with `--yacc', use the output format specified by
 492          POSIX.  */
 493       fprintf (stderr, _("conflicts: "));
 494       if (src_total > 0)
 495         fprintf (stderr, _(" %d shift/reduce"), src_total);
 496       if (src_total > 0 && rrc_total > 0)
 497         fprintf (stderr, ",");
 498       if (rrc_total > 0)
 499         fprintf (stderr, _(" %d reduce/reduce"), rrc_total);
 500       putc ('\n', stderr);
 501     }
 502   else
 503     {
 504       fprintf (stderr, _("%s contains"), infile);
 505       fputs (conflict_report (src_total, rrc_total), stderr);
 506     }
 507 }
 508
 509
 510 void
 511 print_reductions (int state)
 512 {
 513   int i;
 514   int j;
 515   int k;
 516   unsigned *fp1;
 517   unsigned *fp2;
 518   unsigned *fp3;
 519   unsigned *fp4;
 520   int rule;
 521   int symbol;
 522   unsigned mask;
 523   int m;
 524   int n;
 525   int default_LA;
 526   int default_rule = 0;
 527   int cmax;
 528   int count;
 529   shifts *shiftp;
 530   errs *errp;
 531   int nodefault = 0;
 532
 533   for (i = 0; i < tokensetsize; i++)
 534     shiftset[i] = 0;
 535
 536   shiftp = shift_table[state];
 537   if (shiftp)
 538     {
 539       k = shiftp->nshifts;
 540       for (i = 0; i < k; i++)
 541         {
 542           if (!shiftp->shifts[i])
 543             continue;
 544           symbol = accessing_symbol[shiftp->shifts[i]];
 545           if (ISVAR (symbol))
 546             break;
 547           /* if this state has a shift for the error token,
 548              don't use a default rule.  */
 549           if (symbol == error_token_number)
 550             nodefault = 1;
 551           SETBIT (shiftset, symbol);
 552         }
 553     }
 554
 555   errp = err_table[state];
 556   if (errp)
 557     {
 558       k = errp->nerrs;
 559       for (i = 0; i < k; i++)
 560         {
 561           if (!errp->errs[i])
 562             continue;
 563           symbol = errp->errs[i];
 564           SETBIT (shiftset, symbol);
 565         }
 566     }
 567
 568   m = lookaheads[state];
 569   n = lookaheads[state + 1];
 570
 571   if (n - m == 1 && !nodefault)
 572     {
 573       default_rule = LAruleno[m];
 574
 575       fp1 = LA + m * tokensetsize;
 576       fp2 = shiftset;
 577       fp3 = lookaheadset;
 578       fp4 = lookaheadset + tokensetsize;
 579
 580       while (fp3 < fp4)
 581         *fp3++ = *fp1++ & *fp2++;
 582
 583       mask = 1;
 584       fp3 = lookaheadset;
 585
 586       for (i = 0; i < ntokens; i++)
 587         {
 588           if (mask & *fp3)
 589             obstack_fgrow3 (&output_obstack,
 590                             _("    %-4s\t[reduce using rule %d (%s)]\n"),
 591                             tags[i], default_rule, tags[rlhs[default_rule]]);
 592
 593           mask <<= 1;
 594           if (mask == 0)
 595             {
 596               mask = 1;
 597               fp3++;
 598             }
 599         }
 600
 601       obstack_fgrow2 (&output_obstack,
 602                       _("    $default\treduce using rule %d (%s)\n\n"),
 603                       default_rule, tags[rlhs[default_rule]]);
 604     }
 605   else if (n - m >= 1)
 606     {
 607       cmax = 0;
 608       default_LA = -1;
 609       fp4 = lookaheadset + tokensetsize;
 610
 611       if (!nodefault)
 612         for (i = m; i < n; i++)
 613           {
 614             fp1 = LA + i * tokensetsize;
 615             fp2 = shiftset;
 616             fp3 = lookaheadset;
 617
 618             while (fp3 < fp4)
 619               *fp3++ = *fp1++ & (~(*fp2++));
 620
 621             count = 0;
 622             mask = 1;
 623             fp3 = lookaheadset;
 624             for (j = 0; j < ntokens; j++)
 625               {
 626                 if (mask & *fp3)
 627                   count++;
 628
 629                 mask <<= 1;
 630                 if (mask == 0)
 631                   {
 632                     mask = 1;
 633                     fp3++;
 634                   }
 635               }
 636
 637             if (count > cmax)
 638               {
 639                 cmax = count;
 640                 default_LA = i;
 641                 default_rule = LAruleno[i];
 642               }
 643
 644             fp2 = shiftset;
 645             fp3 = lookaheadset;
 646
 647             while (fp3 < fp4)
 648               *fp2++ |= *fp3++;
 649           }
 650
 651       for (i = 0; i < tokensetsize; i++)
 652         shiftset[i] = 0;
 653
 654       if (shiftp)
 655         {
 656           k = shiftp->nshifts;
 657           for (i = 0; i < k; i++)
 658             {
 659               if (!shiftp->shifts[i])
 660                 continue;
 661               symbol = accessing_symbol[shiftp->shifts[i]];
 662               if (ISVAR (symbol))
 663                 break;
 664               SETBIT (shiftset, symbol);
 665             }
 666         }
 667
 668       mask = 1;
 669       fp1 = LA + m * tokensetsize;
 670       fp2 = shiftset;
 671       for (i = 0; i < ntokens; i++)
 672         {
 673           int defaulted = 0;
 674
 675           if (mask & *fp2)
 676             count = 1;
 677           else
 678             count = 0;
 679
 680           fp3 = fp1;
 681           for (j = m; j < n; j++)
 682             {
 683               if (mask & *fp3)
 684                 {
 685                   if (count == 0)
 686                     {
 687                       if (j != default_LA)
 688                         {
 689                           rule = LAruleno[j];
 690                           obstack_fgrow3 (&output_obstack,
 691                                    _("    %-4s\treduce using rule %d (%s)\n"),
 692                                    tags[i], rule, tags[rlhs[rule]]);
 693                         }
 694                       else
 695                         defaulted = 1;
 696
 697                       count++;
 698                     }
 699                   else
 700                     {
 701                       if (defaulted)
 702                         {
 703                           rule = LAruleno[default_LA];
 704                           obstack_fgrow3 (&output_obstack,
 705                                    _("    %-4s\treduce using rule %d (%s)\n"),
 706                                    tags[i], rule, tags[rlhs[rule]]);
 707                           defaulted = 0;
 708                         }
 709                       rule = LAruleno[j];
 710                       obstack_fgrow3 (&output_obstack,
 711                                _("    %-4s\t[reduce using rule %d (%s)]\n"),
 712                                tags[i], rule, tags[rlhs[rule]]);
 713                     }
 714                 }
 715
 716               fp3 += tokensetsize;
 717             }
 718
 719           mask <<= 1;
 720           if (mask == 0)
 721             {
 722               mask = 1;
 723               /* We tried incrementing just fp1, and just fp2; both seem wrong.
 724                  It seems necessary to increment both in sync.  */
 725               fp1++;
 726               fp2++;
 727             }
 728         }
 729
 730       if (default_LA >= 0)
 731         obstack_fgrow2 (&output_obstack,
 732                         _("    $default\treduce using rule %d (%s)\n"),
 733                         default_rule, tags[rlhs[default_rule]]);
 734
 735       obstack_1grow (&output_obstack, '\n');
 736     }
 737 }
 738
 739
 740 void
 741 finalize_conflicts (void)
 742 {
 743   XFREE (conflicts);
 744   XFREE (shiftset);
 745   XFREE (lookaheadset);
 746 }