m4_divert(-1) # C++ skeleton for Bison # Copyright (C) 2002, 2003, 2004 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 # (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 ## ---------------- ## ## Default values. ## ## ---------------- ## # Default parser class name. m4_define_default([b4_parser_class_name], [parser]) ## ----------------- ## ## Semantic Values. ## ## ----------------- ## # b4_lhs_value([TYPE]) # -------------------- # Expansion of $$. m4_define([b4_lhs_value], [(yyval[]m4_ifval([$1], [.$1]))]) # b4_rhs_value(RULE-LENGTH, NUM, [TYPE]) # -------------------------------------- # Expansion of $NUM, where the current rule has RULE-LENGTH # symbols on RHS. m4_define([b4_rhs_value], [(yysemantic_stack_@{m4_eval([$1 - $2])@}m4_ifval([$3], [.$3]))]) m4_define_default([b4_location_type], [location]) m4_define_default([b4_filename_type], [std::string]) # b4_lhs_location() # ----------------- # Expansion of @$. m4_define([b4_lhs_location], [(yyloc)]) # b4_rhs_location(RULE-LENGTH, NUM) # --------------------------------- # Expansion of @NUM, where the current rule has RULE-LENGTH symbols # on RHS. m4_define([b4_rhs_location], [(yylocation_stack_@{m4_eval([$1 - $2])@})]) # b4_parse_param_decl # ------------------- # Extra formal arguments of the constructor. # Change the parameter names from "foo" into "foo_yyarg", so that # there is no collision bw the user chosen attribute name, and the # argument name in the constructor. m4_define([b4_parse_param_decl], [m4_ifset([b4_parse_param], [m4_map_sep([b4_parse_param_decl_1], [, ], [b4_parse_param])])]) m4_define([b4_parse_param_decl_1], [$1_yyarg]) # b4_parse_param_cons # ------------------- # Extra initialisations of the constructor. m4_define([b4_parse_param_cons], [m4_ifset([b4_parse_param], [, b4_cc_constructor_calls(b4_parse_param)])]) m4_define([b4_cc_constructor_calls], [m4_map_sep([b4_cc_constructor_call], [, ], [$@])]) m4_define([b4_cc_constructor_call], [$2 ($2_yyarg)]) # b4_parse_param_vars # ------------------- # Extra instance variables. m4_define([b4_parse_param_vars], [m4_ifset([b4_parse_param], [ /* User arguments. */ b4_cc_var_decls(b4_parse_param)])]) m4_define([b4_cc_var_decls], [m4_map_sep([b4_cc_var_decl], [ ], [$@])]) m4_define([b4_cc_var_decl], [ $1;]) # We do want M4 expansion after # for CPP macros. m4_changecom() m4_divert(0)dnl m4_if(b4_defines_flag, 0, [], [@output @output_header_name@ b4_copyright([C++ Skeleton parser for LALR(1) parsing with Bison], [2002, 2003, 2004])[ /* FIXME: This is wrong, we want computed header guards. I don't know why the macros are missing now. :( */ #ifndef PARSER_HEADER_H # define PARSER_HEADER_H #include #include /* Using locations. */ #define YYLSP_NEEDED ]b4_locations_flag[ namespace yy { class position; class location; } ]b4_token_defines(b4_tokens)[ /* Copy the first part of user declarations. */ ]b4_pre_prologue[ ]/* Line __line__ of lalr1.cc. */ b4_syncline([@oline@], [@ofile@])[ #include "stack.hh" #include "location.hh" /* Enabling traces. */ #ifndef YYDEBUG # define YYDEBUG ]b4_debug[ #endif /* Enabling verbose error message. */ #ifndef YYERROR_VERBOSE # define YYERROR_VERBOSE ]b4_error_verbose[ #endif #if ! defined (YYSTYPE) && ! defined (YYSTYPE_IS_DECLARED) ]m4_ifdef([b4_stype], [b4_syncline([b4_stype_line], [b4_filename]) union YYSTYPE b4_stype; /* Line __line__ of lalr1.cc. */ b4_syncline([@oline@], [@ofile@])], [typedef int YYSTYPE;])[ # define yystype YYSTYPE /* obsolescent; will be withdrawn */ # define YYSTYPE_IS_DECLARED 1 # define YYSTYPE_IS_TRIVIAL 1 #endif /* Copy the second part of user declarations. */ ]b4_post_prologue[ ]/* Line __line__ of lalr1.cc. */ b4_syncline([@oline@], [@ofile@])[ /* 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). */ #ifndef YYLLOC_DEFAULT # define YYLLOC_DEFAULT(Current, Rhs, N) \ do { \ if (N) \ { \ (Current).begin = (Rhs)[1].begin; \ (Current).end = (Rhs)[N].end; \ } \ else \ { \ (Current).begin = (Current).end = (Rhs)[0].end; \ } \ } while (0) #endif namespace yy { class ]b4_parser_class_name[; template struct traits { }; template <> struct traits<]b4_parser_class_name[> { typedef ]b4_int_type_for([b4_translate])[ token_number_type; typedef ]b4_int_type_for([b4_rhs])[ rhs_number_type; typedef int state_type; typedef YYSTYPE semantic_type; typedef ]b4_location_type[ location_type; }; } namespace yy { /// A Bison parser. class ]b4_parser_class_name[ { public: /// Internal symbol numbers. typedef traits<]b4_parser_class_name[>::token_number_type token_number_type; /// A type to store symbol numbers and -1. typedef traits<]b4_parser_class_name[>::rhs_number_type rhs_number_type; /// State numbers. typedef traits<]b4_parser_class_name[>::state_type state_type; /// Symbol semantic values. typedef traits<]b4_parser_class_name[>::semantic_type semantic_type; /// Symbol locations. typedef traits<]b4_parser_class_name[>::location_type location_type; /// State stack type. typedef stack state_stack; /// Semantic value stack type. typedef stack semantic_stack; /// location stack type. typedef stack location_stack; /// Build a parser object. ]b4_parser_class_name[ (]b4_parse_param_decl[) : yydebug_ (false), yycdebug_ (&std::cerr)]b4_parse_param_cons[ { } virtual ~]b4_parser_class_name[ () { } /// Parse. /// \returns 0 iff parsing succeeded. virtual int parse (); /// 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); private: /// Call the scanner. virtual void yylex_ (); /// 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, and invoke error. virtual void yyreport_syntax_error_ (); #if YYDEBUG /// \brief Report a symbol on the debug stream. /// \param yytype The token type. /// \param yyvaluep Its semantic value. /// \param yylocationp Its location. virtual void yysymprint_ (int yytype, const semantic_type* yyvaluep, const location_type* yylocationp); #endif /* ! YYDEBUG */ /// The state stack. state_stack yystate_stack_; /// The semantic value stack. semantic_stack yysemantic_stack_; /// The location stack. location_stack yylocation_stack_; /* Tables. */ /// 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 /// For a symbol, its name in clear. static const char* const yyname_[]; #endif #if YYDEBUG /// A `-1'-separated list of the rules' RHS. static const rhs_number_type 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 yyreduce_print_ (int r); /// Print the state stack on the debug stream. virtual void yystack_print_ (); #endif /// Convert a scanner token number to a symbol number. inline token_number_type yytranslate_ (int token); /// \brief Reclaim the memory associated to a symbol. /// \param yymsg Why this token is reclaimed. /// \param yytype The symbol type. /// \param yyvaluep Its semantic value. /// \param yylocationp Its location. inline void yydestruct_ (const char* yymsg, int yytype, semantic_type* yyvaluep, location_type* yylocationp); /// Pop \a n symbols the three stacks. inline void yypop_ (unsigned int n = 1); /* 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_; /* State. */ int yyn_; int yylen_; int yystate_; /* Error handling. */ int yynerrs_; int yyerrstatus_; /* Debugging. */ int yydebug_; std::ostream* yycdebug_; /* Look-ahead and look-ahead in internal form. */ int yylooka_; int yyilooka_; /// Semantic value of the look-ahead. semantic_type yylval; /// Location of the look-ahead. location_type yylloc; /// The locations where the error started and ended. location yyerror_range_[2]; /// $$. semantic_type yyval; /// @@$. location_type yyloc; ]b4_parse_param_vars[ }; } #endif /* ! defined PARSER_HEADER_H */] ])dnl @output @output_parser_name@ b4_copyright([C++ Skeleton parser for LALR(1) parsing with Bison], [2002, 2003, 2004]) m4_if(b4_prefix[], [yy], [], [ // Take the name prefix into account. #define yylex b4_prefix[]lex]) m4_if(b4_defines_flag, 0, [], [ #include @output_header_name@])[ /* A pseudo ostream that takes yydebug_ into account. */ # define YYCDEBUG \ for (bool yydebugcond_ = yydebug_; yydebugcond_; yydebugcond_ = false) \ (*yycdebug_) /* Enable debugging if requested. */ #if YYDEBUG # define YY_SYMBOL_PRINT(Title, Type, Value, Location) \ do { \ if (yydebug_) \ { \ *yycdebug_ << (Title) << ' '; \ yysymprint_ ((Type), (Value), (Location)); \ *yycdebug_ << std::endl; \ } \ } while (0) # define YY_REDUCE_PRINT(Rule) \ do { \ if (yydebug_) \ yyreduce_print_ (Rule); \ } while (0) # define YY_STACK_PRINT() \ do { \ if (yydebug_) \ yystack_print_ (); \ } while (0) #else /* !YYDEBUG */ # define YY_SYMBOL_PRINT(Title, Type, Value, Location) # define YY_REDUCE_PRINT(Rule) # define YY_STACK_PRINT() #endif /* !YYDEBUG */ #define YYACCEPT goto yyacceptlab #define YYABORT goto yyabortlab #define YYERROR goto yyerrorlab #if YYDEBUG /*--------------------------------. | Print this symbol on YYOUTPUT. | `--------------------------------*/ void yy::]b4_parser_class_name[::yysymprint_ (int yytype, const semantic_type* yyvaluep, const location_type* yylocationp) { /* Pacify ``unused variable'' warnings. */ (void) yyvaluep; (void) yylocationp; /* Backward compatibility, but should be removed eventually. */ std::ostream& cdebug_ = *yycdebug_; (void) cdebug_; *yycdebug_ << (yytype < yyntokens_ ? "token" : "nterm") << ' ' << yyname_[yytype] << " (" << *yylocationp << ": "; switch (yytype) { ]m4_map([b4_symbol_actions], m4_defn([b4_symbol_printers]))dnl [ default: break; } *yycdebug_ << ')'; } #endif /* ! YYDEBUG */ void yy::]b4_parser_class_name[::yydestruct_ (const char* yymsg, int yytype, semantic_type* yyvaluep, location_type* yylocationp) { /* Pacify ``unused variable'' warnings. */ (void) yyvaluep; (void) yylocationp; YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp); switch (yytype) { ]m4_map([b4_symbol_actions], m4_defn([b4_symbol_destructors]))[ default: break; } } void yy::]b4_parser_class_name[::yypop_ (unsigned int n) { yystate_stack_.pop (n); yysemantic_stack_.pop (n); yylocation_stack_.pop (n); } std::ostream& yy::]b4_parser_class_name[::debug_stream () const { return *yycdebug_; } void yy::]b4_parser_class_name[::set_debug_stream (std::ostream& o) { yycdebug_ = &o; } yy::]b4_parser_class_name[::debug_level_type yy::]b4_parser_class_name[::debug_level () const { return yydebug_; } void yy::]b4_parser_class_name[::set_debug_level (debug_level_type l) { yydebug_ = l; } int yy::]b4_parser_class_name[::parse () { YYCDEBUG << "Starting parse" << std::endl; yynerrs_ = 0; yyerrstatus_ = 0; /* Start. */ yystate_ = 0; yylooka_ = yyempty_; ]m4_ifdef([b4_initial_action], [ m4_pushdef([b4_at_dollar], [yylloc])dnl m4_pushdef([b4_dollar_dollar], [yylval])dnl /* User initialization code. */ b4_initial_action m4_popdef([b4_dollar_dollar])dnl m4_popdef([b4_at_dollar])dnl /* Line __line__ of yacc.c. */ b4_syncline([@oline@], [@ofile@])])dnl [ /* Initialize the stacks. The initial state will be pushed in yynewstate, since the latter expects the semantical and the location values to have been already stored, initialize these stacks with a primary value. */ yystate_stack_ = state_stack (0); yysemantic_stack_ = semantic_stack (0); yylocation_stack_ = location_stack (0); yysemantic_stack_.push (yylval); yylocation_stack_.push (yylloc); /* New state. */ yynewstate: yystate_stack_.push (yystate_); YYCDEBUG << "Entering state " << yystate_ << std::endl; goto yybackup; /* Backup. */ yybackup: /* Try to take a decision without look-ahead. */ yyn_ = yypact_[yystate_]; if (yyn_ == yypact_ninf_) goto yydefault; /* Read a look-ahead token. */ if (yylooka_ == yyempty_) yylex_ (); /* Convert token to internal form. */ if (yylooka_ <= yyeof_) { yylooka_ = yyilooka_ = yyeof_; YYCDEBUG << "Now at end of input." << std::endl; } else { yyilooka_ = yytranslate_ (yylooka_); YY_SYMBOL_PRINT ("Next token is", yyilooka_, &yylval, &yylloc); } /* If the proper action on seeing token ILOOKA_ is to reduce or to detect an error, take that action. */ yyn_ += yyilooka_; if (yyn_ < 0 || yylast_ < yyn_ || yycheck_[yyn_] != yyilooka_) goto yydefault; /* Reduce or error. */ yyn_ = yytable_[yyn_]; if (yyn_ < 0) { if (yyn_ == yytable_ninf_) goto yyerrlab; else { yyn_ = -yyn_; goto yyreduce; } } else if (yyn_ == 0) goto yyerrlab; /* Accept? */ if (yyn_ == yyfinal_) goto yyacceptlab; /* Shift the look-ahead token. */ YY_SYMBOL_PRINT ("Shifting", yyilooka_, &yylval, &yylloc); /* Discard the token being shifted unless it is eof. */ if (yylooka_ != yyeof_) yylooka_ = yyempty_; yysemantic_stack_.push (yylval); yylocation_stack_.push (yylloc); /* Count tokens shifted since error; after three, turn off error status. */ if (yyerrstatus_) --yyerrstatus_; yystate_ = yyn_; 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_]; /* If LEN_ 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 = yysemantic_stack_[yylen_ - 1]; else yyval = yysemantic_stack_[0]; { slice slice (yylocation_stack_, yylen_); YYLLOC_DEFAULT (yyloc, slice, yylen_); } YY_REDUCE_PRINT (yyn_); switch (yyn_) { ]b4_actions[ } ]/* Line __line__ of lalr1.cc. */ b4_syncline([@oline@], [@ofile@])[ yypop_ (yylen_); YY_STACK_PRINT (); yysemantic_stack_.push (yyval); yylocation_stack_.push (yyloc); /* Shift the result of the reduction. */ yyn_ = yyr1_[yyn_]; yystate_ = yypgoto_[yyn_ - yyntokens_] + yystate_stack_[0]; if (0 <= yystate_ && yystate_ <= yylast_ && yycheck_[yystate_] == yystate_stack_[0]) yystate_ = yytable_[yystate_]; else yystate_ = yydefgoto_[yyn_ - yyntokens_]; goto yynewstate; /*------------------------------------. | yyerrlab -- here on detecting error | `------------------------------------*/ yyerrlab: /* If not already recovering from an error, report this error. */ yyreport_syntax_error_ (); yyerror_range_[0] = yylloc; if (yyerrstatus_ == 3) { /* If just tried and failed to reuse look-ahead token after an error, discard it. */ /* Return failure if at end of input. */ if (yylooka_ <= yyeof_) { /* If at end of input, pop the error token, then the rest of the stack, then return failure. */ if (yylooka_ == yyeof_) for (;;) { yyerror_range_[0] = yylocation_stack_[0]; yypop_ (); if (yystate_stack_.height () == 1) YYABORT; yydestruct_ ("Error: popping", yystos_[yystate_stack_[0]], &yysemantic_stack_[0], &yylocation_stack_[0]); } } else { yydestruct_ ("Error: discarding", yyilooka_, &yylval, &yylloc); yylooka_ = yyempty_; } } /* Else will try to reuse look-ahead token after shifting the error token. */ goto yyerrlab1; /*---------------------------------------------------. | yyerrorlab -- error raised explicitly by YYERROR. | `---------------------------------------------------*/ yyerrorlab: #ifdef __GNUC__ /* Pacify GCC when the user code never invokes YYERROR and the label yyerrorlab therefore never appears in user code. */ if (0) goto yyerrorlab; #endif yyerror_range_[0] = yylocation_stack_[yylen_ - 1]; yypop_ (yylen_); yystate_ = yystate_stack_[0]; 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_) { yyn_ += yyterror_; if (0 <= yyn_ && yyn_ <= yylast_ && yycheck_[yyn_] == yyterror_) { yyn_ = yytable_[yyn_]; if (0 < yyn_) break; } } /* Pop the current state because it cannot handle the error token. */ if (yystate_stack_.height () == 1) YYABORT; yyerror_range_[0] = yylocation_stack_[0]; yydestruct_ ("Error: popping", yystos_[yystate_], &yysemantic_stack_[0], &yylocation_stack_[0]); yypop_ (); yystate_ = yystate_stack_[0]; YY_STACK_PRINT (); } if (yyn_ == yyfinal_) goto yyacceptlab; yyerror_range_[1] = yylloc; // Using YYLLOC is tempting, but would change the location of // the look-ahead. YYLOC is available though. YYLLOC_DEFAULT (yyloc, yyerror_range_ - 1, 2); yysemantic_stack_.push (yylval); yylocation_stack_.push (yyloc); /* Shift the error token. */ YY_SYMBOL_PRINT ("Shifting", yystos_[yyn_], &yysemantic_stack_[0], &yylocation_stack_[0]); yystate_ = yyn_; goto yynewstate; /* Accept. */ yyacceptlab: return 0; /* Abort. */ yyabortlab: /* Free the lookahead. */ yydestruct_ ("Error: discarding lookahead", yyilooka_, &yylval, &yylloc); yylooka_ = yyempty_; return 1; } void yy::]b4_parser_class_name[::yylex_ () { YYCDEBUG << "Reading a token: "; #if YYLSP_NEEDED yylooka_ = yylex (&yylval, &yylloc); #else yylooka_ = yylex (&yylval); #endif } // Generate an error message, and invoke error. void yy::]b4_parser_class_name[::yyreport_syntax_error_ () { /* If not already recovering from an error, report this error. */ if (!yyerrstatus_) { ++yynerrs_; std::string message; #if YYERROR_VERBOSE 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_; int yyxend = yychecklim < yyntokens_ ? yychecklim : yyntokens_; int count = 0; for (int x = yyxbegin; x < yyxend; ++x) if (yycheck_[x + yyn_] == x && x != yyterror_) ++count; message = "syntax error, unexpected "; message += yyname_[yyilooka_]; if (count < 5) { count = 0; for (int x = yyxbegin; x < yyxend; ++x) if (yycheck_[x + yyn_] == x && x != yyterror_) { message += (!count++) ? ", expecting " : " or "; message += yyname_[x]; } } } else #endif message = "syntax error"; error (yylloc, message); } } /* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing STATE-NUM. */ const ]b4_int_type(b4_pact_ninf, b4_pact_ninf) yy::b4_parser_class_name::yypact_ninf_ = b4_pact_ninf[; const ]b4_int_type_for([b4_pact])[ yy::]b4_parser_class_name[::yypact_[] = { ]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 ]b4_int_type_for([b4_defact])[ yy::]b4_parser_class_name[::yydefact_[] = { ]b4_defact[ }; /* YYPGOTO[NTERM-NUM]. */ const ]b4_int_type_for([b4_pgoto])[ yy::]b4_parser_class_name[::yypgoto_[] = { ]b4_pgoto[ }; /* YYDEFGOTO[NTERM-NUM]. */ const ]b4_int_type_for([b4_defgoto])[ yy::]b4_parser_class_name[::yydefgoto_[] = { ]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 ]b4_int_type(b4_table_ninf, b4_table_ninf) yy::b4_parser_class_name::yytable_ninf_ = b4_table_ninf[; const ]b4_int_type_for([b4_table])[ yy::]b4_parser_class_name[::yytable_[] = { ]b4_table[ }; /* YYCHECK. */ const ]b4_int_type_for([b4_check])[ yy::]b4_parser_class_name[::yycheck_[] = { ]b4_check[ }; /* STOS_[STATE-NUM] -- The (internal number of the) accessing symbol of state STATE-NUM. */ const ]b4_int_type_for([b4_stos])[ yy::]b4_parser_class_name[::yystos_[] = { ]b4_stos[ }; #if YYDEBUG /* TOKEN_NUMBER_[YYLEX-NUM] -- Internal symbol number corresponding to YYLEX-NUM. */ const ]b4_int_type_for([b4_toknum])[ yy::]b4_parser_class_name[::yytoken_number_[] = { ]b4_toknum[ }; #endif /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */ const ]b4_int_type_for([b4_r1])[ yy::]b4_parser_class_name[::yyr1_[] = { ]b4_r1[ }; /* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */ const ]b4_int_type_for([b4_r2])[ yy::]b4_parser_class_name[::yyr2_[] = { ]b4_r2[ }; #if YYDEBUG || YYERROR_VERBOSE /* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM. First, the terminals, then, starting at \a yyntokens_, nonterminals. */ const char* const yy::]b4_parser_class_name[::yyname_[] = { ]b4_tname[ }; #endif #if YYDEBUG /* YYRHS -- A `-1'-separated list of the rules' RHS. */ const yy::]b4_parser_class_name[::rhs_number_type yy::]b4_parser_class_name[::yyrhs_[] = { ]b4_rhs[ }; /* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in YYRHS. */ const ]b4_int_type_for([b4_prhs])[ yy::]b4_parser_class_name[::yyprhs_[] = { ]b4_prhs[ }; /* YYRLINE[YYN] -- Source line where rule number YYN was defined. */ const ]b4_int_type_for([b4_rline])[ yy::]b4_parser_class_name[::yyrline_[] = { ]b4_rline[ }; // Print the state stack on the debug stream. void yy::]b4_parser_class_name[::yystack_print_ () { *yycdebug_ << "Stack now"; for (state_stack::const_iterator i = yystate_stack_.begin (); i != yystate_stack_.end (); ++i) *yycdebug_ << ' ' << *i; *yycdebug_ << std::endl; } // Report on the debug stream that the rule \a yyrule is going to be reduced. void yy::]b4_parser_class_name[::yyreduce_print_ (int yyrule) { unsigned int yylno = yyrline_[yyrule]; /* Print the symbols being reduced, and their result. */ *yycdebug_ << "Reducing stack by rule " << yyn_ - 1 << " (line " << yylno << "), "; for (]b4_int_type_for([b4_prhs])[ i = yyprhs_[yyn_]; 0 <= yyrhs_[i]; ++i) *yycdebug_ << yyname_[yyrhs_[i]] << ' '; *yycdebug_ << "-> " << yyname_[yyr1_[yyn_]] << std::endl; } #endif // YYDEBUG /* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */ yy::]b4_parser_class_name[::token_number_type yy::]b4_parser_class_name[::yytranslate_ (int token) { static const token_number_type translate_table[] = { ]b4_translate[ }; if ((unsigned int) token <= yyuser_token_number_max_) return translate_table[token]; else return yyundef_token_; } const int yy::]b4_parser_class_name[::yyeof_ = 0; const int yy::]b4_parser_class_name[::yylast_ = ]b4_last[; const int yy::]b4_parser_class_name[::yynnts_ = ]b4_nterms_number[; const int yy::]b4_parser_class_name[::yyempty_ = -2; const int yy::]b4_parser_class_name[::yyfinal_ = ]b4_final_state_number[; const int yy::]b4_parser_class_name[::yyterror_ = 1; const int yy::]b4_parser_class_name[::yyerrcode_ = 256; const int yy::]b4_parser_class_name[::yyntokens_ = ]b4_tokens_number[; const unsigned int yy::]b4_parser_class_name[::yyuser_token_number_max_ = ]b4_user_token_number_max[; const yy::]b4_parser_class_name[::token_number_type yy::]b4_parser_class_name[::yyundef_token_ = ]b4_undef_token_number[; ]b4_epilogue dnl @output stack.hh b4_copyright([stack handling for Bison C++ parsers], [2002, 2003, 2004])[ #ifndef BISON_STACK_HH # define BISON_STACK_HH #include namespace yy { template > class stack { public: // Hide our reversed order. typedef typename S::reverse_iterator iterator; typedef typename S::const_reverse_iterator const_iterator; stack () : seq_ () { } stack (unsigned int n) : seq_ (n) { } inline T& operator [] (unsigned int i) { return seq_[i]; } inline const T& operator [] (unsigned int i) const { return seq_[i]; } inline void push (const T& t) { seq_.push_front (t); } inline void pop (unsigned int n = 1) { for (; n; --n) seq_.pop_front (); } inline unsigned int height () const { return seq_.size (); } inline const_iterator begin () const { return seq_.rbegin (); } inline const_iterator end () const { return seq_.rend (); } private: S seq_; }; template > class slice { public: slice (const S& stack, unsigned int range) : stack_ (stack), range_ (range) { } inline const T& operator [] (unsigned int i) const { return stack_[range_ - i]; } private: const S& stack_; unsigned int range_; }; } #endif // not BISON_STACK_HH] dnl @output position.hh b4_copyright([Position class for Bison C++ parsers], [2002, 2003, 2004])[ /** ** \file position.hh ** Define the position class. */ #ifndef BISON_POSITION_HH # define BISON_POSITION_HH # include # include namespace yy { /// Abstract a position. class position { public: /// Initial column number. static const unsigned int initial_column = 0; /// Initial line number. static const unsigned int initial_line = 1; /** \name Ctor & dtor. ** \{ */ public: /// Construct a position. position () : filename (0), line (initial_line), column (initial_column) { } /** \} */ /** \name Line and Column related manipulators ** \{ */ public: /// (line related) Advance to the COUNT next lines. inline void lines (int count = 1) { column = initial_column; line += count; } /// (column related) Advance to the COUNT next columns. inline void columns (int count = 1) { int leftmost = initial_column; int current = column; if (leftmost <= current + count) column += count; else column = initial_column; } /** \} */ public: /// File name to which this position refers. ]b4_filename_type[* filename; /// Current line number. unsigned int line; /// Current column number. unsigned int column; }; /// Add and assign a position. inline const position& operator+= (position& res, const int width) { res.columns (width); return res; } /// Add two position objects. inline const position operator+ (const position& begin, const int width) { position res = begin; return res += width; } /// Add and assign a position. inline const position& operator-= (position& res, const int width) { return res += -width; } /// Add two position objects. inline const position operator- (const position& begin, const int width) { return begin + -width; } /** \brief Intercept output stream redirection. ** \param ostr the destination output stream ** \param pos a reference to the position to redirect */ inline std::ostream& operator<< (std::ostream& ostr, const position& pos) { if (pos.filename) ostr << *pos.filename << ':'; return ostr << pos.line << '.' << pos.column; } } #endif // not BISON_POSITION_HH] @output location.hh b4_copyright([Location class for Bison C++ parsers], [2002, 2003, 2004])[ /** ** \file location.hh ** Define the location class. */ #ifndef BISON_LOCATION_HH # define BISON_LOCATION_HH # include # include # include "position.hh" namespace yy { /// Abstract a location. class location { /** \name Ctor & dtor. ** \{ */ public: /// Construct a location. location (void) : begin (), end () { } /** \} */ /** \name Line and Column related manipulators ** \{ */ public: /// Reset initial location to final location. inline void step (void) { begin = end; } /// Extend the current location to the COUNT next columns. inline void columns (unsigned int count = 1) { end += count; } /// Extend the current location to the COUNT next lines. inline void lines (unsigned int count = 1) { end.lines (count); } /** \} */ public: /// Beginning of the located region. position begin; /// End of the located region. position end; }; /// Join two location objects to create a location. inline const location operator+ (const location& begin, const location& end) { location res = begin; res.end = end.end; return res; } /// Add two location objects. inline const location operator+ (const location& begin, unsigned int width) { location res = begin; res.columns (width); return res; } /// Add and assign a location. inline location& operator+= (location& res, unsigned int width) { res.columns (width); return res; } /** \brief Intercept output stream redirection. ** \param ostr the destination output stream ** \param loc a reference to the location to redirect ** ** Avoid duplicate information. */ inline std::ostream& operator<< (std::ostream& ostr, const location& loc) { position last = loc.end - 1; ostr << loc.begin; if (last.filename && (!loc.begin.filename || *loc.begin.filename != *last.filename)) ostr << '-' << last; else if (loc.begin.line != last.line) ostr << '-' << last.line << '.' << last.column; else if (loc.begin.column != last.column) ostr << '-' << last.column; return ostr; } } #endif // not BISON_LOCATION_HH]