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