X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/88bce5a2ef15e5b508749e75ddad709aca85b019..20c1e2ad9841d06212465ce0b81c771d08c9ec51:/src/gram.h

diff --git a/src/gram.h b/src/gram.h
index dd5a45f8..919efa25 100644
--- a/src/gram.h
+++ b/src/gram.h
@@ -115,7 +115,7 @@ extern int nvars;
 
 typedef int item_number_t;
 # define ITEM_NUMBER_MAX ((item_number_t) INT_MAX)
-# define ITEM_NUMBER_MIN ((item_number_t) MIN_MAX)
+# define ITEM_NUMBER_MIN ((item_number_t) INT_MIN)
 extern item_number_t *ritem;
 extern unsigned int nritems;
 
@@ -175,6 +175,36 @@ typedef struct rule_s
 
 extern struct rule_s *rules;
 
+/* A function that selects a rule.  */
+typedef bool (*rule_filter_t) PARAMS ((rule_t *r));
+
+/* Return true IFF the rule has a `number' smaller than NRULES.  */
+bool rule_useful_p PARAMS ((rule_t *r));
+
+/* Return true IFF the rule has a `number' higher than NRULES.  */
+bool rule_useless_p PARAMS ((rule_t *r));
+
+/* Return true IFF the rule is not flagged as useful *and* is useful.
+   In other words, it was discarded because of conflicts.  */
+bool rule_never_reduced_p PARAMS ((rule_t *r));
+
+/* Print this RULE's number and lhs on OUT.  If a PREVIOUS_LHS was
+   already displayed (by a previous call for another rule), avoid
+   useless repetitions.  */
+void rule_lhs_print PARAMS ((rule_t *rule, symbol_t *previous_lhs, FILE *out));
+
+/* Return the length of the RHS.  */
+int rule_rhs_length PARAMS ((rule_t *rule));
+
+/* Print this RULE's RHS on OUT.  */
+void rule_rhs_print PARAMS ((rule_t *rule, FILE *out));
+
+/* Print this RULE on OUT.  */
+void rule_print PARAMS ((rule_t *rule, FILE *out));
+
+
+
+
 /* Table of the symbols, indexed by the symbol number. */
 extern symbol_t **symbols;
 
@@ -185,6 +215,7 @@ extern symbol_number_t *token_translations;
 extern int max_user_token_number;
 
 
+
 /* GLR_PARSER is nonzero if the input file says to use the GLR
    (Generalized LR) parser, and to output some additional
    information used by the GLR algorithm. */
@@ -196,20 +227,6 @@ extern int glr_parser;
 
 extern int pure_parser;
 
-/* Print this RULE's number and lhs on OUT.  If a PREVIOUS_LHS was
-   already displayed (by a previous call for another rule), avoid
-   useless repetitions.  */
-void rule_lhs_print PARAMS ((rule_t *rule, symbol_t *previous_lhs, FILE *out));
-
-/* Return the length of the RHS.  */
-int rule_rhs_length PARAMS ((rule_t *rule));
-
-/* Print this RULE's RHS on OUT.  */
-void rule_rhs_print PARAMS ((rule_t *rule, FILE *out));
-
-/* Print this RULE on OUT.  */
-void rule_print PARAMS ((rule_t *rule, FILE *out));
-
 /* Dump RITEM for traces. */
 void ritem_print PARAMS ((FILE *out));
 
@@ -219,8 +236,7 @@ size_t ritem_longest_rhs PARAMS ((void));
 /* Print the grammar's rules numbers from BEGIN (inclusive) to END
    (exclusive) on OUT under TITLE.  */
 void grammar_rules_partial_print PARAMS ((FILE *out, const char *title,
-					  rule_number_t begin,
-					  rule_number_t end));
+					  rule_filter_t filter));
 
 /* Print the grammar's rules on OUT.  */
 void grammar_rules_print PARAMS ((FILE *out));
@@ -228,6 +244,12 @@ void grammar_rules_print PARAMS ((FILE *out));
 /* Dump the grammar. */
 void grammar_dump PARAMS ((FILE *out, const char *title));
 
+/* Report on STDERR the rules that are not flagged USEFUL, using the
+   MESSAGE (which can be `useless rule' when invoked after grammar
+   reduction, or `never reduced' after conflicts were taken into
+   account).  */
+void grammar_rules_never_reduced_report PARAMS ((const char *message));
+
 /* Free the packed grammar. */
 void grammar_free PARAMS ((void));