-m4_divert(-1)
# C++ skeleton for Bison
-# Copyright (C) 2002, 2003 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 <http://www.gnu.org/licenses/>.
-## ---------------- ##
-## Default values. ##
-## ---------------- ##
+m4_include(b4_pkgdatadir/[c++.m4])
-# Default Parser class name.
-m4_define_default([b4_parser_class_name], [Parser])
+# b4_table_define(TABLE-NAME, CONTENT)
+# ------------------------------------
+# Define "parser::yy<TABLE-NAME>_" which contents is CONTENT.
+m4_define([b4_table_define],
+[const b4_int_type_for([$2])
+ b4_parser_class_name::yy$1_[[]] =
+ {
+ $2
+ }dnl
+])
+# 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
-## ----------------- ##
-## Semantic Values. ##
-## ----------------- ##
+# b4_assert_if([IF-ASSERTIONS-ARE-USED], [IF-NOT])
+# ----------------------------------------------------
+m4_define([b4_assert_if],
+[b4_percent_define_ifdef([[assert]], [$1], [$2])])
# b4_lhs_value([TYPE])
# --------------------
# Expansion of $<TYPE>$.
m4_define([b4_lhs_value],
-[yyval[]m4_ifval([$1], [.$1])])
+[b4_symbol_value([yylhs.value], [$1])])
+
+
+# b4_lhs_location()
+# -----------------
+# Expansion of @$.
+m4_define([b4_lhs_location],
+[yylhs.location])
+
+
+# b4_rhs_data(RULE-LENGTH, NUM)
+# -----------------------------
+# Return the data corresponding to the symbol #NUM, where the current
+# rule has RULE-LENGTH symbols on RHS.
+m4_define([b4_rhs_data],
+ [yystack_@{($1) - ($2)@}])
+
+
+# b4_rhs_state(RULE-LENGTH, NUM)
+# -----------------------------
+# The state corresponding to the symbol #NUM, where the current
+# rule has RULE-LENGTH symbols on RHS.
+m4_define([b4_rhs_state],
+ [b4_rhs_data([$1], [$2]).state])
# b4_rhs_value(RULE-LENGTH, NUM, [TYPE])
# Expansion of $<TYPE>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])])
-
-m4_define_default([b4_location_type], [Location])
-
-# b4_lhs_location()
-# -----------------
-# Expansion of @$.
-m4_define([b4_lhs_location],
-[yyloc])
+ [b4_symbol_value([b4_rhs_data([$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([b4_inherit],
- [m4_ifdef([b4_root],
- [: public b4_root
-],
- [])])
-
-m4_define([b4_param],
- [m4_ifdef([b4_root],
- [,
- const Param& param],
- [])])
-
-m4_define([b4_constructor],
- [m4_ifdef([b4_root],
- [b4_root (param),
- ],
- [])])
-
+ [b4_rhs_data([$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([yydata.value], [$6])])dnl
+m4_pushdef([b4_at_dollar], [yydata.location])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(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])[
-/* FIXME: This is wrong, we want computed header guards.
- I don't know why the macros are missing now. :( */
+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
-#include "stack.hh"
-#include "location.hh"
+]b4_percent_code_get([[requires]])[
+]b4_assert_if([#include <cassert>])[
#include <string>
#include <iostream>
+#include "stack.hh"
-/* Using locations. */
-#define YYLSP_NEEDED ]b4_locations_flag[
+]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 <size_t S>
+ struct variant
+ {]b4_assert_if([
+ /// Whether something is contained.
+ bool built;
+
+ /// Initially uninitialized.
+ variant ()
+ : built(false)
+ {}])[
+
+ /// Instantiate a \a T in here.
+ template <typename T>
+ inline T&
+ build()
+ {]b4_assert_if([
+ assert(!built);
+ built = true;])[
+ return *new (buffer) T;
+ }
-]b4_token_defines(b4_tokens)[
+ /// Accessor to a built \a T.
+ template <typename T>
+ inline T&
+ as()
+ {]b4_assert_if([
+ assert(built);])[
+ return reinterpret_cast<T&>(buffer);
+ }
-/* Copy the first part of user declarations. */
-]b4_pre_prologue[
+ /// Const accessor to a built \a T (for %printer).
+ template <typename T>
+ inline const T&
+ as() const
+ {]b4_assert_if([
+ assert(built);])[
+ return reinterpret_cast<const T&>(buffer);
+ }
-]/* Line __line__ of lalr1.cc. */
-b4_syncline([@oline@], [@ofile@])[
+ /// Swap the content with \a other.
+ template <typename T>
+ inline void
+ swap(variant<S>& other)
+ {
+ std::swap(as<T>(), other.as<T>());
+ }
+
+ /// Assign the content of \a other to this.
+ /// Destroys \a other.
+ template <typename T>
+ inline void
+ build(variant<S>& other)
+ {
+ build<T>();
+ swap<T>(other);
+ other.destroy<T>();
+ }
+
+ /// Destroy the stored \a T.
+ template <typename T>
+ inline void
+ destroy()
+ {
+ as<T>().~T();]b4_assert_if([
+ built = false;])[
+ }
+
+ /// A buffer large enough to store any of the semantic values.
+ char buffer[S];
+ };
+]])[
+]b4_namespace_close[
+
+#include "location.hh"
/* 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],
-[b4_syncline([b4_stype_line], [b4_filename])
-typedef union b4_stype yystype;
-/* Line __line__ of lalr1.cc. */
-b4_syncline([@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 lalr1.cc. */
-b4_syncline([@oline@], [@ofile@])[
#ifndef YYLLOC_DEFAULT
-# define YYLLOC_DEFAULT(Current, Rhs, N) \
- Current.end = Rhs[N].end;
+# 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
-namespace yy
-{
- class ]b4_parser_class_name[;
-
- template < typename P >
- struct Traits
- {
- };
-
- template < >
- struct Traits< ]b4_parser_class_name[ >
- {
- typedef ]b4_int_type_for([b4_translate])[ TokenNumberType;
- typedef ]b4_int_type_for([b4_rhs])[ RhsNumberType;
- typedef int StateType;
- typedef yystype SemanticType;
- typedef ]b4_location_type[ LocationType;
- };
-}
+]b4_namespace_open[
-namespace yy
-{
- class ]b4_parser_class_name b4_inherit[
+ /// A Bison parser.
+ class ]b4_parser_class_name[
{
public:
-
- typedef Traits< ]b4_parser_class_name[ >::TokenNumberType TokenNumberType;
- typedef Traits< ]b4_parser_class_name[ >::RhsNumberType RhsNumberType;
- typedef Traits< ]b4_parser_class_name[ >::StateType StateType;
- typedef Traits< ]b4_parser_class_name[ >::SemanticType SemanticType;
- typedef Traits< ]b4_parser_class_name[ >::LocationType LocationType;
-
- typedef Stack< StateType > StateStack;
- typedef Stack< SemanticType > SemanticStack;
- typedef Stack< LocationType > LocationStack;
-
-#if YYLSP_NEEDED
- ]b4_parser_class_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<sizeof(union_type)> 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_parser_class_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_parser_class_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);
- virtual void lex_ ();
- virtual void error_ ();
- virtual void print_ ();
+ /// 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);
- /* 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 ]b4_int_type_for([b4_pact])[ pact_[];
- static const ]b4_int_type_for([b4_pact])[ pact_ninf_;
- static const ]b4_int_type_for([b4_defact])[ defact_[];
- static const ]b4_int_type_for([b4_pgoto])[ pgoto_[];
- static const ]b4_int_type_for([b4_defgoto])[ defgoto_[];
- static const ]b4_int_type_for([b4_table])[ table_[];
- static const ]b4_int_type_for([b4_table])[ table_ninf_;
- static const ]b4_int_type_for([b4_check])[ check_[];
- static const ]b4_int_type_for([b4_r1])[ r1_[];
- static const ]b4_int_type_for([b4_r2])[ 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_int_type_for([b4_prhs])[ prhs_[];
- static const ]b4_int_type_for([b4_rline])[ rline_[];
- static const ]b4_int_type_for([b4_stos])[ stos_[];
- static const ]b4_int_type_for([b4_toknum])[ token_number_[];
+ /// 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);
- /* Constants. */
- static const int eof_;
- /* LAST_ -- Last index in TABLE_. */
- static const int last_;
- static const int nnts_;
- static const int empty_;
- static const int final_;
- static const int terror_;
- static const int errcode_;
- static const int ntokens_;
- static const unsigned user_token_number_max_;
- static const TokenNumberType undef_token_;
+ /// Element of the stack: a state and its attributes.
+ struct data_type
+ {
+ /// Default constructor.
+ data_type ();
- /* State. */
- int n_;
- int len_;
- int state_;
+ /// Constructor.
+ data_type (state_type s, const semantic_type& v, const location_type& l);
- /* Debugging. */
- int debug_;
- std::ostream &cdebug_;
+ /// The state.
+ state_type state;
+
+ /// The semantic value.
+ semantic_type value;
+
+ /// The location.
+ location_type location;
+ };
- /* Lookahead and lookahead in internal form. */
- int looka_;
- int ilooka_;
+#if YYDEBUG
+ /// \brief Report a symbol value on the debug stream as per %printer.
+ /// \param yytype The token type.
+ /// \param yydata Its semantic value and location.
+ virtual void yy_symbol_value_print_ (int yytype,
+ const data_type& yydata);
+ /// \brief Report a symbol on the debug stream.
+ /// \param yytype The token type.
+ /// \param yydata Its semantic value and location.
+ virtual void yy_symbol_print_ (int yytype,
+ const data_type& yydata);
+#endif
- /* Message. */
- std::string message;
+ /// \brief Reclaim the memory associated to a lookahead symbol.
+ /// \param yymsg Why this token is reclaimed.
+ /// If null, print nothing.
+ /// \param yytype The symbol type.
+ /// \param yydata Its semantic value and location.
+ inline void yydestruct_ (const char* yymsg,
+ int yytype, data_type& yydata);
- /* Semantic value and location of lookahead token. */
- SemanticType value;
- LocationType location;
+ /// \brief Reclaim the memory associated to a stack symbol.
+ /// \param yymsg Why this token is reclaimed.
+ /// If null, print nothing.
+ /// \param yysym Its kind, semantic value and location.
+ inline void yydestruct_ (const char* yymsg, data_type& yysym);
- /* @@$ and $$. */
- SemanticType yyval;
- LocationType yyloc;
+ /// Stack type.
+ typedef stack<data_type> stack_type;
- /* Initial location. */
- LocationType initlocation_;
+ /// The stack.
+ stack_type yystack_;
+
+ /// Push a new state on the stack.
+ /// \param m a debug message to display
+ /// if null, no trace is output.
+ /// \param s the symbol
+ /// \warning the contents of \a s.value is stolen.
+ inline void yypush_ (const char* m, data_type& s);
+
+ /// 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_;
+]b4_parse_param_vars[
};
-}
+]b4_namespace_close[
+
+]b4_percent_define_flag_if([[global_tokens_and_yystype]],
+[b4_token_defines(b4_tokens)
+
+#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 */]
+[#endif /* ! defined PARSER_HEADER_H */]
])dnl
-@output @output_parser_name@
-b4_copyright([C++ Skeleton parser for LALR(1) parsing with Bison],
- [2002, 2003])
+@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 <libintl.h> /* FIXME: INFRINGES ON USER NAME SPACE */
+# define YY_(msgid) dgettext ("bison-runtime", msgid)
+# endif
+# endif
+# ifndef YY_
+# define YY_(msgid) msgid
+# endif
+#endif
-m4_if(b4_defines_flag, 0, [], [#include @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, Data) \
+ do { \
+ if (yydebug_) \
+ { \
+ *yycdebug_ << Title << ' '; \
+ yy_symbol_print_ ((Type), (Data)); \
+ *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_
+
+# define YYCDEBUG if (false) std::cerr
+# define YY_SYMBOL_PRINT(Title, Type, Data) static_cast<void>(0)
+# define YY_REDUCE_PRINT(Rule) static_cast<void>(0)
+# define YY_STACK_PRINT() static_cast<void>(0)
+
#endif /* !YYDEBUG */
+#define yyerrok (yyerrstatus_ = 0)
+#define yyclearin (yychar = yyempty_)
+
#define YYACCEPT goto yyacceptlab
#define YYABORT goto yyabortlab
-#define YYERROR goto yyerrlab1
-
-
-int
-yy::]b4_parser_class_name[::parse ()
-{
- int nerrs = 0;
- int errstatus = 0;
-
- /* 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. */
- 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 YYERROR goto yyerrorlab
+#define YYRECOVERING() (!!yyerrstatus_)
- /* New state. */
- yynewstate:
- state_stack_.push (state_);
- YYCDEBUG << "Entering state " << state_ << std::endl;
- goto yybackup;
-
- /* Backup. */
- yybackup:
+]b4_namespace_open[
+#if YYERROR_VERBOSE
- /* Try to take a decision without lookahead. */
- n_ = pact_[state_];
- if (n_ == pact_ninf_)
- goto yydefault;
+ /* 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;
+ }
- /* Read a lookahead token. */
- if (looka_ == empty_)
- {
- YYCDEBUG << "Reading a token: ";
- lex_ ();
- }
+#endif
- /* Convert token to internal form. */
- if (looka_ <= 0)
- {
- looka_ = eof_;
- ilooka_ = 0;
- YYCDEBUG << "Now at end of input." << std::endl;
- }
- else
- {
- ilooka_ = translate_ (looka_);
+ /// Build a parser object.
+ ]b4_parser_class_name::b4_parser_class_name[ (]b4_parse_param_decl[)]m4_ifset([b4_parse_param], [
+ :])[
#if YYDEBUG
- if (debug_)
- {
- YYCDEBUG << "Next token is " << looka_
- << " (" << name_[ilooka_];
- print_ ();
- YYCDEBUG << ')' << std::endl;
- }
-#endif
- }
+ ]m4_ifset([b4_parse_param], [ ], [ :])[yydebug_ (false),
+ yycdebug_ (&std::cerr)]m4_ifset([b4_parse_param], [,])[
+#endif]b4_parse_param_cons[
+ {
+ }
- n_ += ilooka_;
- if (n_ < 0 || last_ < n_ || check_[n_] != ilooka_)
- goto yydefault;
+ ]b4_parser_class_name::~b4_parser_class_name[ ()
+ {
+ }
- /* Reduce or error. */
- n_ = table_[n_];
- if (n_ < 0)
- {
- if (n_ == table_ninf_)
- goto yyerrlab;
- else
- {
- n_ = -n_;
- goto yyreduce;
- }
- }
- else if (n_ == 0)
- goto yyerrlab;
+#if YYDEBUG
+ /*--------------------------------.
+ | Print this symbol on YYOUTPUT. |
+ `--------------------------------*/
- /* Accept? */
- if (n_ == final_)
- goto yyacceptlab;
+ inline void
+ ]b4_parser_class_name[::yy_symbol_value_print_ (int yytype,
+ const data_type& yydata)
+ {
+ switch (yytype)
+ {
+ ]m4_map([b4_symbol_actions], m4_defn([b4_symbol_printers]))dnl
+[ default:
+ break;
+ }
+ }
- /* Shift the lookahead token. */
-#if YYDEBUG
- YYCDEBUG << "Shifting token " << looka_
- << " (" << name_[ilooka_] << "), ";
+
+ void
+ ]b4_parser_class_name[::yy_symbol_print_ (int yytype,
+ const data_type& yydata)
+ {
+ *yycdebug_ << (yytype < yyntokens_ ? "token" : "nterm")
+ << ' ' << yytname_[yytype] << " ("
+ << yydata.location << ": ";
+ yy_symbol_value_print_ (yytype, yydata);
+ *yycdebug_ << ')';
+ }
#endif
- /* Discard the token being shifted unless it is eof. */
- if (looka_ != eof_)
- looka_ = empty_;
+ void
+ ]b4_parser_class_name[::yydestruct_ (const char* yymsg, data_type& yysym)
+ {
+ yydestruct_ (yymsg, yystos_[yysym.state], yysym);
+ }
- semantic_stack_.push (value);
- location_stack_.push (location);
+ void
+ ]b4_parser_class_name[::yydestruct_ (const char* yymsg,
+ int yytype, data_type& yydata)
+ {
+ YYUSE (yymsg);
- /* Count tokens shifted since error; after three, turn off error
- status. */
- if (errstatus)
- --errstatus;
+ if (yymsg)
+ YY_SYMBOL_PRINT (yymsg, yytype, yydata);
- state_ = n_;
- goto yynewstate;
+ // User destructor.
+ switch (yytype)
+ {
+ ]m4_map([b4_symbol_actions], m4_defn([b4_symbol_destructors]))[
+ default:
+ break;
+ }]b4_variant_if([
- /* Default action. */
- yydefault:
- n_ = defact_[state_];
- if (n_ == 0)
- goto yyerrlab;
- goto yyreduce;
+ // Type destructor.
+ b4_symbol_variant([[yytype]], [[yydata.value]], [[destroy]])])[
+ }
- /* 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[::data_type::data_type ()
+ : state()
+ , value()
+ , location()
+ {
+ }
+
+ ]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)
+ {
+ }
+
+ void
+ ]b4_parser_class_name[::yypush_ (const char* m, data_type& s)
+ {
+ if (m)
+ YY_SYMBOL_PRINT (m, yystos_[s.state], s);
+]b4_variant_if(
+[[ yystack_.push (data_type (s, semantic_type(), l));
+ ]b4_symbol_variant([[yystos_[s]]], [[yystack_[0].value]],
+ [build], [s.value])],
+[ yystack_.push (s);])[
+ }
+
+ void
+ ]b4_parser_class_name[::yypop_ (unsigned int n)
+ {
+ yystack_.pop (n);
+ }
#if YYDEBUG
- if (debug_)
- {
- // Short files will use "unsigned char" for line numbers,
- // in which case they will be output as character litterals
- // by "<<".
- unsigned yylineno = rline_[n_];
- YYCDEBUG << "Reducing via rule " << n_ - 1
- << " (line " << yylineno << "), ";
- for (]b4_int_type_for([b4_prhs])[ i = prhs_[n_];
- 0 <= rhs_[i]; ++i)
- YYCDEBUG << name_[rhs_[i]] << ' ';
- YYCDEBUG << "-> " << name_[r1_[n_]] << std::endl;
- }
-#endif
+ std::ostream&
+ ]b4_parser_class_name[::debug_stream () const
+ {
+ return *yycdebug_;
+ }
- if (len_)
- {
- Slice< LocationType, LocationStack > slice (location_stack_, len_);
- YYLLOC_DEFAULT (yyloc, slice, len_);
- }
+ void
+ ]b4_parser_class_name[::set_debug_stream (std::ostream& o)
+ {
+ yycdebug_ = &o;
+ }
- switch (n_)
- {
- ]b4_actions[
- }
-]/* Line __line__ of lalr1.cc. */
-b4_syncline([@oline@], [@ofile@])[
+ ]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
- state_stack_.pop (len_);
- semantic_stack_.pop (len_);
- location_stack_.pop (len_);
+ int
+ ]b4_parser_class_name[::parse ()
+ {
+ /// Lookahead and lookahead in internal form.
+ int yychar = yyempty_;
+ int yytoken = 0;
-#if YYDEBUG
- if (debug_)
+ /* State. */
+ int yyn;
+ int yylen = 0;
+ int yystate = 0;
+
+ /* Error handling. */
+ int yynerrs_ = 0;
+ int yyerrstatus_ = 0;
+
+ /// The lookahead symbol.
+ data_type yyla;
+
+ /// The locations where the error started and ended.
+ data_type yyerror_range[2];
+
+ /// $$ and @@$.
+ data_type yylhs;
+
+ /// The return value of parse().
+ int yyresult;
+
+ YYCDEBUG << "Starting parse" << std::endl;
+
+]m4_ifdef([b4_initial_action], [
+m4_pushdef([b4_at_dollar], [yyla.location])dnl
+m4_pushdef([b4_dollar_dollar], [yyla.value])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, yyla);
+
+ // 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*], [&yyla.value]][]dnl
+b4_locations_if([, [[location*], [&yyla.location]]])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, yyla);
+ }
+
+ /* 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. */
+ yyla.state = yystate = yyn;
+ yypush_ ("Shifting", yyla);
+ 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@}]], [yylhs.value], [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 YYLHS.VALUE to garbage.
+ This behavior is undocumented and Bison
+ users should not rely upon it. */
+ if (yylen)
+ yylhs.value = yystack_@{yylen - 1@}.value;
+ else
+ yylhs.value = yystack_@{0@}.value;])[
+
+ // Compute the default @@$.
{
- YYCDEBUG << "state stack now";
- for (StateStack::ConstIterator i = state_stack_.begin ();
- i != state_stack_.end (); ++i)
- YYCDEBUG << ' ' << *i;
- YYCDEBUG << std::endl;
+ slice<data_type, stack_type> slice (yystack_, yylen);
+ YYLLOC_DEFAULT (yylhs.location, slice, yylen);
}
-#endif
- 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 (0 <= state_ && 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)
+ // Perform the reduction.
+ YY_REDUCE_PRINT (yyn);
+ switch (yyn)
+ {
+ ]b4_user_actions[
+ default:
+ break;
+ }
+ // Compute post-reduction state.
+ yyn = yyr1_[yyn];
+ yystate = yypgoto_[yyn - yyntokens_] + yystack_[yylen].state;
+ if (0 <= yystate && yystate <= yylast_
+ && yycheck_[yystate] == yystack_[yylen].state)
+ yystate = yytable_[yystate];
+ else
+ yystate = yydefgoto_[yyn - yyntokens_];
+ yylhs.state = yystate;
+ YY_SYMBOL_PRINT ("-> $$ =", yyn, yylhs);
+]b4_variant_if([[
+ // Destroy the lhs symbols.
+ for (int i = 0; i < yylen; ++i)
+ // Destroy a variant which value may have be swapped with
+ // yylhs.value. The value of yylhs.value (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, yystack_[i]);]])[
+
+ yypop_ (yylen);
+ yylen = 0;
+ YY_STACK_PRINT ();
+
+ /* Shift the result of the reduction. */
+ yypush_ (0, yylhs);
+ goto yynewstate;
+
+ /*------------------------------------.
+ | yyerrlab -- here on detecting error |
+ `------------------------------------*/
+ yyerrlab:
+ /* If not already recovering from an error, report this error. */
+ if (!yyerrstatus_)
+ {
+ ++yynerrs_;
+ error (yyla.location, yysyntax_error_ (yystate, yytoken));
+ }
+
+ yyerror_range[0].location = yyla.location;
+ if (yyerrstatus_ == 3)
+ {
+ /* If just tried and failed to reuse lookahead token after an
+ error, discard it. */
+
+ if (yychar <= yyeof_)
+ {
+ /* Return failure if at end of input. */
+ if (yychar == yyeof_)
+ YYABORT;
+ }
+ else
+ {
+ yydestruct_ ("Error: discarding", yytoken, yyla);
+ 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. */
{
- ++nerrs;
+ data_type error_token;
+ 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 (yystack_.size () == 1)
+ YYABORT;
+
+ yyerror_range[0].location = yystack_[0].location;
+ yydestruct_ ("Error: popping", yystack_[0]);
+ yypop_ ();
+ yystate = yystack_[0].state;
+ YY_STACK_PRINT ();
+ }
+
+ yyerror_range[1].location = yyla.location;
+ YYLLOC_DEFAULT (error_token.location, (yyerror_range - 1), 2);
+
+ /* Shift the error token. */
+ error_token.state = yystate = yyn;
+ yypush_ ("Shifting", error_token);
+ }
+ goto yynewstate;
+
+ /* Accept. */
+ yyacceptlab:
+ yyresult = 0;
+ goto yyreturn;
+
+ /* Abort. */
+ yyabortlab:
+ yyresult = 1;
+ goto yyreturn;
+
+ yyreturn:
+ if (yychar != yyempty_)
+ yydestruct_ ("Cleanup: discarding lookahead", yytoken, yyla);
+
+ /* Do not reclaim the symbols of the rule which action triggered
+ this YYABORT or YYACCEPT. */
+ yypop_ (yylen);
+ while (yystack_.size () != 1)
+ {
+ yydestruct_ ("Cleanup: popping", yystack_[0]);
+ 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
- n_ = pact_[state_];
- if (pact_ninf_ < n_ && n_ < last_)
- {
- message = "syntax error, unexpected ";
- message += name_[ilooka_];
+ 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)
{
- int count = 0;
- for (int x = (n_ < 0 ? -n_ : 0); x < ntokens_ + nnts_; ++x)
- if (check_[x + n_] == x && x != terror_)
- ++count;
- if (count < 5)
- {
- count = 0;
- for (int x = (n_ < 0 ? -n_ : 0); x < ntokens_ + nnts_; ++x)
- if (check_[x + n_] == x && x != terror_)
- {
- message += (!count++) ? ", expecting " : " or ";
- message += name_[x];
- }
- }
+ 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
+ }
+ else
#endif
- message = "syntax error";
- error_ ();
- }
- goto yyerrlab1;
+ res = YY_("syntax error");
+ return res;
+ }
- /*----------------------------------------------------.
- | 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. */
+ /* 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])[;
- /* Return failure if at end of input. */
- if (looka_ == eof_)
- goto yyabortlab;
-#if YYDEBUG
- YYCDEBUG << "Discarding token " << looka_
- << " (" << name_[ilooka_] << ")." << std::endl;
-#endif
- looka_ = empty_;
- }
+ /* 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])[;
- /* Else will try to reuse lookahead token after shifting the error
- token. */
+ /* YYPGOTO[NTERM-NUM]. */
+ ]b4_table_define([pgoto], [b4_pgoto])[;
- errstatus = 3;
+ /* YYDEFGOTO[NTERM-NUM]. */
+ ]b4_table_define([defgoto], [b4_defgoto])[;
- for (;;)
- {
- n_ = pact_[state_];
- if (n_ != pact_ninf_)
- {
- n_ += terror_;
- if (0 <= n_ && n_ <= last_ && check_[n_] == terror_)
- {
- n_ = table_[n_];
- if (0 < n_)
- break;
- }
- }
-
- /* Pop the current state because it cannot handle the error token. */
- if (state_stack_.height () == 1)
- goto yyabortlab;
+ /* 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])[;
-#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;
- }
- }
-#endif
+ /* YYCHECK. */
+ ]b4_table_define([check], [b4_check])[;
- state_ = (state_stack_.pop (), state_stack_[0]);
- semantic_stack_.pop ();
- location_stack_.pop ();;
+ /* STOS_[STATE-NUM] -- The (internal number of the) accessing
+ symbol of state STATE-NUM. */
+ ]b4_table_define([stos], [b4_stos])[;
#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;
- }
+ /* TOKEN_NUMBER_[YYLEX-NUM] -- Internal symbol number corresponding
+ to YYLEX-NUM. */
+ ]b4_table_define([token_number], [b4_toknum])[;
#endif
- }
- if (n_ == final_)
- goto yyacceptlab;
+ /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */
+ ]b4_table_define([r1], [b4_r1])[;
- YYCDEBUG << "Shifting error token, ";
+ /* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */
+ ]b4_table_define([r2], [b4_r2])[;
- semantic_stack_.push (value);
- location_stack_.push (location);
+#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
- state_ = n_;
- goto yynewstate;
+#if YYDEBUG
+ /* YYRLINE[YYN] -- Source line where rule number YYN was defined. */
+ ]b4_table_define([rline], [b4_rline])[;
- /* Accept. */
- yyacceptlab:
- return 0;
+ // Print the state stack on the debug stream.
+ void
+ ]b4_parser_class_name[::yystack_print_ ()
+ {
+ *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;
+ }
- /* Abort. */
- yyabortlab:
- return 1;
-}
+ // 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 << " =",
+ ]yystos_@{b4_rhs_state(yynrhs, yyi + 1)@}[,
+ ]b4_rhs_data(yynrhs, yyi + 1)[);
+ }
+#endif // YYDEBUG
-void
-yy::]b4_parser_class_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 ]b4_int_type_for([b4_pact]) yy::b4_parser_class_name::pact_ninf_ = b4_pact_ninf[;
-const ]b4_int_type_for([b4_pact])[
-yy::]b4_parser_class_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 ]b4_int_type_for([b4_defact])[
-yy::]b4_parser_class_name[::defact_[] =
-{
- ]b4_defact[
-};
-
-/* YYPGOTO[NTERM-NUM]. */
-const ]b4_int_type_for([b4_pgoto])[
-yy::]b4_parser_class_name[::pgoto_[] =
-{
- ]b4_pgoto[
-};
-
-/* YYDEFGOTO[NTERM-NUM]. */
-const ]b4_int_type_for([b4_defgoto])[
-yy::]b4_parser_class_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 ]b4_int_type_for([b4_table]) yy::b4_parser_class_name::table_ninf_ = b4_table_ninf[;
-const ]b4_int_type_for([b4_table])[
-yy::]b4_parser_class_name[::table_[] =
-{
- ]b4_table[
-};
-
-/* YYCHECK. */
-const ]b4_int_type_for([b4_check])[
-yy::]b4_parser_class_name[::check_[] =
-{
- ]b4_check[
-};
+ /* 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_;
+ }
-#if YYDEBUG
-/* 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[::stos_[] =
-{
- ]b4_stos[
-};
-
-/* TOKEN_NUMBER_[YYLEX-NUM] -- Internal token number corresponding
- to YYLEX-NUM. */
-const ]b4_int_type_for([b4_toknum])[
-yy::]b4_parser_class_name[::token_number_[] =
-{
- ]b4_toknum[
-};
-#endif
+ 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[;
-/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */
-const ]b4_int_type_for([b4_r1])[
-yy::]b4_parser_class_name[::r1_[] =
-{
- ]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[::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_parser_class_name[::name_[] =
-{
- ]b4_tname[
-};
-#endif
+ 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[;
-#if YYDEBUG
-/* YYRHS -- A `-1'-separated list of the rules' RHS. */
-const yy::]b4_parser_class_name[::RhsNumberType
-yy::]b4_parser_class_name[::rhs_[] =
-{
- ]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[::prhs_[] =
-{
- ]b4_prhs[
-};
-
-/* YYRLINE[YYN] -- source line where rule number YYN was defined. */
-const ]b4_int_type_for([b4_rline])[
-yy::]b4_parser_class_name[::rline_[] =
-{
- ]b4_rline[
-};
-#endif
+]b4_namespace_close[
-/* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */
-yy::]b4_parser_class_name[::TokenNumberType
-yy::]b4_parser_class_name[::translate_ (int token)
-{
- static
- const TokenNumberType
- translate_[] =
- {
- ]b4_translate[
- };
- if ((unsigned) token <= user_token_number_max_)
- return translate_[token];
- else
- return undef_token_;
-}
-
-const int yy::]b4_parser_class_name[::eof_ = 0;
-const int yy::]b4_parser_class_name[::last_ = ]b4_last[;
-const int yy::]b4_parser_class_name[::nnts_ = ]b4_nterms_number[;
-const int yy::]b4_parser_class_name[::empty_ = -2;
-const int yy::]b4_parser_class_name[::final_ = ]b4_final_state_number[;
-const int yy::]b4_parser_class_name[::terror_ = 1;
-const int yy::]b4_parser_class_name[::errcode_ = 256;
-const int yy::]b4_parser_class_name[::ntokens_ = ]b4_tokens_number[;
-
-const unsigned yy::]b4_parser_class_name[::user_token_number_max_ = ]b4_user_token_number_max[;
-const yy::]b4_parser_class_name[::TokenNumberType yy::]b4_parser_class_name[::undef_token_ = ]b4_undef_token_number[;
-
-]b4_epilogue
-dnl
-@output stack.hh
-b4_copyright([Stack handling for Bison C++ parsers], [2002, 2003])[
+]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 <deque>
-namespace yy
-{
- template < class T, class S = std::deque< T > >
- class Stack
+]b4_namespace_open[
+ template <class T, class S = std::deque<T> >
+ 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
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 T, class S = stack<T> >
+ 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_;
+ unsigned int range_;
};
-}
-
-#endif // not BISON_STACK_HH]
-dnl
-@output position.hh
-b4_copyright([Position class for Bison C++ parsers], [2002, 2003])[
-
-/**
- ** \file position.hh
- ** Define the Location class.
- */
-
-#ifndef BISON_POSITION_HH
-# define BISON_POSITION_HH
-
-# include <iostream>
-# include <string>
-
-namespace yy
-{
- /** \brief Abstract a Position. */
- class Position
- {
- public:
- /** \brief Initial column number. */
- static const unsigned int initial_column = 0;
- /** \brief Initial line number. */
- static const unsigned int initial_line = 1;
-
- /** \name Ctor & dtor.
- ** \{ */
- public:
- /** \brief Construct a Position. */
- Position () :
- filename (),
- line (initial_line),
- column (initial_column)
- {
- }
- /** \} */
-
-
- /** \name Line and Column related manipulators
- ** \{ */
- public:
- /** \brief (line related) Advance to the LINES next lines. */
- inline void lines (int lines = 1)
- {
- column = initial_column;
- line += lines;
- }
-
- /** \brief (column related) Advance to the COLUMNS next columns. */
- inline void columns (int columns = 1)
- {
- int leftmost = initial_column;
- int current = column;
- if (leftmost <= current + columns)
- column += columns;
- else
- column = initial_column;
- }
- /** \} */
-
- public:
- /** \brief File name to which this position refers. */
- std::string filename;
- /** \brief Current line number. */
- unsigned int line;
- /** \brief Current column number. */
- unsigned int column;
- };
-
- /** \brief Add and assign a Position. */
- inline const Position&
- operator+= (Position& res, const int width)
- {
- res.columns (width);
- return res;
- }
-
- /** \brief Add two Position objects. */
- inline const Position
- operator+ (const Position& begin, const int width)
- {
- Position res = begin;
- return res += width;
- }
-
- /** \brief Add and assign a Position. */
- inline const Position&
- operator-= (Position& res, const int width)
- {
- return res += -width;
- }
-
- /** \brief 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])[
-
-/**
- ** \file location.hh
- ** Define the Location class.
- */
-
-#ifndef BISON_LOCATION_HH
-# define BISON_LOCATION_HH
-
-# include <iostream>
-# include <string>
-# include "position.hh"
-
-namespace yy
-{
-
- /** \brief Abstract a Location. */
- class Location
- {
- /** \name Ctor & dtor.
- ** \{ */
- public:
- /** \brief Construct a Location. */
- Location (void) :
- begin (),
- end ()
- {
- }
- /** \} */
-
-
- /** \name Line and Column related manipulators
- ** \{ */
- public:
- /** \brief Reset initial location to final location. */
- inline void step (void)
- {
- begin = end;
- }
-
- /** \brief Extend the current location to the COLUMNS next columns. */
- inline void columns (unsigned columns = 1)
- {
- end += columns;
- }
-
- /** \brief Extend the current location to the LINES next lines. */
- inline void lines (unsigned lines = 1)
- {
- end.lines (lines);
- }
- /** \} */
-
-
- public:
- /** \brief Beginning of the located region. */
- Position begin;
- /** \brief End of the located region. */
- Position end;
- };
-
- /** \brief 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;
- }
-
- /** \brief Add two Location objects */
- inline const Location operator+ (const Location& begin, unsigned width)
- {
- Location res = begin;
- res.columns (width);
- return res;
- }
-
- /** \brief Add and assign a Location */
- inline Location &operator+= (Location& res, unsigned 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 (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;
- }
-
-}
+]b4_namespace_close[
-#endif // not BISON_LOCATION_HH]
+#endif // not BISON_STACK_HH[]dnl
+]
+m4_divert_pop(0)
+m4_popdef([b4_copyright_years])dnl
projects / bison.git / blobdiff