X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/fb8135fa993b77b8cfc0ff652b02424aea3c6754..2935744b3a563ff41d9cc7e6c21ffb4e86767717:/data/lalr1.cc diff --git a/data/lalr1.cc b/data/lalr1.cc index 1488d921..6a67c5b8 100644 --- a/data/lalr1.cc +++ b/data/lalr1.cc @@ -1,29 +1,49 @@ -m4_divert(-1) # C++ skeleton for Bison -# Copyright (C) 2002 Free Software Foundation, Inc. -# This program is free software; you can redistribute it and/or modify +# Copyright (C) 2002, 2003, 2004, 2005, 2006, 2007, 2008 +# Free Software Foundation, Inc. + +# 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 of the License, or +# the Free Software Foundation, either version 3 of the License, or # (at your option) any later version. - +# # 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 this program; if not, write to the Free Software -# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA -# 02111-1307 USA +# along with this program. If not, see . + +m4_include(b4_pkgdatadir/[c++.m4]) + +# b4_table_define(TABLE-NAME, CONTENT) +# ------------------------------------ +# Define "parser::yy_" which contents is CONTENT. +m4_define([b4_table_define], +[const b4_int_type_for([$2]) + b4_parser_class_name::yy$1_[[]] = + { + $2 + }dnl +]) -m4_include([c.m4]) +# How the semantic value is extracted when using variants. +b4_variant_if([ + # b4_symbol_value(VAL, [TYPE]) + # ---------------------------- + m4_define([b4_symbol_value], + [m4_ifval([$2], + [$1.as<$2>()], + [$1])]) +]) # b4_variant_if -# b4_lhs_value([TYPE]) -# -------------------- -# Expansion of $$. -m4_define([b4_lhs_value], -[yyval[]m4_ifval([$1], [.$1])]) + +# b4_assert_if([IF-ASSERTIONS-ARE-USED], [IF-NOT]) +# ---------------------------------------------------- +m4_define([b4_assert_if], +[b4_percent_define_ifdef([[assert]], [$1], [$2])]) # b4_rhs_value(RULE-LENGTH, NUM, [TYPE]) @@ -31,786 +51,1260 @@ m4_define([b4_lhs_value], # Expansion of $NUM, where the current rule has RULE-LENGTH # symbols on RHS. m4_define([b4_rhs_value], -[semantic_stack_@<:@m4_eval([$1 - $2])@:>@m4_ifval([$3], [.$3])]) - - -# b4_lhs_location() -# ----------------- -# Expansion of @$. -m4_define([b4_lhs_location], -[yyloc]) - + [b4_symbol_value([yystack_@{($1) - ($2)@}.value], [$3])]) # b4_rhs_location(RULE-LENGTH, NUM) # --------------------------------- # Expansion of @NUM, where the current rule has RULE-LENGTH symbols # on RHS. m4_define([b4_rhs_location], -[location_stack_@<:@m4_eval([$1 - $2])@:>@]) - - -m4_define_default([b4_input_suffix], [.y]) - -m4_define_default([b4_output_parser_suffix], -[m4_translit(b4_input_suffix, [yY], [cC])]) - -m4_define_default([b4_output_parser_name], -[b4_output_prefix[]b4_output_infix[]b4_output_parser_suffix[]]) - - -m4_define_default([b4_output_header_suffix], -[m4_translit(b4_input_suffix, [yY], [hH])]) +[yystack_@{($1) - ($2)@}.location]) + + +# b4_symbol_actions(FILENAME, LINENO, +# SYMBOL-TAG, SYMBOL-NUM, +# SYMBOL-ACTION, SYMBOL-TYPENAME) +# ------------------------------------------------- +# Same as in C, but using references instead of pointers. +m4_define([b4_symbol_actions], +[m4_pushdef([b4_dollar_dollar], + [b4_symbol_value([yyvalue], [$6])])dnl +m4_pushdef([b4_at_dollar], [yylocation])dnl + case $4: // $3 +b4_syncline([$2], [$1]) + $5; +b4_syncline([@oline@], [@ofile@]) + break; +m4_popdef([b4_at_dollar])dnl +m4_popdef([b4_dollar_dollar])dnl +]) + + +# b4_symbol_action_(SYMBOL-TAG, SYMBOL-NUM, SYMBOL-TYPENAME) +# ---------------------------------------------------------- +# Invoke b4_dollar_dollar(SYMBOL_TYPENAME) for each symbol. +m4_define([b4_symbol_action_], +[m4_ifval($3, +[ case $2: // $1 + b4_dollar_dollar($@); + break; +])]) + + +# b4_symbol_variant(YYTYPE, YYVAL, ACTION, [ARGS]) +# ------------------------------------------------ +# Run some ACTION ("build", or "destroy") on YYVAL of symbol type +# YYTYPE. +m4_define([b4_symbol_variant], +[m4_pushdef([b4_dollar_dollar], + [$2.$3<$][3>(m4_shift3($@))])dnl + switch ($1) + { +m4_map([b4_symbol_action_], m4_defn([b4_type_names])) + default: + break; + } +m4_popdef([b4_dollar_dollar])dnl +]) + + +# _b4_char_sizeof_counter +# ----------------------- +# A counter used by _b4_char_sizeof_dummy to create fresh symbols. +m4_define([_b4_char_sizeof_counter], +[0]) + +# _b4_char_sizeof_dummy +# --------------------- +# At each call return a new C++ identifier. +m4_define([_b4_char_sizeof_dummy], +[m4_define([_b4_char_sizeof_counter], m4_incr(_b4_char_sizeof_counter))dnl +dummy[]_b4_char_sizeof_counter]) + + +# b4_char_sizeof(SYMBOL-TAG, SYMBOL-NUM, SYMBOL-TYPENAME) +# ------------------------------------------------------- +# To be mapped on the list of type names to produce: +# +# char dummy1[sizeof(type_name_1)]; +# char dummy2[sizeof(type_name_2)]; +# +# for defined type names. +# $3 is doubly-quoted, do not quote it again. +m4_define([b4_char_sizeof], +[m4_ifval($3, +[ + char _b4_char_sizeof_dummy@{sizeof($3)@}; // $1])dnl +]) + + +m4_pushdef([b4_copyright_years], + [2002, 2003, 2004, 2005, 2006, 2007, 2008]) + +m4_define([b4_parser_class_name], + [b4_percent_define_get([[parser_class_name]])]) + +# The header is mandatory. +b4_defines_if([], + [b4_fatal([b4_skeleton[: using %%defines is mandatory]])]) + +# Backward compatibility. +m4_define([b4_location_constructors]) +m4_include(b4_pkgdatadir/[location.cc]) + +# We do want M4 expansion after # for CPP macros. +m4_changecom() +m4_divert_push(0)dnl +b4_defines_if( +[@output(b4_spec_defines_file@)@ +b4_copyright([Skeleton interface for Bison LALR(1) parsers in C++]) +dnl FIXME: This is wrong, we want computed header guards. +[ +/* C++ LALR(1) parser skeleton written by Akim Demaille. */ + +#ifndef PARSER_HEADER_H +# define PARSER_HEADER_H + +]b4_percent_code_get([[requires]])[ + +]b4_assert_if([#include ])[ +#include +#include +#include "stack.hh" -m4_define_default([b4_output_header_name], -[b4_output_prefix[]b4_output_infix[]b4_output_header_suffix[]]) +]b4_namespace_open[ + class position; + class location; +]b4_variant_if( +[[ + /// A char[S] buffer to store and retrieve objects. + /// + /// Sort of a variant, but does not keep track of the nature + /// of the stored data, since that knowledge is available + /// via the current state. + template + struct variant + {]b4_assert_if([ + /// Whether something is contained. + bool built; + + /// Initially uninitialized. + variant () + : built(false) + {}])[ + + /// Instantiate a \a T in here. + template + inline T& + build() + {]b4_assert_if([ + assert(!built); + built = true;])[ + return *new (buffer) T; + } -m4_define_default([b4_header_guard], - [m4_bpatsubst(m4_toupper([BISON_]b4_output_header_name), - [[^ABCDEFGHIJKLMNOPQRSTUVWXYZ]], [_])]) + /// Accessor to a built \a T. + template + inline T& + as() + {]b4_assert_if([ + assert(built);])[ + return reinterpret_cast(buffer); + } -m4_define([b4_inherit], - [m4_ifdef([b4_root], - [: public b4_root -], - [])]) + /// Const accessor to a built \a T (for %printer). + template + inline const T& + as() const + {]b4_assert_if([ + assert(built);])[ + return reinterpret_cast(buffer); + } -m4_define([b4_param], - [m4_ifdef([b4_root], - [, - const Param& param], - [])]) + /// Swap the content with \a other. + template + inline void + swap(variant& other) + { + std::swap(as(), other.as()); + } -m4_define([b4_constructor], - [m4_ifdef([b4_root], - [b4_root (param), - ], - [])]) + /// Assign the content of \a other to this. + /// Destroys \a other. + template + inline void + build(variant& other) + { + build(); + swap(other); + other.destroy(); + } + /// Destroy the stored \a T. + template + inline void + destroy() + { + as().~T();]b4_assert_if([ + built = false;])[ + } -m4_divert(0)dnl -#output "b4_output_header_name" -b4_copyright([C++ Skeleton parser for LALR(1) parsing with Bison], - [2002]) -#ifndef b4_header_guard -# define b4_header_guard + /// A buffer large enough to store any of the semantic values. + char buffer[S]; + }; +]])[ +]b4_namespace_close[ -#include "stack.hh" #include "location.hh" -#include -#include - -/* Using locations. */ -#define YYLSP_NEEDED b4_locations_flag - -/* Copy the first part of user declarations. */ -b4_pre_prologue - -/* Line __line__ of __file__. */ -#line __oline__ "__ofile__" - -/* Tokens. */ -b4_token_defines(b4_tokens) - /* Enabling traces. */ #ifndef YYDEBUG -# define YYDEBUG b4_debug +# define YYDEBUG ]b4_debug_flag[ #endif -/* Enabling verbose error message. */ -#ifndef YYERROR_VERBOSE -# define YYERROR_VERBOSE b4_error_verbose +/* Enabling verbose error messages. */ +#ifdef YYERROR_VERBOSE +# undef YYERROR_VERBOSE +# define YYERROR_VERBOSE 1 +#else +# define YYERROR_VERBOSE ]b4_error_verbose_flag[ #endif -#ifndef YYSTYPE -m4_ifdef([b4_stype], -[#line b4_stype_line "b4_filename" -typedef union b4_stype yystype; -/* Line __line__ of __file__. */ -#line __oline__ "__ofile__"], -[typedef int yystype;]) -# define YYSTYPE yystype +/* Enabling the token table. */ +#ifndef YYTOKEN_TABLE +# define YYTOKEN_TABLE ]b4_token_table[ #endif -/* Copy the second part of user declarations. */ -b4_post_prologue +/* YYLLOC_DEFAULT -- Set CURRENT to span from RHS[1] to RHS[N]. + If N is 0, then set CURRENT to the empty location which ends + the previous symbol: RHS[0] (always defined). */ -/* Line __line__ of __file__. */ -#line __oline__ "__ofile__" #ifndef YYLLOC_DEFAULT -# define YYLLOC_DEFAULT(Current, Rhs, N) \ - Current.last_line = Rhs[[N]].last_line; \ - Current.last_column = Rhs[[N]].last_column; +# define YYLLOC_DEFAULT(Current, Rhs, N) \ +do { \ + if (N) \ + { \ + (Current).begin = (Rhs)[1].location.begin; \ + (Current).end = (Rhs)[N].location.end; \ + } \ + else \ + { \ + (Current).begin = (Current).end = (Rhs)[0].location.end; \ + } \ +} while (false) #endif -m4_if(b4_locations_flag, [0], [], -[#ifndef YYLTYPE -typedef struct yyltype -{ - int first_line; - int first_column; - int last_line; - int last_column; -} yyltype; -# define YYLTYPE yyltype -#endif]) - -namespace yy -{ - class b4_name; - - template < typename P > - struct Traits - { - }; - - template < > - struct Traits< b4_name > - { - typedef b4_uint_type(b4_translate_max) TokenNumberType; - typedef b4_sint_type(b4_rhs_max) RhsNumberType; - typedef int StateType; - typedef yystype SemanticType; - typedef b4_ltype LocationType; - }; -} +]b4_namespace_open[ -namespace yy -{ - class b4_name b4_inherit + /// A Bison parser. + class ]b4_parser_class_name[ { public: - - typedef Traits< b4_name >::TokenNumberType TokenNumberType; - typedef Traits< b4_name >::RhsNumberType RhsNumberType; - typedef Traits< b4_name >::StateType StateType; - typedef Traits< b4_name >::SemanticType SemanticType; - typedef Traits< b4_name >::LocationType LocationType; - - typedef Stack< StateType > StateStack; - typedef Stack< SemanticType > SemanticStack; - typedef Stack< LocationType > LocationStack; - -#if YYLSP_NEEDED - b4_name (bool debug, - LocationType initlocation[]b4_param) : - b4_constructor[]debug_ (debug), - cdebug_ (std::cerr), - initlocation_ (initlocation) +#ifndef YYSTYPE +]b4_variant_if( +[ /// An auxiliary type to compute the largest semantic type. + union union_type + {]m4_map([b4_char_sizeof], m4_defn([b4_type_names]))[ + }; + + /// Symbol semantic values. + typedef variant semantic_type;], +[ /// Symbol semantic values. +m4_ifdef([b4_stype], +[ union semantic_type + {b4_user_stype + };], +[m4_if(b4_tag_seen_flag, 0, +[[ typedef int semantic_type;]], +[[ typedef YYSTYPE semantic_type;]])])])[ #else - b4_name (bool debug[]b4_param) : - b4_constructor[]debug_ (debug), - cdebug_ (std::cerr) + typedef YYSTYPE semantic_type; #endif + /// Symbol locations. + typedef ]b4_percent_define_get([[location_type]])[ location_type; + /// Tokens. + struct token { - } + ]b4_token_enums(b4_tokens)[ + }; + /// Token type. + typedef token::yytokentype token_type; - virtual ~b4_name () - { - } + /// Build a parser object. + ]b4_parser_class_name[ (]b4_parse_param_decl[); + virtual ~]b4_parser_class_name[ (); + /// Parse. + /// \returns 0 iff parsing succeeded. virtual int parse (); +#if YYDEBUG + /// The current debugging stream. + std::ostream& debug_stream () const; + /// Set the current debugging stream. + void set_debug_stream (std::ostream &); + + /// Type for debugging levels. + typedef int debug_level_type; + /// The current debugging level. + debug_level_type debug_level () const; + /// Set the current debugging level. + void set_debug_level (debug_level_type l); +#endif + private: + /// Report a syntax error. + /// \param loc where the syntax error is found. + /// \param msg a description of the syntax error. + virtual void error (const location_type& loc, const std::string& msg); + + /// Generate an error message. + /// \param state the state where the error occurred. + /// \param tok the lookahead token. + virtual std::string yysyntax_error_ (int yystate, int tok); - virtual void lex_ (); - virtual void error_ (); - virtual void print_ (); +#if YYDEBUG + /// \brief Report a symbol value on the debug stream. + /// \param yytype The token type. + /// \param yyvalue Its semantic value. + /// \param yylocation Its location. + virtual void yy_symbol_value_print_ (int yytype, + const semantic_type& yyvalue, + const location_type& yylocation); + /// \brief Report a symbol on the debug stream. + /// \param yytype The token type. + /// \param yyvalue Its semantic value. + /// \param yylocation Its location. + virtual void yy_symbol_print_ (int yytype, + const semantic_type& yyvalue, + const location_type& yylocation); +#endif - /* Stacks. */ - StateStack state_stack_; - SemanticStack semantic_stack_; - LocationStack location_stack_; + /// State numbers. + typedef int state_type; + /// Internal symbol numbers. + typedef ]b4_int_type_for([b4_translate])[ token_number_type; /* Tables. */ - static const short pact_[[]]; - static const short defact_[[]]; - static const short pgoto_[[]]; - static const short defgoto_[[]]; - static const short table_[[]]; - static const short check_[[]]; - static const b4_uint_type(b4_r1_max) r1_[[]]; - static const b4_uint_type(b4_r2_max) r2_[[]]; - -#if YYDEBUG || YYERROR_VERBOSE - static const char* const name_[[]]; + /// For a state, the index in \a yytable_ of its portion. + static const ]b4_int_type_for([b4_pact])[ yypact_[]; + static const ]b4_int_type(b4_pact_ninf, b4_pact_ninf)[ yypact_ninf_; + + /// For a state, default rule to reduce. + /// Unless\a yytable_ specifies something else to do. + /// Zero means the default is an error. + static const ]b4_int_type_for([b4_defact])[ yydefact_[]; + + static const ]b4_int_type_for([b4_pgoto])[ yypgoto_[]; + static const ]b4_int_type_for([b4_defgoto])[ yydefgoto_[]; + + /// What to do in a state. + /// \a yytable_[yypact_[s]]: what to do in state \a s. + /// - if positive, shift that token. + /// - if negative, reduce the rule which number is the opposite. + /// - if zero, do what YYDEFACT says. + static const ]b4_int_type_for([b4_table])[ yytable_[]; + static const ]b4_int_type(b4_table_ninf, b4_table_ninf)[ yytable_ninf_; + + static const ]b4_int_type_for([b4_check])[ yycheck_[]; + + /// For a state, its accessing symbol. + static const ]b4_int_type_for([b4_stos])[ yystos_[]; + + /// For a rule, its LHS. + static const ]b4_int_type_for([b4_r1])[ yyr1_[]; + /// For a rule, its RHS length. + static const ]b4_int_type_for([b4_r2])[ yyr2_[]; + +#if YYDEBUG || YYERROR_VERBOSE || YYTOKEN_TABLE + /// For a symbol, its name in clear. + static const char* const yytname_[]; +#endif + +#if YYERROR_VERBOSE + /// Convert the symbol name \a n to a form suitable for a diagnostic. + virtual std::string yytnamerr_ (const char *n); #endif - /* More tables, for debugging. */ #if YYDEBUG - static const RhsNumberType rhs_[[]]; - static const b4_uint_type(b4_prhs_max) prhs_[[]]; - static const b4_uint_type(b4_rline_max) rline_[[]]; - static const b4_uint_type(b4_stos_max) stos_[[]]; - static const short token_number_[[]]; + /// A `-1'-separated list of the rules' RHS. + static const ]b4_int_type_for([b4_rhs])[ yyrhs_[]; + /// For each rule, the index of the first RHS symbol in \a yyrhs_. + static const ]b4_int_type_for([b4_prhs])[ yyprhs_[]; + /// For each rule, its source line number. + static const ]b4_int_type_for([b4_rline])[ yyrline_[]; + /// For each scanner token number, its symbol number. + static const ]b4_int_type_for([b4_toknum])[ yytoken_number_[]; + /// Report on the debug stream that the rule \a r is going to be reduced. + virtual void yy_reduce_print_ (int r); + /// Print the state stack on the debug stream. + virtual void yystack_print_ (); + + /* Debugging. */ + int yydebug_; + std::ostream* yycdebug_; #endif - /* Even more tables. */ - static inline TokenNumberType translate_ (int token); + /// Convert a scanner token number \a t to a symbol number. + token_number_type yytranslate_ (int t); + + /// \brief Reclaim the memory associated to a symbol. + /// \param yymsg Why this token is reclaimed. + /// If null, nothing is printed at all. + /// \param yytype The symbol type. + /// \param yyvalue Its semantic value. + /// \param yylocation Its location. + inline void yydestruct_ (const char* yymsg, + int yytype, + semantic_type& yyvalue, + location_type& yylocation); + + /// Element of the stack: a state and its attributes. + struct data_type + { + /// Default constructor. + data_type (); - /* Constants. */ - static const int eof_; - static const int last_; - static const int flag_; - static const int nnts_; - static const int nsym_; - static const int empty_; - static const int final_; - static const int terror_; - static const int errcode_; - static const int ntokens_; - static const int initdepth_; - static const unsigned user_token_number_max_; - static const TokenNumberType undef_token_; + /// Constructor. + data_type (state_type s, const semantic_type& v, const location_type& l); - /* State. */ - int n_; - int len_; - int state_; + /// The state. + state_type state; - /* Debugging. */ - int debug_; - std::ostream &cdebug_; + /// The semantic value. + semantic_type value; + + /// The location. + location_type location; + }; - /* Lookahead and lookahead in internal form. */ - int looka_; - int ilooka_; + /// Stack type. + typedef stack stack_type; - /* Message. */ - std::string message; + /// The stack. + stack_type yystack_; - /* Semantic value and location of lookahead token. */ - SemanticType value; - LocationType location; + /// Push a new state on the stack. + /// \param m a debug message to display + /// if null, no trace is output. + /// \param s the state entered + /// \param v semantic value + /// \param l location + /// \warning the contents of \a v is stolen. + inline void yypush_ (const char* m, state_type s, + semantic_type& v, const location_type& l); - /* @$ and $$. */ - SemanticType yyval; - LocationType yyloc; + /// Pop \a n symbols the three stacks. + inline void yypop_ (unsigned int n = 1); - /* Initial location. */ - LocationType initlocation_; + /* Constants. */ + static const int yyeof_; + /* LAST_ -- Last index in TABLE_. */ + static const int yylast_; + static const int yynnts_; + static const int yyempty_; + static const int yyfinal_; + static const int yyterror_; + static const int yyerrcode_; + static const int yyntokens_; + static const unsigned int yyuser_token_number_max_; + static const token_number_type yyundef_token_; +]b4_parse_param_vars[ }; -} +]b4_namespace_close[ -#endif /* not b4_header_guard */ +]b4_percent_define_flag_if([[global_tokens_and_yystype]], +[b4_token_defines(b4_tokens) -#output "b4_output_prefix[]b4_output_infix[].cc" -b4_copyright([C++ Skeleton parser for LALR(1) parsing with Bison], - [2002]) +#ifndef YYSTYPE + /* Redirection for backward compatibility. */ +# define YYSTYPE b4_namespace_ref::b4_parser_class_name::semantic_type +#endif +]) +b4_percent_code_get([[provides]])[]dnl + +[#endif /* ! defined PARSER_HEADER_H */] +])dnl +@output(b4_parser_file_name@)@ +b4_copyright([Skeleton implementation for Bison LALR(1) parsers in C++]) +b4_percent_code_get([[top]])[]dnl +m4_if(b4_prefix, [yy], [], +[ +// Take the name prefix into account. +#define yylex b4_prefix[]lex])[ + +/* First part of user declarations. */ +]b4_user_pre_prologue + +b4_defines_if([[ +#include "@basename(]b4_spec_defines_file[@)"]])[ + +/* User implementation prologue. */ +]b4_user_post_prologue +b4_percent_code_get[]dnl + +[#ifndef YY_ +# if YYENABLE_NLS +# if ENABLE_NLS +# include /* FIXME: INFRINGES ON USER NAME SPACE */ +# define YY_(msgid) dgettext ("bison-runtime", msgid) +# endif +# endif +# ifndef YY_ +# define YY_(msgid) msgid +# endif +#endif -#include "b4_output_header_name" +/* Suppress unused-variable warnings by "using" E. */ +#define YYUSE(e) ((void) (e)) /* Enable debugging if requested. */ #if YYDEBUG -# define YYCDEBUG if (debug_) cdebug_ + +/* A pseudo ostream that takes yydebug_ into account. */ +# define YYCDEBUG if (yydebug_) (*yycdebug_) + +# define YY_SYMBOL_PRINT(Title, Type, Value, Location) \ + do { \ + if (yydebug_) \ + { \ + *yycdebug_ << Title << ' '; \ + yy_symbol_print_ ((Type), (Value), (Location)); \ + *yycdebug_ << std::endl; \ + } \ + } while (false) + +# define YY_REDUCE_PRINT(Rule) \ + do { \ + if (yydebug_) \ + yy_reduce_print_ (Rule); \ + } while (false) + +# define YY_STACK_PRINT() \ + do { \ + if (yydebug_) \ + yystack_print_ (); \ + } while (false) + #else /* !YYDEBUG */ -# define YYCDEBUG if (0) cdebug_ -#endif /* !YYDEBUG */ -int -yy::b4_name::parse () -{ - int nerrs = 0; - int errstatus = 0; - - /* Initialize stack. */ - state_stack_ = StateStack (0); - semantic_stack_ = SemanticStack (1); - location_stack_ = LocationStack (1); - - /* Start. */ - state_ = 0; - looka_ = empty_; -#if YYLSP_NEEDED - location = initlocation_; -#endif - YYCDEBUG << "Starting parse" << std::endl; +# define YYCDEBUG if (false) std::cerr +# define YY_SYMBOL_PRINT(Title, Type, Value, Location) static_cast(0) +# define YY_REDUCE_PRINT(Rule) static_cast(0) +# define YY_STACK_PRINT() static_cast(0) - /* New state. */ - yynewstate: - state_stack_.push (state_); - YYCDEBUG << "Entering state " << state_ << std::endl; - goto yybackup; +#endif /* !YYDEBUG */ - /* Backup. */ - yybackup: +#define yyerrok (yyerrstatus_ = 0) +#define yyclearin (yychar = yyempty_) - /* Try to take a decision without lookahead. */ - n_ = pact_[[state_]]; - if (n_ == flag_) - goto yydefault; +#define YYACCEPT goto yyacceptlab +#define YYABORT goto yyabortlab +#define YYERROR goto yyerrorlab +#define YYRECOVERING() (!!yyerrstatus_) - /* Read a lookahead token. */ - if (looka_ == empty_) - { - YYCDEBUG << "Reading a token: "; - lex_ (); - } +]b4_namespace_open[ +#if YYERROR_VERBOSE + + /* Return YYSTR after stripping away unnecessary quotes and + backslashes, so that it's suitable for yyerror. The heuristic is + that double-quoting is unnecessary unless the string contains an + apostrophe, a comma, or backslash (other than backslash-backslash). + YYSTR is taken from yytname. */ + std::string + ]b4_parser_class_name[::yytnamerr_ (const char *yystr) + { + if (*yystr == '"') + { + std::string yyr = ""; + char const *yyp = yystr; + + for (;;) + switch (*++yyp) + { + case '\'': + case ',': + goto do_not_strip_quotes; + + case '\\': + if (*++yyp != '\\') + goto do_not_strip_quotes; + /* Fall through. */ + default: + yyr += *yyp; + break; + + case '"': + return yyr; + } + do_not_strip_quotes: ; + } + + return yystr; + } - /* Convert token to internal form. */ - if (looka_ <= 0) - { - looka_ = eof_; - ilooka_ = 0; - YYCDEBUG << "Now at end of input." << std::endl; - } - else - { - ilooka_ = translate_ (looka_); -#if YYDEBUG - if (debug_) - { - YYCDEBUG << "Next token is " << looka_ - << " (" << name_[[ilooka_]]; - print_ (); - YYCDEBUG << ')' << std::endl; - } #endif - } - n_ += ilooka_; - if (n_ < 0 || n_ > last_ || check_[[n_]] != ilooka_) - goto yydefault; + /// Build a parser object. + ]b4_parser_class_name::b4_parser_class_name[ (]b4_parse_param_decl[)]m4_ifset([b4_parse_param], [ + :])[ +#if YYDEBUG + ]m4_ifset([b4_parse_param], [ ], [ :])[yydebug_ (false), + yycdebug_ (&std::cerr)]m4_ifset([b4_parse_param], [,])[ +#endif]b4_parse_param_cons[ + { + } - /* Reduce or error. */ - n_ = table_[[n_]]; - if (n_ < 0) - { - if (n_ == flag_) - goto yyerrlab; - else - { - n_ = -n_; - goto yyreduce; - } - } - else if (n_ == 0) - goto yyerrlab; - - /* Accept? */ - if (n_ == final_) - goto yyacceptlab; - - /* Shift the lookahead token. */ - YYCDEBUG << "Shifting token " << looka_ - << " (" << name_[[ilooka_]] << "), "; - - /* Discard the token being shifted unless it is eof. */ - if (looka_ != eof_) - looka_ = empty_; - - semantic_stack_.push (value); - location_stack_.push (location); - - /* Count tokens shifted since error; after three, turn off error - status. */ - if (errstatus) - --errstatus; - - state_ = n_; - goto yynewstate; - - /* Default action. */ - yydefault: - n_ = defact_[[state_]]; - if (n_ == 0) - goto yyerrlab; - goto yyreduce; - - /* Reduce. */ - yyreduce: - len_ = r2_[[n_]]; - if (len_) - { - yyval = semantic_stack_[[len_ - 1]]; - yyloc = location_stack_[[len_ - 1]]; - } - else - { - yyval = semantic_stack_[[0]]; - yyloc = location_stack_[[0]]; - } + ]b4_parser_class_name::~b4_parser_class_name[ () + { + } #if YYDEBUG - if (debug_) - { - YYCDEBUG << "Reducing via rule " << n_ - 1 - << " (line " << rline_[[n_]] << "), "; - for (b4_uint_type(b4_prhs_max) i = prhs_[[n_]]; - rhs_[[i]] >= 0; ++i) - YYCDEBUG << name_[[rhs_[i]]] << ' '; - YYCDEBUG << "-> " << name_[[r1_[n_]]] << std::endl; - } -#endif + /*--------------------------------. + | Print this symbol on YYOUTPUT. | + `--------------------------------*/ - if (len_) - { - Slice< LocationType, LocationStack > slice (location_stack_, len_); - YYLLOC_DEFAULT (yyloc, slice, len_); - } + inline void + ]b4_parser_class_name[::yy_symbol_value_print_ (int yytype, + const semantic_type& yyvalue, const location_type& yylocation) + { + YYUSE (yylocation); + YYUSE (yyvalue); + switch (yytype) + { + ]m4_map([b4_symbol_actions], m4_defn([b4_symbol_printers]))dnl +[ default: + break; + } + } + + + void + ]b4_parser_class_name[::yy_symbol_print_ (int yytype, + const semantic_type& yyvalue, const location_type& yylocation) + { + *yycdebug_ << (yytype < yyntokens_ ? "token" : "nterm") + << ' ' << yytname_[yytype] << " (" + << yylocation << ": "; + yy_symbol_value_print_ (yytype, yyvalue, yylocation); + *yycdebug_ << ')'; + } +#endif - switch (n_) - { - b4_actions - } + void + ]b4_parser_class_name[::yydestruct_ (const char* yymsg, + int yytype, semantic_type& yyvalue, location_type& yylocation) + { + YYUSE (yymsg); + YYUSE (yyvalue); + YYUSE (yylocation); + + if (yymsg) + YY_SYMBOL_PRINT (yymsg, yytype, yyvalue, yylocation); + + // User destructor. + switch (yytype) + { + ]m4_map([b4_symbol_actions], m4_defn([b4_symbol_destructors]))[ + default: + break; + }]b4_variant_if([ + + // Type destructor. + b4_symbol_variant([[yytype]], [[yyvalue]], [[destroy]])])[ + } + + ]b4_parser_class_name[::data_type::data_type () + : state() + , value() + , location() + { + } -/* Line __line__ of __file__. */ -#line __oline__ "__ofile__" + ]b4_parser_class_name[::data_type::data_type (state_type s, + const semantic_type& v, const location_type& l) + : state(s) + , value(v) + , location(l) + { + } - state_stack_.pop (len_); - semantic_stack_.pop (len_); - location_stack_.pop (len_); + void + ]b4_parser_class_name[::yypush_ (const char* m, state_type s, + semantic_type& v, const location_type& l) + { + if (m) + YY_SYMBOL_PRINT (m, yystos_[s], v, l); +]b4_variant_if( +[[ yystack_.push (data_type (s, semantic_type(), l)); + ]b4_symbol_variant([[yystos_[s]]], [[yystack_[0].value]], [build], [v])], +[ yystack_.push (data_type (s, v, l));])[ + } + + void + ]b4_parser_class_name[::yypop_ (unsigned int n) + { + yystack_.pop (n); + } #if YYDEBUG - if (debug_) - { - YYCDEBUG << "state stack now"; - for (StateStack::ConstIterator i = state_stack_.begin (); - i != state_stack_.end (); ++i) - YYCDEBUG << ' ' << *i; - YYCDEBUG << std::endl; - } -#endif + std::ostream& + ]b4_parser_class_name[::debug_stream () const + { + return *yycdebug_; + } - semantic_stack_.push (yyval); - location_stack_.push (yyloc); - - /* Shift the result of the reduction. */ - n_ = r1_[[n_]]; - state_ = pgoto_[[n_ - ntokens_]] + state_stack_[[0]]; - if (state_ >= 0 && state_ <= last_ && check_[[state_]] == state_stack_[[0]]) - state_ = table_[[state_]]; - else - state_ = defgoto_[[n_ - ntokens_]]; - goto yynewstate; - - /* Report and recover from errors. This is very incomplete. */ - yyerrlab: - /* If not already recovering from an error, report this error. */ - if (!errstatus) - { - ++nerrs; + void + ]b4_parser_class_name[::set_debug_stream (std::ostream& o) + { + yycdebug_ = &o; + } -#if YYERROR_VERBOSE - n_ = pact_[[state_]]; - if (n_ > flag_ && n_ < last_) - { - message = "parse error, unexpected "; - message += name_[[ilooka_]]; - { - int count = 0; - for (int x = (n_ < 0 ? -n_ : 0); x < ntokens_ + nnts_; ++x) - if (check_[[x + n_]] == x) - ++count; - if (count < 5) - { - count = 0; - for (int x = (n_ < 0 ? -n_ : 0); x < ntokens_ + nnts_; ++x) - if (check_[[x + n_]] == x) - { - message += (!count++) ? ", expecting " : " or "; - message += name_[[x]]; - } - } - } - } - else + + ]b4_parser_class_name[::debug_level_type + ]b4_parser_class_name[::debug_level () const + { + return yydebug_; + } + + void + ]b4_parser_class_name[::set_debug_level (debug_level_type l) + { + yydebug_ = l; + } #endif - message = "parse error"; - error_ (); - } - goto yyerrlab1; - /* Error raised explicitly by an action. */ - yyerrlab1: - if (errstatus == 3) - { - /* If just tried and failed to reuse lookahead token after an - error, discard it. */ + int + ]b4_parser_class_name[::parse () + { + /// Lookahead and lookahead in internal form. + int yychar = yyempty_; + int yytoken = 0; - /* Return failure if at end of input. */ - if (looka_ == eof_) - goto yyabortlab; - YYCDEBUG << "Discarding token " << looka_ - << " (" << name_[[ilooka_]] << ")." << std::endl; - looka_ = empty_; + /* State. */ + int yyn; + int yylen = 0; + int yystate = 0; + + /* Error handling. */ + int yynerrs_ = 0; + int yyerrstatus_ = 0; + + /// Semantic value of the lookahead. + semantic_type yylval; + /// Location of the lookahead. + location_type yylloc; + /// The locations where the error started and ended. + data_type yyerror_range[2]; + + /// $$. + semantic_type yyval; + /// @@$. + location_type yyloc; + + int yyresult; + + YYCDEBUG << "Starting parse" << std::endl; + +]m4_ifdef([b4_initial_action], [ +m4_pushdef([b4_at_dollar], [yylloc])dnl +m4_pushdef([b4_dollar_dollar], [yylval])dnl + /* User initialization code. */ + b4_user_initial_action +m4_popdef([b4_dollar_dollar])dnl +m4_popdef([b4_at_dollar])])dnl + + [ /* Initialize the stack. The initial state will be set in + yynewstate, since the latter expects the semantical and the + location values to have been already stored, initialize these + stacks with a primary value. */ + yystack_ = stack_type (0); + yypush_ (0, yystate, yylval, yylloc); + + // A new state was pushed on the stack. + // Invariant: yystate == yystack_[0].state, i.e., + // yystate was just pushed onto the state stack. + yynewstate: + YYCDEBUG << "Entering state " << yystate << std::endl; + + /* Accept? */ + if (yystate == yyfinal_) + goto yyacceptlab; + + goto yybackup; + + /* Backup. */ + yybackup: + + /* Try to take a decision without lookahead. */ + yyn = yypact_[yystate]; + if (yyn == yypact_ninf_) + goto yydefault; + + /* Read a lookahead token. */ + if (yychar == yyempty_) + { + YYCDEBUG << "Reading a token: "; + yychar = ]b4_c_function_call([yylex], [int], + [[YYSTYPE*], [&yylval]][]dnl +b4_locations_if([, [[location*], [&yylloc]]])dnl +m4_ifdef([b4_lex_param], [, ]b4_lex_param))[; + } + + + /* Convert token to internal form. */ + if (yychar <= yyeof_) + { + yychar = yytoken = yyeof_; + YYCDEBUG << "Now at end of input." << std::endl; + } + else + { + yytoken = yytranslate_ (yychar); + YY_SYMBOL_PRINT ("Next token is", yytoken, yylval, yylloc); + } + + /* If the proper action on seeing token YYTOKEN is to reduce or to + detect an error, take that action. */ + yyn += yytoken; + if (yyn < 0 || yylast_ < yyn || yycheck_[yyn] != yytoken) + goto yydefault; + + /* Reduce or error. */ + yyn = yytable_[yyn]; + if (yyn <= 0) + { + if (yyn == 0 || yyn == yytable_ninf_) + goto yyerrlab; + yyn = -yyn; + goto yyreduce; + } + + /* Discard the token being shifted. */ + yychar = yyempty_; + + /* Count tokens shifted since error; after three, turn off error + status. */ + if (yyerrstatus_) + --yyerrstatus_; + + /* Shift the lookahead token. */ + yystate = yyn; + yypush_ ("Shifting", yystate, yylval, yylloc); + goto yynewstate; + + /*-----------------------------------------------------------. + | yydefault -- do the default action for the current state. | + `-----------------------------------------------------------*/ + yydefault: + yyn = yydefact_[yystate]; + if (yyn == 0) + goto yyerrlab; + goto yyreduce; + + /*-----------------------------. + | yyreduce -- Do a reduction. | + `-----------------------------*/ + yyreduce: + yylen = yyr2_[yyn];]b4_variant_if([ + /* Variants are always initialized to an empty instance of the + correct type. The default $$=$1 rule is NOT applied when using + variants */ + ]b4_symbol_variant([[yyr1_@{yyn@}]], [yyval], [build])[],[ + /* If YYLEN is nonzero, implement the default value of the action: + `$$ = $1'. Otherwise, use the top of the stack. + + Otherwise, the following line sets YYVAL to garbage. + This behavior is undocumented and Bison + users should not rely upon it. */ + if (yylen) + yyval = yystack_@{yylen - 1@}.value; + else + yyval = yystack_@{0@}.value;])[ + + // Compute the default @@$. + { + slice slice (yystack_, yylen); + YYLLOC_DEFAULT (yyloc, slice, yylen); } - /* Else will try to reuse lookahead token after shifting the error - token. */ - - errstatus = 3; + // Perform the reduction. + YY_REDUCE_PRINT (yyn); + switch (yyn) + { + ]b4_user_actions[ + default: + break; + } + YY_SYMBOL_PRINT ("-> $$ =", yyr1_[yyn], yyval, yyloc); +]b4_variant_if([[ + // Destroy the lhs symbols. + for (int i = 0; i < yylen; ++i) + // Destroy a variant which value may have be swapped with yyval. + // The value of yyval (hence maybe one of these lhs symbols) + // depends on what does the default contruction for this type. + // In the case of pointers for instance, nothing is done, so the + // value is junk. Therefore do not try to report the content in + // the debug trace, it's junk. Hence yymsg = 0. Besides, that + // keeps exactly the same traces as with the other Bison + // skeletons. + yydestruct_ (0, + yystos_[yystack_[i].state], + yystack_[i].value, yystack_[i].location);]])[ + + yypop_ (yylen); + yylen = 0; + YY_STACK_PRINT (); + + /* Shift the result of the reduction. */ + yyn = yyr1_[yyn]; + yystate = yypgoto_[yyn - yyntokens_] + yystack_[0].state; + if (0 <= yystate && yystate <= yylast_ + && yycheck_[yystate] == yystack_[0].state) + yystate = yytable_[yystate]; + else + yystate = yydefgoto_[yyn - yyntokens_]; + yypush_ (0, yystate, yyval, yyloc); + goto yynewstate; + + /*------------------------------------. + | yyerrlab -- here on detecting error | + `------------------------------------*/ + yyerrlab: + /* If not already recovering from an error, report this error. */ + if (!yyerrstatus_) + { + ++yynerrs_; + error (yylloc, yysyntax_error_ (yystate, yytoken)); + } + + yyerror_range[0].location = yylloc; + if (yyerrstatus_ == 3) + { + /* If just tried and failed to reuse lookahead token after an + error, discard it. */ - for (;;) - { - n_ = pact_[[state_]]; - if (n_ != flag_) + if (yychar <= yyeof_) + { + /* Return failure if at end of input. */ + if (yychar == yyeof_) + YYABORT; + } + else + { + yydestruct_ ("Error: discarding", yytoken, yylval, yylloc); + yychar = yyempty_; + } + } + + /* Else will try to reuse lookahead token after shifting the error + token. */ + goto yyerrlab1; + + + /*---------------------------------------------------. + | yyerrorlab -- error raised explicitly by YYERROR. | + `---------------------------------------------------*/ + yyerrorlab: + + /* Pacify compilers like GCC when the user code never invokes + YYERROR and the label yyerrorlab therefore never appears in user + code. */ + if (false) + goto yyerrorlab; + + yyerror_range[0].location = yystack_[yylen - 1].location; + /* Do not reclaim the symbols of the rule which action triggered + this YYERROR. */ + yypop_ (yylen); + yylen = 0; + yystate = yystack_[0].state; + goto yyerrlab1; + + /*-------------------------------------------------------------. + | yyerrlab1 -- common code for both syntax error and YYERROR. | + `-------------------------------------------------------------*/ + yyerrlab1: + yyerrstatus_ = 3; /* Each real token shifted decrements this. */ + + for (;;) + { + yyn = yypact_[yystate]; + if (yyn != yypact_ninf_) { - n_ += terror_; - if (0 <= n_ && n_ <= last_ && check_[[n_]] == terror_) + yyn += yyterror_; + if (0 <= yyn && yyn <= yylast_ && yycheck_[yyn] == yyterror_) { - n_ = table_[[n_]]; - if (0 < n_) + yyn = yytable_[yyn]; + if (0 < yyn) break; } } - /* Pop the current state because it cannot handle the error token. */ - if (!state_stack_.height ()) - goto yyabortlab; - -#if YYDEBUG - if (debug_) - { - if (stos_[[state_]] < ntokens_) - { - YYCDEBUG << "Error: popping token " - << token_number_[[stos_[state_]]] - << " (" << name_[[stos_[state_]]]; -# ifdef YYPRINT - YYPRINT (stderr, token_number_[[stos_[state_]]], - semantic_stack_.top ()); -# endif - YYCDEBUG << ')' << std::endl; - } - else - { - YYCDEBUG << "Error: popping nonterminal (" - << name_[[stos_[state_]]] << ')' << std::endl; - } - } + // Pop the current state because it cannot handle the error token. + if (yystack_.size () == 1) + YYABORT; + + yyerror_range[0].location = yystack_[0].location; + yydestruct_ ("Error: popping", + yystos_[yystate], + yystack_[0].value, yystack_[0].location); + yypop_ (); + yystate = yystack_[0].state; + YY_STACK_PRINT (); + } + + yyerror_range[1].location = yylloc; + // Using YYLLOC is tempting, but would change the location of + // the lookahead. YYLOC is available though. + YYLLOC_DEFAULT (yyloc, (yyerror_range - 1), 2); + + /* Shift the error token. */ + yystate = yyn; + yypush_ ("Shifting", yystate, yylval, yyloc); + goto yynewstate; + + /* Accept. */ + yyacceptlab: + yyresult = 0; + goto yyreturn; + + /* Abort. */ + yyabortlab: + yyresult = 1; + goto yyreturn; + + yyreturn: + if (yychar != yyempty_) + yydestruct_ ("Cleanup: discarding lookahead", yytoken, yylval, yylloc); + + /* Do not reclaim the symbols of the rule which action triggered + this YYABORT or YYACCEPT. */ + yypop_ (yylen); + while (yystack_.size () != 1) + { + yydestruct_ ("Cleanup: popping", + yystos_[yystack_[0].state], + yystack_[0].value, yystack_[0].location); + yypop_ (); + } + + return yyresult; + } + + // Generate an error message. + std::string + ]b4_parser_class_name[::yysyntax_error_ (int yystate, int]dnl +b4_error_verbose_if([ tok])[) + { + std::string res; + YYUSE (yystate); +#if YYERROR_VERBOSE + int yyn = yypact_[yystate]; + if (yypact_ninf_ < yyn && yyn <= yylast_) + { + /* Start YYX at -YYN if negative to avoid negative indexes in + YYCHECK. */ + int yyxbegin = yyn < 0 ? -yyn : 0; + + /* Stay within bounds of both yycheck and yytname. */ + int yychecklim = yylast_ - yyn + 1; + int yyxend = yychecklim < yyntokens_ ? yychecklim : yyntokens_; + int count = 0; + for (int x = yyxbegin; x < yyxend; ++x) + if (yycheck_[x + yyn] == x && x != yyterror_) + ++count; + + // FIXME: This method of building the message is not compatible + // with internationalization. It should work like yacc.c does it. + // That is, first build a string that looks like this: + // "syntax error, unexpected %s or %s or %s" + // Then, invoke YY_ on this string. + // Finally, use the string as a format to output + // yytname_[tok], etc. + // Until this gets fixed, this message appears in English only. + res = "syntax error, unexpected "; + res += yytnamerr_ (yytname_[tok]); + if (count < 5) + { + count = 0; + for (int x = yyxbegin; x < yyxend; ++x) + if (yycheck_[x + yyn] == x && x != yyterror_) + { + res += (!count++) ? ", expecting " : " or "; + res += yytnamerr_ (yytname_[x]); + } + } + } + else #endif + res = YY_("syntax error"); + return res; + } - state_ = (state_stack_.pop (), state_stack_[[0]]); - semantic_stack_.pop (); - location_stack_.pop ();; -#if YYDEBUG - if (debug_) - { - YYCDEBUG << "Error: state stack now"; - for (StateStack::ConstIterator i = state_stack_.begin (); - i != state_stack_.end (); ++i) - YYCDEBUG << ' ' << *i; - YYCDEBUG << std::endl; - } -#endif - } + /* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing + STATE-NUM. */ + const ]b4_int_type(b4_pact_ninf, b4_pact_ninf) b4_parser_class_name::yypact_ninf_ = b4_pact_ninf[; + ]b4_table_define([pact], [b4_pact])[; - if (n_ == final_) - goto yyacceptlab; + /* YYDEFACT[S] -- default rule to reduce with in state S when YYTABLE + doesn't specify something else to do. Zero means the default is an + error. */ + ]b4_table_define([defact], [b4_defact])[; - YYCDEBUG << "Shifting error token, "; + /* YYPGOTO[NTERM-NUM]. */ + ]b4_table_define([pgoto], [b4_pgoto])[; - semantic_stack_.push (value); - location_stack_.push (location); + /* YYDEFGOTO[NTERM-NUM]. */ + ]b4_table_define([defgoto], [b4_defgoto])[; - state_ = n_; - goto yynewstate; + /* YYTABLE[YYPACT[STATE-NUM]]. What to do in state STATE-NUM. If + positive, shift that token. If negative, reduce the rule which + number is the opposite. If zero, do what YYDEFACT says. */ + const ]b4_int_type(b4_table_ninf, b4_table_ninf) b4_parser_class_name::yytable_ninf_ = b4_table_ninf[; + ]b4_table_define([table], [b4_table])[; - /* Accept. */ - yyacceptlab: - return 0; + /* YYCHECK. */ + ]b4_table_define([check], [b4_check])[; - /* Abort. */ - yyabortlab: - return 1; -} - -void -yy::b4_name::lex_ () -{ -#if YYLSP_NEEDED - looka_ = yylex (&value, &location); -#else - looka_ = yylex (&value); -#endif -} - -/* YYPACT[[STATE-NUM]] -- Index in YYTABLE of the portion describing - STATE-NUM. */ -const short -yy::b4_name::pact_[[]] = -{ - b4_pact -}; - -/* YYDEFACT[[S]] -- default rule to reduce with in state S when YYTABLE - doesn't specify something else to do. Zero means the default is an - error. */ -const short -yy::b4_name::defact_[[]] = -{ - b4_defact -}; - -/* YYPGOTO[[NTERM-NUM]]. */ -const short -yy::b4_name::pgoto_[[]] = -{ - b4_pgoto -}; - -/* YYDEFGOTO[[NTERM-NUM]]. */ -const short -yy::b4_name::defgoto_[[]] = -{ - b4_defgoto -}; - -/* YYTABLE[[YYPACT[STATE-NUM]]]. What to do in state STATE-NUM. If - positive, shift that token. If negative, reduce the rule which - number is the opposite. If zero, do what YYDEFACT says. */ -const short -yy::b4_name::table_[[]] = -{ - b4_table -}; - -/* YYCHECK. */ -const short -yy::b4_name::check_[[]] = -{ - b4_check -}; + /* STOS_[STATE-NUM] -- The (internal number of the) accessing + symbol of state STATE-NUM. */ + ]b4_table_define([stos], [b4_stos])[; #if YYDEBUG -/* STOS_[[STATE-NUM]] -- The (internal number of the) accessing - symbol of state STATE-NUM. */ -const b4_uint_type(b4_stos_max) -yy::b4_name::stos_[[]] = -{ - b4_stos -}; - -/* TOKEN_NUMBER_[[YYLEX-NUM]] -- Internal token number corresponding - to YYLEX-NUM. */ -const short -yy::b4_name::token_number_[[]] = -{ - b4_toknum -}; + /* TOKEN_NUMBER_[YYLEX-NUM] -- Internal symbol number corresponding + to YYLEX-NUM. */ + ]b4_table_define([token_number], [b4_toknum])[; #endif -/* YYR1[[YYN]] -- Symbol number of symbol that rule YYN derives. */ -const b4_uint_type(b4_r1_max) -yy::b4_name::r1_[[]] = -{ - b4_r1 -}; - -/* YYR2[[YYN]] -- Number of symbols composing right hand side of rule YYN. */ -const b4_uint_type(b4_r2_max) -yy::b4_name::r2_[[]] = -{ - b4_r2 -}; - -#if YYDEBUG || YYERROR_VERBOSE -/* YYTNAME[[SYMBOL-NUM]] -- String name of the symbol SYMBOL-NUM. - First, the terminals, then, starting at YYNTOKENS, nonterminals. */ -const char* -const yy::b4_name::name_[[]] = -{ - b4_tname -}; + /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */ + ]b4_table_define([r1], [b4_r1])[; + + /* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */ + ]b4_table_define([r2], [b4_r2])[; + +#if YYDEBUG || YYERROR_VERBOSE || YYTOKEN_TABLE + /* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM. + First, the terminals, then, starting at \a yyntokens_, nonterminals. */ + const char* + const ]b4_parser_class_name[::yytname_[] = + { + ]b4_tname[ + }; #endif #if YYDEBUG -/* YYRHS -- A `-1'-separated list of the rules' RHS. */ -const yy::b4_name::RhsNumberType -yy::b4_name::rhs_[[]] = -{ - b4_rhs -}; - -/* YYPRHS[[YYN]] -- Index of the first RHS symbol of rule number YYN in - YYRHS. */ -const b4_uint_type(b4_prhs_max) -yy::b4_name::prhs_[[]] = -{ - b4_prhs -}; - -/* YYRLINE[[YYN]] -- source line where rule number YYN was defined. */ -const b4_uint_type(b4_rline_max) -yy::b4_name::rline_[[]] = -{ - b4_rline -}; -#endif + /* YYRHS -- A `-1'-separated list of the rules' RHS. */ + ]b4_table_define([rhs], [b4_rhs])[; + + /* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in + YYRHS. */ + ]b4_table_define([prhs], [b4_prhs])[; + + /* YYRLINE[YYN] -- Source line where rule number YYN was defined. */ + ]b4_table_define([rline], [b4_rline])[; -/* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */ -yy::b4_name::TokenNumberType -yy::b4_name::translate_ (int token) -{ - static - const TokenNumberType - translate_[[]] = + // Print the state stack on the debug stream. + void + ]b4_parser_class_name[::yystack_print_ () { - b4_translate - }; - if ((unsigned) token <= user_token_number_max_) - return translate_[[token]]; - else - return undef_token_; -} - -const int yy::b4_name::eof_ = 0; -const int yy::b4_name::last_ = b4_last; -const int yy::b4_name::flag_ = b4_flag; -const int yy::b4_name::nnts_ = b4_nnts; -const int yy::b4_name::nsym_ = b4_nsym; -const int yy::b4_name::empty_ = -2; -const int yy::b4_name::final_ = b4_final; -const int yy::b4_name::terror_ = 1; -const int yy::b4_name::errcode_ = 256; -const int yy::b4_name::ntokens_ = b4_ntokens; -const int yy::b4_name::initdepth_ = b4_initdepth; - -const unsigned yy::b4_name::user_token_number_max_ = b4_user_token_number_max; -const yy::b4_name::TokenNumberType yy::b4_name::undef_token_ = b4_undef_token_number; - -b4_epilogue - -#output "stack.hh" -b4_copyright([2002]) + *yycdebug_ << "Stack now"; + for (stack_type::const_iterator + i = yystack_.begin (), + i_end = yystack_.end (); + i != i_end; ++i) + *yycdebug_ << ' ' << i->state; + *yycdebug_ << std::endl; + } + + // Report on the debug stream that the rule \a yyrule is going to be reduced. + void + ]b4_parser_class_name[::yy_reduce_print_ (int yyrule) + { + unsigned int yylno = yyrline_[yyrule]; + int yynrhs = yyr2_[yyrule]; + /* Print the symbols being reduced, and their result. */ + *yycdebug_ << "Reducing stack by rule " << yyrule - 1 + << " (line " << yylno << "):" << std::endl; + /* The symbols being reduced. */ + for (int yyi = 0; yyi < yynrhs; yyi++) + YY_SYMBOL_PRINT (" $" << yyi + 1 << " =", + yyrhs_[yyprhs_[yyrule] + yyi], + ]b4_rhs_value(yynrhs, yyi + 1)[, + ]b4_rhs_location(yynrhs, yyi + 1)[); + } +#endif // YYDEBUG + + /* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */ + ]b4_parser_class_name[::token_number_type + ]b4_parser_class_name[::yytranslate_ (int t) + { + static + const token_number_type + translate_table[] = + { + ]b4_translate[ + }; + if ((unsigned int) t <= yyuser_token_number_max_) + return translate_table[t]; + else + return yyundef_token_; + } + + const int ]b4_parser_class_name[::yyeof_ = 0; + const int ]b4_parser_class_name[::yylast_ = ]b4_last[; + const int ]b4_parser_class_name[::yynnts_ = ]b4_nterms_number[; + const int ]b4_parser_class_name[::yyempty_ = -2; + const int ]b4_parser_class_name[::yyfinal_ = ]b4_final_state_number[; + const int ]b4_parser_class_name[::yyterror_ = 1; + const int ]b4_parser_class_name[::yyerrcode_ = 256; + const int ]b4_parser_class_name[::yyntokens_ = ]b4_tokens_number[; + + const unsigned int ]b4_parser_class_name[::yyuser_token_number_max_ = ]b4_user_token_number_max[; + const ]b4_parser_class_name[::token_number_type ]b4_parser_class_name[::yyundef_token_ = ]b4_undef_token_number[; + +]b4_namespace_close[ + +]b4_epilogue[]dnl +@output(b4_dir_prefix[]stack.hh@)@ +b4_copyright([Stack handling for Bison parsers in C++])[ #ifndef BISON_STACK_HH # define BISON_STACK_HH #include -namespace yy -{ - template < class T, class S = std::deque< T > > - class Stack +]b4_namespace_open[ + template > + class stack { public: - typedef typename S::iterator Iterator; - typedef typename S::const_iterator ConstIterator; + // Hide our reversed order. + typedef typename S::reverse_iterator iterator; + typedef typename S::const_reverse_iterator const_iterator; - Stack () : seq_ () + stack () : seq_ () { } - Stack (unsigned n) : seq_ (n) + stack (unsigned int n) : seq_ (n) { } inline T& - operator [[]] (unsigned index) + operator [] (unsigned int i) { - return seq_[[index]]; + return seq_[i]; } inline const T& - operator [[]] (unsigned index) const + operator [] (unsigned int i) const { - return seq_[[index]]; + return seq_[i]; } inline @@ -822,73 +1316,54 @@ namespace yy inline void - pop (unsigned n = 1) + pop (unsigned int n = 1) { for (; n; --n) seq_.pop_front (); } inline - unsigned - height () const + typename S::size_type + size () const { return seq_.size (); } - inline ConstIterator begin () const { return seq_.begin (); } - inline ConstIterator end () const { return seq_.end (); } + inline const_iterator begin () const { return seq_.rbegin (); } + inline const_iterator end () const { return seq_.rend (); } private: - + /// The wrapped container. S seq_; }; - template < class T, class S = Stack< T > > - class Slice + /// Present a slice of the top of a stack. + template > + class slice { public: - Slice (const S& stack, - unsigned range) : stack_ (stack), - range_ (range) + slice (const S& stack, + unsigned int range) : stack_ (stack), + range_ (range) { } inline const T& - operator [[]] (unsigned index) const + operator [] (unsigned int i) const { - return stack_[[range_ - index]]; + return stack_[range_ - i]; } private: const S& stack_; - unsigned range_; - }; -} - -#endif // not BISON_STACK_HH - -#output "location.hh" -b4_copyright([2002]) - -#ifndef BISON_LOCATION_HH -# define BISON_LOCATION_HH - -namespace yy -{ - struct Position - { - int line; - int column; - }; - - struct Location - { - Position first; - Position last; + unsigned int range_; }; -} +]b4_namespace_close[ -#endif // not BISON_LOCATION_HH +#endif // not BISON_STACK_HH[]dnl +] +m4_divert_pop(0) +m4_popdef([b4_copyright_years])dnl