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