]>
Commit | Line | Data |
---|---|---|
1 | m4_divert(-1) -*- C -*- | |
2 | ||
3 | # Yacc compatible skeleton for Bison | |
4 | ||
5 | # Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004, 2005 | |
6 | # Free Software Foundation, Inc. | |
7 | ||
8 | # This program is free software; you can redistribute it and/or modify | |
9 | # it under the terms of the GNU General Public License as published by | |
10 | # the Free Software Foundation; either version 2 of the License, or | |
11 | # (at your option) any later version. | |
12 | ||
13 | # This program is distributed in the hope that it will be useful, | |
14 | # but WITHOUT ANY WARRANTY; without even the implied warranty of | |
15 | # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
16 | # GNU General Public License for more details. | |
17 | ||
18 | # You should have received a copy of the GNU General Public License | |
19 | # along with this program; if not, write to the Free Software | |
20 | # Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA | |
21 | # 02110-1301 USA | |
22 | ||
23 | ||
24 | ||
25 | ## ---------------- ## | |
26 | ## Default values. ## | |
27 | ## ---------------- ## | |
28 | ||
29 | # Stack parameters. | |
30 | m4_define_default([b4_stack_depth_max], [10000]) | |
31 | m4_define_default([b4_stack_depth_init], [200]) | |
32 | ||
33 | ||
34 | ## ------------------------ ## | |
35 | ## Pure/impure interfaces. ## | |
36 | ## ------------------------ ## | |
37 | ||
38 | ||
39 | # b4_pure_if(IF-TRUE, IF-FALSE) | |
40 | # ----------------------------- | |
41 | # Expand IF-TRUE, if %pure-parser and %parse-param, IF-FALSE otherwise. | |
42 | m4_define([b4_Pure_if], | |
43 | [b4_pure_if([m4_ifset([b4_parse_param], | |
44 | [$1], [$2])], | |
45 | [$2])]) | |
46 | ||
47 | ||
48 | # b4_yyerror_args | |
49 | # --------------- | |
50 | # Arguments passed to yyerror: user args plus yylloc. | |
51 | m4_define([b4_yyerror_args], | |
52 | [b4_Pure_if([b4_location_if([&yylloc, ])])dnl | |
53 | m4_ifset([b4_parse_param], [b4_c_args(b4_parse_param), ])]) | |
54 | ||
55 | ||
56 | # b4_lex_param | |
57 | # ------------ | |
58 | # Accumulate in b4_lex_param all the yylex arguments. | |
59 | # b4_lex_param arrives quoted twice, but we want to keep only one level. | |
60 | m4_define([b4_lex_param], | |
61 | m4_dquote(b4_pure_if([[[[YYSTYPE *]], [[&yylval]]][]dnl | |
62 | b4_location_if([, [[YYLTYPE *], [&yylloc]]])m4_ifdef([b4_lex_param], [, ])])dnl | |
63 | m4_ifdef([b4_lex_param], b4_lex_param))) | |
64 | ||
65 | ||
66 | ||
67 | ## ------------ ## | |
68 | ## Data Types. ## | |
69 | ## ------------ ## | |
70 | ||
71 | # b4_int_type(MIN, MAX) | |
72 | # --------------------- | |
73 | # Return the smallest int type able to handle numbers ranging from | |
74 | # MIN to MAX (included). We overwrite the version from c.m4 which relies | |
75 | # on "signed char" which is not portable to old K&R compilers. | |
76 | m4_define([b4_int_type], | |
77 | [m4_if(b4_ints_in($@, [0], [255]), [1], [unsigned char], | |
78 | b4_ints_in($@, [-128], [127]), [1], [yysigned_char], | |
79 | ||
80 | b4_ints_in($@, [0], [65535]), [1], [unsigned short int], | |
81 | b4_ints_in($@, [-32768], [32767]), [1], [short int], | |
82 | ||
83 | m4_eval([0 <= $1]), [1], [unsigned int], | |
84 | ||
85 | [int])]) | |
86 | ||
87 | ||
88 | ## ----------------- ## | |
89 | ## Semantic Values. ## | |
90 | ## ----------------- ## | |
91 | ||
92 | ||
93 | # b4_lhs_value([TYPE]) | |
94 | # -------------------- | |
95 | # Expansion of $<TYPE>$. | |
96 | m4_define([b4_lhs_value], | |
97 | [(yyval[]m4_ifval([$1], [.$1]))]) | |
98 | ||
99 | ||
100 | # b4_rhs_value(RULE-LENGTH, NUM, [TYPE]) | |
101 | # -------------------------------------- | |
102 | # Expansion of $<TYPE>NUM, where the current rule has RULE-LENGTH | |
103 | # symbols on RHS. | |
104 | m4_define([b4_rhs_value], | |
105 | [(yyvsp@{m4_eval([$2 - $1])@}m4_ifval([$3], [.$3]))]) | |
106 | ||
107 | ||
108 | ||
109 | ## ----------- ## | |
110 | ## Locations. ## | |
111 | ## ----------- ## | |
112 | ||
113 | # b4_lhs_location() | |
114 | # ----------------- | |
115 | # Expansion of @$. | |
116 | m4_define([b4_lhs_location], | |
117 | [(yyloc)]) | |
118 | ||
119 | ||
120 | # b4_rhs_location(RULE-LENGTH, NUM) | |
121 | # --------------------------------- | |
122 | # Expansion of @NUM, where the current rule has RULE-LENGTH symbols | |
123 | # on RHS. | |
124 | m4_define([b4_rhs_location], | |
125 | [(yylsp@{m4_eval([$2 - $1])@})]) | |
126 | ||
127 | ||
128 | ||
129 | ## --------------------------------------------------------- ## | |
130 | ## Defining symbol actions, e.g., printers and destructors. ## | |
131 | ## --------------------------------------------------------- ## | |
132 | ||
133 | # We do want M4 expansion after # for CPP macros. | |
134 | m4_changecom() | |
135 | m4_divert(0)dnl | |
136 | @output @output_parser_name@ | |
137 | b4_copyright([Skeleton parser for Yacc-like parsing with Bison], | |
138 | [1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004, 2005])[ | |
139 | ||
140 | /* As a special exception, when this file is copied by Bison into a | |
141 | Bison output file, you may use that output file without restriction. | |
142 | This special exception was added by the Free Software Foundation | |
143 | in version 1.24 of Bison. */ | |
144 | ||
145 | /* Written by Richard Stallman by simplifying the original so called | |
146 | ``semantic'' parser. */ | |
147 | ||
148 | /* All symbols defined below should begin with yy or YY, to avoid | |
149 | infringing on user name space. This should be done even for local | |
150 | variables, as they might otherwise be expanded by user macros. | |
151 | There are some unavoidable exceptions within include files to | |
152 | define necessary library symbols; they are noted "INFRINGES ON | |
153 | USER NAME SPACE" below. */ | |
154 | ||
155 | ]b4_identification | |
156 | m4_if(b4_prefix[], [yy], [], | |
157 | [/* Substitute the variable and function names. */ | |
158 | #define yyparse b4_prefix[]parse | |
159 | #define yylex b4_prefix[]lex | |
160 | #define yyerror b4_prefix[]error | |
161 | #define yylval b4_prefix[]lval | |
162 | #define yychar b4_prefix[]char | |
163 | #define yydebug b4_prefix[]debug | |
164 | #define yynerrs b4_prefix[]nerrs | |
165 | b4_location_if([#define yylloc b4_prefix[]lloc])])[ | |
166 | ||
167 | ]b4_token_enums_defines(b4_tokens)[ | |
168 | ||
169 | /* Copy the first part of user declarations. */ | |
170 | ]b4_pre_prologue[ | |
171 | ||
172 | /* Enabling traces. */ | |
173 | #ifndef YYDEBUG | |
174 | # define YYDEBUG ]b4_debug[ | |
175 | #endif | |
176 | ||
177 | /* Enabling verbose error messages. */ | |
178 | #ifdef YYERROR_VERBOSE | |
179 | # undef YYERROR_VERBOSE | |
180 | # define YYERROR_VERBOSE 1 | |
181 | #else | |
182 | # define YYERROR_VERBOSE ]b4_error_verbose[ | |
183 | #endif | |
184 | ||
185 | /* Enabling the token table. */ | |
186 | #ifndef YYTOKEN_TABLE | |
187 | # define YYTOKEN_TABLE ]b4_token_table[ | |
188 | #endif | |
189 | ||
190 | #if ! defined (YYSTYPE) && ! defined (YYSTYPE_IS_DECLARED) | |
191 | ]m4_ifdef([b4_stype], | |
192 | [b4_syncline([b4_stype_line], [b4_file_name]) | |
193 | typedef union m4_bregexp(b4_stype, [^{], [YYSTYPE ])b4_stype YYSTYPE; | |
194 | /* Line __line__ of yacc.c. */ | |
195 | b4_syncline([@oline@], [@ofile@])], | |
196 | [typedef int YYSTYPE;])[ | |
197 | # define yystype YYSTYPE /* obsolescent; will be withdrawn */ | |
198 | # define YYSTYPE_IS_DECLARED 1 | |
199 | # define YYSTYPE_IS_TRIVIAL 1 | |
200 | #endif | |
201 | ||
202 | ]b4_location_if([#if ! defined (YYLTYPE) && ! defined (YYLTYPE_IS_DECLARED) | |
203 | typedef struct YYLTYPE | |
204 | { | |
205 | int first_line; | |
206 | int first_column; | |
207 | int last_line; | |
208 | int last_column; | |
209 | } YYLTYPE; | |
210 | # define yyltype YYLTYPE /* obsolescent; will be withdrawn */ | |
211 | # define YYLTYPE_IS_DECLARED 1 | |
212 | # define YYLTYPE_IS_TRIVIAL 1 | |
213 | #endif | |
214 | ])[ | |
215 | ||
216 | /* Copy the second part of user declarations. */ | |
217 | ]b4_post_prologue | |
218 | ||
219 | /* Line __line__ of yacc.c. */ | |
220 | b4_syncline([@oline@], [@ofile@])[ | |
221 | ||
222 | /* Define YYMODERN_C if this compiler supports C89 or better. If | |
223 | __STDC__ is defined, the compiler is modern. IBM xlc 7.0 when run | |
224 | as 'cc' doesn't define __STDC__ (or __STDC_VERSION__) for pedantic | |
225 | reasons, but it defines __C99__FUNC__ so check that as well. | |
226 | Consider a C++ compiler to be modern if it defines __cplusplus. */ | |
227 | #ifndef YYMODERN_C | |
228 | # if defined (__STDC__) || defined (__C99__FUNC__) || defined (__cplusplus) | |
229 | # define YYMODERN_C 1 | |
230 | # else | |
231 | # define YYMODERN_C 0 | |
232 | # endif | |
233 | #endif | |
234 | ||
235 | #ifndef YYSIZE_T | |
236 | # if defined (__SIZE_TYPE__) | |
237 | # define YYSIZE_T __SIZE_TYPE__ | |
238 | # elif defined (size_t) | |
239 | # define YYSIZE_T size_t | |
240 | # elif ! defined (YYSIZE_T) && YYMODERN_C | |
241 | # include <stddef.h> /* INFRINGES ON USER NAME SPACE */ | |
242 | # define YYSIZE_T size_t | |
243 | # else | |
244 | # define YYSIZE_T unsigned int | |
245 | # endif | |
246 | #endif | |
247 | ||
248 | #define YYSIZE_MAXIMUM ((YYSIZE_T) -1) | |
249 | ||
250 | #ifndef YY_ | |
251 | # if YYENABLE_NLS | |
252 | # if ENABLE_NLS | |
253 | # include <libintl.h> /* INFRINGES ON USER NAME SPACE */ | |
254 | # define YY_(msgid) dgettext ("bison-runtime", msgid) | |
255 | # endif | |
256 | # endif | |
257 | # ifndef YY_ | |
258 | # define YY_(msgid) msgid | |
259 | # endif | |
260 | #endif | |
261 | ||
262 | /* Suppress unused-variable warnings by "using" E. */ | |
263 | #define YYUSE(e) do {;} while (/*CONSTCOND*/ 0 && (e)) | |
264 | ||
265 | #if ! defined (yyoverflow) || YYERROR_VERBOSE | |
266 | ||
267 | /* The parser invokes alloca or malloc; define the necessary symbols. */ | |
268 | ||
269 | # ifdef YYSTACK_USE_ALLOCA | |
270 | # if YYSTACK_USE_ALLOCA | |
271 | # ifdef __GNUC__ | |
272 | # define YYSTACK_ALLOC __builtin_alloca | |
273 | # elif defined (__BUILTIN_VA_ARG_INCR) | |
274 | # include <alloca.h> /* INFRINGES ON USER NAME SPACE */ | |
275 | # elif defined (_AIX) | |
276 | # define YYSTACK_ALLOC __alloca | |
277 | # elif defined (_MSC_VER) | |
278 | # include <malloc.h> /* INFRINGES ON USER NAME SPACE */ | |
279 | # define alloca _alloca | |
280 | # else | |
281 | # define YYSTACK_ALLOC alloca | |
282 | # if ! defined (_ALLOCA_H) && ! defined (_STDLIB_H) && YYMODERN_C | |
283 | # include <stdlib.h> /* INFRINGES ON USER NAME SPACE */ | |
284 | # ifndef _STDLIB_H | |
285 | # define _STDLIB_H 1 | |
286 | # endif | |
287 | # endif | |
288 | # endif | |
289 | # endif | |
290 | # endif | |
291 | ||
292 | # ifdef YYSTACK_ALLOC | |
293 | /* Pacify GCC's `empty if-body' warning. */ | |
294 | # define YYSTACK_FREE(Ptr) do { /* empty */; } while (0) | |
295 | # ifndef YYSTACK_ALLOC_MAXIMUM | |
296 | /* The OS might guarantee only one guard page at the bottom of the stack, | |
297 | and a page size can be as small as 4096 bytes. So we cannot safely | |
298 | invoke alloca (N) if N exceeds 4096. Use a slightly smaller number | |
299 | to allow for a few compiler-allocated temporary stack slots. */ | |
300 | # define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2005 */ | |
301 | # endif | |
302 | # else | |
303 | # define YYSTACK_ALLOC YYMALLOC | |
304 | # define YYSTACK_FREE YYFREE | |
305 | # ifndef YYSTACK_ALLOC_MAXIMUM | |
306 | # define YYSTACK_ALLOC_MAXIMUM YYSIZE_MAXIMUM | |
307 | # endif | |
308 | # ifdef __cplusplus | |
309 | extern "C" { | |
310 | # endif | |
311 | # ifndef YYMALLOC | |
312 | # define YYMALLOC malloc | |
313 | # if ! defined (malloc) && ! defined (_STDLIB_H) && YYMODERN_C | |
314 | void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */ | |
315 | # endif | |
316 | # endif | |
317 | # ifndef YYFREE | |
318 | # define YYFREE free | |
319 | # if ! defined (free) && ! defined (_STDLIB_H) && YYMODERN_C | |
320 | void free (void *); /* INFRINGES ON USER NAME SPACE */ | |
321 | # endif | |
322 | # endif | |
323 | # ifdef __cplusplus | |
324 | } | |
325 | # endif | |
326 | # endif | |
327 | #endif /* ! defined (yyoverflow) || YYERROR_VERBOSE */ | |
328 | ||
329 | ||
330 | #if (! defined (yyoverflow) \ | |
331 | && (! defined (__cplusplus) \ | |
332 | || (]b4_location_if([[defined (YYLTYPE_IS_TRIVIAL) && YYLTYPE_IS_TRIVIAL \ | |
333 | && ]])[defined (YYSTYPE_IS_TRIVIAL) && YYSTYPE_IS_TRIVIAL))) | |
334 | ||
335 | /* A type that is properly aligned for any stack member. */ | |
336 | union yyalloc | |
337 | { | |
338 | short int yyss; | |
339 | YYSTYPE yyvs; | |
340 | ]b4_location_if([ YYLTYPE yyls; | |
341 | ])dnl | |
342 | [}; | |
343 | ||
344 | /* The size of the maximum gap between one aligned stack and the next. */ | |
345 | # define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1) | |
346 | ||
347 | /* The size of an array large to enough to hold all stacks, each with | |
348 | N elements. */ | |
349 | ]b4_location_if( | |
350 | [# define YYSTACK_BYTES(N) \ | |
351 | ((N) * (sizeof (short int) + sizeof (YYSTYPE) + sizeof (YYLTYPE)) \ | |
352 | + 2 * YYSTACK_GAP_MAXIMUM)], | |
353 | [# define YYSTACK_BYTES(N) \ | |
354 | ((N) * (sizeof (short int) + sizeof (YYSTYPE)) \ | |
355 | + YYSTACK_GAP_MAXIMUM)])[ | |
356 | ||
357 | /* Copy COUNT objects from FROM to TO. The source and destination do | |
358 | not overlap. */ | |
359 | # ifndef YYCOPY | |
360 | # if defined (__GNUC__) && 1 < __GNUC__ | |
361 | # define YYCOPY(To, From, Count) \ | |
362 | __builtin_memcpy (To, From, (Count) * sizeof (*(From))) | |
363 | # else | |
364 | # define YYCOPY(To, From, Count) \ | |
365 | do \ | |
366 | { \ | |
367 | YYSIZE_T yyi; \ | |
368 | for (yyi = 0; yyi < (Count); yyi++) \ | |
369 | (To)[yyi] = (From)[yyi]; \ | |
370 | } \ | |
371 | while (/*CONSTCOND*/ 0) | |
372 | # endif | |
373 | # endif | |
374 | ||
375 | /* Relocate STACK from its old location to the new one. The | |
376 | local variables YYSIZE and YYSTACKSIZE give the old and new number of | |
377 | elements in the stack, and YYPTR gives the new location of the | |
378 | stack. Advance YYPTR to a properly aligned location for the next | |
379 | stack. */ | |
380 | # define YYSTACK_RELOCATE(Stack) \ | |
381 | do \ | |
382 | { \ | |
383 | YYSIZE_T yynewbytes; \ | |
384 | YYCOPY (&yyptr->Stack, Stack, yysize); \ | |
385 | Stack = &yyptr->Stack; \ | |
386 | yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \ | |
387 | yyptr += yynewbytes / sizeof (*yyptr); \ | |
388 | } \ | |
389 | while (/*CONSTCOND*/ 0) | |
390 | ||
391 | #endif | |
392 | ||
393 | #if YYMODERN_C | |
394 | typedef signed char yysigned_char; | |
395 | #else | |
396 | typedef short int yysigned_char; | |
397 | #endif | |
398 | ||
399 | /* YYFINAL -- State number of the termination state. */ | |
400 | #define YYFINAL ]b4_final_state_number[ | |
401 | /* YYLAST -- Last index in YYTABLE. */ | |
402 | #define YYLAST ]b4_last[ | |
403 | ||
404 | /* YYNTOKENS -- Number of terminals. */ | |
405 | #define YYNTOKENS ]b4_tokens_number[ | |
406 | /* YYNNTS -- Number of nonterminals. */ | |
407 | #define YYNNTS ]b4_nterms_number[ | |
408 | /* YYNRULES -- Number of rules. */ | |
409 | #define YYNRULES ]b4_rules_number[ | |
410 | /* YYNRULES -- Number of states. */ | |
411 | #define YYNSTATES ]b4_states_number[ | |
412 | ||
413 | /* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */ | |
414 | #define YYUNDEFTOK ]b4_undef_token_number[ | |
415 | #define YYMAXUTOK ]b4_user_token_number_max[ | |
416 | ||
417 | #define YYTRANSLATE(YYX) \ | |
418 | ((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK) | |
419 | ||
420 | /* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX. */ | |
421 | static const ]b4_int_type_for([b4_translate])[ yytranslate[] = | |
422 | { | |
423 | ]b4_translate[ | |
424 | }; | |
425 | ||
426 | #if YYDEBUG | |
427 | /* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in | |
428 | YYRHS. */ | |
429 | static const ]b4_int_type_for([b4_prhs])[ yyprhs[] = | |
430 | { | |
431 | ]b4_prhs[ | |
432 | }; | |
433 | ||
434 | /* YYRHS -- A `-1'-separated list of the rules' RHS. */ | |
435 | static const ]b4_int_type_for([b4_rhs])[ yyrhs[] = | |
436 | { | |
437 | ]b4_rhs[ | |
438 | }; | |
439 | ||
440 | /* YYRLINE[YYN] -- source line where rule number YYN was defined. */ | |
441 | static const ]b4_int_type_for([b4_rline])[ yyrline[] = | |
442 | { | |
443 | ]b4_rline[ | |
444 | }; | |
445 | #endif | |
446 | ||
447 | #if YYDEBUG || YYERROR_VERBOSE || YYTOKEN_TABLE | |
448 | /* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM. | |
449 | First, the terminals, then, starting at YYNTOKENS, nonterminals. */ | |
450 | static const char *const yytname[] = | |
451 | { | |
452 | ]b4_tname[ | |
453 | }; | |
454 | #endif | |
455 | ||
456 | # ifdef YYPRINT | |
457 | /* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to | |
458 | token YYLEX-NUM. */ | |
459 | static const ]b4_int_type_for([b4_toknum])[ yytoknum[] = | |
460 | { | |
461 | ]b4_toknum[ | |
462 | }; | |
463 | # endif | |
464 | ||
465 | /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */ | |
466 | static const ]b4_int_type_for([b4_r1])[ yyr1[] = | |
467 | { | |
468 | ]b4_r1[ | |
469 | }; | |
470 | ||
471 | /* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */ | |
472 | static const ]b4_int_type_for([b4_r2])[ yyr2[] = | |
473 | { | |
474 | ]b4_r2[ | |
475 | }; | |
476 | ||
477 | /* YYDEFACT[STATE-NAME] -- Default rule to reduce with in state | |
478 | STATE-NUM when YYTABLE doesn't specify something else to do. Zero | |
479 | means the default is an error. */ | |
480 | static const ]b4_int_type_for([b4_defact])[ yydefact[] = | |
481 | { | |
482 | ]b4_defact[ | |
483 | }; | |
484 | ||
485 | /* YYDEFGOTO[NTERM-NUM]. */ | |
486 | static const ]b4_int_type_for([b4_defgoto])[ yydefgoto[] = | |
487 | { | |
488 | ]b4_defgoto[ | |
489 | }; | |
490 | ||
491 | /* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing | |
492 | STATE-NUM. */ | |
493 | #define YYPACT_NINF ]b4_pact_ninf[ | |
494 | static const ]b4_int_type_for([b4_pact])[ yypact[] = | |
495 | { | |
496 | ]b4_pact[ | |
497 | }; | |
498 | ||
499 | /* YYPGOTO[NTERM-NUM]. */ | |
500 | static const ]b4_int_type_for([b4_pgoto])[ yypgoto[] = | |
501 | { | |
502 | ]b4_pgoto[ | |
503 | }; | |
504 | ||
505 | /* YYTABLE[YYPACT[STATE-NUM]]. What to do in state STATE-NUM. If | |
506 | positive, shift that token. If negative, reduce the rule which | |
507 | number is the opposite. If zero, do what YYDEFACT says. | |
508 | If YYTABLE_NINF, syntax error. */ | |
509 | #define YYTABLE_NINF ]b4_table_ninf[ | |
510 | static const ]b4_int_type_for([b4_table])[ yytable[] = | |
511 | { | |
512 | ]b4_table[ | |
513 | }; | |
514 | ||
515 | static const ]b4_int_type_for([b4_check])[ yycheck[] = | |
516 | { | |
517 | ]b4_check[ | |
518 | }; | |
519 | ||
520 | /* YYSTOS[STATE-NUM] -- The (internal number of the) accessing | |
521 | symbol of state STATE-NUM. */ | |
522 | static const ]b4_int_type_for([b4_stos])[ yystos[] = | |
523 | { | |
524 | ]b4_stos[ | |
525 | }; | |
526 | ||
527 | #define yyerrok (yyerrstatus = 0) | |
528 | #define yyclearin (yychar = YYEMPTY) | |
529 | #define YYEMPTY (-2) | |
530 | #define YYEOF 0 | |
531 | ||
532 | #define YYACCEPT goto yyacceptlab | |
533 | #define YYABORT goto yyabortlab | |
534 | #define YYERROR goto yyerrorlab | |
535 | ||
536 | ||
537 | /* Like YYERROR except do call yyerror. This remains here temporarily | |
538 | to ease the transition to the new meaning of YYERROR, for GCC. | |
539 | Once GCC version 2 has supplanted version 1, this can go. */ | |
540 | ||
541 | #define YYFAIL goto yyerrlab | |
542 | ||
543 | #define YYRECOVERING() (!!yyerrstatus) | |
544 | ||
545 | #define YYBACKUP(Token, Value) \ | |
546 | do \ | |
547 | if (yychar == YYEMPTY && yylen == 1) \ | |
548 | { \ | |
549 | yychar = (Token); \ | |
550 | yylval = (Value); \ | |
551 | yytoken = YYTRANSLATE (yychar); \ | |
552 | YYPOPSTACK; \ | |
553 | goto yybackup; \ | |
554 | } \ | |
555 | else \ | |
556 | { \ | |
557 | yyerror (]b4_yyerror_args[YY_("syntax error: cannot back up")); \ | |
558 | YYERROR; \ | |
559 | } \ | |
560 | while (/*CONSTCOND*/ 0) | |
561 | ||
562 | ||
563 | #define YYTERROR 1 | |
564 | #define YYERRCODE 256 | |
565 | ||
566 | ||
567 | /* YYLLOC_DEFAULT -- Set CURRENT to span from RHS[1] to RHS[N]. | |
568 | If N is 0, then set CURRENT to the empty location which ends | |
569 | the previous symbol: RHS[0] (always defined). */ | |
570 | ||
571 | #define YYRHSLOC(Rhs, K) ((Rhs)[K]) | |
572 | #ifndef YYLLOC_DEFAULT | |
573 | # define YYLLOC_DEFAULT(Current, Rhs, N) \ | |
574 | do \ | |
575 | if (N) \ | |
576 | { \ | |
577 | (Current).first_line = YYRHSLOC (Rhs, 1).first_line; \ | |
578 | (Current).first_column = YYRHSLOC (Rhs, 1).first_column; \ | |
579 | (Current).last_line = YYRHSLOC (Rhs, N).last_line; \ | |
580 | (Current).last_column = YYRHSLOC (Rhs, N).last_column; \ | |
581 | } \ | |
582 | else \ | |
583 | { \ | |
584 | (Current).first_line = (Current).last_line = \ | |
585 | YYRHSLOC (Rhs, 0).last_line; \ | |
586 | (Current).first_column = (Current).last_column = \ | |
587 | YYRHSLOC (Rhs, 0).last_column; \ | |
588 | } \ | |
589 | while (/*CONSTCOND*/ 0) | |
590 | #endif | |
591 | ||
592 | ||
593 | /* YY_LOCATION_PRINT -- Print the location on the stream. | |
594 | This macro was not mandated originally: define only if we know | |
595 | we won't break user code: when these are the locations we know. */ | |
596 | ||
597 | #ifndef YY_LOCATION_PRINT | |
598 | # if YYLTYPE_IS_TRIVIAL | |
599 | # define YY_LOCATION_PRINT(File, Loc) \ | |
600 | fprintf (File, "%d.%d-%d.%d", \ | |
601 | (Loc).first_line, (Loc).first_column, \ | |
602 | (Loc).last_line, (Loc).last_column) | |
603 | # else | |
604 | # define YY_LOCATION_PRINT(File, Loc) ((void) 0) | |
605 | # endif | |
606 | #endif | |
607 | ||
608 | ||
609 | /* YYLEX -- calling `yylex' with the right arguments. */ | |
610 | ||
611 | #ifdef YYLEX_PARAM | |
612 | # define YYLEX yylex (]b4_pure_if([&yylval[]b4_location_if([, &yylloc]), ])[YYLEX_PARAM) | |
613 | #else | |
614 | # define YYLEX ]b4_c_function_call([yylex], [int], b4_lex_param)[ | |
615 | #endif | |
616 | ||
617 | /* Enable debugging if requested. */ | |
618 | #if YYDEBUG | |
619 | ||
620 | # ifndef YYFPRINTF | |
621 | # include <stdio.h> /* INFRINGES ON USER NAME SPACE */ | |
622 | # define YYFPRINTF fprintf | |
623 | # endif | |
624 | ||
625 | # define YYDPRINTF(Args) \ | |
626 | do { \ | |
627 | if (yydebug) \ | |
628 | YYFPRINTF Args; \ | |
629 | } while (/*CONSTCOND*/ 0) | |
630 | ||
631 | # define YY_SYMBOL_PRINT(Title, Type, Value, Location) \ | |
632 | do { \ | |
633 | if (yydebug) \ | |
634 | { \ | |
635 | YYFPRINTF (stderr, "%s ", Title); \ | |
636 | yysymprint (stderr, \ | |
637 | Type, Value]b4_location_if([, Location])[); \ | |
638 | YYFPRINTF (stderr, "\n"); \ | |
639 | } \ | |
640 | } while (/*CONSTCOND*/ 0) | |
641 | ||
642 | /*------------------------------------------------------------------. | |
643 | | yy_stack_print -- Print the state stack from its BOTTOM up to its | | |
644 | | TOP (included). | | |
645 | `------------------------------------------------------------------*/ | |
646 | ||
647 | ]b4_c_function_def([yy_stack_print], [static void], | |
648 | [[short int *bottom], [bottom]], | |
649 | [[short int *top], [top]])[ | |
650 | { | |
651 | YYFPRINTF (stderr, "Stack now"); | |
652 | for (/* Nothing. */; bottom <= top; ++bottom) | |
653 | YYFPRINTF (stderr, " %d", *bottom); | |
654 | YYFPRINTF (stderr, "\n"); | |
655 | } | |
656 | ||
657 | # define YY_STACK_PRINT(Bottom, Top) \ | |
658 | do { \ | |
659 | if (yydebug) \ | |
660 | yy_stack_print ((Bottom), (Top)); \ | |
661 | } while (/*CONSTCOND*/ 0) | |
662 | ||
663 | ||
664 | /*------------------------------------------------. | |
665 | | Report that the YYRULE is going to be reduced. | | |
666 | `------------------------------------------------*/ | |
667 | ||
668 | ]b4_c_function_def([yy_reduce_print], [static void], | |
669 | [[int yyrule], [yyrule]])[ | |
670 | { | |
671 | int yyi; | |
672 | unsigned long int yylno = yyrline[yyrule]; | |
673 | YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu), ", | |
674 | yyrule - 1, yylno); | |
675 | /* Print the symbols being reduced, and their result. */ | |
676 | for (yyi = yyprhs[yyrule]; 0 <= yyrhs[yyi]; yyi++) | |
677 | YYFPRINTF (stderr, "%s ", yytname[yyrhs[yyi]]); | |
678 | YYFPRINTF (stderr, "-> %s\n", yytname[yyr1[yyrule]]); | |
679 | } | |
680 | ||
681 | # define YY_REDUCE_PRINT(Rule) \ | |
682 | do { \ | |
683 | if (yydebug) \ | |
684 | yy_reduce_print (Rule); \ | |
685 | } while (/*CONSTCOND*/ 0) | |
686 | ||
687 | /* Nonzero means print parse trace. It is left uninitialized so that | |
688 | multiple parsers can coexist. */ | |
689 | int yydebug; | |
690 | #else /* !YYDEBUG */ | |
691 | # define YYDPRINTF(Args) | |
692 | # define YY_SYMBOL_PRINT(Title, Type, Value, Location) | |
693 | # define YY_STACK_PRINT(Bottom, Top) | |
694 | # define YY_REDUCE_PRINT(Rule) | |
695 | #endif /* !YYDEBUG */ | |
696 | ||
697 | ||
698 | /* YYINITDEPTH -- initial size of the parser's stacks. */ | |
699 | #ifndef YYINITDEPTH | |
700 | # define YYINITDEPTH ]b4_stack_depth_init[ | |
701 | #endif | |
702 | ||
703 | /* YYMAXDEPTH -- maximum size the stacks can grow to (effective only | |
704 | if the built-in stack extension method is used). | |
705 | ||
706 | Do not make this value too large; the results are undefined if | |
707 | YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH) | |
708 | evaluated with infinite-precision integer arithmetic. */ | |
709 | ||
710 | #ifndef YYMAXDEPTH | |
711 | # define YYMAXDEPTH ]b4_stack_depth_max[ | |
712 | #endif | |
713 | ||
714 | \f | |
715 | ||
716 | #if YYERROR_VERBOSE | |
717 | ||
718 | # ifndef yystrlen | |
719 | # if defined (__GLIBC__) && defined (_STRING_H) | |
720 | # define yystrlen strlen | |
721 | # else | |
722 | /* Return the length of YYSTR. */ | |
723 | static YYSIZE_T | |
724 | # if YYMODERN_C | |
725 | yystrlen (const char *yystr) | |
726 | # else | |
727 | yystrlen (yystr) | |
728 | const char *yystr; | |
729 | # endif | |
730 | { | |
731 | const char *yys = yystr; | |
732 | ||
733 | while (*yys++ != '\0') | |
734 | continue; | |
735 | ||
736 | return yys - yystr - 1; | |
737 | } | |
738 | # endif | |
739 | # endif | |
740 | ||
741 | # ifndef yystpcpy | |
742 | # if defined (__GLIBC__) && defined (_STRING_H) && defined (_GNU_SOURCE) | |
743 | # define yystpcpy stpcpy | |
744 | # else | |
745 | /* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in | |
746 | YYDEST. */ | |
747 | static char * | |
748 | # if YYMODERN_C | |
749 | yystpcpy (char *yydest, const char *yysrc) | |
750 | # else | |
751 | yystpcpy (yydest, yysrc) | |
752 | char *yydest; | |
753 | const char *yysrc; | |
754 | # endif | |
755 | { | |
756 | char *yyd = yydest; | |
757 | const char *yys = yysrc; | |
758 | ||
759 | while ((*yyd++ = *yys++) != '\0') | |
760 | continue; | |
761 | ||
762 | return yyd - 1; | |
763 | } | |
764 | # endif | |
765 | # endif | |
766 | ||
767 | # ifndef yytnamerr | |
768 | /* Copy to YYRES the contents of YYSTR after stripping away unnecessary | |
769 | quotes and backslashes, so that it's suitable for yyerror. The | |
770 | heuristic is that double-quoting is unnecessary unless the string | |
771 | contains an apostrophe, a comma, or backslash (other than | |
772 | backslash-backslash). YYSTR is taken from yytname. If YYRES is | |
773 | null, do not copy; instead, return the length of what the result | |
774 | would have been. */ | |
775 | static YYSIZE_T | |
776 | yytnamerr (char *yyres, const char *yystr) | |
777 | { | |
778 | if (*yystr == '"') | |
779 | { | |
780 | size_t yyn = 0; | |
781 | char const *yyp = yystr; | |
782 | ||
783 | for (;;) | |
784 | switch (*++yyp) | |
785 | { | |
786 | case '\'': | |
787 | case ',': | |
788 | goto do_not_strip_quotes; | |
789 | ||
790 | case '\\': | |
791 | if (*++yyp != '\\') | |
792 | goto do_not_strip_quotes; | |
793 | /* Fall through. */ | |
794 | default: | |
795 | if (yyres) | |
796 | yyres[yyn] = *yyp; | |
797 | yyn++; | |
798 | break; | |
799 | ||
800 | case '"': | |
801 | if (yyres) | |
802 | yyres[yyn] = '\0'; | |
803 | return yyn; | |
804 | } | |
805 | do_not_strip_quotes: ; | |
806 | } | |
807 | ||
808 | if (! yyres) | |
809 | return yystrlen (yystr); | |
810 | ||
811 | return yystpcpy (yyres, yystr) - yyres; | |
812 | } | |
813 | # endif | |
814 | ||
815 | /* Copy into YYRESULT an error message about the unexpected token | |
816 | YYCHAR while in state YYSTATE. Return the number of bytes copied, | |
817 | including the terminating null byte. If YYRESULT is null, do not | |
818 | copy anything; just return the number of bytes that would be | |
819 | copied. As a special case, return 0 if an ordinary "syntax error" | |
820 | message will do. Return YYSIZE_MAXIMUM if overflow occurs during | |
821 | size calculation. */ | |
822 | static YYSIZE_T | |
823 | yysyntax_error (char *yyresult, int yystate, int yychar) | |
824 | { | |
825 | int yyn = yypact[yystate]; | |
826 | ||
827 | if (! (YYPACT_NINF < yyn && yyn < YYLAST)) | |
828 | return 0; | |
829 | else | |
830 | { | |
831 | int yytype = YYTRANSLATE (yychar); | |
832 | YYSIZE_T yysize0 = yytnamerr (0, yytname[yytype]); | |
833 | YYSIZE_T yysize = yysize0; | |
834 | YYSIZE_T yysize1; | |
835 | int yysize_overflow = 0; | |
836 | enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 }; | |
837 | char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM]; | |
838 | int yyx; | |
839 | ||
840 | # if 0 | |
841 | /* This is so xgettext sees the translatable formats that are | |
842 | constructed on the fly. */ | |
843 | YY_("syntax error, unexpected %s"); | |
844 | YY_("syntax error, unexpected %s, expecting %s"); | |
845 | YY_("syntax error, unexpected %s, expecting %s or %s"); | |
846 | YY_("syntax error, unexpected %s, expecting %s or %s or %s"); | |
847 | YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s"); | |
848 | # endif | |
849 | char *yyfmt; | |
850 | char const *yyf; | |
851 | static char const yyunexpected[] = "syntax error, unexpected %s"; | |
852 | static char const yyexpecting[] = ", expecting %s"; | |
853 | static char const yyor[] = " or %s"; | |
854 | char yyformat[sizeof yyunexpected | |
855 | + sizeof yyexpecting - 1 | |
856 | + ((YYERROR_VERBOSE_ARGS_MAXIMUM - 2) | |
857 | * (sizeof yyor - 1))]; | |
858 | char const *yyprefix = yyexpecting; | |
859 | ||
860 | /* Start YYX at -YYN if negative to avoid negative indexes in | |
861 | YYCHECK. */ | |
862 | int yyxbegin = yyn < 0 ? -yyn : 0; | |
863 | ||
864 | /* Stay within bounds of both yycheck and yytname. */ | |
865 | int yychecklim = YYLAST - yyn; | |
866 | int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS; | |
867 | int yycount = 1; | |
868 | ||
869 | yyarg[0] = yytname[yytype]; | |
870 | yyfmt = yystpcpy (yyformat, yyunexpected); | |
871 | ||
872 | for (yyx = yyxbegin; yyx < yyxend; ++yyx) | |
873 | if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR) | |
874 | { | |
875 | if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM) | |
876 | { | |
877 | yycount = 1; | |
878 | yysize = yysize0; | |
879 | yyformat[sizeof yyunexpected - 1] = '\0'; | |
880 | break; | |
881 | } | |
882 | yyarg[yycount++] = yytname[yyx]; | |
883 | yysize1 = yysize + yytnamerr (0, yytname[yyx]); | |
884 | yysize_overflow |= yysize1 < yysize; | |
885 | yysize = yysize1; | |
886 | yyfmt = yystpcpy (yyfmt, yyprefix); | |
887 | yyprefix = yyor; | |
888 | } | |
889 | ||
890 | yyf = YY_(yyformat); | |
891 | yysize1 = yysize + yystrlen (yyf); | |
892 | yysize_overflow |= yysize1 < yysize; | |
893 | yysize = yysize1; | |
894 | ||
895 | if (yysize_overflow) | |
896 | return YYSIZE_MAXIMUM; | |
897 | ||
898 | if (yyresult) | |
899 | { | |
900 | /* Avoid sprintf, as that infringes on the user's name space. | |
901 | Don't have undefined behavior even if the translation | |
902 | produced a string with the wrong number of "%s"s. */ | |
903 | char *yyp = yyresult; | |
904 | int yyi = 0; | |
905 | while ((*yyp = *yyf)) | |
906 | { | |
907 | if (*yyp == '%' && yyf[1] == 's' && yyi < yycount) | |
908 | { | |
909 | yyp += yytnamerr (yyp, yyarg[yyi++]); | |
910 | yyf += 2; | |
911 | } | |
912 | else | |
913 | { | |
914 | yyp++; | |
915 | yyf++; | |
916 | } | |
917 | } | |
918 | } | |
919 | return yysize; | |
920 | } | |
921 | } | |
922 | #endif /* YYERROR_VERBOSE */ | |
923 | \f | |
924 | ||
925 | #if YYDEBUG | |
926 | ]b4_yysymprint_generate([b4_c_function_def])[ | |
927 | #endif /* ! YYDEBUG */ | |
928 | ]b4_yydestruct_generate([b4_c_function_def]) | |
929 | \f | |
930 | ||
931 | /* Prevent warnings from -Wmissing-prototypes. */ | |
932 | ||
933 | #ifdef YYPARSE_PARAM | |
934 | # if YYMODERN_C | |
935 | int yyparse (void *YYPARSE_PARAM); | |
936 | # else | |
937 | int yyparse (); | |
938 | # endif | |
939 | #else /* ! YYPARSE_PARAM */ | |
940 | b4_c_function_decl([yyparse], [int], b4_parse_param) | |
941 | #endif /* ! YYPARSE_PARAM */ | |
942 | ||
943 | ||
944 | m4_divert_push([KILL])# ======================== M4 code. | |
945 | # b4_declare_parser_variables | |
946 | # --------------------------- | |
947 | # Declare the variables that are global, or local to YYPARSE if | |
948 | # pure-parser. | |
949 | m4_define([b4_declare_parser_variables], | |
950 | [/* The look-ahead symbol. */ | |
951 | int yychar; | |
952 | ||
953 | /* The semantic value of the look-ahead symbol. */ | |
954 | YYSTYPE yylval; | |
955 | ||
956 | /* Number of syntax errors so far. */ | |
957 | int yynerrs;b4_location_if([ | |
958 | /* Location data for the look-ahead symbol. */ | |
959 | YYLTYPE yylloc;]) | |
960 | ]) | |
961 | m4_divert_pop([KILL])dnl# ====================== End of M4 code. | |
962 | ||
963 | b4_pure_if([], | |
964 | [b4_declare_parser_variables]) | |
965 | ||
966 | ||
967 | /*----------. | |
968 | | yyparse. | | |
969 | `----------*/ | |
970 | ||
971 | #ifdef YYPARSE_PARAM | |
972 | # if YYMODERN_C | |
973 | int yyparse (void *YYPARSE_PARAM) | |
974 | # else | |
975 | int yyparse (YYPARSE_PARAM) | |
976 | void *YYPARSE_PARAM; | |
977 | # endif | |
978 | #else /* ! YYPARSE_PARAM */ | |
979 | b4_c_function_def([yyparse], [int], b4_parse_param) | |
980 | #endif | |
981 | {[ | |
982 | ]b4_pure_if([b4_declare_parser_variables])[ | |
983 | int yystate; | |
984 | int yyn; | |
985 | int yyresult; | |
986 | /* Number of tokens to shift before error messages enabled. */ | |
987 | int yyerrstatus; | |
988 | /* Look-ahead token as an internal (translated) token number. */ | |
989 | int yytoken = 0; | |
990 | #if YYERROR_VERBOSE | |
991 | /* Buffer for error messages, and its allocated size. */ | |
992 | char yymsgbuf[128]; | |
993 | char *yymsg = yymsgbuf; | |
994 | YYSIZE_T yymsg_alloc = sizeof yymsgbuf; | |
995 | #endif | |
996 | ||
997 | /* Three stacks and their tools: | |
998 | `yyss': related to states, | |
999 | `yyvs': related to semantic values, | |
1000 | `yyls': related to locations. | |
1001 | ||
1002 | Refer to the stacks thru separate pointers, to allow yyoverflow | |
1003 | to reallocate them elsewhere. */ | |
1004 | ||
1005 | /* The state stack. */ | |
1006 | short int yyssa[YYINITDEPTH]; | |
1007 | short int *yyss = yyssa; | |
1008 | short int *yyssp; | |
1009 | ||
1010 | /* The semantic value stack. */ | |
1011 | YYSTYPE yyvsa[YYINITDEPTH]; | |
1012 | YYSTYPE *yyvs = yyvsa; | |
1013 | YYSTYPE *yyvsp; | |
1014 | ||
1015 | ]b4_location_if( | |
1016 | [[ /* The location stack. */ | |
1017 | YYLTYPE yylsa[YYINITDEPTH]; | |
1018 | YYLTYPE *yyls = yylsa; | |
1019 | YYLTYPE *yylsp; | |
1020 | /* The locations where the error started and ended. */ | |
1021 | YYLTYPE yyerror_range[2];]])[ | |
1022 | ||
1023 | #define YYPOPSTACK (yyvsp--, yyssp--]b4_location_if([, yylsp--])[) | |
1024 | ||
1025 | YYSIZE_T yystacksize = YYINITDEPTH; | |
1026 | ||
1027 | /* The variables used to return semantic value and location from the | |
1028 | action routines. */ | |
1029 | YYSTYPE yyval; | |
1030 | ]b4_location_if([ YYLTYPE yyloc;])[ | |
1031 | ||
1032 | /* When reducing, the number of symbols on the RHS of the reduced | |
1033 | rule. */ | |
1034 | int yylen; | |
1035 | ||
1036 | YYDPRINTF ((stderr, "Starting parse\n")); | |
1037 | ||
1038 | yystate = 0; | |
1039 | yyerrstatus = 0; | |
1040 | yynerrs = 0; | |
1041 | yychar = YYEMPTY; /* Cause a token to be read. */ | |
1042 | ||
1043 | /* Initialize stack pointers. | |
1044 | Waste one element of value and location stack | |
1045 | so that they stay on the same level as the state stack. | |
1046 | The wasted elements are never initialized. */ | |
1047 | ||
1048 | yyssp = yyss; | |
1049 | yyvsp = yyvs; | |
1050 | ]b4_location_if([[ yylsp = yyls; | |
1051 | #if YYLTYPE_IS_TRIVIAL | |
1052 | /* Initialize the default location before parsing starts. */ | |
1053 | yylloc.first_line = yylloc.last_line = 1; | |
1054 | yylloc.first_column = yylloc.last_column = 0; | |
1055 | #endif | |
1056 | ]]) | |
1057 | m4_ifdef([b4_initial_action], [ | |
1058 | m4_pushdef([b4_at_dollar], [m4_define([b4_at_dollar_used])yylloc])dnl | |
1059 | m4_pushdef([b4_dollar_dollar], [m4_define([b4_dollar_dollar_used])yylval])dnl | |
1060 | /* User initialization code. */ | |
1061 | b4_initial_action | |
1062 | m4_popdef([b4_dollar_dollar])dnl | |
1063 | m4_popdef([b4_at_dollar])dnl | |
1064 | /* Line __line__ of yacc.c. */ | |
1065 | b4_syncline([@oline@], [@ofile@]) | |
1066 | ])dnl | |
1067 | m4_ifdef([b4_dollar_dollar_used],[[ yyvsp[0] = yylval; | |
1068 | ]])dnl | |
1069 | m4_ifdef([b4_at_dollar_used], [[ yylsp[0] = yylloc; | |
1070 | ]])dnl | |
1071 | [ goto yysetstate; | |
1072 | ||
1073 | /*------------------------------------------------------------. | |
1074 | | yynewstate -- Push a new state, which is found in yystate. | | |
1075 | `------------------------------------------------------------*/ | |
1076 | yynewstate: | |
1077 | /* In all cases, when you get here, the value and location stacks | |
1078 | have just been pushed. so pushing a state here evens the stacks. | |
1079 | */ | |
1080 | yyssp++; | |
1081 | ||
1082 | yysetstate: | |
1083 | *yyssp = yystate; | |
1084 | ||
1085 | if (yyss + yystacksize - 1 <= yyssp) | |
1086 | { | |
1087 | /* Get the current used size of the three stacks, in elements. */ | |
1088 | YYSIZE_T yysize = yyssp - yyss + 1; | |
1089 | ||
1090 | #ifdef yyoverflow | |
1091 | { | |
1092 | /* Give user a chance to reallocate the stack. Use copies of | |
1093 | these so that the &'s don't force the real ones into | |
1094 | memory. */ | |
1095 | YYSTYPE *yyvs1 = yyvs; | |
1096 | short int *yyss1 = yyss; | |
1097 | ]b4_location_if([ YYLTYPE *yyls1 = yyls;])[ | |
1098 | ||
1099 | /* Each stack pointer address is followed by the size of the | |
1100 | data in use in that stack, in bytes. This used to be a | |
1101 | conditional around just the two extra args, but that might | |
1102 | be undefined if yyoverflow is a macro. */ | |
1103 | yyoverflow (YY_("memory exhausted"), | |
1104 | &yyss1, yysize * sizeof (*yyssp), | |
1105 | &yyvs1, yysize * sizeof (*yyvsp), | |
1106 | ]b4_location_if([ &yyls1, yysize * sizeof (*yylsp),])[ | |
1107 | &yystacksize); | |
1108 | ]b4_location_if([ yyls = yyls1;])[ | |
1109 | yyss = yyss1; | |
1110 | yyvs = yyvs1; | |
1111 | } | |
1112 | #else /* no yyoverflow */ | |
1113 | # ifndef YYSTACK_RELOCATE | |
1114 | goto yyexhaustedlab; | |
1115 | # else | |
1116 | /* Extend the stack our own way. */ | |
1117 | if (YYMAXDEPTH <= yystacksize) | |
1118 | goto yyexhaustedlab; | |
1119 | yystacksize *= 2; | |
1120 | if (YYMAXDEPTH < yystacksize) | |
1121 | yystacksize = YYMAXDEPTH; | |
1122 | ||
1123 | { | |
1124 | short int *yyss1 = yyss; | |
1125 | union yyalloc *yyptr = | |
1126 | (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize)); | |
1127 | if (! yyptr) | |
1128 | goto yyexhaustedlab; | |
1129 | YYSTACK_RELOCATE (yyss); | |
1130 | YYSTACK_RELOCATE (yyvs); | |
1131 | ]b4_location_if([ YYSTACK_RELOCATE (yyls);])[ | |
1132 | # undef YYSTACK_RELOCATE | |
1133 | if (yyss1 != yyssa) | |
1134 | YYSTACK_FREE (yyss1); | |
1135 | } | |
1136 | # endif | |
1137 | #endif /* no yyoverflow */ | |
1138 | ||
1139 | yyssp = yyss + yysize - 1; | |
1140 | yyvsp = yyvs + yysize - 1; | |
1141 | ]b4_location_if([ yylsp = yyls + yysize - 1;])[ | |
1142 | ||
1143 | YYDPRINTF ((stderr, "Stack size increased to %lu\n", | |
1144 | (unsigned long int) yystacksize)); | |
1145 | ||
1146 | if (yyss + yystacksize - 1 <= yyssp) | |
1147 | YYABORT; | |
1148 | } | |
1149 | ||
1150 | YYDPRINTF ((stderr, "Entering state %d\n", yystate)); | |
1151 | ||
1152 | goto yybackup; | |
1153 | ||
1154 | /*-----------. | |
1155 | | yybackup. | | |
1156 | `-----------*/ | |
1157 | yybackup: | |
1158 | ||
1159 | /* Do appropriate processing given the current state. */ | |
1160 | /* Read a look-ahead token if we need one and don't already have one. */ | |
1161 | /* yyresume: */ | |
1162 | ||
1163 | /* First try to decide what to do without reference to look-ahead token. */ | |
1164 | ||
1165 | yyn = yypact[yystate]; | |
1166 | if (yyn == YYPACT_NINF) | |
1167 | goto yydefault; | |
1168 | ||
1169 | /* Not known => get a look-ahead token if don't already have one. */ | |
1170 | ||
1171 | /* YYCHAR is either YYEMPTY or YYEOF or a valid look-ahead symbol. */ | |
1172 | if (yychar == YYEMPTY) | |
1173 | { | |
1174 | YYDPRINTF ((stderr, "Reading a token: ")); | |
1175 | yychar = YYLEX; | |
1176 | } | |
1177 | ||
1178 | if (yychar <= YYEOF) | |
1179 | { | |
1180 | yychar = yytoken = YYEOF; | |
1181 | YYDPRINTF ((stderr, "Now at end of input.\n")); | |
1182 | } | |
1183 | else | |
1184 | { | |
1185 | yytoken = YYTRANSLATE (yychar); | |
1186 | YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc); | |
1187 | } | |
1188 | ||
1189 | /* If the proper action on seeing token YYTOKEN is to reduce or to | |
1190 | detect an error, take that action. */ | |
1191 | yyn += yytoken; | |
1192 | if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken) | |
1193 | goto yydefault; | |
1194 | yyn = yytable[yyn]; | |
1195 | if (yyn <= 0) | |
1196 | { | |
1197 | if (yyn == 0 || yyn == YYTABLE_NINF) | |
1198 | goto yyerrlab; | |
1199 | yyn = -yyn; | |
1200 | goto yyreduce; | |
1201 | } | |
1202 | ||
1203 | if (yyn == YYFINAL) | |
1204 | YYACCEPT; | |
1205 | ||
1206 | /* Shift the look-ahead token. */ | |
1207 | YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc); | |
1208 | ||
1209 | /* Discard the token being shifted unless it is eof. */ | |
1210 | if (yychar != YYEOF) | |
1211 | yychar = YYEMPTY; | |
1212 | ||
1213 | *++yyvsp = yylval; | |
1214 | ]b4_location_if([ *++yylsp = yylloc;])[ | |
1215 | ||
1216 | /* Count tokens shifted since error; after three, turn off error | |
1217 | status. */ | |
1218 | if (yyerrstatus) | |
1219 | yyerrstatus--; | |
1220 | ||
1221 | yystate = yyn; | |
1222 | goto yynewstate; | |
1223 | ||
1224 | ||
1225 | /*-----------------------------------------------------------. | |
1226 | | yydefault -- do the default action for the current state. | | |
1227 | `-----------------------------------------------------------*/ | |
1228 | yydefault: | |
1229 | yyn = yydefact[yystate]; | |
1230 | if (yyn == 0) | |
1231 | goto yyerrlab; | |
1232 | goto yyreduce; | |
1233 | ||
1234 | ||
1235 | /*-----------------------------. | |
1236 | | yyreduce -- Do a reduction. | | |
1237 | `-----------------------------*/ | |
1238 | yyreduce: | |
1239 | /* yyn is the number of a rule to reduce with. */ | |
1240 | yylen = yyr2[yyn]; | |
1241 | ||
1242 | /* If YYLEN is nonzero, implement the default value of the action: | |
1243 | `$$ = $1'. | |
1244 | ||
1245 | Otherwise, the following line sets YYVAL to garbage. | |
1246 | This behavior is undocumented and Bison | |
1247 | users should not rely upon it. Assigning to YYVAL | |
1248 | unconditionally makes the parser a bit smaller, and it avoids a | |
1249 | GCC warning that YYVAL may be used uninitialized. */ | |
1250 | yyval = yyvsp[1-yylen]; | |
1251 | ||
1252 | ]b4_location_if( | |
1253 | [[ /* Default location. */ | |
1254 | YYLLOC_DEFAULT (yyloc, yylsp - yylen, yylen);]])[ | |
1255 | YY_REDUCE_PRINT (yyn); | |
1256 | switch (yyn) | |
1257 | ]{ | |
1258 | b4_actions | |
1259 | default: break; | |
1260 | } | |
1261 | ||
1262 | /* Line __line__ of yacc.c. */ | |
1263 | b4_syncline([@oline@], [@ofile@]) | |
1264 | \f | |
1265 | [ yyvsp -= yylen; | |
1266 | yyssp -= yylen; | |
1267 | ]b4_location_if([ yylsp -= yylen;])[ | |
1268 | ||
1269 | YY_STACK_PRINT (yyss, yyssp); | |
1270 | ||
1271 | *++yyvsp = yyval; | |
1272 | ]b4_location_if([ *++yylsp = yyloc;])[ | |
1273 | ||
1274 | /* Now `shift' the result of the reduction. Determine what state | |
1275 | that goes to, based on the state we popped back to and the rule | |
1276 | number reduced by. */ | |
1277 | ||
1278 | yyn = yyr1[yyn]; | |
1279 | ||
1280 | yystate = yypgoto[yyn - YYNTOKENS] + *yyssp; | |
1281 | if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp) | |
1282 | yystate = yytable[yystate]; | |
1283 | else | |
1284 | yystate = yydefgoto[yyn - YYNTOKENS]; | |
1285 | ||
1286 | goto yynewstate; | |
1287 | ||
1288 | ||
1289 | /*------------------------------------. | |
1290 | | yyerrlab -- here on detecting error | | |
1291 | `------------------------------------*/ | |
1292 | yyerrlab: | |
1293 | /* If not already recovering from an error, report this error. */ | |
1294 | if (!yyerrstatus) | |
1295 | { | |
1296 | ++yynerrs; | |
1297 | #if ! YYERROR_VERBOSE | |
1298 | yyerror (]b4_yyerror_args[YY_("syntax error")); | |
1299 | #else | |
1300 | { | |
1301 | YYSIZE_T yysize = yysyntax_error (0, yystate, yychar); | |
1302 | if (yymsg_alloc < yysize && yymsg_alloc < YYSTACK_ALLOC_MAXIMUM) | |
1303 | { | |
1304 | YYSIZE_T yyalloc = 2 * yysize; | |
1305 | if (! (yysize <= yyalloc && yyalloc <= YYSTACK_ALLOC_MAXIMUM)) | |
1306 | yyalloc = YYSTACK_ALLOC_MAXIMUM; | |
1307 | if (yymsg != yymsgbuf) | |
1308 | YYSTACK_FREE (yymsg); | |
1309 | yymsg = (char *) YYSTACK_ALLOC (yyalloc); | |
1310 | if (yymsg) | |
1311 | yymsg_alloc = yyalloc; | |
1312 | else | |
1313 | { | |
1314 | yymsg = yymsgbuf; | |
1315 | yymsg_alloc = sizeof yymsgbuf; | |
1316 | } | |
1317 | } | |
1318 | ||
1319 | if (0 < yysize && yysize <= yymsg_alloc) | |
1320 | { | |
1321 | (void) yysyntax_error (yymsg, yystate, yychar); | |
1322 | yyerror (]b4_yyerror_args[yymsg); | |
1323 | } | |
1324 | else | |
1325 | { | |
1326 | yyerror (]b4_yyerror_args[YY_("syntax error")); | |
1327 | if (yysize != 0) | |
1328 | goto yyexhaustedlab; | |
1329 | } | |
1330 | } | |
1331 | #endif | |
1332 | } | |
1333 | ||
1334 | ]b4_location_if([[ yyerror_range[0] = yylloc;]])[ | |
1335 | ||
1336 | if (yyerrstatus == 3) | |
1337 | { | |
1338 | /* If just tried and failed to reuse look-ahead token after an | |
1339 | error, discard it. */ | |
1340 | ||
1341 | if (yychar <= YYEOF) | |
1342 | { | |
1343 | /* Return failure if at end of input. */ | |
1344 | if (yychar == YYEOF) | |
1345 | YYABORT; | |
1346 | } | |
1347 | else | |
1348 | { | |
1349 | yydestruct ("Error: discarding", yytoken, &yylval]b4_location_if([, &yylloc])[); | |
1350 | yychar = YYEMPTY; | |
1351 | } | |
1352 | } | |
1353 | ||
1354 | /* Else will try to reuse look-ahead token after shifting the error | |
1355 | token. */ | |
1356 | goto yyerrlab1; | |
1357 | ||
1358 | ||
1359 | /*---------------------------------------------------. | |
1360 | | yyerrorlab -- error raised explicitly by YYERROR. | | |
1361 | `---------------------------------------------------*/ | |
1362 | yyerrorlab: | |
1363 | ||
1364 | /* Pacify compilers like GCC when the user code never invokes | |
1365 | YYERROR and the label yyerrorlab therefore never appears in user | |
1366 | code. */ | |
1367 | if (/*CONSTCOND*/ 0) | |
1368 | goto yyerrorlab; | |
1369 | ||
1370 | ]b4_location_if([[ yyerror_range[0] = yylsp[1-yylen]; | |
1371 | yylsp -= yylen; | |
1372 | ]])[yyvsp -= yylen; | |
1373 | yyssp -= yylen; | |
1374 | yystate = *yyssp; | |
1375 | goto yyerrlab1; | |
1376 | ||
1377 | ||
1378 | /*-------------------------------------------------------------. | |
1379 | | yyerrlab1 -- common code for both syntax error and YYERROR. | | |
1380 | `-------------------------------------------------------------*/ | |
1381 | yyerrlab1: | |
1382 | yyerrstatus = 3; /* Each real token shifted decrements this. */ | |
1383 | ||
1384 | for (;;) | |
1385 | { | |
1386 | yyn = yypact[yystate]; | |
1387 | if (yyn != YYPACT_NINF) | |
1388 | { | |
1389 | yyn += YYTERROR; | |
1390 | if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR) | |
1391 | { | |
1392 | yyn = yytable[yyn]; | |
1393 | if (0 < yyn) | |
1394 | break; | |
1395 | } | |
1396 | } | |
1397 | ||
1398 | /* Pop the current state because it cannot handle the error token. */ | |
1399 | if (yyssp == yyss) | |
1400 | YYABORT; | |
1401 | ||
1402 | ]b4_location_if([[ yyerror_range[0] = *yylsp;]])[ | |
1403 | yydestruct ("Error: popping", yystos[yystate], yyvsp]b4_location_if([, yylsp])[); | |
1404 | YYPOPSTACK; | |
1405 | yystate = *yyssp; | |
1406 | YY_STACK_PRINT (yyss, yyssp); | |
1407 | } | |
1408 | ||
1409 | if (yyn == YYFINAL) | |
1410 | YYACCEPT; | |
1411 | ||
1412 | *++yyvsp = yylval; | |
1413 | ]b4_location_if([[ | |
1414 | yyerror_range[1] = yylloc; | |
1415 | /* Using YYLLOC is tempting, but would change the location of | |
1416 | the look-ahead. YYLOC is available though. */ | |
1417 | YYLLOC_DEFAULT (yyloc, yyerror_range - 1, 2); | |
1418 | *++yylsp = yyloc;]])[ | |
1419 | ||
1420 | /* Shift the error token. */ | |
1421 | YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp); | |
1422 | ||
1423 | yystate = yyn; | |
1424 | goto yynewstate; | |
1425 | ||
1426 | ||
1427 | /*-------------------------------------. | |
1428 | | yyacceptlab -- YYACCEPT comes here. | | |
1429 | `-------------------------------------*/ | |
1430 | yyacceptlab: | |
1431 | yyresult = 0; | |
1432 | goto yyreturn; | |
1433 | ||
1434 | /*-----------------------------------. | |
1435 | | yyabortlab -- YYABORT comes here. | | |
1436 | `-----------------------------------*/ | |
1437 | yyabortlab: | |
1438 | yyresult = 1; | |
1439 | goto yyreturn; | |
1440 | ||
1441 | #ifndef yyoverflow | |
1442 | /*-------------------------------------------------. | |
1443 | | yyexhaustedlab -- memory exhaustion comes here. | | |
1444 | `-------------------------------------------------*/ | |
1445 | yyexhaustedlab: | |
1446 | yyerror (]b4_yyerror_args[YY_("memory exhausted")); | |
1447 | yyresult = 2; | |
1448 | /* Fall through. */ | |
1449 | #endif | |
1450 | ||
1451 | yyreturn: | |
1452 | if (yychar != YYEOF && yychar != YYEMPTY) | |
1453 | yydestruct ("Cleanup: discarding lookahead", | |
1454 | yytoken, &yylval]b4_location_if([, &yylloc])[); | |
1455 | while (yyssp != yyss) | |
1456 | { | |
1457 | yydestruct ("Cleanup: popping", | |
1458 | yystos[*yyssp], yyvsp]b4_location_if([, yylsp])[); | |
1459 | YYPOPSTACK; | |
1460 | } | |
1461 | #ifndef yyoverflow | |
1462 | if (yyss != yyssa) | |
1463 | YYSTACK_FREE (yyss); | |
1464 | #endif | |
1465 | #if YYERROR_VERBOSE | |
1466 | if (yymsg != yymsgbuf) | |
1467 | YYSTACK_FREE (yymsg); | |
1468 | #endif | |
1469 | return yyresult; | |
1470 | ]} | |
1471 | ||
1472 | ||
1473 | b4_epilogue | |
1474 | m4_if(b4_defines_flag, 0, [], | |
1475 | [@output @output_header_name@ | |
1476 | b4_copyright([Skeleton parser for Yacc-like parsing with Bison], | |
1477 | [1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004, 2005]) | |
1478 | ||
1479 | /* As a special exception, when this file is copied by Bison into a | |
1480 | Bison output file, you may use that output file without restriction. | |
1481 | This special exception was added by the Free Software Foundation | |
1482 | in version 1.24 of Bison. */ | |
1483 | ||
1484 | b4_token_enums_defines(b4_tokens) | |
1485 | ||
1486 | #if ! defined (YYSTYPE) && ! defined (YYSTYPE_IS_DECLARED) | |
1487 | m4_ifdef([b4_stype], | |
1488 | [b4_syncline([b4_stype_line], [b4_file_name]) | |
1489 | typedef union m4_bregexp(b4_stype, [^{], [YYSTYPE ])b4_stype YYSTYPE; | |
1490 | /* Line __line__ of yacc.c. */ | |
1491 | b4_syncline([@oline@], [@ofile@])], | |
1492 | [typedef int YYSTYPE;]) | |
1493 | # define yystype YYSTYPE /* obsolescent; will be withdrawn */ | |
1494 | # define YYSTYPE_IS_DECLARED 1 | |
1495 | # define YYSTYPE_IS_TRIVIAL 1 | |
1496 | #endif | |
1497 | ||
1498 | b4_pure_if([], | |
1499 | [extern YYSTYPE b4_prefix[]lval;]) | |
1500 | ||
1501 | b4_location_if( | |
1502 | [#if ! defined (YYLTYPE) && ! defined (YYLTYPE_IS_DECLARED) | |
1503 | typedef struct YYLTYPE | |
1504 | { | |
1505 | int first_line; | |
1506 | int first_column; | |
1507 | int last_line; | |
1508 | int last_column; | |
1509 | } YYLTYPE; | |
1510 | # define yyltype YYLTYPE /* obsolescent; will be withdrawn */ | |
1511 | # define YYLTYPE_IS_DECLARED 1 | |
1512 | # define YYLTYPE_IS_TRIVIAL 1 | |
1513 | #endif | |
1514 | ||
1515 | m4_if(b4_pure, [0], | |
1516 | [extern YYLTYPE b4_prefix[]lloc;]) | |
1517 | ]) | |
1518 | ]) |