RULES[R].line -- the line where R was defined.
- RULES[R].useful -- TRUE iff the rule is used (i.e., FALSE if thrown
+ RULES[R].useful -- true iff the rule is used (i.e., false if thrown
away by reduce).
The right hand side is stored as symbol numbers in a portion of
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;
extern struct rule_s *rules;
+/* A function that selects a rule. */
+typedef bool (*rule_filter_t) (rule_t *r);
+
+/* Return true IFF the rule has a `number' smaller than NRULES. */
+bool rule_useful_p (rule_t *r);
+
+/* Return true IFF the rule has a `number' higher than NRULES. */
+bool rule_useless_p (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 (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 (rule_t *rule, symbol_t *previous_lhs, FILE *out);
+
+/* Return the length of the RHS. */
+int rule_rhs_length (rule_t *rule);
+
+/* Print this RULE's RHS on OUT. */
+void rule_rhs_print (rule_t *rule, FILE *out);
+
+/* Print this RULE on OUT. */
+void rule_print (rule_t *rule, FILE *out);
+
+
+
+
/* Table of the symbols, indexed by the symbol number. */
extern symbol_t **symbols;
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. */
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));
+void ritem_print (FILE *out);
/* Return the size of the longest rule RHS. */
-size_t ritem_longest_rhs PARAMS ((void));
+size_t ritem_longest_rhs (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));
+void grammar_rules_partial_print (FILE *out, const char *title,
+ rule_filter_t filter);
/* Print the grammar's rules on OUT. */
-void grammar_rules_print PARAMS ((FILE *out));
+void grammar_rules_print (FILE *out);
/* Dump the grammar. */
-void grammar_dump PARAMS ((FILE *out, const char *title));
+void grammar_dump (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 (const char *message);
/* Free the packed grammar. */
-void grammar_free PARAMS ((void));
+void grammar_free (void);
#endif /* !GRAM_H_ */