]>
Commit | Line | Data |
---|---|---|
1 | # C++ skeleton for Bison | |
2 | ||
3 | # Copyright (C) 2002-2012 Free Software Foundation, Inc. | |
4 | ||
5 | # This program is free software: you can redistribute it and/or modify | |
6 | # it under the terms of the GNU General Public License as published by | |
7 | # the Free Software Foundation, either version 3 of the License, or | |
8 | # (at your option) any later version. | |
9 | # | |
10 | # This program is distributed in the hope that it will be useful, | |
11 | # but WITHOUT ANY WARRANTY; without even the implied warranty of | |
12 | # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
13 | # GNU General Public License for more details. | |
14 | # | |
15 | # You should have received a copy of the GNU General Public License | |
16 | # along with this program. If not, see <http://www.gnu.org/licenses/>. | |
17 | ||
18 | m4_include(b4_pkgdatadir/[c++.m4]) | |
19 | ||
20 | m4_define([b4_parser_class_name], | |
21 | [b4_percent_define_get([[parser_class_name]])]) | |
22 | ||
23 | # The header is mandatory. | |
24 | b4_defines_if([], | |
25 | [b4_fatal([b4_skeleton[: using %%defines is mandatory]])]) | |
26 | ||
27 | b4_percent_define_ifdef([[location_type]], [], | |
28 | [# Backward compatibility. | |
29 | m4_define([b4_location_constructors]) | |
30 | m4_include(b4_pkgdatadir/[location.cc])]) | |
31 | ||
32 | # We do want M4 expansion after # for CPP macros. | |
33 | m4_changecom() | |
34 | m4_divert_push(0)dnl | |
35 | b4_defines_if( | |
36 | [@output(b4_spec_defines_file@)@ | |
37 | b4_copyright([Skeleton interface for Bison LALR(1) parsers in C++], | |
38 | [2002-2012]) | |
39 | dnl FIXME: This is wrong, we want computed header guards. | |
40 | [ | |
41 | /* C++ LALR(1) parser skeleton written by Akim Demaille. */ | |
42 | ||
43 | #ifndef PARSER_HEADER_H | |
44 | # define PARSER_HEADER_H | |
45 | ||
46 | ]b4_percent_code_get([[requires]])[ | |
47 | ||
48 | #include <string> | |
49 | #include <iostream> | |
50 | #include "stack.hh" | |
51 | ]b4_percent_define_ifdef([[location_type]], [], | |
52 | [[#include "location.hh"]])[ | |
53 | ||
54 | ]b4_null_define[ | |
55 | ||
56 | /* Enabling traces. */ | |
57 | #ifndef YYDEBUG | |
58 | # define YYDEBUG ]b4_debug_flag[ | |
59 | #endif | |
60 | ||
61 | /* Enabling verbose error messages. */ | |
62 | #ifdef YYERROR_VERBOSE | |
63 | # undef YYERROR_VERBOSE | |
64 | # define YYERROR_VERBOSE 1 | |
65 | #else | |
66 | # define YYERROR_VERBOSE ]b4_error_verbose_flag[ | |
67 | #endif | |
68 | ||
69 | /* Enabling the token table. */ | |
70 | #ifndef YYTOKEN_TABLE | |
71 | # define YYTOKEN_TABLE ]b4_token_table[ | |
72 | #endif | |
73 | ||
74 | ]b4_namespace_open[ | |
75 | ||
76 | /// A Bison parser. | |
77 | class ]b4_parser_class_name[ | |
78 | { | |
79 | public: | |
80 | /// Symbol semantic values. | |
81 | #ifndef YYSTYPE | |
82 | ]m4_ifdef([b4_stype], | |
83 | [ union semantic_type | |
84 | { | |
85 | b4_user_stype | |
86 | };], | |
87 | [m4_if(b4_tag_seen_flag, 0, | |
88 | [[ typedef int semantic_type;]], | |
89 | [[ typedef YYSTYPE semantic_type;]])])[ | |
90 | #else | |
91 | typedef YYSTYPE semantic_type; | |
92 | #endif | |
93 | /// Symbol locations. | |
94 | typedef ]b4_percent_define_get([[location_type]], | |
95 | [[location]])[ location_type; | |
96 | /// Tokens. | |
97 | struct token | |
98 | { | |
99 | ]b4_token_enums(b4_tokens)[ | |
100 | }; | |
101 | /// Token type. | |
102 | typedef token::yytokentype token_type; | |
103 | ||
104 | /// Build a parser object. | |
105 | ]b4_parser_class_name[ (]b4_parse_param_decl[); | |
106 | virtual ~]b4_parser_class_name[ (); | |
107 | ||
108 | /// Parse. | |
109 | /// \returns 0 iff parsing succeeded. | |
110 | virtual int parse (); | |
111 | ||
112 | #if YYDEBUG | |
113 | /// The current debugging stream. | |
114 | std::ostream& debug_stream () const; | |
115 | /// Set the current debugging stream. | |
116 | void set_debug_stream (std::ostream &); | |
117 | ||
118 | /// Type for debugging levels. | |
119 | typedef int debug_level_type; | |
120 | /// The current debugging level. | |
121 | debug_level_type debug_level () const; | |
122 | /// Set the current debugging level. | |
123 | void set_debug_level (debug_level_type l); | |
124 | #endif | |
125 | ||
126 | private: | |
127 | /// Report a syntax error. | |
128 | /// \param loc where the syntax error is found. | |
129 | /// \param msg a description of the syntax error. | |
130 | virtual void error (const location_type& loc, const std::string& msg); | |
131 | ||
132 | /// Generate an error message. | |
133 | /// \param state the state where the error occurred. | |
134 | /// \param tok the lookahead token. | |
135 | virtual std::string yysyntax_error_ (int yystate, int tok); | |
136 | ||
137 | #if YYDEBUG | |
138 | /// \brief Report a symbol value on the debug stream. | |
139 | /// \param yytype The token type. | |
140 | /// \param yyvaluep Its semantic value. | |
141 | /// \param yylocationp Its location. | |
142 | virtual void yy_symbol_value_print_ (int yytype, | |
143 | const semantic_type* yyvaluep, | |
144 | const location_type* yylocationp); | |
145 | /// \brief Report a symbol on the debug stream. | |
146 | /// \param yytype The token type. | |
147 | /// \param yyvaluep Its semantic value. | |
148 | /// \param yylocationp Its location. | |
149 | virtual void yy_symbol_print_ (int yytype, | |
150 | const semantic_type* yyvaluep, | |
151 | const location_type* yylocationp); | |
152 | #endif | |
153 | ||
154 | ||
155 | /// State numbers. | |
156 | typedef int state_type; | |
157 | /// State stack type. | |
158 | typedef stack<state_type> state_stack_type; | |
159 | /// Semantic value stack type. | |
160 | typedef stack<semantic_type> semantic_stack_type; | |
161 | /// location stack type. | |
162 | typedef stack<location_type> location_stack_type; | |
163 | ||
164 | /// The state stack. | |
165 | state_stack_type yystate_stack_; | |
166 | /// The semantic value stack. | |
167 | semantic_stack_type yysemantic_stack_; | |
168 | /// The location stack. | |
169 | location_stack_type yylocation_stack_; | |
170 | ||
171 | /// Whether the given \c yypact_ value indicates a defaulted state. | |
172 | /// \param yyvalue the value to check | |
173 | static bool yy_pact_value_is_default_ (int yyvalue); | |
174 | ||
175 | /// Whether the given \c yytable_ value indicates a syntax error. | |
176 | /// \param yyvalue the value to check | |
177 | static bool yy_table_value_is_error_ (int yyvalue); | |
178 | ||
179 | /// Internal symbol numbers. | |
180 | typedef ]b4_int_type_for([b4_translate])[ token_number_type; | |
181 | /* Tables. */ | |
182 | /// For a state, the index in \a yytable_ of its portion. | |
183 | static const ]b4_int_type_for([b4_pact])[ yypact_[]; | |
184 | static const ]b4_int_type(b4_pact_ninf, b4_pact_ninf)[ yypact_ninf_; | |
185 | ||
186 | /// For a state, default reduction number. | |
187 | /// Unless\a yytable_ specifies something else to do. | |
188 | /// Zero means the default is an error. | |
189 | static const ]b4_int_type_for([b4_defact])[ yydefact_[]; | |
190 | ||
191 | static const ]b4_int_type_for([b4_pgoto])[ yypgoto_[]; | |
192 | static const ]b4_int_type_for([b4_defgoto])[ yydefgoto_[]; | |
193 | ||
194 | /// What to do in a state. | |
195 | /// \a yytable_[yypact_[s]]: what to do in state \a s. | |
196 | /// - if positive, shift that token. | |
197 | /// - if negative, reduce the rule which number is the opposite. | |
198 | /// - if zero, do what YYDEFACT says. | |
199 | static const ]b4_int_type_for([b4_table])[ yytable_[]; | |
200 | static const ]b4_int_type(b4_table_ninf, b4_table_ninf)[ yytable_ninf_; | |
201 | ||
202 | static const ]b4_int_type_for([b4_check])[ yycheck_[]; | |
203 | ||
204 | /// For a state, its accessing symbol. | |
205 | static const ]b4_int_type_for([b4_stos])[ yystos_[]; | |
206 | ||
207 | /// For a rule, its LHS. | |
208 | static const ]b4_int_type_for([b4_r1])[ yyr1_[]; | |
209 | /// For a rule, its RHS length. | |
210 | static const ]b4_int_type_for([b4_r2])[ yyr2_[]; | |
211 | ||
212 | #if YYDEBUG || YYERROR_VERBOSE || YYTOKEN_TABLE | |
213 | /// For a symbol, its name in clear. | |
214 | static const char* const yytname_[]; | |
215 | #endif]b4_error_verbose_if([ | |
216 | ||
217 | /// Convert the symbol name \a n to a form suitable for a diagnostic. | |
218 | static std::string yytnamerr_ (const char *n);])[ | |
219 | ||
220 | #if YYDEBUG | |
221 | /// A type to store symbol numbers and -1. | |
222 | typedef ]b4_int_type_for([b4_rhs])[ rhs_number_type; | |
223 | /// A `-1'-separated list of the rules' RHS. | |
224 | static const rhs_number_type yyrhs_[]; | |
225 | /// For each rule, the index of the first RHS symbol in \a yyrhs_. | |
226 | static const ]b4_int_type_for([b4_prhs])[ yyprhs_[]; | |
227 | /// For each rule, its source line number. | |
228 | static const ]b4_int_type_for([b4_rline])[ yyrline_[]; | |
229 | /// For each scanner token number, its symbol number. | |
230 | static const ]b4_int_type_for([b4_toknum])[ yytoken_number_[]; | |
231 | /// Report on the debug stream that the rule \a r is going to be reduced. | |
232 | virtual void yy_reduce_print_ (int r); | |
233 | /// Print the state stack on the debug stream. | |
234 | virtual void yystack_print_ (); | |
235 | ||
236 | /* Debugging. */ | |
237 | int yydebug_; | |
238 | std::ostream* yycdebug_; | |
239 | #endif | |
240 | ||
241 | /// Convert a scanner token number \a t to a symbol number. | |
242 | token_number_type yytranslate_ (int t); | |
243 | ||
244 | /// \brief Reclaim the memory associated to a symbol. | |
245 | /// \param yymsg Why this token is reclaimed. | |
246 | /// \param yytype The symbol type. | |
247 | /// \param yyvaluep Its semantic value. | |
248 | /// \param yylocationp Its location. | |
249 | inline void yydestruct_ (const char* yymsg, | |
250 | int yytype, | |
251 | semantic_type* yyvaluep, | |
252 | location_type* yylocationp); | |
253 | ||
254 | /// Pop \a n symbols the three stacks. | |
255 | inline void yypop_ (unsigned int n = 1); | |
256 | ||
257 | /* Constants. */ | |
258 | static const int yyeof_; | |
259 | /* LAST_ -- Last index in TABLE_. */ | |
260 | static const int yylast_; | |
261 | static const int yynnts_; | |
262 | static const int yyempty_; | |
263 | static const int yyfinal_; | |
264 | static const int yyterror_; | |
265 | static const int yyerrcode_; | |
266 | static const int yyntokens_; | |
267 | static const unsigned int yyuser_token_number_max_; | |
268 | static const token_number_type yyundef_token_; | |
269 | ]b4_parse_param_vars[ | |
270 | }; | |
271 | ]b4_namespace_close[ | |
272 | ||
273 | ]b4_percent_define_flag_if([[global_tokens_and_yystype]], | |
274 | [b4_token_defines(b4_tokens) | |
275 | ||
276 | #ifndef YYSTYPE | |
277 | /* Redirection for backward compatibility. */ | |
278 | # define YYSTYPE b4_namespace_ref::b4_parser_class_name::semantic_type | |
279 | #endif | |
280 | ]) | |
281 | b4_percent_code_get([[provides]])[]dnl | |
282 | ||
283 | [#endif /* ! defined PARSER_HEADER_H */] | |
284 | ])dnl | |
285 | @output(b4_parser_file_name@)@ | |
286 | b4_copyright([Skeleton implementation for Bison LALR(1) parsers in C++], | |
287 | [2002-2012]) | |
288 | b4_percent_code_get([[top]])[]dnl | |
289 | m4_if(b4_prefix, [yy], [], | |
290 | [ | |
291 | // Take the name prefix into account. | |
292 | #define yylex b4_prefix[]lex])[ | |
293 | ||
294 | /* First part of user declarations. */ | |
295 | ]b4_user_pre_prologue | |
296 | ||
297 | b4_defines_if([[ | |
298 | #include "@basename(]b4_spec_defines_file[@)"]])[ | |
299 | ||
300 | /* User implementation prologue. */ | |
301 | ]b4_user_post_prologue | |
302 | b4_percent_code_get[]dnl | |
303 | ||
304 | [#ifndef YY_ | |
305 | # if defined YYENABLE_NLS && YYENABLE_NLS | |
306 | # if ENABLE_NLS | |
307 | # include <libintl.h> /* FIXME: INFRINGES ON USER NAME SPACE */ | |
308 | # define YY_(msgid) dgettext ("bison-runtime", msgid) | |
309 | # endif | |
310 | # endif | |
311 | # ifndef YY_ | |
312 | # define YY_(msgid) msgid | |
313 | # endif | |
314 | #endif | |
315 | ||
316 | /* YYLLOC_DEFAULT -- Set CURRENT to span from RHS[1] to RHS[N]. | |
317 | If N is 0, then set CURRENT to the empty location which ends | |
318 | the previous symbol: RHS[0] (always defined). */ | |
319 | ||
320 | #define YYRHSLOC(Rhs, K) ((Rhs)[K]) | |
321 | #ifndef YYLLOC_DEFAULT | |
322 | # define YYLLOC_DEFAULT(Current, Rhs, N) \ | |
323 | do \ | |
324 | if (N) \ | |
325 | { \ | |
326 | (Current).begin = YYRHSLOC (Rhs, 1).begin; \ | |
327 | (Current).end = YYRHSLOC (Rhs, N).end; \ | |
328 | } \ | |
329 | else \ | |
330 | { \ | |
331 | (Current).begin = (Current).end = YYRHSLOC (Rhs, 0).end; \ | |
332 | } \ | |
333 | while (false) | |
334 | #endif | |
335 | ||
336 | /* Suppress unused-variable warnings by "using" E. */ | |
337 | #define YYUSE(e) ((void) (e)) | |
338 | ||
339 | /* Enable debugging if requested. */ | |
340 | #if YYDEBUG | |
341 | ||
342 | /* A pseudo ostream that takes yydebug_ into account. */ | |
343 | # define YYCDEBUG if (yydebug_) (*yycdebug_) | |
344 | ||
345 | # define YY_SYMBOL_PRINT(Title, Type, Value, Location) \ | |
346 | do { \ | |
347 | if (yydebug_) \ | |
348 | { \ | |
349 | *yycdebug_ << Title << ' '; \ | |
350 | yy_symbol_print_ ((Type), (Value), (Location)); \ | |
351 | *yycdebug_ << std::endl; \ | |
352 | } \ | |
353 | } while (false) | |
354 | ||
355 | # define YY_REDUCE_PRINT(Rule) \ | |
356 | do { \ | |
357 | if (yydebug_) \ | |
358 | yy_reduce_print_ (Rule); \ | |
359 | } while (false) | |
360 | ||
361 | # define YY_STACK_PRINT() \ | |
362 | do { \ | |
363 | if (yydebug_) \ | |
364 | yystack_print_ (); \ | |
365 | } while (false) | |
366 | ||
367 | #else /* !YYDEBUG */ | |
368 | ||
369 | # define YYCDEBUG if (false) std::cerr | |
370 | # define YY_SYMBOL_PRINT(Title, Type, Value, Location) | |
371 | # define YY_REDUCE_PRINT(Rule) | |
372 | # define YY_STACK_PRINT() | |
373 | ||
374 | #endif /* !YYDEBUG */ | |
375 | ||
376 | #define yyerrok (yyerrstatus_ = 0) | |
377 | #define yyclearin (yychar = yyempty_) | |
378 | ||
379 | #define YYACCEPT goto yyacceptlab | |
380 | #define YYABORT goto yyabortlab | |
381 | #define YYERROR goto yyerrorlab | |
382 | #define YYRECOVERING() (!!yyerrstatus_) | |
383 | ||
384 | ]b4_namespace_open[]b4_error_verbose_if([[ | |
385 | ||
386 | /* Return YYSTR after stripping away unnecessary quotes and | |
387 | backslashes, so that it's suitable for yyerror. The heuristic is | |
388 | that double-quoting is unnecessary unless the string contains an | |
389 | apostrophe, a comma, or backslash (other than backslash-backslash). | |
390 | YYSTR is taken from yytname. */ | |
391 | std::string | |
392 | ]b4_parser_class_name[::yytnamerr_ (const char *yystr) | |
393 | { | |
394 | if (*yystr == '"') | |
395 | { | |
396 | std::string yyr = ""; | |
397 | char const *yyp = yystr; | |
398 | ||
399 | for (;;) | |
400 | switch (*++yyp) | |
401 | { | |
402 | case '\'': | |
403 | case ',': | |
404 | goto do_not_strip_quotes; | |
405 | ||
406 | case '\\': | |
407 | if (*++yyp != '\\') | |
408 | goto do_not_strip_quotes; | |
409 | /* Fall through. */ | |
410 | default: | |
411 | yyr += *yyp; | |
412 | break; | |
413 | ||
414 | case '"': | |
415 | return yyr; | |
416 | } | |
417 | do_not_strip_quotes: ; | |
418 | } | |
419 | ||
420 | return yystr; | |
421 | } | |
422 | ]])[ | |
423 | ||
424 | /// Build a parser object. | |
425 | ]b4_parser_class_name::b4_parser_class_name[ (]b4_parse_param_decl[)]m4_ifset([b4_parse_param], [ | |
426 | :])[ | |
427 | #if YYDEBUG | |
428 | ]m4_ifset([b4_parse_param], [ ], [ :])[yydebug_ (false), | |
429 | yycdebug_ (&std::cerr)]m4_ifset([b4_parse_param], [,])[ | |
430 | #endif]b4_parse_param_cons[ | |
431 | { | |
432 | } | |
433 | ||
434 | ]b4_parser_class_name::~b4_parser_class_name[ () | |
435 | { | |
436 | } | |
437 | ||
438 | #if YYDEBUG | |
439 | /*--------------------------------. | |
440 | | Print this symbol on YYOUTPUT. | | |
441 | `--------------------------------*/ | |
442 | ||
443 | inline void | |
444 | ]b4_parser_class_name[::yy_symbol_value_print_ (int yytype, | |
445 | const semantic_type* yyvaluep, const location_type* yylocationp) | |
446 | { | |
447 | YYUSE (yylocationp); | |
448 | YYUSE (yyvaluep); | |
449 | std::ostream& yyo = debug_stream (); | |
450 | std::ostream& yyoutput = yyo; | |
451 | YYUSE (yyoutput); | |
452 | switch (yytype) | |
453 | { | |
454 | ]m4_map([b4_symbol_actions], m4_defn([b4_symbol_printers]))dnl | |
455 | [ default: | |
456 | break; | |
457 | } | |
458 | } | |
459 | ||
460 | ||
461 | void | |
462 | ]b4_parser_class_name[::yy_symbol_print_ (int yytype, | |
463 | const semantic_type* yyvaluep, const location_type* yylocationp) | |
464 | { | |
465 | *yycdebug_ << (yytype < yyntokens_ ? "token" : "nterm") | |
466 | << ' ' << yytname_[yytype] << " (" | |
467 | << *yylocationp << ": "; | |
468 | yy_symbol_value_print_ (yytype, yyvaluep, yylocationp); | |
469 | *yycdebug_ << ')'; | |
470 | } | |
471 | #endif | |
472 | ||
473 | void | |
474 | ]b4_parser_class_name[::yydestruct_ (const char* yymsg, | |
475 | int yytype, semantic_type* yyvaluep, location_type* yylocationp) | |
476 | { | |
477 | YYUSE (yylocationp); | |
478 | YYUSE (yymsg); | |
479 | YYUSE (yyvaluep); | |
480 | ||
481 | YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp); | |
482 | ||
483 | switch (yytype) | |
484 | { | |
485 | ]m4_map([b4_symbol_actions], m4_defn([b4_symbol_destructors]))[ | |
486 | default: | |
487 | break; | |
488 | } | |
489 | } | |
490 | ||
491 | void | |
492 | ]b4_parser_class_name[::yypop_ (unsigned int n) | |
493 | { | |
494 | yystate_stack_.pop (n); | |
495 | yysemantic_stack_.pop (n); | |
496 | yylocation_stack_.pop (n); | |
497 | } | |
498 | ||
499 | #if YYDEBUG | |
500 | std::ostream& | |
501 | ]b4_parser_class_name[::debug_stream () const | |
502 | { | |
503 | return *yycdebug_; | |
504 | } | |
505 | ||
506 | void | |
507 | ]b4_parser_class_name[::set_debug_stream (std::ostream& o) | |
508 | { | |
509 | yycdebug_ = &o; | |
510 | } | |
511 | ||
512 | ||
513 | ]b4_parser_class_name[::debug_level_type | |
514 | ]b4_parser_class_name[::debug_level () const | |
515 | { | |
516 | return yydebug_; | |
517 | } | |
518 | ||
519 | void | |
520 | ]b4_parser_class_name[::set_debug_level (debug_level_type l) | |
521 | { | |
522 | yydebug_ = l; | |
523 | } | |
524 | #endif | |
525 | ||
526 | inline bool | |
527 | ]b4_parser_class_name[::yy_pact_value_is_default_ (int yyvalue) | |
528 | { | |
529 | return yyvalue == yypact_ninf_; | |
530 | } | |
531 | ||
532 | inline bool | |
533 | ]b4_parser_class_name[::yy_table_value_is_error_ (int yyvalue) | |
534 | { | |
535 | return yyvalue == yytable_ninf_; | |
536 | } | |
537 | ||
538 | int | |
539 | ]b4_parser_class_name[::parse () | |
540 | { | |
541 | /// Lookahead and lookahead in internal form. | |
542 | int yychar = yyempty_; | |
543 | int yytoken = 0; | |
544 | ||
545 | /* State. */ | |
546 | int yyn; | |
547 | int yylen = 0; | |
548 | int yystate = 0; | |
549 | ||
550 | /* Error handling. */ | |
551 | int yynerrs_ = 0; | |
552 | int yyerrstatus_ = 0; | |
553 | ||
554 | /// Semantic value of the lookahead. | |
555 | semantic_type yylval; | |
556 | /// Location of the lookahead. | |
557 | location_type yylloc; | |
558 | /// The locations where the error started and ended. | |
559 | location_type yyerror_range[3]; | |
560 | ||
561 | /// $$. | |
562 | semantic_type yyval; | |
563 | /// @@$. | |
564 | location_type yyloc; | |
565 | ||
566 | int yyresult; | |
567 | ||
568 | YYCDEBUG << "Starting parse" << std::endl; | |
569 | ||
570 | ]m4_ifdef([b4_initial_action], [ | |
571 | m4_pushdef([b4_at_dollar], [yylloc])dnl | |
572 | m4_pushdef([b4_dollar_dollar], [yylval])dnl | |
573 | /* User initialization code. */ | |
574 | b4_user_initial_action | |
575 | m4_popdef([b4_dollar_dollar])dnl | |
576 | m4_popdef([b4_at_dollar])])dnl | |
577 | ||
578 | [ /* Initialize the stacks. The initial state will be pushed in | |
579 | yynewstate, since the latter expects the semantical and the | |
580 | location values to have been already stored, initialize these | |
581 | stacks with a primary value. */ | |
582 | yystate_stack_ = state_stack_type (0); | |
583 | yysemantic_stack_ = semantic_stack_type (0); | |
584 | yylocation_stack_ = location_stack_type (0); | |
585 | yysemantic_stack_.push (yylval); | |
586 | yylocation_stack_.push (yylloc); | |
587 | ||
588 | /* New state. */ | |
589 | yynewstate: | |
590 | yystate_stack_.push (yystate); | |
591 | YYCDEBUG << "Entering state " << yystate << std::endl; | |
592 | ||
593 | /* Accept? */ | |
594 | if (yystate == yyfinal_) | |
595 | goto yyacceptlab; | |
596 | ||
597 | goto yybackup; | |
598 | ||
599 | /* Backup. */ | |
600 | yybackup: | |
601 | ||
602 | /* Try to take a decision without lookahead. */ | |
603 | yyn = yypact_[yystate]; | |
604 | if (yy_pact_value_is_default_ (yyn)) | |
605 | goto yydefault; | |
606 | ||
607 | /* Read a lookahead token. */ | |
608 | if (yychar == yyempty_) | |
609 | { | |
610 | YYCDEBUG << "Reading a token: "; | |
611 | yychar = ]b4_c_function_call([yylex], [int], | |
612 | [[YYSTYPE*], [&yylval]][]dnl | |
613 | b4_locations_if([, [[location*], [&yylloc]]])dnl | |
614 | m4_ifdef([b4_lex_param], [, ]b4_lex_param))[; | |
615 | } | |
616 | ||
617 | ||
618 | /* Convert token to internal form. */ | |
619 | if (yychar <= yyeof_) | |
620 | { | |
621 | yychar = yytoken = yyeof_; | |
622 | YYCDEBUG << "Now at end of input." << std::endl; | |
623 | } | |
624 | else | |
625 | { | |
626 | yytoken = yytranslate_ (yychar); | |
627 | YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc); | |
628 | } | |
629 | ||
630 | /* If the proper action on seeing token YYTOKEN is to reduce or to | |
631 | detect an error, take that action. */ | |
632 | yyn += yytoken; | |
633 | if (yyn < 0 || yylast_ < yyn || yycheck_[yyn] != yytoken) | |
634 | goto yydefault; | |
635 | ||
636 | /* Reduce or error. */ | |
637 | yyn = yytable_[yyn]; | |
638 | if (yyn <= 0) | |
639 | { | |
640 | if (yy_table_value_is_error_ (yyn)) | |
641 | goto yyerrlab; | |
642 | yyn = -yyn; | |
643 | goto yyreduce; | |
644 | } | |
645 | ||
646 | /* Shift the lookahead token. */ | |
647 | YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc); | |
648 | ||
649 | /* Discard the token being shifted. */ | |
650 | yychar = yyempty_; | |
651 | ||
652 | yysemantic_stack_.push (yylval); | |
653 | yylocation_stack_.push (yylloc); | |
654 | ||
655 | /* Count tokens shifted since error; after three, turn off error | |
656 | status. */ | |
657 | if (yyerrstatus_) | |
658 | --yyerrstatus_; | |
659 | ||
660 | yystate = yyn; | |
661 | goto yynewstate; | |
662 | ||
663 | /*-----------------------------------------------------------. | |
664 | | yydefault -- do the default action for the current state. | | |
665 | `-----------------------------------------------------------*/ | |
666 | yydefault: | |
667 | yyn = yydefact_[yystate]; | |
668 | if (yyn == 0) | |
669 | goto yyerrlab; | |
670 | goto yyreduce; | |
671 | ||
672 | /*-----------------------------. | |
673 | | yyreduce -- Do a reduction. | | |
674 | `-----------------------------*/ | |
675 | yyreduce: | |
676 | yylen = yyr2_[yyn]; | |
677 | /* If YYLEN is nonzero, implement the default value of the action: | |
678 | `$$ = $1'. Otherwise, use the top of the stack. | |
679 | ||
680 | Otherwise, the following line sets YYVAL to garbage. | |
681 | This behavior is undocumented and Bison | |
682 | users should not rely upon it. */ | |
683 | if (yylen) | |
684 | yyval = yysemantic_stack_[yylen - 1]; | |
685 | else | |
686 | yyval = yysemantic_stack_[0]; | |
687 | ||
688 | { | |
689 | slice<location_type, location_stack_type> slice (yylocation_stack_, yylen); | |
690 | YYLLOC_DEFAULT (yyloc, slice, yylen); | |
691 | } | |
692 | YY_REDUCE_PRINT (yyn); | |
693 | switch (yyn) | |
694 | { | |
695 | ]b4_user_actions[ | |
696 | default: | |
697 | break; | |
698 | } | |
699 | /* User semantic actions sometimes alter yychar, and that requires | |
700 | that yytoken be updated with the new translation. We take the | |
701 | approach of translating immediately before every use of yytoken. | |
702 | One alternative is translating here after every semantic action, | |
703 | but that translation would be missed if the semantic action | |
704 | invokes YYABORT, YYACCEPT, or YYERROR immediately after altering | |
705 | yychar. In the case of YYABORT or YYACCEPT, an incorrect | |
706 | destructor might then be invoked immediately. In the case of | |
707 | YYERROR, subsequent parser actions might lead to an incorrect | |
708 | destructor call or verbose syntax error message before the | |
709 | lookahead is translated. */ | |
710 | YY_SYMBOL_PRINT ("-> $$ =", yyr1_[yyn], &yyval, &yyloc); | |
711 | ||
712 | yypop_ (yylen); | |
713 | yylen = 0; | |
714 | YY_STACK_PRINT (); | |
715 | ||
716 | yysemantic_stack_.push (yyval); | |
717 | yylocation_stack_.push (yyloc); | |
718 | ||
719 | /* Shift the result of the reduction. */ | |
720 | yyn = yyr1_[yyn]; | |
721 | yystate = yypgoto_[yyn - yyntokens_] + yystate_stack_[0]; | |
722 | if (0 <= yystate && yystate <= yylast_ | |
723 | && yycheck_[yystate] == yystate_stack_[0]) | |
724 | yystate = yytable_[yystate]; | |
725 | else | |
726 | yystate = yydefgoto_[yyn - yyntokens_]; | |
727 | goto yynewstate; | |
728 | ||
729 | /*------------------------------------. | |
730 | | yyerrlab -- here on detecting error | | |
731 | `------------------------------------*/ | |
732 | yyerrlab: | |
733 | /* Make sure we have latest lookahead translation. See comments at | |
734 | user semantic actions for why this is necessary. */ | |
735 | yytoken = yytranslate_ (yychar); | |
736 | ||
737 | /* If not already recovering from an error, report this error. */ | |
738 | if (!yyerrstatus_) | |
739 | { | |
740 | ++yynerrs_; | |
741 | if (yychar == yyempty_) | |
742 | yytoken = yyempty_; | |
743 | error (yylloc, yysyntax_error_ (yystate, yytoken)); | |
744 | } | |
745 | ||
746 | yyerror_range[1] = yylloc; | |
747 | if (yyerrstatus_ == 3) | |
748 | { | |
749 | /* If just tried and failed to reuse lookahead token after an | |
750 | error, discard it. */ | |
751 | ||
752 | if (yychar <= yyeof_) | |
753 | { | |
754 | /* Return failure if at end of input. */ | |
755 | if (yychar == yyeof_) | |
756 | YYABORT; | |
757 | } | |
758 | else | |
759 | { | |
760 | yydestruct_ ("Error: discarding", yytoken, &yylval, &yylloc); | |
761 | yychar = yyempty_; | |
762 | } | |
763 | } | |
764 | ||
765 | /* Else will try to reuse lookahead token after shifting the error | |
766 | token. */ | |
767 | goto yyerrlab1; | |
768 | ||
769 | ||
770 | /*---------------------------------------------------. | |
771 | | yyerrorlab -- error raised explicitly by YYERROR. | | |
772 | `---------------------------------------------------*/ | |
773 | yyerrorlab: | |
774 | ||
775 | /* Pacify compilers like GCC when the user code never invokes | |
776 | YYERROR and the label yyerrorlab therefore never appears in user | |
777 | code. */ | |
778 | if (false) | |
779 | goto yyerrorlab; | |
780 | ||
781 | yyerror_range[1] = yylocation_stack_[yylen - 1]; | |
782 | /* Do not reclaim the symbols of the rule which action triggered | |
783 | this YYERROR. */ | |
784 | yypop_ (yylen); | |
785 | yylen = 0; | |
786 | yystate = yystate_stack_[0]; | |
787 | goto yyerrlab1; | |
788 | ||
789 | /*-------------------------------------------------------------. | |
790 | | yyerrlab1 -- common code for both syntax error and YYERROR. | | |
791 | `-------------------------------------------------------------*/ | |
792 | yyerrlab1: | |
793 | yyerrstatus_ = 3; /* Each real token shifted decrements this. */ | |
794 | ||
795 | for (;;) | |
796 | { | |
797 | yyn = yypact_[yystate]; | |
798 | if (!yy_pact_value_is_default_ (yyn)) | |
799 | { | |
800 | yyn += yyterror_; | |
801 | if (0 <= yyn && yyn <= yylast_ && yycheck_[yyn] == yyterror_) | |
802 | { | |
803 | yyn = yytable_[yyn]; | |
804 | if (0 < yyn) | |
805 | break; | |
806 | } | |
807 | } | |
808 | ||
809 | /* Pop the current state because it cannot handle the error token. */ | |
810 | if (yystate_stack_.height () == 1) | |
811 | YYABORT; | |
812 | ||
813 | yyerror_range[1] = yylocation_stack_[0]; | |
814 | yydestruct_ ("Error: popping", | |
815 | yystos_[yystate], | |
816 | &yysemantic_stack_[0], &yylocation_stack_[0]); | |
817 | yypop_ (); | |
818 | yystate = yystate_stack_[0]; | |
819 | YY_STACK_PRINT (); | |
820 | } | |
821 | ||
822 | yyerror_range[2] = yylloc; | |
823 | // Using YYLLOC is tempting, but would change the location of | |
824 | // the lookahead. YYLOC is available though. | |
825 | YYLLOC_DEFAULT (yyloc, yyerror_range, 2); | |
826 | yysemantic_stack_.push (yylval); | |
827 | yylocation_stack_.push (yyloc); | |
828 | ||
829 | /* Shift the error token. */ | |
830 | YY_SYMBOL_PRINT ("Shifting", yystos_[yyn], | |
831 | &yysemantic_stack_[0], &yylocation_stack_[0]); | |
832 | ||
833 | yystate = yyn; | |
834 | goto yynewstate; | |
835 | ||
836 | /* Accept. */ | |
837 | yyacceptlab: | |
838 | yyresult = 0; | |
839 | goto yyreturn; | |
840 | ||
841 | /* Abort. */ | |
842 | yyabortlab: | |
843 | yyresult = 1; | |
844 | goto yyreturn; | |
845 | ||
846 | yyreturn: | |
847 | if (yychar != yyempty_) | |
848 | { | |
849 | /* Make sure we have latest lookahead translation. See comments | |
850 | at user semantic actions for why this is necessary. */ | |
851 | yytoken = yytranslate_ (yychar); | |
852 | yydestruct_ ("Cleanup: discarding lookahead", yytoken, &yylval, | |
853 | &yylloc); | |
854 | } | |
855 | ||
856 | /* Do not reclaim the symbols of the rule which action triggered | |
857 | this YYABORT or YYACCEPT. */ | |
858 | yypop_ (yylen); | |
859 | while (yystate_stack_.height () != 1) | |
860 | { | |
861 | yydestruct_ ("Cleanup: popping", | |
862 | yystos_[yystate_stack_[0]], | |
863 | &yysemantic_stack_[0], | |
864 | &yylocation_stack_[0]); | |
865 | yypop_ (); | |
866 | } | |
867 | ||
868 | return yyresult; | |
869 | } | |
870 | ||
871 | // Generate an error message. | |
872 | std::string | |
873 | ]b4_parser_class_name[::yysyntax_error_ (]dnl | |
874 | b4_error_verbose_if([int yystate, int yytoken], | |
875 | [int, int])[) | |
876 | {]b4_error_verbose_if([[ | |
877 | std::string yyres; | |
878 | // Number of reported tokens (one for the "unexpected", one per | |
879 | // "expected"). | |
880 | size_t yycount = 0; | |
881 | // Its maximum. | |
882 | enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 }; | |
883 | // Arguments of yyformat. | |
884 | char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM]; | |
885 | ||
886 | /* There are many possibilities here to consider: | |
887 | - If this state is a consistent state with a default action, then | |
888 | the only way this function was invoked is if the default action | |
889 | is an error action. In that case, don't check for expected | |
890 | tokens because there are none. | |
891 | - The only way there can be no lookahead present (in yytoken) is | |
892 | if this state is a consistent state with a default action. | |
893 | Thus, detecting the absence of a lookahead is sufficient to | |
894 | determine that there is no unexpected or expected token to | |
895 | report. In that case, just report a simple "syntax error". | |
896 | - Don't assume there isn't a lookahead just because this state is | |
897 | a consistent state with a default action. There might have | |
898 | been a previous inconsistent state, consistent state with a | |
899 | non-default action, or user semantic action that manipulated | |
900 | yychar. | |
901 | - Of course, the expected token list depends on states to have | |
902 | correct lookahead information, and it depends on the parser not | |
903 | to perform extra reductions after fetching a lookahead from the | |
904 | scanner and before detecting a syntax error. Thus, state | |
905 | merging (from LALR or IELR) and default reductions corrupt the | |
906 | expected token list. However, the list is correct for | |
907 | canonical LR with one exception: it will still contain any | |
908 | token that will not be accepted due to an error action in a | |
909 | later state. | |
910 | */ | |
911 | if (yytoken != yyempty_) | |
912 | { | |
913 | yyarg[yycount++] = yytname_[yytoken]; | |
914 | int yyn = yypact_[yystate]; | |
915 | if (!yy_pact_value_is_default_ (yyn)) | |
916 | { | |
917 | /* Start YYX at -YYN if negative to avoid negative indexes in | |
918 | YYCHECK. In other words, skip the first -YYN actions for | |
919 | this state because they are default actions. */ | |
920 | int yyxbegin = yyn < 0 ? -yyn : 0; | |
921 | /* Stay within bounds of both yycheck and yytname. */ | |
922 | int yychecklim = yylast_ - yyn + 1; | |
923 | int yyxend = yychecklim < yyntokens_ ? yychecklim : yyntokens_; | |
924 | for (int yyx = yyxbegin; yyx < yyxend; ++yyx) | |
925 | if (yycheck_[yyx + yyn] == yyx && yyx != yyterror_ | |
926 | && !yy_table_value_is_error_ (yytable_[yyx + yyn])) | |
927 | { | |
928 | if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM) | |
929 | { | |
930 | yycount = 1; | |
931 | break; | |
932 | } | |
933 | else | |
934 | yyarg[yycount++] = yytname_[yyx]; | |
935 | } | |
936 | } | |
937 | } | |
938 | ||
939 | char const* yyformat = YY_NULL; | |
940 | switch (yycount) | |
941 | { | |
942 | #define YYCASE_(N, S) \ | |
943 | case N: \ | |
944 | yyformat = S; \ | |
945 | break | |
946 | YYCASE_(0, YY_("syntax error")); | |
947 | YYCASE_(1, YY_("syntax error, unexpected %s")); | |
948 | YYCASE_(2, YY_("syntax error, unexpected %s, expecting %s")); | |
949 | YYCASE_(3, YY_("syntax error, unexpected %s, expecting %s or %s")); | |
950 | YYCASE_(4, YY_("syntax error, unexpected %s, expecting %s or %s or %s")); | |
951 | YYCASE_(5, YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s")); | |
952 | #undef YYCASE_ | |
953 | } | |
954 | ||
955 | // Argument number. | |
956 | size_t yyi = 0; | |
957 | for (char const* yyp = yyformat; *yyp; ++yyp) | |
958 | if (yyp[0] == '%' && yyp[1] == 's' && yyi < yycount) | |
959 | { | |
960 | yyres += yytnamerr_ (yyarg[yyi++]); | |
961 | ++yyp; | |
962 | } | |
963 | else | |
964 | yyres += *yyp; | |
965 | return yyres;]], [[ | |
966 | return YY_("syntax error");]])[ | |
967 | } | |
968 | ||
969 | ||
970 | /* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing | |
971 | STATE-NUM. */ | |
972 | const ]b4_int_type(b4_pact_ninf, b4_pact_ninf) b4_parser_class_name::yypact_ninf_ = b4_pact_ninf[; | |
973 | const ]b4_int_type_for([b4_pact])[ | |
974 | ]b4_parser_class_name[::yypact_[] = | |
975 | { | |
976 | ]b4_pact[ | |
977 | }; | |
978 | ||
979 | /* YYDEFACT[S] -- default reduction number in state S. Performed when | |
980 | YYTABLE doesn't specify something else to do. Zero means the | |
981 | default is an error. */ | |
982 | const ]b4_int_type_for([b4_defact])[ | |
983 | ]b4_parser_class_name[::yydefact_[] = | |
984 | { | |
985 | ]b4_defact[ | |
986 | }; | |
987 | ||
988 | /* YYPGOTO[NTERM-NUM]. */ | |
989 | const ]b4_int_type_for([b4_pgoto])[ | |
990 | ]b4_parser_class_name[::yypgoto_[] = | |
991 | { | |
992 | ]b4_pgoto[ | |
993 | }; | |
994 | ||
995 | /* YYDEFGOTO[NTERM-NUM]. */ | |
996 | const ]b4_int_type_for([b4_defgoto])[ | |
997 | ]b4_parser_class_name[::yydefgoto_[] = | |
998 | { | |
999 | ]b4_defgoto[ | |
1000 | }; | |
1001 | ||
1002 | /* YYTABLE[YYPACT[STATE-NUM]]. What to do in state STATE-NUM. If | |
1003 | positive, shift that token. If negative, reduce the rule which | |
1004 | number is the opposite. If YYTABLE_NINF_, syntax error. */ | |
1005 | const ]b4_int_type(b4_table_ninf, b4_table_ninf) b4_parser_class_name::yytable_ninf_ = b4_table_ninf[; | |
1006 | const ]b4_int_type_for([b4_table])[ | |
1007 | ]b4_parser_class_name[::yytable_[] = | |
1008 | { | |
1009 | ]b4_table[ | |
1010 | }; | |
1011 | ||
1012 | /* YYCHECK. */ | |
1013 | const ]b4_int_type_for([b4_check])[ | |
1014 | ]b4_parser_class_name[::yycheck_[] = | |
1015 | { | |
1016 | ]b4_check[ | |
1017 | }; | |
1018 | ||
1019 | /* STOS_[STATE-NUM] -- The (internal number of the) accessing | |
1020 | symbol of state STATE-NUM. */ | |
1021 | const ]b4_int_type_for([b4_stos])[ | |
1022 | ]b4_parser_class_name[::yystos_[] = | |
1023 | { | |
1024 | ]b4_stos[ | |
1025 | }; | |
1026 | ||
1027 | #if YYDEBUG | |
1028 | /* TOKEN_NUMBER_[YYLEX-NUM] -- Internal symbol number corresponding | |
1029 | to YYLEX-NUM. */ | |
1030 | const ]b4_int_type_for([b4_toknum])[ | |
1031 | ]b4_parser_class_name[::yytoken_number_[] = | |
1032 | { | |
1033 | ]b4_toknum[ | |
1034 | }; | |
1035 | #endif | |
1036 | ||
1037 | /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */ | |
1038 | const ]b4_int_type_for([b4_r1])[ | |
1039 | ]b4_parser_class_name[::yyr1_[] = | |
1040 | { | |
1041 | ]b4_r1[ | |
1042 | }; | |
1043 | ||
1044 | /* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */ | |
1045 | const ]b4_int_type_for([b4_r2])[ | |
1046 | ]b4_parser_class_name[::yyr2_[] = | |
1047 | { | |
1048 | ]b4_r2[ | |
1049 | }; | |
1050 | ||
1051 | #if YYDEBUG || YYERROR_VERBOSE || YYTOKEN_TABLE | |
1052 | /* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM. | |
1053 | First, the terminals, then, starting at \a yyntokens_, nonterminals. */ | |
1054 | const char* | |
1055 | const ]b4_parser_class_name[::yytname_[] = | |
1056 | { | |
1057 | ]b4_tname[ | |
1058 | }; | |
1059 | #endif | |
1060 | ||
1061 | #if YYDEBUG | |
1062 | /* YYRHS -- A `-1'-separated list of the rules' RHS. */ | |
1063 | const ]b4_parser_class_name[::rhs_number_type | |
1064 | ]b4_parser_class_name[::yyrhs_[] = | |
1065 | { | |
1066 | ]b4_rhs[ | |
1067 | }; | |
1068 | ||
1069 | /* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in | |
1070 | YYRHS. */ | |
1071 | const ]b4_int_type_for([b4_prhs])[ | |
1072 | ]b4_parser_class_name[::yyprhs_[] = | |
1073 | { | |
1074 | ]b4_prhs[ | |
1075 | }; | |
1076 | ||
1077 | /* YYRLINE[YYN] -- Source line where rule number YYN was defined. */ | |
1078 | const ]b4_int_type_for([b4_rline])[ | |
1079 | ]b4_parser_class_name[::yyrline_[] = | |
1080 | { | |
1081 | ]b4_rline[ | |
1082 | }; | |
1083 | ||
1084 | // Print the state stack on the debug stream. | |
1085 | void | |
1086 | ]b4_parser_class_name[::yystack_print_ () | |
1087 | { | |
1088 | *yycdebug_ << "Stack now"; | |
1089 | for (state_stack_type::const_iterator i = yystate_stack_.begin (); | |
1090 | i != yystate_stack_.end (); ++i) | |
1091 | *yycdebug_ << ' ' << *i; | |
1092 | *yycdebug_ << std::endl; | |
1093 | } | |
1094 | ||
1095 | // Report on the debug stream that the rule \a yyrule is going to be reduced. | |
1096 | void | |
1097 | ]b4_parser_class_name[::yy_reduce_print_ (int yyrule) | |
1098 | { | |
1099 | unsigned int yylno = yyrline_[yyrule]; | |
1100 | int yynrhs = yyr2_[yyrule]; | |
1101 | /* Print the symbols being reduced, and their result. */ | |
1102 | *yycdebug_ << "Reducing stack by rule " << yyrule - 1 | |
1103 | << " (line " << yylno << "):" << std::endl; | |
1104 | /* The symbols being reduced. */ | |
1105 | for (int yyi = 0; yyi < yynrhs; yyi++) | |
1106 | YY_SYMBOL_PRINT (" $" << yyi + 1 << " =", | |
1107 | yyrhs_[yyprhs_[yyrule] + yyi], | |
1108 | &]b4_rhs_value(yynrhs, yyi + 1)[, | |
1109 | &]b4_rhs_location(yynrhs, yyi + 1)[); | |
1110 | } | |
1111 | #endif // YYDEBUG | |
1112 | ||
1113 | /* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */ | |
1114 | ]b4_parser_class_name[::token_number_type | |
1115 | ]b4_parser_class_name[::yytranslate_ (int t) | |
1116 | { | |
1117 | static | |
1118 | const token_number_type | |
1119 | translate_table[] = | |
1120 | { | |
1121 | ]b4_translate[ | |
1122 | }; | |
1123 | if ((unsigned int) t <= yyuser_token_number_max_) | |
1124 | return translate_table[t]; | |
1125 | else | |
1126 | return yyundef_token_; | |
1127 | } | |
1128 | ||
1129 | const int ]b4_parser_class_name[::yyeof_ = 0; | |
1130 | const int ]b4_parser_class_name[::yylast_ = ]b4_last[; | |
1131 | const int ]b4_parser_class_name[::yynnts_ = ]b4_nterms_number[; | |
1132 | const int ]b4_parser_class_name[::yyempty_ = -2; | |
1133 | const int ]b4_parser_class_name[::yyfinal_ = ]b4_final_state_number[; | |
1134 | const int ]b4_parser_class_name[::yyterror_ = 1; | |
1135 | const int ]b4_parser_class_name[::yyerrcode_ = 256; | |
1136 | const int ]b4_parser_class_name[::yyntokens_ = ]b4_tokens_number[; | |
1137 | ||
1138 | const unsigned int ]b4_parser_class_name[::yyuser_token_number_max_ = ]b4_user_token_number_max[; | |
1139 | const ]b4_parser_class_name[::token_number_type ]b4_parser_class_name[::yyundef_token_ = ]b4_undef_token_number[; | |
1140 | ||
1141 | ]b4_namespace_close[ | |
1142 | ||
1143 | ]b4_epilogue | |
1144 | dnl | |
1145 | @output(b4_dir_prefix[]stack.hh@)@ | |
1146 | b4_copyright([Stack handling for Bison parsers in C++], | |
1147 | [2002-2012])[ | |
1148 | ||
1149 | #ifndef BISON_STACK_HH | |
1150 | # define BISON_STACK_HH | |
1151 | ||
1152 | #include <deque> | |
1153 | ||
1154 | ]b4_namespace_open[ | |
1155 | template <class T, class S = std::deque<T> > | |
1156 | class stack | |
1157 | { | |
1158 | public: | |
1159 | ||
1160 | // Hide our reversed order. | |
1161 | typedef typename S::reverse_iterator iterator; | |
1162 | typedef typename S::const_reverse_iterator const_iterator; | |
1163 | ||
1164 | stack () : seq_ () | |
1165 | { | |
1166 | } | |
1167 | ||
1168 | stack (unsigned int n) : seq_ (n) | |
1169 | { | |
1170 | } | |
1171 | ||
1172 | inline | |
1173 | T& | |
1174 | operator [] (unsigned int i) | |
1175 | { | |
1176 | return seq_[i]; | |
1177 | } | |
1178 | ||
1179 | inline | |
1180 | const T& | |
1181 | operator [] (unsigned int i) const | |
1182 | { | |
1183 | return seq_[i]; | |
1184 | } | |
1185 | ||
1186 | inline | |
1187 | void | |
1188 | push (const T& t) | |
1189 | { | |
1190 | seq_.push_front (t); | |
1191 | } | |
1192 | ||
1193 | inline | |
1194 | void | |
1195 | pop (unsigned int n = 1) | |
1196 | { | |
1197 | for (; n; --n) | |
1198 | seq_.pop_front (); | |
1199 | } | |
1200 | ||
1201 | inline | |
1202 | unsigned int | |
1203 | height () const | |
1204 | { | |
1205 | return seq_.size (); | |
1206 | } | |
1207 | ||
1208 | inline const_iterator begin () const { return seq_.rbegin (); } | |
1209 | inline const_iterator end () const { return seq_.rend (); } | |
1210 | ||
1211 | private: | |
1212 | ||
1213 | S seq_; | |
1214 | }; | |
1215 | ||
1216 | /// Present a slice of the top of a stack. | |
1217 | template <class T, class S = stack<T> > | |
1218 | class slice | |
1219 | { | |
1220 | public: | |
1221 | ||
1222 | slice (const S& stack, | |
1223 | unsigned int range) : stack_ (stack), | |
1224 | range_ (range) | |
1225 | { | |
1226 | } | |
1227 | ||
1228 | inline | |
1229 | const T& | |
1230 | operator [] (unsigned int i) const | |
1231 | { | |
1232 | return stack_[range_ - i]; | |
1233 | } | |
1234 | ||
1235 | private: | |
1236 | ||
1237 | const S& stack_; | |
1238 | unsigned int range_; | |
1239 | }; | |
1240 | ]b4_namespace_close[ | |
1241 | ||
1242 | #endif // not BISON_STACK_HH[]dnl | |
1243 | ] | |
1244 | m4_divert_pop(0) |