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