X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/12e3584054c16ab255672c07af0ffc7bb220e8bc..c53b6848897960bc783afdbc230e1a247977d63d:/src/symlist.h diff --git a/src/symlist.h b/src/symlist.h index 9da8afe5..c369f69b 100644 --- a/src/symlist.h +++ b/src/symlist.h @@ -1,49 +1,61 @@ /* Lists of symbols for Bison - Copyright (C) 2002, 2005, 2006 Free Software Foundation, Inc. + Copyright (C) 2002, 2005-2007, 2009-2013 Free Software Foundation, + Inc. This file is part of Bison, the GNU Compiler Compiler. - Bison is free software; you can redistribute it and/or modify + This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by - the Free Software Foundation; either version 2, or (at your option) - any later version. + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. - Bison is distributed in the hope that it will be useful, + This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License - along with Bison; see the file COPYING. If not, write to - the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, - Boston, MA 02110-1301, USA. */ + along with this program. If not, see . */ #ifndef SYMLIST_H_ # define SYMLIST_H_ # include "location.h" +# include "scan-code.h" # include "symtab.h" +# include "named-ref.h" /* A list of symbols, used during the parsing to store the rules. */ typedef struct symbol_list { /** * Whether this node contains a symbol, a semantic type, a \c <*>, or a - * \c . + * \c <>. */ enum { - SYMLIST_SYMBOL, SYMLIST_TYPE, - SYMLIST_DEFAULT_TAGGED, SYMLIST_DEFAULT_TAGLESS + SYMLIST_SYMBOL, + SYMLIST_TYPE } content_type; union { - /** The symbol or \c NULL iff node_type = SYMLIST_SYMBOL. */ + /** + * The symbol or \c NULL iff + * symbol_list::content_type = SYMLIST_SYMBOL. + */ symbol *sym; - /** The semantic type iff node_type = SYMLIST_TYPE. */ - uniqstr type_name; + /** + * The semantic type iff symbol_list::content_type = SYMLIST_TYPE. + */ + semantic_type *sem_type; } content; location location; + /* Named reference. */ + named_ref *named_ref; + + /* Proper location of the symbol, not all the rule */ + location sym_loc; + /* If this symbol is the generated lhs for a midrule but this is the rule in whose rhs it appears, MIDRULE = a pointer to that midrule. */ struct symbol_list *midrule; @@ -55,16 +67,23 @@ typedef struct symbol_list struct symbol_list *midrule_parent_rule; int midrule_parent_rhs_index; - /* The action is attached to the LHS of a rule. */ - const char *action; - location action_location; - - /* Whether this symbol's value is used in the current action. */ - bool used; + /* ---------------------------------------------- */ + /* Apply to the rule (attached to the LHS only). */ + /* ---------------------------------------------- */ /* Precedence/associativity. */ symbol *ruleprec; + + /* The action is attached to the LHS of a rule, but action properties for + * each RHS are also stored here. */ + code_props action_props; + + /* The location of the first %empty for this rule, or \a + empty_location. */ + location percent_empty_loc; + int dprec; + location dprec_location; int merger; location merger_declaration_location; @@ -79,11 +98,6 @@ symbol_list *symbol_list_sym_new (symbol *sym, location loc); /** Create a list containing \c type_name at \c loc. */ symbol_list *symbol_list_type_new (uniqstr type_name, location loc); -/** Create a list containing a \c <*> at \c loc. */ -symbol_list *symbol_list_default_tagged_new (location loc); -/** Create a list containing a \c at \c loc. */ -symbol_list *symbol_list_default_tagless_new (location loc); - /** Print this list. \pre For every node \c n in the list, n->content_type = @@ -93,6 +107,9 @@ void symbol_list_syms_print (const symbol_list *l, FILE *f); /** Prepend \c node to \c list. */ symbol_list *symbol_list_prepend (symbol_list *list, symbol_list *node); +/** Append \c node to \c list. */ +symbol_list *symbol_list_append (symbol_list *list, symbol_list *node); + /** Free \c list, but not the items it contains. */ void symbol_list_free (symbol_list *list); @@ -106,15 +123,11 @@ symbol_list *symbol_list_n_get (symbol_list *l, int n); symbol N in rule RULE. */ uniqstr symbol_list_n_type_name_get (symbol_list *l, location loc, int n); -/** The item \c n in symbol list \c l is \c used. */ -void symbol_list_n_used_set (symbol_list *l, int n, bool used); - -/** Set the \c \%destructor for \c node as \c destructor at \c loc. */ -void symbol_list_destructor_set (symbol_list *node, const char *destructor, - location loc); +/* Check whether the node is a border element of a rule. */ +bool symbol_list_null (symbol_list *node); -/** Set the \c \%printer for \c node as \c printer at \c loc. */ -void symbol_list_printer_set (symbol_list *node, const char *printer, - location loc); +/** Set the \c \%destructor or \c \%printer for \c node as \c cprops. */ +void symbol_list_code_props_set (symbol_list *node, code_props_type kind, + code_props const *cprops); #endif /* !SYMLIST_H_ */