- }
- else
-#endif
- res = YY_("syntax error");
- return res;
-}
-
-
-/* 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 || YYTOKEN_TABLE
-/* 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[::yytname_[] =
-{
- ]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_type::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 " << yyrule - 1
- << " (line " << yylno << "), ";
- for (]b4_int_type_for([b4_prhs])[ i = yyprhs_[yyrule];
- 0 <= yyrhs_[i]; ++i)
- *yycdebug_ << yytname_[yyrhs_[i]] << ' ';
- *yycdebug_ << "-> " << yytname_[yyr1_[yyrule]] << 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 b4_dir_prefix[]stack.hh
-b4_copyright([stack handling for Bison C++ parsers], [2002, 2003, 2004, 2005])[
-
-#ifndef BISON_STACK_HH
-# define BISON_STACK_HH
-
-#include <deque>
-
-namespace yy
-{
- template <class T, class S = std::deque<T> >
- class stack
- {
- public:
-
- // Hide our reversed order.
- typedef typename S::reverse_iterator iterator;
- typedef typename S::const_reverse_iterator const_iterator;