1 # C++ skeleton for Bison
3 # Copyright (C) 2002, 2003, 2004, 2005, 2006, 2007, 2008
4 # Free Software Foundation, Inc.
6 # This program is free software: you can redistribute it and/or modify
7 # it under the terms of the GNU General Public License as published by
8 # the Free Software Foundation, either version 3 of the License, or
9 # (at your option) any later version.
11 # This program is distributed in the hope that it will be useful,
12 # but WITHOUT ANY WARRANTY; without even the implied warranty of
13 # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 # GNU General Public License for more details.
16 # You should have received a copy of the GNU General Public License
17 # along with this program. If not, see <http://www.gnu.org/licenses/>.
19 m4_include(b4_pkgdatadir
/[c
++.m4
])
21 # b4_table_define(TABLE-NAME, CONTENT)
22 # ------------------------------------
23 # Define "parser::yy<TABLE-NAME>_" which contents is CONTENT.
24 m4_define([b4_table_define
],
25 [const b4_int_type_for([$
2])
26 b4_parser_class_name::yy$
1_
[[]] =
32 # How the semantic value is extracted when using variants.
34 # b4_symbol_value(VAL, [TYPE])
35 # ----------------------------
36 m4_define([b4_symbol_value
],
43 # b4_assert_if([IF-ASSERTIONS-ARE-USED], [IF-NOT])
44 # ----------------------------------------------------
45 m4_define([b4_assert_if
],
46 [b4_percent_define_ifdef([[assert]], [$
1], [$
2])])
49 # b4_lhs_value([TYPE])
50 # --------------------
51 # Expansion of $<TYPE>$.
52 m4_define([b4_lhs_value
],
53 [b4_symbol_value([yylhs
.value
], [$
1])])
59 m4_define([b4_lhs_location
],
63 # b4_rhs_data(RULE-LENGTH, NUM)
64 # -----------------------------
65 # Return the data corresponding to the symbol #NUM, where the current
66 # rule has RULE-LENGTH symbols on RHS.
67 m4_define([b4_rhs_data
],
68 [yystack_@
{($
1) - ($
2)@
}])
71 # b4_rhs_state(RULE-LENGTH, NUM)
72 # -----------------------------
73 # The state corresponding to the symbol #NUM, where the current
74 # rule has RULE-LENGTH symbols on RHS.
75 m4_define([b4_rhs_state
],
76 [b4_rhs_data([$
1], [$
2]).state
])
79 # b4_rhs_value(RULE-LENGTH, NUM, [TYPE])
80 # --------------------------------------
81 # Expansion of $<TYPE>NUM, where the current rule has RULE-LENGTH
83 m4_define([b4_rhs_value
],
84 [b4_symbol_value([b4_rhs_data([$
1], [$
2]).value
], [$
3])])
87 # b4_rhs_location(RULE-LENGTH, NUM)
88 # ---------------------------------
89 # Expansion of @NUM, where the current rule has RULE-LENGTH symbols
91 m4_define([b4_rhs_location
],
92 [b4_rhs_data([$
1], [$
2]).location
])
95 # b4_symbol_actions(FILENAME, LINENO,
96 # SYMBOL-TAG, SYMBOL-NUM,
97 # SYMBOL-ACTION, SYMBOL-TYPENAME)
98 # -------------------------------------------------
99 # Same as in C, but using references instead of pointers.
100 m4_define([b4_symbol_actions
],
101 [m4_pushdef([b4_dollar_dollar
],
102 [b4_symbol_value([yydata
.value
], [$
6])])dnl
103 m4_pushdef([b4_at_dollar
], [yydata
.location
])dnl
105 b4_syncline([$
2], [$
1])
107 b4_syncline([@oline@
], [@ofile@
])
109 m4_popdef([b4_at_dollar
])dnl
110 m4_popdef([b4_dollar_dollar
])dnl
114 # b4_symbol_action_(SYMBOL-TAG, SYMBOL-NUM, SYMBOL-TYPENAME)
115 # ----------------------------------------------------------
116 # Invoke b4_dollar_dollar(SYMBOL_TYPENAME) for each symbol.
117 m4_define([b4_symbol_action_
],
120 b4_dollar_dollar($@
);
125 # b4_symbol_variant(YYTYPE, YYVAL, ACTION, [ARGS])
126 # ------------------------------------------------
127 # Run some ACTION ("build", or "destroy") on YYVAL of symbol type
129 m4_define([b4_symbol_variant
],
130 [m4_pushdef([b4_dollar_dollar
],
131 [$
2.$
3<$
][3>(m4_shift3($@
))])dnl
134 m4_map([b4_symbol_action_
], m4_defn([b4_type_names
]))
138 m4_popdef([b4_dollar_dollar
])dnl
142 # _b4_char_sizeof_counter
143 # -----------------------
144 # A counter used by _b4_char_sizeof_dummy to create fresh symbols.
145 m4_define([_b4_char_sizeof_counter
],
148 # _b4_char_sizeof_dummy
149 # ---------------------
150 # At each call return a new C++ identifier.
151 m4_define([_b4_char_sizeof_dummy
],
152 [m4_define([_b4_char_sizeof_counter
], m4_incr(_b4_char_sizeof_counter
))dnl
153 dummy
[]_b4_char_sizeof_counter
])
156 # b4_char_sizeof(SYMBOL-TAG, SYMBOL-NUM, SYMBOL-TYPENAME)
157 # -------------------------------------------------------
158 # To be mapped on the list of type names to produce:
160 # char dummy1[sizeof(type_name_1)];
161 # char dummy2[sizeof(type_name_2)];
163 # for defined type names.
164 # $3 is doubly-quoted, do not quote it again.
165 m4_define([b4_char_sizeof
],
168 char _b4_char_sizeof_dummy@
{sizeof($
3)@
}; // $1])dnl
172 m4_pushdef([b4_copyright_years
],
173 [2002, 2003, 2004, 2005, 2006, 2007, 2008])
175 m4_define([b4_parser_class_name
],
176 [b4_percent_define_get([[parser_class_name]])])
178 # The header is mandatory.
180 [b4_fatal([b4_skeleton
[: using %%defines is mandatory
]])])
182 # Backward compatibility.
183 m4_define([b4_location_constructors
])
184 m4_include(b4_pkgdatadir
/[location
.cc
])
186 # We do want M4 expansion after # for CPP macros.
190 [@
output(b4_spec_defines_file@
)@
191 b4_copyright([Skeleton interface
for Bison
LALR(1) parsers in C
++])
192 dnl FIXME
: This is wrong
, we want computed header guards
.
194 /* C++ LALR(1) parser skeleton written by Akim Demaille. */
196 #ifndef PARSER_HEADER_H
197 # define PARSER_HEADER_H
199 ]b4_percent_code_get([[requires]])[
201 ]b4_assert_if([#include <cassert>])[
211 /// A char[S] buffer to store and retrieve objects.
213 /// Sort of a variant, but does not keep track of the nature
214 /// of the stored data, since that knowledge is available
215 /// via the current state.
219 /// Whether something is contained.
222 /// Initially uninitialized.
227 /// Instantiate a \a T in here.
228 template <typename T
>
234 return *new (buffer
) T
;
237 /// Accessor to a built \a T.
238 template <typename T
>
243 return reinterpret_cast<T
&>(buffer
);
246 /// Const accessor to a built \a T (for %printer).
247 template <typename T
>
252 return reinterpret_cast<const T
&>(buffer
);
255 /// Swap the content with \a other.
256 template <typename T
>
258 swap(variant
<S
>& other
)
260 std::swap(as
<T
>(), other
.as
<T
>());
263 /// Assign the content of \a other to this.
264 /// Destroys \a other.
265 template <typename T
>
267 build(variant
<S
>& other
)
274 /// Destroy the stored \a T.
275 template <typename T
>
279 as
<T
>().~T();]b4_assert_if([
283 /// A buffer large enough to store any of the semantic values.
289 #include "location.hh"
291 /* Enabling traces. */
293 # define YYDEBUG ]b4_debug_flag[
296 /* Enabling verbose error messages. */
297 #ifdef YYERROR_VERBOSE
298 # undef YYERROR_VERBOSE
299 # define YYERROR_VERBOSE 1
301 # define YYERROR_VERBOSE ]b4_error_verbose_flag[
304 /* Enabling the token table. */
305 #ifndef YYTOKEN_TABLE
306 # define YYTOKEN_TABLE ]b4_token_table[
309 /* YYLLOC_DEFAULT -- Set CURRENT to span from RHS[1] to RHS[N].
310 If N is 0, then set CURRENT to the empty location which ends
311 the previous symbol: RHS[0] (always defined). */
313 #ifndef YYLLOC_DEFAULT
314 # define YYLLOC_DEFAULT(Current, Rhs, N) \
318 (Current).begin = (Rhs)[1].location.begin; \
319 (Current).end = (Rhs)[N].location.end; \
323 (Current).begin = (Current).end = (Rhs)[0].location.end; \
331 class ]b4_parser_class_name
[
336 [ /// An auxiliary type to compute the largest semantic type.
338 {]m4_map([b4_char_sizeof
], m4_defn([b4_type_names
]))[
341 /// Symbol semantic values.
342 typedef variant
<sizeof(union_type
)> semantic_type
;],
343 [ /// Symbol semantic values.
345 [ union semantic_type
348 [m4_if(b4_tag_seen_flag
, 0,
349 [[ typedef int semantic_type
;]],
350 [[ typedef YYSTYPE semantic_type
;]])])])[
352 typedef YYSTYPE semantic_type
;
354 /// Symbol locations.
355 typedef ]b4_percent_define_get([[location_type]])[ location_type
;
359 ]b4_token_enums(b4_tokens
)[
362 typedef token::yytokentype token_type
;
364 /// Build a parser object.
365 ]b4_parser_class_name
[ (]b4_parse_param_decl
[);
366 virtual ~]b4_parser_class_name
[ ();
369 /// \returns 0 iff parsing succeeded.
370 virtual int parse ();
373 /// The current debugging stream.
374 std::ostream
& debug_stream () const;
375 /// Set the current debugging stream.
376 void set_debug_stream (std::ostream
&);
378 /// Type for debugging levels.
379 typedef int debug_level_type
;
380 /// The current debugging level.
381 debug_level_type
debug_level () const;
382 /// Set the current debugging level.
383 void set_debug_level (debug_level_type l
);
387 /// Report a syntax error.
388 /// \param loc where the syntax error is found.
389 /// \param msg a description of the syntax error.
390 virtual void error (const location_type
& loc
, const std::string
& msg
);
392 /// Generate an error message.
393 /// \param state the state where the error occurred.
394 /// \param tok the lookahead token.
395 virtual std::string
yysyntax_error_ (int yystate
, int tok
);
398 typedef int state_type
;
400 /// Internal symbol numbers.
401 typedef ]b4_int_type_for([b4_translate
])[ token_number_type
;
403 /// For a state, the index in \a yytable_ of its portion.
404 static const ]b4_int_type_for([b4_pact
])[ yypact_
[];
405 static const ]b4_int_type(b4_pact_ninf
, b4_pact_ninf
)[ yypact_ninf_
;
407 /// For a state, default rule to reduce.
408 /// Unless\a yytable_ specifies something else to do.
409 /// Zero means the default is an error.
410 static const ]b4_int_type_for([b4_defact
])[ yydefact_
[];
412 static const ]b4_int_type_for([b4_pgoto
])[ yypgoto_
[];
413 static const ]b4_int_type_for([b4_defgoto
])[ yydefgoto_
[];
415 /// What to do in a state.
416 /// \a yytable_[yypact_[s]]: what to do in state \a s.
417 /// - if positive, shift that token.
418 /// - if negative, reduce the rule which number is the opposite.
419 /// - if zero, do what YYDEFACT says.
420 static const ]b4_int_type_for([b4_table
])[ yytable_
[];
421 static const ]b4_int_type(b4_table_ninf
, b4_table_ninf
)[ yytable_ninf_
;
423 static const ]b4_int_type_for([b4_check
])[ yycheck_
[];
425 /// For a state, its accessing symbol.
426 static const ]b4_int_type_for([b4_stos
])[ yystos_
[];
428 /// For a rule, its LHS.
429 static const ]b4_int_type_for([b4_r1
])[ yyr1_
[];
430 /// For a rule, its RHS length.
431 static const ]b4_int_type_for([b4_r2
])[ yyr2_
[];
433 #if YYDEBUG || YYERROR_VERBOSE || YYTOKEN_TABLE
434 /// For a symbol, its name in clear.
435 static const char* const yytname_
[];
439 /// Convert the symbol name \a n to a form suitable for a diagnostic.
440 virtual std::string
yytnamerr_ (const char *n
);
444 /// For each rule, its source line number.
445 static const ]b4_int_type_for([b4_rline
])[ yyrline_
[];
446 /// For each scanner token number, its symbol number.
447 static const ]b4_int_type_for([b4_toknum
])[ yytoken_number_
[];
448 /// Report on the debug stream that the rule \a r is going to be reduced.
449 virtual void yy_reduce_print_ (int r
);
450 /// Print the state stack on the debug stream.
451 virtual void yystack_print_ ();
455 std::ostream
* yycdebug_
;
458 /// Convert a scanner token number \a t to a symbol number.
459 token_number_type
yytranslate_ (int t
);
461 /// Element of the stack: a state and its attributes.
462 struct stack_symbol_type
464 /// Default constructor.
465 stack_symbol_type ();
468 stack_symbol_type (state_type s
,
469 const semantic_type
& v
, const location_type
& l
);
474 /// The semantic value.
478 location_type location
;
482 /// \brief Report a symbol value on the debug stream as per %printer.
483 /// \param yytype The token type.
484 /// \param yydata Its semantic value and location.
485 virtual void yy_symbol_value_print_ (int yytype
,
486 const stack_symbol_type
& yydata
);
487 /// \brief Report a symbol on the debug stream.
488 /// \param yytype The token type.
489 /// \param yydata Its semantic value and location.
490 virtual void yy_symbol_print_ (int yytype
,
491 const stack_symbol_type
& yydata
);
494 /// \brief Reclaim the memory associated to a lookahead symbol.
495 /// \param yymsg Why this token is reclaimed.
496 /// If null, print nothing.
497 /// \param yytype The symbol type.
498 /// \param yydata Its semantic value and location.
499 inline void yydestruct_ (const char* yymsg
,
500 int yytype
, stack_symbol_type
& yydata
);
502 /// \brief Reclaim the memory associated to a stack symbol.
503 /// \param yymsg Why this token is reclaimed.
504 /// If null, print nothing.
505 /// \param yysym Its kind, semantic value and location.
506 inline void yydestruct_ (const char* yymsg
, stack_symbol_type
& yysym
);
509 typedef stack
<stack_symbol_type
> stack_type
;
514 /// Push a new state on the stack.
515 /// \param m a debug message to display
516 /// if null, no trace is output.
517 /// \param s the symbol
518 /// \warning the contents of \a s.value is stolen.
519 inline void yypush_ (const char* m
, stack_symbol_type
& s
);
521 /// Pop \a n symbols the three stacks.
522 inline void yypop_ (unsigned int n
= 1);
525 static const int yyeof_
;
526 /* LAST_ -- Last index in TABLE_. */
527 static const int yylast_
;
528 static const int yynnts_
;
529 static const int yyempty_
;
530 static const int yyfinal_
;
531 static const int yyterror_
;
532 static const int yyerrcode_
;
533 static const int yyntokens_
;
534 static const unsigned int yyuser_token_number_max_
;
535 static const token_number_type yyundef_token_
;
536 ]b4_parse_param_vars
[
540 ]b4_percent_define_flag_if([[global_tokens_and_yystype]],
541 [b4_token_defines(b4_tokens
)
544 /* Redirection for backward compatibility. */
545 # define YYSTYPE b4_namespace_ref::b4_parser_class_name::semantic_type
548 b4_percent_code_get([[provides]])[]dnl
550 [#endif /* ! defined PARSER_HEADER_H */]
552 @
output(b4_parser_file_name@
)@
553 b4_copyright([Skeleton implementation
for Bison
LALR(1) parsers in C
++])
554 b4_percent_code_get([[top]])[]dnl
555 m4_if(b4_prefix
, [yy
], [],
557 // Take the name prefix into account.
558 #define yylex b4_prefix[]lex])[
560 /* First part of user declarations. */
561 ]b4_user_pre_prologue
564 #include "@basename(]b4_spec_defines_file[@)"]])[
566 /* User implementation prologue. */
567 ]b4_user_post_prologue
568 b4_percent_code_get
[]dnl
573 # include <libintl.h> /* FIXME: INFRINGES ON USER NAME SPACE */
574 # define YY_(msgid) dgettext ("bison-runtime", msgid)
578 # define YY_(msgid) msgid
582 /* Suppress unused-variable warnings by "using" E. */
583 #define YYUSE(e) ((void) (e))
585 /* Enable debugging if requested. */
588 /* A pseudo ostream that takes yydebug_ into account. */
589 # define YYCDEBUG if (yydebug_) (*yycdebug_)
591 # define YY_SYMBOL_PRINT(Title, Type, Data) \
595 *yycdebug_ << Title << ' '; \
596 yy_symbol_print_ ((Type), (Data)); \
597 *yycdebug_ << std::endl; \
601 # define YY_REDUCE_PRINT(Rule) \
604 yy_reduce_print_ (Rule); \
607 # define YY_STACK_PRINT() \
615 # define YYCDEBUG if (false) std::cerr
616 # define YY_SYMBOL_PRINT(Title, Type, Data) static_cast<void>(0)
617 # define YY_REDUCE_PRINT(Rule) static_cast<void>(0)
618 # define YY_STACK_PRINT() static_cast<void>(0)
620 #endif /* !YYDEBUG */
622 #define yyerrok (yyerrstatus_ = 0)
623 #define yyclearin (yychar = yyempty_)
625 #define YYACCEPT goto yyacceptlab
626 #define YYABORT goto yyabortlab
627 #define YYERROR goto yyerrorlab
628 #define YYRECOVERING() (!!yyerrstatus_)
633 /* Return YYSTR after stripping away unnecessary quotes and
634 backslashes, so that it's suitable for yyerror. The heuristic is
635 that double-quoting is unnecessary unless the string contains an
636 apostrophe, a comma, or backslash (other than backslash-backslash).
637 YYSTR is taken from yytname. */
639 ]b4_parser_class_name
[::yytnamerr_ (const char *yystr
)
643 std::string yyr
= "";
644 char const *yyp
= yystr
;
651 goto do_not_strip_quotes
;
655 goto do_not_strip_quotes
;
664 do_not_strip_quotes
: ;
672 /// Build a parser object.
673 ]b4_parser_class_name::b4_parser_class_name
[ (]b4_parse_param_decl
[)]m4_ifset([b4_parse_param
], [
676 ]m4_ifset([b4_parse_param
], [ ], [ :])[yydebug_ (false),
677 yycdebug_ (&std::cerr
)]m4_ifset([b4_parse_param
], [,])[
678 #endif]b4_parse_param_cons[
682 ]b4_parser_class_name::~b4_parser_class_name
[ ()
687 /*--------------------------------.
688 | Print this symbol on YYOUTPUT. |
689 `--------------------------------*/
692 ]b4_parser_class_name
[::yy_symbol_value_print_ (int yytype
,
693 const stack_symbol_type
& yydata
)
697 ]m4_map([b4_symbol_actions
], m4_defn([b4_symbol_printers
]))dnl
705 ]b4_parser_class_name
[::yy_symbol_print_ (int yytype
,
706 const stack_symbol_type
& yydata
)
708 *yycdebug_
<< (yytype
< yyntokens_
? "token" : "nterm")
709 << ' ' << yytname_
[yytype
] << " ("
710 << yydata
.location
<< ": ";
711 yy_symbol_value_print_ (yytype
, yydata
);
717 ]b4_parser_class_name
[::yydestruct_ (const char* yymsg
,
718 stack_symbol_type
& yysym
)
720 yydestruct_ (yymsg
, yystos_
[yysym
.state
], yysym
);
724 ]b4_parser_class_name
[::yydestruct_ (const char* yymsg
,
725 int yytype
, stack_symbol_type
& yydata
)
730 YY_SYMBOL_PRINT (yymsg
, yytype
, yydata
);
735 ]m4_map([b4_symbol_actions
], m4_defn([b4_symbol_destructors
]))[
741 b4_symbol_variant([[yytype]], [[yydata
.value
]], [[destroy]])])[
744 ]b4_parser_class_name
[::stack_symbol_type::stack_symbol_type ()
751 ]b4_parser_class_name
[::stack_symbol_type::stack_symbol_type (state_type s
,
752 const semantic_type
& v
, const location_type
& l
)
760 ]b4_parser_class_name
[::yypush_ (const char* m
, stack_symbol_type
& s
)
763 YY_SYMBOL_PRINT (m
, yystos_
[s
.state
], s
);
765 [[ yystack_
.push (stack_symbol_type (s
, semantic_type(), l
));
766 ]b4_symbol_variant([[yystos_
[s
]]], [[yystack_
[0].value
]],
767 [build
], [s
.value
])],
768 [ yystack_
.push (s
);])[
772 ]b4_parser_class_name
[::yypop_ (unsigned int n
)
779 ]b4_parser_class_name
[::debug_stream () const
785 ]b4_parser_class_name
[::set_debug_stream (std::ostream
& o
)
791 ]b4_parser_class_name
[::debug_level_type
792 ]b4_parser_class_name
[::debug_level () const
798 ]b4_parser_class_name
[::set_debug_level (debug_level_type l
)
805 ]b4_parser_class_name
[::parse ()
807 /// Lookahead and lookahead in internal form.
808 int yychar
= yyempty_
;
816 /* Error handling. */
818 int yyerrstatus_
= 0;
820 /// The lookahead symbol.
821 stack_symbol_type yyla
;
823 /// The locations where the error started and ended.
824 stack_symbol_type yyerror_range
[2];
827 stack_symbol_type yylhs
;
829 /// The return value of parse().
832 YYCDEBUG
<< "Starting parse" << std::endl
;
834 ]m4_ifdef([b4_initial_action
], [
835 m4_pushdef([b4_at_dollar
], [yyla
.location
])dnl
836 m4_pushdef([b4_dollar_dollar
], [yyla
.value
])dnl
837 /* User initialization code. */
838 b4_user_initial_action
839 m4_popdef([b4_dollar_dollar
])dnl
840 m4_popdef([b4_at_dollar
])])dnl
842 [ /* Initialize the stack. The initial state will be set in
843 yynewstate, since the latter expects the semantical and the
844 location values to have been already stored, initialize these
845 stacks with a primary value. */
846 yystack_
= stack_type (0);
849 // A new state was pushed on the stack.
850 // Invariant: yystate == yystack_[0].state, i.e.,
851 // yystate was just pushed onto the state stack.
853 YYCDEBUG
<< "Entering state " << yystate
<< std::endl
;
856 if (yystate
== yyfinal_
)
864 /* Try to take a decision without lookahead. */
865 yyn
= yypact_
[yystate
];
866 if (yyn
== yypact_ninf_
)
869 /* Read a lookahead token. */
870 if (yychar
== yyempty_
)
872 YYCDEBUG
<< "Reading a token: ";
873 yychar
= ]b4_c_function_call([yylex
], [int],
874 [[YYSTYPE
*], [&yyla
.value
]][]dnl
875 b4_locations_if([, [[location
*], [&yyla
.location
]]])dnl
876 m4_ifdef([b4_lex_param
], [, ]b4_lex_param
))[;
880 /* Convert token to internal form. */
881 if (yychar
<= yyeof_
)
883 yychar
= yytoken
= yyeof_
;
884 YYCDEBUG
<< "Now at end of input." << std::endl
;
888 yytoken
= yytranslate_ (yychar
);
889 YY_SYMBOL_PRINT ("Next token is", yytoken
, yyla
);
892 /* If the proper action on seeing token YYTOKEN is to reduce or to
893 detect an error, take that action. */
895 if (yyn
< 0 || yylast_
< yyn
|| yycheck_
[yyn
] != yytoken
)
898 /* Reduce or error. */
902 if (yyn
== 0 || yyn
== yytable_ninf_
)
908 /* Discard the token being shifted. */
911 /* Count tokens shifted since error; after three, turn off error
916 /* Shift the lookahead token. */
917 yyla
.state
= yystate
= yyn
;
918 yypush_ ("Shifting", yyla
);
921 /*-----------------------------------------------------------.
922 | yydefault -- do the default action for the current state. |
923 `-----------------------------------------------------------*/
925 yyn
= yydefact_
[yystate
];
930 /*-----------------------------.
931 | yyreduce -- Do a reduction. |
932 `-----------------------------*/
934 yylen
= yyr2_
[yyn
];]b4_variant_if([
935 /* Variants are always initialized to an empty instance of the
936 correct type. The default $$=$1 rule is NOT applied when using
938 ]b4_symbol_variant([[yyr1_@
{yyn@
}]], [yylhs
.value
], [build
])[],[
939 /* If YYLEN is nonzero, implement the default value of the action:
940 `$$ = $1'. Otherwise, use the top of the stack.
942 Otherwise, the following line sets YYLHS.VALUE to garbage.
943 This behavior is undocumented and Bison
944 users should not rely upon it. */
946 yylhs
.value
= yystack_@
{yylen
- 1@
}.value
;
948 yylhs
.value
= yystack_@
{0@
}.value
;])[
950 // Compute the default @@$.
952 slice
<stack_symbol_type
, stack_type
> slice (yystack_
, yylen
);
953 YYLLOC_DEFAULT (yylhs
.location
, slice
, yylen
);
956 // Perform the reduction.
957 YY_REDUCE_PRINT (yyn
);
964 // Compute post-reduction state.
966 yystate
= yypgoto_
[yyn
- yyntokens_
] + yystack_
[yylen
].state
;
967 if (0 <= yystate
&& yystate
<= yylast_
968 && yycheck_
[yystate
] == yystack_
[yylen
].state
)
969 yystate
= yytable_
[yystate
];
971 yystate
= yydefgoto_
[yyn
- yyntokens_
];
972 yylhs
.state
= yystate
;
973 YY_SYMBOL_PRINT ("-> $$ =", yyn
, yylhs
);
975 // Destroy the lhs symbols.
976 for (int i
= 0; i
< yylen
; ++i
)
977 // Destroy a variant which value may have be swapped with
978 // yylhs.value. The value of yylhs.value (hence maybe one of
979 // these lhs symbols) depends on what does the default
980 // contruction for this type. In the case of pointers for
981 // instance, nothing is done, so the value is junk. Therefore
982 // do not try to report the content in the debug trace, it's
983 // junk. Hence yymsg = 0. Besides, that keeps exactly the same
984 // traces as with the other Bison skeletons.
985 yydestruct_ (0, yystack_
[i
]);]])[
991 /* Shift the result of the reduction. */
995 /*------------------------------------.
996 | yyerrlab -- here on detecting error |
997 `------------------------------------*/
999 /* If not already recovering from an error, report this error. */
1003 error (yyla
.location
, yysyntax_error_ (yystate
, yytoken
));
1006 yyerror_range
[0].location
= yyla
.location
;
1007 if (yyerrstatus_
== 3)
1009 /* If just tried and failed to reuse lookahead token after an
1010 error, discard it. */
1012 if (yychar
<= yyeof_
)
1014 /* Return failure if at end of input. */
1015 if (yychar
== yyeof_
)
1020 yydestruct_ ("Error: discarding", yytoken
, yyla
);
1025 /* Else will try to reuse lookahead token after shifting the error
1030 /*---------------------------------------------------.
1031 | yyerrorlab -- error raised explicitly by YYERROR. |
1032 `---------------------------------------------------*/
1035 /* Pacify compilers like GCC when the user code never invokes
1036 YYERROR and the label yyerrorlab therefore never appears in user
1041 yyerror_range
[0].location
= yystack_
[yylen
- 1].location
;
1042 /* Do not reclaim the symbols of the rule which action triggered
1046 yystate
= yystack_
[0].state
;
1049 /*-------------------------------------------------------------.
1050 | yyerrlab1 -- common code for both syntax error and YYERROR. |
1051 `-------------------------------------------------------------*/
1053 yyerrstatus_
= 3; /* Each real token shifted decrements this. */
1055 stack_symbol_type error_token
;
1058 yyn
= yypact_
[yystate
];
1059 if (yyn
!= yypact_ninf_
)
1062 if (0 <= yyn
&& yyn
<= yylast_
&& yycheck_
[yyn
] == yyterror_
)
1064 yyn
= yytable_
[yyn
];
1070 // Pop the current state because it cannot handle the error token.
1071 if (yystack_
.size () == 1)
1074 yyerror_range
[0].location
= yystack_
[0].location
;
1075 yydestruct_ ("Error: popping", yystack_
[0]);
1077 yystate
= yystack_
[0].state
;
1081 yyerror_range
[1].location
= yyla
.location
;
1082 YYLLOC_DEFAULT (error_token
.location
, (yyerror_range
- 1), 2);
1084 /* Shift the error token. */
1085 error_token
.state
= yystate
= yyn
;
1086 yypush_ ("Shifting", error_token
);
1101 if (yychar
!= yyempty_
)
1102 yydestruct_ ("Cleanup: discarding lookahead", yytoken
, yyla
);
1104 /* Do not reclaim the symbols of the rule which action triggered
1105 this YYABORT or YYACCEPT. */
1107 while (yystack_
.size () != 1)
1109 yydestruct_ ("Cleanup: popping", yystack_
[0]);
1116 // Generate an error message.
1118 ]b4_parser_class_name
[::yysyntax_error_ (int yystate
, int]dnl
1119 b4_error_verbose_if([ tok
])[)
1124 int yyn
= yypact_
[yystate
];
1125 if (yypact_ninf_
< yyn
&& yyn
<= yylast_
)
1127 /* Start YYX at -YYN if negative to avoid negative indexes in
1129 int yyxbegin
= yyn
< 0 ? -yyn
: 0;
1131 /* Stay within bounds of both yycheck and yytname. */
1132 int yychecklim
= yylast_
- yyn
+ 1;
1133 int yyxend
= yychecklim
< yyntokens_
? yychecklim
: yyntokens_
;
1135 for (int x
= yyxbegin
; x
< yyxend
; ++x
)
1136 if (yycheck_
[x
+ yyn
] == x
&& x
!= yyterror_
)
1139 // FIXME: This method of building the message is not compatible
1140 // with internationalization. It should work like yacc.c does it.
1141 // That is, first build a string that looks like this:
1142 // "syntax error, unexpected %s or %s or %s"
1143 // Then, invoke YY_ on this string.
1144 // Finally, use the string as a format to output
1145 // yytname_[tok], etc.
1146 // Until this gets fixed, this message appears in English only.
1147 res
= "syntax error, unexpected ";
1148 res
+= yytnamerr_ (yytname_
[tok
]);
1152 for (int x
= yyxbegin
; x
< yyxend
; ++x
)
1153 if (yycheck_
[x
+ yyn
] == x
&& x
!= yyterror_
)
1155 res
+= (!count
++) ? ", expecting " : " or ";
1156 res
+= yytnamerr_ (yytname_
[x
]);
1162 res
= YY_("syntax error");
1167 /* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
1169 const ]b4_int_type(b4_pact_ninf
, b4_pact_ninf
) b4_parser_class_name::yypact_ninf_
= b4_pact_ninf
[;
1170 ]b4_table_define([pact
], [b4_pact
])[;
1172 /* YYDEFACT[S] -- default rule to reduce with in state S when YYTABLE
1173 doesn't specify something else to do. Zero means the default is an
1175 ]b4_table_define([defact
], [b4_defact
])[;
1177 /* YYPGOTO[NTERM-NUM]. */
1178 ]b4_table_define([pgoto
], [b4_pgoto
])[;
1180 /* YYDEFGOTO[NTERM-NUM]. */
1181 ]b4_table_define([defgoto
], [b4_defgoto
])[;
1183 /* YYTABLE[YYPACT[STATE-NUM]]. What to do in state STATE-NUM. If
1184 positive, shift that token. If negative, reduce the rule which
1185 number is the opposite. If zero, do what YYDEFACT says. */
1186 const ]b4_int_type(b4_table_ninf
, b4_table_ninf
) b4_parser_class_name::yytable_ninf_
= b4_table_ninf
[;
1187 ]b4_table_define([table
], [b4_table
])[;
1190 ]b4_table_define([check
], [b4_check
])[;
1192 /* STOS_[STATE-NUM] -- The (internal number of the) accessing
1193 symbol of state STATE-NUM. */
1194 ]b4_table_define([stos
], [b4_stos
])[;
1197 /* TOKEN_NUMBER_[YYLEX-NUM] -- Internal symbol number corresponding
1199 ]b4_table_define([token_number
], [b4_toknum
])[;
1202 /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */
1203 ]b4_table_define([r1
], [b4_r1
])[;
1205 /* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */
1206 ]b4_table_define([r2
], [b4_r2
])[;
1208 #if YYDEBUG || YYERROR_VERBOSE || YYTOKEN_TABLE
1209 /* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.
1210 First, the terminals, then, starting at \a yyntokens_, nonterminals. */
1212 const ]b4_parser_class_name
[::yytname_
[] =
1219 /* YYRLINE[YYN] -- Source line where rule number YYN was defined. */
1220 ]b4_table_define([rline
], [b4_rline
])[;
1222 // Print the state stack on the debug stream.
1224 ]b4_parser_class_name
[::yystack_print_ ()
1226 *yycdebug_
<< "Stack now";
1227 for (stack_type::const_iterator
1228 i
= yystack_
.begin (),
1229 i_end
= yystack_
.end ();
1231 *yycdebug_
<< ' ' << i
->state
;
1232 *yycdebug_
<< std::endl
;
1235 // Report on the debug stream that the rule \a yyrule is going to be reduced.
1237 ]b4_parser_class_name
[::yy_reduce_print_ (int yyrule
)
1239 unsigned int yylno
= yyrline_
[yyrule
];
1240 int yynrhs
= yyr2_
[yyrule
];
1241 /* Print the symbols being reduced, and their result. */
1242 *yycdebug_
<< "Reducing stack by rule " << yyrule
- 1
1243 << " (line " << yylno
<< "):" << std::endl
;
1244 /* The symbols being reduced. */
1245 for (int yyi
= 0; yyi
< yynrhs
; yyi
++)
1246 YY_SYMBOL_PRINT (" $" << yyi
+ 1 << " =",
1247 ]yystos_@
{b4_rhs_state(yynrhs
, yyi
+ 1)@
}[,
1248 ]b4_rhs_data(yynrhs
, yyi
+ 1)[);
1252 /* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */
1253 ]b4_parser_class_name
[::token_number_type
1254 ]b4_parser_class_name
[::yytranslate_ (int t
)
1257 const token_number_type
1262 if ((unsigned int) t
<= yyuser_token_number_max_
)
1263 return translate_table
[t
];
1265 return yyundef_token_
;
1268 const int ]b4_parser_class_name
[::yyeof_
= 0;
1269 const int ]b4_parser_class_name
[::yylast_
= ]b4_last
[;
1270 const int ]b4_parser_class_name
[::yynnts_
= ]b4_nterms_number
[;
1271 const int ]b4_parser_class_name
[::yyempty_
= -2;
1272 const int ]b4_parser_class_name
[::yyfinal_
= ]b4_final_state_number
[;
1273 const int ]b4_parser_class_name
[::yyterror_
= 1;
1274 const int ]b4_parser_class_name
[::yyerrcode_
= 256;
1275 const int ]b4_parser_class_name
[::yyntokens_
= ]b4_tokens_number
[;
1277 const unsigned int ]b4_parser_class_name
[::yyuser_token_number_max_
= ]b4_user_token_number_max
[;
1278 const ]b4_parser_class_name
[::token_number_type
]b4_parser_class_name
[::yyundef_token_
= ]b4_undef_token_number
[;
1280 ]b4_namespace_close
[
1283 @
output(b4_dir_prefix
[]stack
.hh@
)@
1284 b4_copyright([Stack handling
for Bison parsers in C
++])[
1286 #ifndef BISON_STACK_HH
1287 # define BISON_STACK_HH
1292 template <class T
, class S
= std::deque
<T
> >
1297 // Hide our reversed order.
1298 typedef typename
S::reverse_iterator iterator
;
1299 typedef typename
S::const_reverse_iterator const_iterator
;
1305 stack (unsigned int n
) : seq_ (n
)
1311 operator [] (unsigned int i
)
1318 operator [] (unsigned int i
) const
1327 seq_
.push_front (t
);
1332 pop (unsigned int n
= 1)
1339 typename
S::size_type
1342 return seq_
.size ();
1345 inline const_iterator
begin () const { return seq_
.rbegin (); }
1346 inline const_iterator
end () const { return seq_
.rend (); }
1349 /// The wrapped container.
1353 /// Present a slice of the top of a stack.
1354 template <class T
, class S
= stack
<T
> >
1359 slice (const S
& stack
,
1360 unsigned int range
) : stack_ (stack
),
1367 operator [] (unsigned int i
) const
1369 return stack_
[range_
- i
];
1375 unsigned int range_
;
1377 ]b4_namespace_close
[
1379 #endif // not BISON_STACK_HH[]dnl
1382 m4_popdef([b4_copyright_years
])dnl