Lines Matching refs:conflicts

1 /* Find and resolve or report lookahead conflicts for bison,
28 #include "conflicts.h"
41 static char *conflicts;
322 | Solve the S/R conflicts of state S using the |
324 | conflicts. ERRORS can be used as storage to compute the list of |
370 for conflicts not resolved above. */
374 conflicts[s->number] = 1;
381 | Solve all the S/R conflicts using the precedence/associativity, |
382 | and flag as inconsistent the states that still have conflicts. |
392 conflicts = xcalloc (nstates, sizeof *conflicts);
419 conflicts[old_to_new[i]] = conflicts[i];
424 | Count the number of shift/reduce conflicts. |
456 | Count the number of reduce/reduce conflicts. If ONE_PER_TOKEN, |
458 | conflicts. Otherwise, count one conflict for each pair of |
486 | Report the number of conflicts, using the Yacc format. |
493 fprintf (out, _("conflicts: %d shift/reduce, %d reduce/reduce\n"),
496 fprintf (out, _("conflicts: %d shift/reduce\n"), src_num);
498 fprintf (out, _("conflicts: %d reduce/reduce\n"), rrc_num);
503 | Output the detailed description of states with conflicts. |
514 if (conflicts[i])
527 | Total the number of S/R and R/R conflicts. Unlike the |
542 if (conflicts[i])
552 | Reporting the total number of conflicts. |
558 /* Is the number of SR conflicts OK? Either EXPECTED_CONFLICTS is
574 if (conflicts[i])
592 /* If there are as many RR conflicts and SR conflicts as
597 /* Report the total number of conflicts on STDERR. */
618 "expected %d shift/reduce conflicts",
623 "expected %d reduce/reduce conflicts",
633 free (conflicts);