X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/1462fcee1ed295b24f47758b370068aa6304bb41..7d6bad195977b0204fc8406cac57cf5a4f1c769b:/src/gram.h diff --git a/src/gram.h b/src/gram.h index a82a6b40..35e8be4a 100644 --- a/src/gram.h +++ b/src/gram.h @@ -1,6 +1,6 @@ /* Data definitions for internal representation of Bison's input. - Copyright (C) 1984, 1986, 1989, 1992, 2001-2007, 2009-2010 Free + Copyright (C) 1984, 1986, 1989, 1992, 2001-2007, 2009-2013 Free Software Foundation, Inc. This file is part of Bison, the GNU Compiler Compiler. @@ -105,15 +105,15 @@ # include "location.h" # include "symtab.h" -# define ISTOKEN(i) ((i) < ntokens) -# define ISVAR(i) ((i) >= ntokens) +# define ISTOKEN(i) ((i) < ntokens) +# define ISVAR(i) ((i) >= ntokens) extern int nsyms; extern int ntokens; extern int nvars; typedef int item_number; -#define ITEM_NUMBER_MAX INT_MAX +# define ITEM_NUMBER_MAX INT_MAX extern item_number *ritem; extern unsigned int nritems; @@ -145,7 +145,7 @@ item_number_is_symbol_number (item_number i) /* Rule numbers. */ typedef int rule_number; -#define RULE_NUMBER_MAX INT_MAX +# define RULE_NUMBER_MAX INT_MAX extern rule_number nrules; static inline item_number @@ -194,6 +194,7 @@ typedef struct location location; bool useful; + bool is_predicate; const char *action; location action_location; @@ -202,34 +203,31 @@ typedef struct extern rule *rules; /* A function that selects a rule. */ -typedef bool (*rule_filter) (rule *); +typedef bool (*rule_filter) (rule const *); /* Return true IFF the rule has a `number' smaller than NRULES. That is, it is useful in the grammar. */ -bool rule_useful_in_grammar_p (rule *r); +bool rule_useful_in_grammar_p (rule const *r); /* Return true IFF the rule has a `number' higher than NRULES. That is, it is useless in the grammar. */ -bool rule_useless_in_grammar_p (rule *r); +bool rule_useless_in_grammar_p (rule const *r); /* Return true IFF the rule is not flagged as useful but is useful in the grammar. In other words, it was discarded because of conflicts. */ -bool rule_useless_in_parser_p (rule *r); +bool rule_useless_in_parser_p (rule const *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 *r, symbol *previous_lhs, FILE *out); -void rule_lhs_print_xml (rule *r, FILE *out, int level); +void rule_lhs_print (rule const *r, symbol const *previous_lhs, FILE *out); +void rule_lhs_print_xml (rule const *r, FILE *out, int level); /* Return the length of the RHS. */ -int rule_rhs_length (rule *r); +size_t rule_rhs_length (rule const *r); /* Print this rule's RHS on OUT. */ -void rule_rhs_print (rule *r, FILE *out); - -/* Print this rule on OUT. */ -void rule_print (rule *r, FILE *out); +void rule_rhs_print (rule const *r, FILE *out); @@ -253,7 +251,7 @@ size_t ritem_longest_rhs (void); /* Print the grammar's rules that match FILTER on OUT under TITLE. */ void grammar_rules_partial_print (FILE *out, const char *title, - rule_filter filter); + rule_filter filter); /* Print the grammar's useful rules on OUT. */ void grammar_rules_print (FILE *out);