]>
Commit | Line | Data |
---|---|---|
1 | -*- C -*- | |
2 | # Yacc compatible skeleton for Bison | |
3 | ||
4 | # Copyright (C) 1984, 1989-1990, 2000-2012 Free Software Foundation, | |
5 | # Inc. | |
6 | ||
7 | m4_pushdef([b4_copyright_years], | |
8 | [1984, 1989-1990, 2000-2012]) | |
9 | ||
10 | # This program is free software: you can redistribute it and/or modify | |
11 | # it under the terms of the GNU General Public License as published by | |
12 | # the Free Software Foundation, either version 3 of the License, or | |
13 | # (at your option) any later version. | |
14 | # | |
15 | # This program is distributed in the hope that it will be useful, | |
16 | # but WITHOUT ANY WARRANTY; without even the implied warranty of | |
17 | # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
18 | # GNU General Public License for more details. | |
19 | # | |
20 | # You should have received a copy of the GNU General Public License | |
21 | # along with this program. If not, see <http://www.gnu.org/licenses/>. | |
22 | ||
23 | # Check the value of %define api.push-pull. | |
24 | b4_percent_define_default([[api.push-pull]], [[pull]]) | |
25 | b4_percent_define_check_values([[[[api.push-pull]], | |
26 | [[pull]], [[push]], [[both]]]]) | |
27 | b4_define_flag_if([pull]) m4_define([b4_pull_flag], [[1]]) | |
28 | b4_define_flag_if([push]) m4_define([b4_push_flag], [[1]]) | |
29 | m4_case(b4_percent_define_get([[api.push-pull]]), | |
30 | [pull], [m4_define([b4_push_flag], [[0]])], | |
31 | [push], [m4_define([b4_pull_flag], [[0]])]) | |
32 | ||
33 | # Handle BISON_USE_PUSH_FOR_PULL for the test suite. So that push parsing | |
34 | # tests function as written, do not let BISON_USE_PUSH_FOR_PULL modify the | |
35 | # behavior of Bison at all when push parsing is already requested. | |
36 | b4_define_flag_if([use_push_for_pull]) | |
37 | b4_use_push_for_pull_if([ | |
38 | b4_push_if([m4_define([b4_use_push_for_pull_flag], [[0]])], | |
39 | [m4_define([b4_push_flag], [[1]])])]) | |
40 | ||
41 | # Check the value of %define parse.lac and friends, where LAC stands for | |
42 | # lookahead correction. | |
43 | b4_percent_define_default([[parse.lac]], [[none]]) | |
44 | b4_percent_define_default([[parse.lac.es-capacity-initial]], [[20]]) | |
45 | b4_percent_define_default([[parse.lac.memory-trace]], [[failures]]) | |
46 | b4_percent_define_check_values([[[[parse.lac]], [[full]], [[none]]]], | |
47 | [[[[parse.lac.memory-trace]], | |
48 | [[failures]], [[full]]]]) | |
49 | b4_define_flag_if([lac]) | |
50 | m4_define([b4_lac_flag], | |
51 | [m4_if(b4_percent_define_get([[parse.lac]]), | |
52 | [none], [[0]], [[1]])]) | |
53 | ||
54 | m4_include(b4_pkgdatadir/[c.m4]) | |
55 | ||
56 | ## ---------------- ## | |
57 | ## Default values. ## | |
58 | ## ---------------- ## | |
59 | ||
60 | # Stack parameters. | |
61 | m4_define_default([b4_stack_depth_max], [10000]) | |
62 | m4_define_default([b4_stack_depth_init], [200]) | |
63 | ||
64 | ||
65 | ## ------------------------ ## | |
66 | ## Pure/impure interfaces. ## | |
67 | ## ------------------------ ## | |
68 | ||
69 | b4_percent_define_default([[api.pure]], [[false]]) | |
70 | b4_define_flag_if([pure]) | |
71 | m4_define([b4_pure_flag], | |
72 | [b4_percent_define_flag_if([[api.pure]], [[1]], [[0]])]) | |
73 | ||
74 | # b4_yacc_pure_if(IF-TRUE, IF-FALSE) | |
75 | # ---------------------------------- | |
76 | # Expand IF-TRUE, if %pure-parser and %parse-param, IF-FALSE otherwise. | |
77 | m4_define([b4_yacc_pure_if], | |
78 | [b4_pure_if([m4_ifset([b4_parse_param], | |
79 | [$1], [$2])], | |
80 | [$2])]) | |
81 | ||
82 | ||
83 | # b4_yyerror_args | |
84 | # --------------- | |
85 | # Arguments passed to yyerror: user args plus yylloc. | |
86 | m4_define([b4_yyerror_args], | |
87 | [b4_yacc_pure_if([b4_locations_if([&yylloc, ])])dnl | |
88 | m4_ifset([b4_parse_param], [b4_c_args(b4_parse_param), ])]) | |
89 | ||
90 | ||
91 | # b4_lex_param | |
92 | # ------------ | |
93 | # Accumulate in b4_lex_param all the yylex arguments. | |
94 | # b4_lex_param arrives quoted twice, but we want to keep only one level. | |
95 | m4_define([b4_lex_param], | |
96 | m4_dquote(b4_pure_if([[[[YYSTYPE *]], [[&yylval]]][]dnl | |
97 | b4_locations_if([, [[YYLTYPE *], [&yylloc]]])m4_ifdef([b4_lex_param], [, ])])dnl | |
98 | m4_ifdef([b4_lex_param], b4_lex_param))) | |
99 | ||
100 | ||
101 | ## ------------ ## | |
102 | ## Data Types. ## | |
103 | ## ------------ ## | |
104 | ||
105 | # b4_int_type(MIN, MAX) | |
106 | # --------------------- | |
107 | # Return the smallest int type able to handle numbers ranging from | |
108 | # MIN to MAX (included). Overwrite the version from c.m4, which | |
109 | # uses only C89 types, so that the user can override the shorter | |
110 | # types, and so that pre-C89 compilers are handled correctly. | |
111 | m4_define([b4_int_type], | |
112 | [m4_if(b4_ints_in($@, [0], [255]), [1], [yytype_uint8], | |
113 | b4_ints_in($@, [-128], [127]), [1], [yytype_int8], | |
114 | ||
115 | b4_ints_in($@, [0], [65535]), [1], [yytype_uint16], | |
116 | b4_ints_in($@, [-32768], [32767]), [1], [yytype_int16], | |
117 | ||
118 | m4_eval([0 <= $1]), [1], [unsigned int], | |
119 | ||
120 | [int])]) | |
121 | ||
122 | ||
123 | ## ----------------- ## | |
124 | ## Semantic Values. ## | |
125 | ## ----------------- ## | |
126 | ||
127 | ||
128 | # b4_lhs_value([TYPE]) | |
129 | # -------------------- | |
130 | # Expansion of $<TYPE>$. | |
131 | m4_define([b4_lhs_value], | |
132 | [b4_symbol_value(yyval, [$1])]) | |
133 | ||
134 | ||
135 | # b4_rhs_value(RULE-LENGTH, NUM, [TYPE]) | |
136 | # -------------------------------------- | |
137 | # Expansion of $<TYPE>NUM, where the current rule has RULE-LENGTH | |
138 | # symbols on RHS. | |
139 | m4_define([b4_rhs_value], | |
140 | [b4_symbol_value([yyvsp@{b4_subtract([$2], [$1])@}], [$3])]) | |
141 | ||
142 | ||
143 | ||
144 | ## ----------- ## | |
145 | ## Locations. ## | |
146 | ## ----------- ## | |
147 | ||
148 | # b4_lhs_location() | |
149 | # ----------------- | |
150 | # Expansion of @$. | |
151 | m4_define([b4_lhs_location], | |
152 | [(yyloc)]) | |
153 | ||
154 | ||
155 | # b4_rhs_location(RULE-LENGTH, NUM) | |
156 | # --------------------------------- | |
157 | # Expansion of @NUM, where the current rule has RULE-LENGTH symbols | |
158 | # on RHS. | |
159 | m4_define([b4_rhs_location], | |
160 | [(yylsp@{b4_subtract([$2], [$1])@})]) | |
161 | ||
162 | ||
163 | ## -------------- ## | |
164 | ## Declarations. ## | |
165 | ## -------------- ## | |
166 | ||
167 | # b4_declare_scanner_communication_variables | |
168 | # ------------------------------------------ | |
169 | # Declare the variables that are global, or local to YYPARSE if | |
170 | # pure-parser. | |
171 | m4_define([b4_declare_scanner_communication_variables], [[ | |
172 | /* The lookahead symbol. */ | |
173 | int yychar; | |
174 | ||
175 | /* The semantic value of the lookahead symbol. */ | |
176 | YYSTYPE yylval;]b4_locations_if([[ | |
177 | ||
178 | /* Location data for the lookahead symbol. */ | |
179 | YYLTYPE yylloc;]])b4_pure_if([], [[ | |
180 | ||
181 | /* Number of syntax errors so far. */ | |
182 | int yynerrs;]])]) | |
183 | ||
184 | ||
185 | # b4_declare_parser_state_variables | |
186 | # --------------------------------- | |
187 | # Declare all the variables that are needed to maintain the parser state | |
188 | # between calls to yypush_parse. | |
189 | m4_define([b4_declare_parser_state_variables], [b4_pure_if([[ | |
190 | /* Number of syntax errors so far. */ | |
191 | int yynerrs; | |
192 | ]])[ | |
193 | int yystate; | |
194 | /* Number of tokens to shift before error messages enabled. */ | |
195 | int yyerrstatus; | |
196 | ||
197 | /* The stacks and their tools: | |
198 | `yyss': related to states. | |
199 | `yyvs': related to semantic values.]b4_locations_if([[ | |
200 | `yyls': related to locations.]])[ | |
201 | ||
202 | Refer to the stacks through separate pointers, to allow yyoverflow | |
203 | to reallocate them elsewhere. */ | |
204 | ||
205 | /* The state stack. */ | |
206 | yytype_int16 yyssa[YYINITDEPTH]; | |
207 | yytype_int16 *yyss; | |
208 | yytype_int16 *yyssp; | |
209 | ||
210 | /* The semantic value stack. */ | |
211 | YYSTYPE yyvsa[YYINITDEPTH]; | |
212 | YYSTYPE *yyvs; | |
213 | YYSTYPE *yyvsp;]b4_locations_if([[ | |
214 | ||
215 | /* The location stack. */ | |
216 | YYLTYPE yylsa[YYINITDEPTH]; | |
217 | YYLTYPE *yyls; | |
218 | YYLTYPE *yylsp; | |
219 | ||
220 | /* The locations where the error started and ended. */ | |
221 | YYLTYPE yyerror_range[3];]])[ | |
222 | ||
223 | YYSIZE_T yystacksize;]b4_lac_if([[ | |
224 | ||
225 | yytype_int16 yyesa@{]b4_percent_define_get([[parse.lac.es-capacity-initial]])[@}; | |
226 | yytype_int16 *yyes; | |
227 | YYSIZE_T yyes_capacity;]])]) | |
228 | ||
229 | ||
230 | # b4_declare_yyparse_push_ | |
231 | # ------------------------ | |
232 | # Declaration of yyparse (and dependencies) when using the push parser | |
233 | # (including in pull mode). | |
234 | m4_define([b4_declare_yyparse_push_], | |
235 | [[#ifndef YYPUSH_MORE_DEFINED | |
236 | # define YYPUSH_MORE_DEFINED | |
237 | enum { YYPUSH_MORE = 4 }; | |
238 | #endif | |
239 | ||
240 | typedef struct ]b4_prefix[pstate ]b4_prefix[pstate; | |
241 | ||
242 | ]b4_pull_if([b4_c_function_decl([b4_prefix[parse]], [[int]], b4_parse_param) | |
243 | ])b4_c_function_decl([b4_prefix[push_parse]], [[int]], | |
244 | [[b4_prefix[pstate *ps]], [[ps]]]b4_pure_if([, | |
245 | [[[int pushed_char]], [[pushed_char]]], | |
246 | [[b4_api_PREFIX[STYPE const *pushed_val]], [[pushed_val]]]b4_locations_if([, | |
247 | [[b4_api_PREFIX[LTYPE const *pushed_loc]], [[pushed_loc]]]])])m4_ifset([b4_parse_param], [, | |
248 | b4_parse_param])) | |
249 | b4_pull_if([b4_c_function_decl([b4_prefix[pull_parse]], [[int]], | |
250 | [[b4_prefix[pstate *ps]], [[ps]]]m4_ifset([b4_parse_param], [, | |
251 | b4_parse_param]))]) | |
252 | b4_c_function_decl([b4_prefix[pstate_new]], [b4_prefix[pstate *]], | |
253 | [[[void]], []]) | |
254 | b4_c_function_decl([b4_prefix[pstate_delete]], [[void]], | |
255 | [[b4_prefix[pstate *ps]], [[ps]]])dnl | |
256 | ]) | |
257 | ||
258 | # b4_declare_yyparse_ | |
259 | # ------------------- | |
260 | # When not the push parser. | |
261 | m4_define([b4_declare_yyparse_], | |
262 | [b4_c_function_decl(b4_prefix[parse], [int], b4_parse_param)]) | |
263 | ||
264 | ||
265 | # b4_declare_yyparse | |
266 | # ------------------ | |
267 | m4_define([b4_declare_yyparse], | |
268 | [b4_push_if([b4_declare_yyparse_push_], | |
269 | [b4_declare_yyparse_])[]dnl | |
270 | ]) | |
271 | ||
272 | ||
273 | # b4_shared_declarations | |
274 | # ---------------------- | |
275 | # Declaration that might either go into the header (if --defines) | |
276 | # or open coded in the parser body. | |
277 | m4_define([b4_shared_declarations], | |
278 | [b4_cpp_guard_open([b4_spec_defines_file])[ | |
279 | ]b4_declare_yydebug[ | |
280 | ]b4_percent_code_get([[requires]])[ | |
281 | ]b4_token_enums_defines[ | |
282 | ]b4_declare_yylstype[ | |
283 | ]b4_declare_yyparse[ | |
284 | ]b4_percent_code_get([[provides]])[ | |
285 | ]b4_cpp_guard_close([b4_spec_defines_file])[]dnl | |
286 | ]) | |
287 | ||
288 | ## -------------- ## | |
289 | ## Output files. ## | |
290 | ## -------------- ## | |
291 | ||
292 | # We do want M4 expansion after # for CPP macros. | |
293 | m4_changecom() | |
294 | m4_divert_push(0)dnl | |
295 | @output(b4_parser_file_name@)@ | |
296 | b4_copyright([Bison implementation for Yacc-like parsers in C])[ | |
297 | ||
298 | /* C LALR(1) parser skeleton written by Richard Stallman, by | |
299 | simplifying the original so-called "semantic" parser. */ | |
300 | ||
301 | /* All symbols defined below should begin with yy or YY, to avoid | |
302 | infringing on user name space. This should be done even for local | |
303 | variables, as they might otherwise be expanded by user macros. | |
304 | There are some unavoidable exceptions within include files to | |
305 | define necessary library symbols; they are noted "INFRINGES ON | |
306 | USER NAME SPACE" below. */ | |
307 | ||
308 | ]b4_identification | |
309 | b4_percent_code_get([[top]])[]dnl | |
310 | m4_if(b4_api_prefix, [yy], [], | |
311 | [[/* Substitute the type names. */ | |
312 | #define YYSTYPE ]b4_api_PREFIX[STYPE]b4_locations_if([[ | |
313 | #define YYLTYPE ]b4_api_PREFIX[LTYPE]])])[ | |
314 | ]m4_if(b4_prefix, [yy], [], | |
315 | [[/* Substitute the variable and function names. */]b4_pull_if([[ | |
316 | #define yyparse ]b4_prefix[parse]])b4_push_if([[ | |
317 | #define yypush_parse ]b4_prefix[push_parse]b4_pull_if([[ | |
318 | #define yypull_parse ]b4_prefix[pull_parse]])[ | |
319 | #define yypstate_new ]b4_prefix[pstate_new | |
320 | #define yypstate_delete ]b4_prefix[pstate_delete | |
321 | #define yypstate ]b4_prefix[pstate]])[ | |
322 | #define yylex ]b4_prefix[lex | |
323 | #define yyerror ]b4_prefix[error | |
324 | #define yylval ]b4_prefix[lval | |
325 | #define yychar ]b4_prefix[char | |
326 | #define yydebug ]b4_prefix[debug | |
327 | #define yynerrs ]b4_prefix[nerrs]b4_locations_if([[ | |
328 | #define yylloc ]b4_prefix[lloc]])])[ | |
329 | ||
330 | /* Copy the first part of user declarations. */ | |
331 | ]b4_user_pre_prologue[ | |
332 | ||
333 | ]b4_null_define[ | |
334 | ||
335 | /* Enabling verbose error messages. */ | |
336 | #ifdef YYERROR_VERBOSE | |
337 | # undef YYERROR_VERBOSE | |
338 | # define YYERROR_VERBOSE 1 | |
339 | #else | |
340 | # define YYERROR_VERBOSE ]b4_error_verbose_if([1], [0])[ | |
341 | #endif | |
342 | ||
343 | /* In a future release of Bison, this section will be replaced | |
344 | by #include "@basename(]b4_spec_defines_file[@)". */ | |
345 | ]b4_shared_declarations[ | |
346 | ||
347 | /* Copy the second part of user declarations. */ | |
348 | ]b4_user_post_prologue | |
349 | b4_percent_code_get[]dnl | |
350 | ||
351 | [#ifdef short | |
352 | # undef short | |
353 | #endif | |
354 | ||
355 | #ifdef YYTYPE_UINT8 | |
356 | typedef YYTYPE_UINT8 yytype_uint8; | |
357 | #else | |
358 | typedef unsigned char yytype_uint8; | |
359 | #endif | |
360 | ||
361 | #ifdef YYTYPE_INT8 | |
362 | typedef YYTYPE_INT8 yytype_int8; | |
363 | #else | |
364 | typedef signed char yytype_int8; | |
365 | #endif | |
366 | ||
367 | #ifdef YYTYPE_UINT16 | |
368 | typedef YYTYPE_UINT16 yytype_uint16; | |
369 | #else | |
370 | typedef unsigned short int yytype_uint16; | |
371 | #endif | |
372 | ||
373 | #ifdef YYTYPE_INT16 | |
374 | typedef YYTYPE_INT16 yytype_int16; | |
375 | #else | |
376 | typedef short int yytype_int16; | |
377 | #endif | |
378 | ||
379 | #ifndef YYSIZE_T | |
380 | # ifdef __SIZE_TYPE__ | |
381 | # define YYSIZE_T __SIZE_TYPE__ | |
382 | # elif defined size_t | |
383 | # define YYSIZE_T size_t | |
384 | # elif ! defined YYSIZE_T | |
385 | # include <stddef.h> /* INFRINGES ON USER NAME SPACE */ | |
386 | # define YYSIZE_T size_t | |
387 | # else | |
388 | # define YYSIZE_T unsigned int | |
389 | # endif | |
390 | #endif | |
391 | ||
392 | #define YYSIZE_MAXIMUM ((YYSIZE_T) -1) | |
393 | ||
394 | #ifndef YY_ | |
395 | # if defined YYENABLE_NLS && YYENABLE_NLS | |
396 | # if ENABLE_NLS | |
397 | # include <libintl.h> /* INFRINGES ON USER NAME SPACE */ | |
398 | # define YY_(msgid) dgettext ("bison-runtime", msgid) | |
399 | # endif | |
400 | # endif | |
401 | # ifndef YY_ | |
402 | # define YY_(msgid) msgid | |
403 | # endif | |
404 | #endif | |
405 | ||
406 | /* Suppress unused-variable warnings by "using" E. */ | |
407 | #if ! defined lint || defined __GNUC__ | |
408 | # define YYUSE(e) ((void) (e)) | |
409 | #else | |
410 | # define YYUSE(e) /* empty */ | |
411 | #endif | |
412 | ||
413 | /* Identity function, used to suppress warnings about constant conditions. */ | |
414 | #ifndef lint | |
415 | # define YYID(n) (n) | |
416 | #else | |
417 | ]b4_c_function_def([YYID], [static int], [[int yyi], [yyi]])[ | |
418 | { | |
419 | return yyi; | |
420 | } | |
421 | #endif | |
422 | ||
423 | #if ]b4_lac_if([[1]], [[! defined yyoverflow || YYERROR_VERBOSE]])[ | |
424 | ||
425 | /* The parser invokes alloca or malloc; define the necessary symbols. */]dnl | |
426 | b4_push_if([], [b4_lac_if([], [[ | |
427 | ||
428 | # ifdef YYSTACK_USE_ALLOCA | |
429 | # if YYSTACK_USE_ALLOCA | |
430 | # ifdef __GNUC__ | |
431 | # define YYSTACK_ALLOC __builtin_alloca | |
432 | # elif defined __BUILTIN_VA_ARG_INCR | |
433 | # include <alloca.h> /* INFRINGES ON USER NAME SPACE */ | |
434 | # elif defined _AIX | |
435 | # define YYSTACK_ALLOC __alloca | |
436 | # elif defined _MSC_VER | |
437 | # include <malloc.h> /* INFRINGES ON USER NAME SPACE */ | |
438 | # define alloca _alloca | |
439 | # else | |
440 | # define YYSTACK_ALLOC alloca | |
441 | # if ! defined _ALLOCA_H && ! defined EXIT_SUCCESS | |
442 | # include <stdlib.h> /* INFRINGES ON USER NAME SPACE */ | |
443 | /* Use EXIT_SUCCESS as a witness for stdlib.h. */ | |
444 | # ifndef EXIT_SUCCESS | |
445 | # define EXIT_SUCCESS 0 | |
446 | # endif | |
447 | # endif | |
448 | # endif | |
449 | # endif | |
450 | # endif]])])[ | |
451 | ||
452 | # ifdef YYSTACK_ALLOC | |
453 | /* Pacify GCC's `empty if-body' warning. */ | |
454 | # define YYSTACK_FREE(Ptr) do { /* empty */; } while (YYID (0)) | |
455 | # ifndef YYSTACK_ALLOC_MAXIMUM | |
456 | /* The OS might guarantee only one guard page at the bottom of the stack, | |
457 | and a page size can be as small as 4096 bytes. So we cannot safely | |
458 | invoke alloca (N) if N exceeds 4096. Use a slightly smaller number | |
459 | to allow for a few compiler-allocated temporary stack slots. */ | |
460 | # define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2006 */ | |
461 | # endif | |
462 | # else | |
463 | # define YYSTACK_ALLOC YYMALLOC | |
464 | # define YYSTACK_FREE YYFREE | |
465 | # ifndef YYSTACK_ALLOC_MAXIMUM | |
466 | # define YYSTACK_ALLOC_MAXIMUM YYSIZE_MAXIMUM | |
467 | # endif | |
468 | # if (defined __cplusplus && ! defined EXIT_SUCCESS \ | |
469 | && ! ((defined YYMALLOC || defined malloc) \ | |
470 | && (defined YYFREE || defined free))) | |
471 | # include <stdlib.h> /* INFRINGES ON USER NAME SPACE */ | |
472 | # ifndef EXIT_SUCCESS | |
473 | # define EXIT_SUCCESS 0 | |
474 | # endif | |
475 | # endif | |
476 | # ifndef YYMALLOC | |
477 | # define YYMALLOC malloc | |
478 | # if ! defined malloc && ! defined EXIT_SUCCESS | |
479 | void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */ | |
480 | # endif | |
481 | # endif | |
482 | # ifndef YYFREE | |
483 | # define YYFREE free | |
484 | # if ! defined free && ! defined EXIT_SUCCESS | |
485 | void free (void *); /* INFRINGES ON USER NAME SPACE */ | |
486 | # endif | |
487 | # endif | |
488 | # endif]b4_lac_if([[ | |
489 | # define YYCOPY_NEEDED 1]])[ | |
490 | #endif]b4_lac_if([], [[ /* ! defined yyoverflow || YYERROR_VERBOSE */]])[ | |
491 | ||
492 | ||
493 | #if (! defined yyoverflow \ | |
494 | && (! defined __cplusplus \ | |
495 | || (]b4_locations_if([[defined ]b4_api_PREFIX[LTYPE_IS_TRIVIAL && ]b4_api_PREFIX[LTYPE_IS_TRIVIAL \ | |
496 | && ]])[defined ]b4_api_PREFIX[STYPE_IS_TRIVIAL && ]b4_api_PREFIX[STYPE_IS_TRIVIAL))) | |
497 | ||
498 | /* A type that is properly aligned for any stack member. */ | |
499 | union yyalloc | |
500 | { | |
501 | yytype_int16 yyss_alloc; | |
502 | YYSTYPE yyvs_alloc;]b4_locations_if([ | |
503 | YYLTYPE yyls_alloc;])[ | |
504 | }; | |
505 | ||
506 | /* The size of the maximum gap between one aligned stack and the next. */ | |
507 | # define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1) | |
508 | ||
509 | /* The size of an array large to enough to hold all stacks, each with | |
510 | N elements. */ | |
511 | ]b4_locations_if( | |
512 | [# define YYSTACK_BYTES(N) \ | |
513 | ((N) * (sizeof (yytype_int16) + sizeof (YYSTYPE) + sizeof (YYLTYPE)) \ | |
514 | + 2 * YYSTACK_GAP_MAXIMUM)], | |
515 | [# define YYSTACK_BYTES(N) \ | |
516 | ((N) * (sizeof (yytype_int16) + sizeof (YYSTYPE)) \ | |
517 | + YYSTACK_GAP_MAXIMUM)])[ | |
518 | ||
519 | # define YYCOPY_NEEDED 1 | |
520 | ||
521 | /* Relocate STACK from its old location to the new one. The | |
522 | local variables YYSIZE and YYSTACKSIZE give the old and new number of | |
523 | elements in the stack, and YYPTR gives the new location of the | |
524 | stack. Advance YYPTR to a properly aligned location for the next | |
525 | stack. */ | |
526 | # define YYSTACK_RELOCATE(Stack_alloc, Stack) \ | |
527 | do \ | |
528 | { \ | |
529 | YYSIZE_T yynewbytes; \ | |
530 | YYCOPY (&yyptr->Stack_alloc, Stack, yysize); \ | |
531 | Stack = &yyptr->Stack_alloc; \ | |
532 | yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \ | |
533 | yyptr += yynewbytes / sizeof (*yyptr); \ | |
534 | } \ | |
535 | while (YYID (0)) | |
536 | ||
537 | #endif | |
538 | ||
539 | #if defined YYCOPY_NEEDED && YYCOPY_NEEDED | |
540 | /* Copy COUNT objects from SRC to DST. The source and destination do | |
541 | not overlap. */ | |
542 | # ifndef YYCOPY | |
543 | # if defined __GNUC__ && 1 < __GNUC__ | |
544 | # define YYCOPY(Dst, Src, Count) \ | |
545 | __builtin_memcpy (Dst, Src, (Count) * sizeof (*(Src))) | |
546 | # else | |
547 | # define YYCOPY(Dst, Src, Count) \ | |
548 | do \ | |
549 | { \ | |
550 | YYSIZE_T yyi; \ | |
551 | for (yyi = 0; yyi < (Count); yyi++) \ | |
552 | (Dst)[yyi] = (Src)[yyi]; \ | |
553 | } \ | |
554 | while (YYID (0)) | |
555 | # endif | |
556 | # endif | |
557 | #endif /* !YYCOPY_NEEDED */ | |
558 | ||
559 | /* YYFINAL -- State number of the termination state. */ | |
560 | #define YYFINAL ]b4_final_state_number[ | |
561 | /* YYLAST -- Last index in YYTABLE. */ | |
562 | #define YYLAST ]b4_last[ | |
563 | ||
564 | /* YYNTOKENS -- Number of terminals. */ | |
565 | #define YYNTOKENS ]b4_tokens_number[ | |
566 | /* YYNNTS -- Number of nonterminals. */ | |
567 | #define YYNNTS ]b4_nterms_number[ | |
568 | /* YYNRULES -- Number of rules. */ | |
569 | #define YYNRULES ]b4_rules_number[ | |
570 | /* YYNSTATES -- Number of states. */ | |
571 | #define YYNSTATES ]b4_states_number[ | |
572 | ||
573 | /* YYTRANSLATE[YYX] -- Symbol number corresponding to YYX as returned | |
574 | by yylex, with out-of-bounds checking. */ | |
575 | #define YYUNDEFTOK ]b4_undef_token_number[ | |
576 | #define YYMAXUTOK ]b4_user_token_number_max[ | |
577 | ||
578 | #define YYTRANSLATE(YYX) \ | |
579 | ((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK) | |
580 | ||
581 | /* YYTRANSLATE[TOKEN-NUM] -- Symbol number corresponding to TOKEN-NUM | |
582 | as returned by yylex, without out-of-bounds checking. */ | |
583 | static const ]b4_int_type_for([b4_translate])[ yytranslate[] = | |
584 | { | |
585 | ]b4_translate[ | |
586 | }; | |
587 | ||
588 | #if ]b4_api_PREFIX[DEBUG | |
589 | ]b4_integral_parser_table_define([rline], [b4_rline], | |
590 | [YYRLINE[YYN] -- Source line where rule number YYN was defined.])[ | |
591 | #endif | |
592 | ||
593 | #if ]b4_api_PREFIX[DEBUG || YYERROR_VERBOSE || ]b4_token_table_flag[ | |
594 | /* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM. | |
595 | First, the terminals, then, starting at YYNTOKENS, nonterminals. */ | |
596 | static const char *const yytname[] = | |
597 | { | |
598 | ]b4_tname[ | |
599 | }; | |
600 | #endif | |
601 | ||
602 | # ifdef YYPRINT | |
603 | /* YYTOKNUM[NUM] -- (External) token number corresponding to the | |
604 | (internal) symbol number NUM (which must be that of a token). */ | |
605 | static const ]b4_int_type_for([b4_toknum])[ yytoknum[] = | |
606 | { | |
607 | ]b4_toknum[ | |
608 | }; | |
609 | # endif | |
610 | ||
611 | #define YYPACT_NINF ]b4_pact_ninf[ | |
612 | ||
613 | #define yypact_value_is_default(yystate) \ | |
614 | ]b4_table_value_equals([[pact]], [[yystate]], [b4_pact_ninf])[ | |
615 | ||
616 | #define YYTABLE_NINF ]b4_table_ninf[ | |
617 | ||
618 | #define yytable_value_is_error(yytable_value) \ | |
619 | ]b4_table_value_equals([[table]], [[yytable_value]], [b4_table_ninf])[ | |
620 | ||
621 | ]b4_parser_tables_define[ | |
622 | ||
623 | #define yyerrok (yyerrstatus = 0) | |
624 | #define yyclearin (yychar = YYEMPTY) | |
625 | #define YYEMPTY (-2) | |
626 | #define YYEOF 0 | |
627 | ||
628 | #define YYACCEPT goto yyacceptlab | |
629 | #define YYABORT goto yyabortlab | |
630 | #define YYERROR goto yyerrorlab | |
631 | ||
632 | ||
633 | #define YYRECOVERING() (!!yyerrstatus) | |
634 | ||
635 | #define YYBACKUP(Token, Value) \ | |
636 | do \ | |
637 | if (yychar == YYEMPTY) \ | |
638 | { \ | |
639 | yychar = (Token); \ | |
640 | yylval = (Value); \ | |
641 | YYPOPSTACK (yylen); \ | |
642 | yystate = *yyssp; \]b4_lac_if([[ | |
643 | YY_LAC_DISCARD ("YYBACKUP"); \]])[ | |
644 | goto yybackup; \ | |
645 | } \ | |
646 | else \ | |
647 | { \ | |
648 | yyerror (]b4_yyerror_args[YY_("syntax error: cannot back up")); \ | |
649 | YYERROR; \ | |
650 | } \ | |
651 | while (YYID (0)) | |
652 | ||
653 | ||
654 | #define YYTERROR 1 | |
655 | #define YYERRCODE 256 | |
656 | ||
657 | ]b4_locations_if([[ | |
658 | ]b4_yylloc_default_define[ | |
659 | #define YYRHSLOC(Rhs, K) ((Rhs)[K]) | |
660 | ||
661 | /* YY_LOCATION_PRINT -- Print the location on the stream. | |
662 | This macro was not mandated originally: define only if we know | |
663 | we won't break user code: when these are the locations we know. */ | |
664 | ||
665 | #ifndef YY_LOCATION_PRINT | |
666 | # if defined ]b4_api_PREFIX[LTYPE_IS_TRIVIAL && ]b4_api_PREFIX[LTYPE_IS_TRIVIAL | |
667 | # define YY_LOCATION_PRINT(File, Loc) \ | |
668 | fprintf (File, "%d.%d-%d.%d", \ | |
669 | (Loc).first_line, (Loc).first_column, \ | |
670 | (Loc).last_line, (Loc).last_column) | |
671 | # else | |
672 | # define YY_LOCATION_PRINT(File, Loc) ((void) 0) | |
673 | # endif | |
674 | #endif]], [[ | |
675 | ||
676 | ||
677 | /* This macro is provided for backward compatibility. */ | |
678 | ||
679 | #ifndef YY_LOCATION_PRINT | |
680 | # define YY_LOCATION_PRINT(File, Loc) ((void) 0) | |
681 | #endif]])[ | |
682 | ||
683 | ||
684 | /* YYLEX -- calling `yylex' with the right arguments. */ | |
685 | ||
686 | #ifdef YYLEX_PARAM | |
687 | # define YYLEX yylex (]b4_pure_if([&yylval[]b4_locations_if([, &yylloc]), ])[YYLEX_PARAM) | |
688 | #else | |
689 | # define YYLEX ]b4_c_function_call([yylex], [int], b4_lex_param)[ | |
690 | #endif | |
691 | ||
692 | /* Enable debugging if requested. */ | |
693 | #if ]b4_api_PREFIX[DEBUG | |
694 | ||
695 | # ifndef YYFPRINTF | |
696 | # include <stdio.h> /* INFRINGES ON USER NAME SPACE */ | |
697 | # define YYFPRINTF fprintf | |
698 | # endif | |
699 | ||
700 | # define YYDPRINTF(Args) \ | |
701 | do { \ | |
702 | if (yydebug) \ | |
703 | YYFPRINTF Args; \ | |
704 | } while (YYID (0)) | |
705 | ||
706 | # define YY_SYMBOL_PRINT(Title, Type, Value, Location) \ | |
707 | do { \ | |
708 | if (yydebug) \ | |
709 | { \ | |
710 | YYFPRINTF (stderr, "%s ", Title); \ | |
711 | yy_symbol_print (stderr, \ | |
712 | Type, Value]b4_locations_if([, Location])[]b4_user_args[); \ | |
713 | YYFPRINTF (stderr, "\n"); \ | |
714 | } \ | |
715 | } while (YYID (0)) | |
716 | ||
717 | ]b4_yy_symbol_print_generate([b4_c_function_def])[ | |
718 | ||
719 | /*------------------------------------------------------------------. | |
720 | | yy_stack_print -- Print the state stack from its BOTTOM up to its | | |
721 | | TOP (included). | | |
722 | `------------------------------------------------------------------*/ | |
723 | ||
724 | ]b4_c_function_def([yy_stack_print], [static void], | |
725 | [[yytype_int16 *yybottom], [yybottom]], | |
726 | [[yytype_int16 *yytop], [yytop]])[ | |
727 | { | |
728 | YYFPRINTF (stderr, "Stack now"); | |
729 | for (; yybottom <= yytop; yybottom++) | |
730 | { | |
731 | int yybot = *yybottom; | |
732 | YYFPRINTF (stderr, " %d", yybot); | |
733 | } | |
734 | YYFPRINTF (stderr, "\n"); | |
735 | } | |
736 | ||
737 | # define YY_STACK_PRINT(Bottom, Top) \ | |
738 | do { \ | |
739 | if (yydebug) \ | |
740 | yy_stack_print ((Bottom), (Top)); \ | |
741 | } while (YYID (0)) | |
742 | ||
743 | ||
744 | /*------------------------------------------------. | |
745 | | Report that the YYRULE is going to be reduced. | | |
746 | `------------------------------------------------*/ | |
747 | ||
748 | ]b4_c_function_def([yy_reduce_print], [static void], | |
749 | [[yytype_int16 *yyssp], [yyssp]], | |
750 | [[YYSTYPE *yyvsp], [yyvsp]], | |
751 | b4_locations_if([[[YYLTYPE *yylsp], [yylsp]], | |
752 | ])[[int yyrule], [yyrule]]m4_ifset([b4_parse_param], [, | |
753 | b4_parse_param]))[ | |
754 | { | |
755 | unsigned long int yylno = yyrline[yyrule]; | |
756 | int yynrhs = yyr2[yyrule]; | |
757 | int yyi; | |
758 | YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n", | |
759 | yyrule - 1, yylno); | |
760 | /* The symbols being reduced. */ | |
761 | for (yyi = 0; yyi < yynrhs; yyi++) | |
762 | { | |
763 | YYFPRINTF (stderr, " $%d = ", yyi + 1); | |
764 | yy_symbol_print (stderr, | |
765 | yystos[yyssp[yyi + 1 - yynrhs]], | |
766 | &]b4_rhs_value(yynrhs, yyi + 1)[ | |
767 | ]b4_locations_if([, &]b4_rhs_location(yynrhs, yyi + 1))[]dnl | |
768 | b4_user_args[); | |
769 | YYFPRINTF (stderr, "\n"); | |
770 | } | |
771 | } | |
772 | ||
773 | # define YY_REDUCE_PRINT(Rule) \ | |
774 | do { \ | |
775 | if (yydebug) \ | |
776 | yy_reduce_print (yyssp, yyvsp, ]b4_locations_if([yylsp, ])[Rule]b4_user_args[); \ | |
777 | } while (YYID (0)) | |
778 | ||
779 | /* Nonzero means print parse trace. It is left uninitialized so that | |
780 | multiple parsers can coexist. */ | |
781 | int yydebug; | |
782 | #else /* !]b4_api_PREFIX[DEBUG */ | |
783 | # define YYDPRINTF(Args) | |
784 | # define YY_SYMBOL_PRINT(Title, Type, Value, Location) | |
785 | # define YY_STACK_PRINT(Bottom, Top) | |
786 | # define YY_REDUCE_PRINT(Rule) | |
787 | #endif /* !]b4_api_PREFIX[DEBUG */ | |
788 | ||
789 | ||
790 | /* YYINITDEPTH -- initial size of the parser's stacks. */ | |
791 | #ifndef YYINITDEPTH | |
792 | # define YYINITDEPTH ]b4_stack_depth_init[ | |
793 | #endif | |
794 | ||
795 | /* YYMAXDEPTH -- maximum size the stacks can grow to (effective only | |
796 | if the built-in stack extension method is used). | |
797 | ||
798 | Do not make this value too large; the results are undefined if | |
799 | YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH) | |
800 | evaluated with infinite-precision integer arithmetic. */ | |
801 | ||
802 | #ifndef YYMAXDEPTH | |
803 | # define YYMAXDEPTH ]b4_stack_depth_max[ | |
804 | #endif]b4_lac_if([[ | |
805 | ||
806 | /* Given a state stack such that *YYBOTTOM is its bottom, such that | |
807 | *YYTOP is either its top or is YYTOP_EMPTY to indicate an empty | |
808 | stack, and such that *YYCAPACITY is the maximum number of elements it | |
809 | can hold without a reallocation, make sure there is enough room to | |
810 | store YYADD more elements. If not, allocate a new stack using | |
811 | YYSTACK_ALLOC, copy the existing elements, and adjust *YYBOTTOM, | |
812 | *YYTOP, and *YYCAPACITY to reflect the new capacity and memory | |
813 | location. If *YYBOTTOM != YYBOTTOM_NO_FREE, then free the old stack | |
814 | using YYSTACK_FREE. Return 0 if successful or if no reallocation is | |
815 | required. Return 1 if memory is exhausted. */ | |
816 | static int | |
817 | yy_lac_stack_realloc (YYSIZE_T *yycapacity, YYSIZE_T yyadd, | |
818 | #if ]b4_api_PREFIX[DEBUG | |
819 | char const *yydebug_prefix, | |
820 | char const *yydebug_suffix, | |
821 | #endif | |
822 | yytype_int16 **yybottom, | |
823 | yytype_int16 *yybottom_no_free, | |
824 | yytype_int16 **yytop, yytype_int16 *yytop_empty) | |
825 | { | |
826 | YYSIZE_T yysize_old = | |
827 | *yytop == yytop_empty ? 0 : *yytop - *yybottom + 1; | |
828 | YYSIZE_T yysize_new = yysize_old + yyadd; | |
829 | if (*yycapacity < yysize_new) | |
830 | { | |
831 | YYSIZE_T yyalloc = 2 * yysize_new; | |
832 | yytype_int16 *yybottom_new; | |
833 | /* Use YYMAXDEPTH for maximum stack size given that the stack | |
834 | should never need to grow larger than the main state stack | |
835 | needs to grow without LAC. */ | |
836 | if (YYMAXDEPTH < yysize_new) | |
837 | { | |
838 | YYDPRINTF ((stderr, "%smax size exceeded%s", yydebug_prefix, | |
839 | yydebug_suffix)); | |
840 | return 1; | |
841 | } | |
842 | if (YYMAXDEPTH < yyalloc) | |
843 | yyalloc = YYMAXDEPTH; | |
844 | yybottom_new = | |
845 | (yytype_int16*) YYSTACK_ALLOC (yyalloc * sizeof *yybottom_new); | |
846 | if (!yybottom_new) | |
847 | { | |
848 | YYDPRINTF ((stderr, "%srealloc failed%s", yydebug_prefix, | |
849 | yydebug_suffix)); | |
850 | return 1; | |
851 | } | |
852 | if (*yytop != yytop_empty) | |
853 | { | |
854 | YYCOPY (yybottom_new, *yybottom, yysize_old); | |
855 | *yytop = yybottom_new + (yysize_old - 1); | |
856 | } | |
857 | if (*yybottom != yybottom_no_free) | |
858 | YYSTACK_FREE (*yybottom); | |
859 | *yybottom = yybottom_new; | |
860 | *yycapacity = yyalloc;]m4_if(b4_percent_define_get([[parse.lac.memory-trace]]), | |
861 | [full], [[ | |
862 | YYDPRINTF ((stderr, "%srealloc to %lu%s", yydebug_prefix, | |
863 | (unsigned long int) yyalloc, yydebug_suffix));]])[ | |
864 | } | |
865 | return 0; | |
866 | } | |
867 | ||
868 | /* Establish the initial context for the current lookahead if no initial | |
869 | context is currently established. | |
870 | ||
871 | We define a context as a snapshot of the parser stacks. We define | |
872 | the initial context for a lookahead as the context in which the | |
873 | parser initially examines that lookahead in order to select a | |
874 | syntactic action. Thus, if the lookahead eventually proves | |
875 | syntactically unacceptable (possibly in a later context reached via a | |
876 | series of reductions), the initial context can be used to determine | |
877 | the exact set of tokens that would be syntactically acceptable in the | |
878 | lookahead's place. Moreover, it is the context after which any | |
879 | further semantic actions would be erroneous because they would be | |
880 | determined by a syntactically unacceptable token. | |
881 | ||
882 | YY_LAC_ESTABLISH should be invoked when a reduction is about to be | |
883 | performed in an inconsistent state (which, for the purposes of LAC, | |
884 | includes consistent states that don't know they're consistent because | |
885 | their default reductions have been disabled). Iff there is a | |
886 | lookahead token, it should also be invoked before reporting a syntax | |
887 | error. This latter case is for the sake of the debugging output. | |
888 | ||
889 | For parse.lac=full, the implementation of YY_LAC_ESTABLISH is as | |
890 | follows. If no initial context is currently established for the | |
891 | current lookahead, then check if that lookahead can eventually be | |
892 | shifted if syntactic actions continue from the current context. | |
893 | Report a syntax error if it cannot. */ | |
894 | #define YY_LAC_ESTABLISH \ | |
895 | do { \ | |
896 | if (!yy_lac_established) \ | |
897 | { \ | |
898 | YYDPRINTF ((stderr, \ | |
899 | "LAC: initial context established for %s\n", \ | |
900 | yytname[yytoken])); \ | |
901 | yy_lac_established = 1; \ | |
902 | { \ | |
903 | int yy_lac_status = \ | |
904 | yy_lac (yyesa, &yyes, &yyes_capacity, yyssp, yytoken); \ | |
905 | if (yy_lac_status == 2) \ | |
906 | goto yyexhaustedlab; \ | |
907 | if (yy_lac_status == 1) \ | |
908 | goto yyerrlab; \ | |
909 | } \ | |
910 | } \ | |
911 | } while (YYID (0)) | |
912 | ||
913 | /* Discard any previous initial lookahead context because of Event, | |
914 | which may be a lookahead change or an invalidation of the currently | |
915 | established initial context for the current lookahead. | |
916 | ||
917 | The most common example of a lookahead change is a shift. An example | |
918 | of both cases is syntax error recovery. That is, a syntax error | |
919 | occurs when the lookahead is syntactically erroneous for the | |
920 | currently established initial context, so error recovery manipulates | |
921 | the parser stacks to try to find a new initial context in which the | |
922 | current lookahead is syntactically acceptable. If it fails to find | |
923 | such a context, it discards the lookahead. */ | |
924 | #if ]b4_api_PREFIX[DEBUG | |
925 | # define YY_LAC_DISCARD(Event) \ | |
926 | do { \ | |
927 | if (yy_lac_established) \ | |
928 | { \ | |
929 | if (yydebug) \ | |
930 | YYFPRINTF (stderr, "LAC: initial context discarded due to " \ | |
931 | Event "\n"); \ | |
932 | yy_lac_established = 0; \ | |
933 | } \ | |
934 | } while (YYID (0)) | |
935 | #else | |
936 | # define YY_LAC_DISCARD(Event) yy_lac_established = 0 | |
937 | #endif | |
938 | ||
939 | /* Given the stack whose top is *YYSSP, return 0 iff YYTOKEN can | |
940 | eventually (after perhaps some reductions) be shifted, return 1 if | |
941 | not, or return 2 if memory is exhausted. As preconditions and | |
942 | postconditions: *YYES_CAPACITY is the allocated size of the array to | |
943 | which *YYES points, and either *YYES = YYESA or *YYES points to an | |
944 | array allocated with YYSTACK_ALLOC. yy_lac may overwrite the | |
945 | contents of either array, alter *YYES and *YYES_CAPACITY, and free | |
946 | any old *YYES other than YYESA. */ | |
947 | static int | |
948 | yy_lac (yytype_int16 *yyesa, yytype_int16 **yyes, | |
949 | YYSIZE_T *yyes_capacity, yytype_int16 *yyssp, int yytoken) | |
950 | { | |
951 | yytype_int16 *yyes_prev = yyssp; | |
952 | yytype_int16 *yyesp = yyes_prev; | |
953 | YYDPRINTF ((stderr, "LAC: checking lookahead %s:", yytname[yytoken])); | |
954 | if (yytoken == YYUNDEFTOK) | |
955 | { | |
956 | YYDPRINTF ((stderr, " Always Err\n")); | |
957 | return 1; | |
958 | } | |
959 | while (1) | |
960 | { | |
961 | int yyrule = yypact[*yyesp]; | |
962 | if (yypact_value_is_default (yyrule) | |
963 | || (yyrule += yytoken) < 0 || YYLAST < yyrule | |
964 | || yycheck[yyrule] != yytoken) | |
965 | { | |
966 | yyrule = yydefact[*yyesp]; | |
967 | if (yyrule == 0) | |
968 | { | |
969 | YYDPRINTF ((stderr, " Err\n")); | |
970 | return 1; | |
971 | } | |
972 | } | |
973 | else | |
974 | { | |
975 | yyrule = yytable[yyrule]; | |
976 | if (yytable_value_is_error (yyrule)) | |
977 | { | |
978 | YYDPRINTF ((stderr, " Err\n")); | |
979 | return 1; | |
980 | } | |
981 | if (0 < yyrule) | |
982 | { | |
983 | YYDPRINTF ((stderr, " S%d\n", yyrule)); | |
984 | return 0; | |
985 | } | |
986 | yyrule = -yyrule; | |
987 | } | |
988 | { | |
989 | YYSIZE_T yylen = yyr2[yyrule]; | |
990 | YYDPRINTF ((stderr, " R%d", yyrule - 1)); | |
991 | if (yyesp != yyes_prev) | |
992 | { | |
993 | YYSIZE_T yysize = yyesp - *yyes + 1; | |
994 | if (yylen < yysize) | |
995 | { | |
996 | yyesp -= yylen; | |
997 | yylen = 0; | |
998 | } | |
999 | else | |
1000 | { | |
1001 | yylen -= yysize; | |
1002 | yyesp = yyes_prev; | |
1003 | } | |
1004 | } | |
1005 | if (yylen) | |
1006 | yyesp = yyes_prev -= yylen; | |
1007 | } | |
1008 | { | |
1009 | int yystate; | |
1010 | { | |
1011 | int yylhs = yyr1[yyrule] - YYNTOKENS; | |
1012 | yystate = yypgoto[yylhs] + *yyesp; | |
1013 | if (yystate < 0 || YYLAST < yystate | |
1014 | || yycheck[yystate] != *yyesp) | |
1015 | yystate = yydefgoto[yylhs]; | |
1016 | else | |
1017 | yystate = yytable[yystate]; | |
1018 | } | |
1019 | if (yyesp == yyes_prev) | |
1020 | { | |
1021 | yyesp = *yyes; | |
1022 | *yyesp = yystate; | |
1023 | } | |
1024 | else | |
1025 | { | |
1026 | if (yy_lac_stack_realloc (yyes_capacity, 1, | |
1027 | #if ]b4_api_PREFIX[DEBUG | |
1028 | " (", ")", | |
1029 | #endif | |
1030 | yyes, yyesa, &yyesp, yyes_prev)) | |
1031 | { | |
1032 | YYDPRINTF ((stderr, "\n")); | |
1033 | return 2; | |
1034 | } | |
1035 | *++yyesp = yystate; | |
1036 | } | |
1037 | YYDPRINTF ((stderr, " G%d", yystate)); | |
1038 | } | |
1039 | } | |
1040 | }]])[ | |
1041 | ||
1042 | ||
1043 | #if YYERROR_VERBOSE | |
1044 | ||
1045 | # ifndef yystrlen | |
1046 | # if defined __GLIBC__ && defined _STRING_H | |
1047 | # define yystrlen strlen | |
1048 | # else | |
1049 | /* Return the length of YYSTR. */ | |
1050 | ]b4_c_function_def([yystrlen], [static YYSIZE_T], | |
1051 | [[const char *yystr], [yystr]])[ | |
1052 | { | |
1053 | YYSIZE_T yylen; | |
1054 | for (yylen = 0; yystr[yylen]; yylen++) | |
1055 | continue; | |
1056 | return yylen; | |
1057 | } | |
1058 | # endif | |
1059 | # endif | |
1060 | ||
1061 | # ifndef yystpcpy | |
1062 | # if defined __GLIBC__ && defined _STRING_H && defined _GNU_SOURCE | |
1063 | # define yystpcpy stpcpy | |
1064 | # else | |
1065 | /* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in | |
1066 | YYDEST. */ | |
1067 | ]b4_c_function_def([yystpcpy], [static char *], | |
1068 | [[char *yydest], [yydest]], [[const char *yysrc], [yysrc]])[ | |
1069 | { | |
1070 | char *yyd = yydest; | |
1071 | const char *yys = yysrc; | |
1072 | ||
1073 | while ((*yyd++ = *yys++) != '\0') | |
1074 | continue; | |
1075 | ||
1076 | return yyd - 1; | |
1077 | } | |
1078 | # endif | |
1079 | # endif | |
1080 | ||
1081 | # ifndef yytnamerr | |
1082 | /* Copy to YYRES the contents of YYSTR after stripping away unnecessary | |
1083 | quotes and backslashes, so that it's suitable for yyerror. The | |
1084 | heuristic is that double-quoting is unnecessary unless the string | |
1085 | contains an apostrophe, a comma, or backslash (other than | |
1086 | backslash-backslash). YYSTR is taken from yytname. If YYRES is | |
1087 | null, do not copy; instead, return the length of what the result | |
1088 | would have been. */ | |
1089 | static YYSIZE_T | |
1090 | yytnamerr (char *yyres, const char *yystr) | |
1091 | { | |
1092 | if (*yystr == '"') | |
1093 | { | |
1094 | YYSIZE_T yyn = 0; | |
1095 | char const *yyp = yystr; | |
1096 | ||
1097 | for (;;) | |
1098 | switch (*++yyp) | |
1099 | { | |
1100 | case '\'': | |
1101 | case ',': | |
1102 | goto do_not_strip_quotes; | |
1103 | ||
1104 | case '\\': | |
1105 | if (*++yyp != '\\') | |
1106 | goto do_not_strip_quotes; | |
1107 | /* Fall through. */ | |
1108 | default: | |
1109 | if (yyres) | |
1110 | yyres[yyn] = *yyp; | |
1111 | yyn++; | |
1112 | break; | |
1113 | ||
1114 | case '"': | |
1115 | if (yyres) | |
1116 | yyres[yyn] = '\0'; | |
1117 | return yyn; | |
1118 | } | |
1119 | do_not_strip_quotes: ; | |
1120 | } | |
1121 | ||
1122 | if (! yyres) | |
1123 | return yystrlen (yystr); | |
1124 | ||
1125 | return yystpcpy (yyres, yystr) - yyres; | |
1126 | } | |
1127 | # endif | |
1128 | ||
1129 | /* Copy into *YYMSG, which is of size *YYMSG_ALLOC, an error message | |
1130 | about the unexpected token YYTOKEN for the state stack whose top is | |
1131 | YYSSP.]b4_lac_if([[ In order to see if a particular token T is a | |
1132 | valid looakhead, invoke yy_lac (YYESA, YYES, YYES_CAPACITY, YYSSP, T).]])[ | |
1133 | ||
1134 | Return 0 if *YYMSG was successfully written. Return 1 if *YYMSG is | |
1135 | not large enough to hold the message. In that case, also set | |
1136 | *YYMSG_ALLOC to the required number of bytes. Return 2 if the | |
1137 | required number of bytes is too large to store]b4_lac_if([[ or if | |
1138 | yy_lac returned 2]])[. */ | |
1139 | static int | |
1140 | yysyntax_error (YYSIZE_T *yymsg_alloc, char **yymsg, | |
1141 | ]b4_lac_if([[yytype_int16 *yyesa, yytype_int16 **yyes, | |
1142 | YYSIZE_T *yyes_capacity, ]])[yytype_int16 *yyssp, int yytoken) | |
1143 | { | |
1144 | YYSIZE_T yysize0 = yytnamerr (YY_NULL, yytname[yytoken]); | |
1145 | YYSIZE_T yysize = yysize0; | |
1146 | YYSIZE_T yysize1; | |
1147 | enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 }; | |
1148 | /* Internationalized format string. */ | |
1149 | const char *yyformat = YY_NULL; | |
1150 | /* Arguments of yyformat. */ | |
1151 | char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM]; | |
1152 | /* Number of reported tokens (one for the "unexpected", one per | |
1153 | "expected"). */ | |
1154 | int yycount = 0; | |
1155 | ||
1156 | /* There are many possibilities here to consider: | |
1157 | - If this state is a consistent state with a default action, then | |
1158 | the only way this function was invoked is if the default action | |
1159 | is an error action. In that case, don't check for expected | |
1160 | tokens because there are none. | |
1161 | - The only way there can be no lookahead present (in yychar) is if | |
1162 | this state is a consistent state with a default action. Thus, | |
1163 | detecting the absence of a lookahead is sufficient to determine | |
1164 | that there is no unexpected or expected token to report. In that | |
1165 | case, just report a simple "syntax error". | |
1166 | - Don't assume there isn't a lookahead just because this state is a | |
1167 | consistent state with a default action. There might have been a | |
1168 | previous inconsistent state, consistent state with a non-default | |
1169 | action, or user semantic action that manipulated yychar.]b4_lac_if([[ | |
1170 | In the first two cases, it might appear that the current syntax | |
1171 | error should have been detected in the previous state when yy_lac | |
1172 | was invoked. However, at that time, there might have been a | |
1173 | different syntax error that discarded a different initial context | |
1174 | during error recovery, leaving behind the current lookahead.]], [[ | |
1175 | - Of course, the expected token list depends on states to have | |
1176 | correct lookahead information, and it depends on the parser not | |
1177 | to perform extra reductions after fetching a lookahead from the | |
1178 | scanner and before detecting a syntax error. Thus, state merging | |
1179 | (from LALR or IELR) and default reductions corrupt the expected | |
1180 | token list. However, the list is correct for canonical LR with | |
1181 | one exception: it will still contain any token that will not be | |
1182 | accepted due to an error action in a later state.]])[ | |
1183 | */ | |
1184 | if (yytoken != YYEMPTY) | |
1185 | { | |
1186 | int yyn = yypact[*yyssp];]b4_lac_if([[ | |
1187 | YYDPRINTF ((stderr, "Constructing syntax error message\n"));]])[ | |
1188 | yyarg[yycount++] = yytname[yytoken]; | |
1189 | if (!yypact_value_is_default (yyn)) | |
1190 | {]b4_lac_if([], [[ | |
1191 | /* Start YYX at -YYN if negative to avoid negative indexes in | |
1192 | YYCHECK. In other words, skip the first -YYN actions for | |
1193 | this state because they are default actions. */ | |
1194 | int yyxbegin = yyn < 0 ? -yyn : 0; | |
1195 | /* Stay within bounds of both yycheck and yytname. */ | |
1196 | int yychecklim = YYLAST - yyn + 1; | |
1197 | int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS;]])[ | |
1198 | int yyx;]b4_lac_if([[ | |
1199 | ||
1200 | for (yyx = 0; yyx < YYNTOKENS; ++yyx) | |
1201 | if (yyx != YYTERROR && yyx != YYUNDEFTOK) | |
1202 | { | |
1203 | { | |
1204 | int yy_lac_status = yy_lac (yyesa, yyes, yyes_capacity, | |
1205 | yyssp, yyx); | |
1206 | if (yy_lac_status == 2) | |
1207 | return 2; | |
1208 | if (yy_lac_status == 1) | |
1209 | continue; | |
1210 | }]], [[ | |
1211 | ||
1212 | for (yyx = yyxbegin; yyx < yyxend; ++yyx) | |
1213 | if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR | |
1214 | && !yytable_value_is_error (yytable[yyx + yyn])) | |
1215 | {]])[ | |
1216 | if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM) | |
1217 | { | |
1218 | yycount = 1; | |
1219 | yysize = yysize0; | |
1220 | break; | |
1221 | } | |
1222 | yyarg[yycount++] = yytname[yyx]; | |
1223 | yysize1 = yysize + yytnamerr (YY_NULL, yytname[yyx]); | |
1224 | if (! (yysize <= yysize1 | |
1225 | && yysize1 <= YYSTACK_ALLOC_MAXIMUM)) | |
1226 | return 2; | |
1227 | yysize = yysize1; | |
1228 | } | |
1229 | }]b4_lac_if([[ | |
1230 | # if ]b4_api_PREFIX[DEBUG | |
1231 | else if (yydebug) | |
1232 | YYFPRINTF (stderr, "No expected tokens.\n"); | |
1233 | # endif]])[ | |
1234 | } | |
1235 | ||
1236 | switch (yycount) | |
1237 | { | |
1238 | # define YYCASE_(N, S) \ | |
1239 | case N: \ | |
1240 | yyformat = S; \ | |
1241 | break | |
1242 | YYCASE_(0, YY_("syntax error")); | |
1243 | YYCASE_(1, YY_("syntax error, unexpected %s")); | |
1244 | YYCASE_(2, YY_("syntax error, unexpected %s, expecting %s")); | |
1245 | YYCASE_(3, YY_("syntax error, unexpected %s, expecting %s or %s")); | |
1246 | YYCASE_(4, YY_("syntax error, unexpected %s, expecting %s or %s or %s")); | |
1247 | YYCASE_(5, YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s")); | |
1248 | # undef YYCASE_ | |
1249 | } | |
1250 | ||
1251 | yysize1 = yysize + yystrlen (yyformat); | |
1252 | if (! (yysize <= yysize1 && yysize1 <= YYSTACK_ALLOC_MAXIMUM)) | |
1253 | return 2; | |
1254 | yysize = yysize1; | |
1255 | ||
1256 | if (*yymsg_alloc < yysize) | |
1257 | { | |
1258 | *yymsg_alloc = 2 * yysize; | |
1259 | if (! (yysize <= *yymsg_alloc | |
1260 | && *yymsg_alloc <= YYSTACK_ALLOC_MAXIMUM)) | |
1261 | *yymsg_alloc = YYSTACK_ALLOC_MAXIMUM; | |
1262 | return 1; | |
1263 | } | |
1264 | ||
1265 | /* Avoid sprintf, as that infringes on the user's name space. | |
1266 | Don't have undefined behavior even if the translation | |
1267 | produced a string with the wrong number of "%s"s. */ | |
1268 | { | |
1269 | char *yyp = *yymsg; | |
1270 | int yyi = 0; | |
1271 | while ((*yyp = *yyformat) != '\0') | |
1272 | if (*yyp == '%' && yyformat[1] == 's' && yyi < yycount) | |
1273 | { | |
1274 | yyp += yytnamerr (yyp, yyarg[yyi++]); | |
1275 | yyformat += 2; | |
1276 | } | |
1277 | else | |
1278 | { | |
1279 | yyp++; | |
1280 | yyformat++; | |
1281 | } | |
1282 | } | |
1283 | return 0; | |
1284 | } | |
1285 | #endif /* YYERROR_VERBOSE */ | |
1286 | ||
1287 | ]b4_yydestruct_generate([b4_c_function_def])[ | |
1288 | ||
1289 | ]b4_pure_if([], [ | |
1290 | ||
1291 | b4_declare_scanner_communication_variables])[]b4_push_if([[ | |
1292 | ||
1293 | struct yypstate | |
1294 | {]b4_declare_parser_state_variables[ | |
1295 | /* Used to determine if this is the first time this instance has | |
1296 | been used. */ | |
1297 | int yynew; | |
1298 | };]b4_pure_if([], [[ | |
1299 | ||
1300 | static char yypstate_allocated = 0;]])b4_pull_if([ | |
1301 | ||
1302 | b4_c_function_def([[yyparse]], [[int]], b4_parse_param)[ | |
1303 | { | |
1304 | return yypull_parse (YY_NULL]m4_ifset([b4_parse_param], | |
1305 | [[, ]b4_c_args(b4_parse_param)])[); | |
1306 | } | |
1307 | ||
1308 | ]b4_c_function_def([[yypull_parse]], [[int]], | |
1309 | [[[yypstate *yyps]], [[yyps]]]m4_ifset([b4_parse_param], [, | |
1310 | b4_parse_param]))[ | |
1311 | { | |
1312 | int yystatus; | |
1313 | yypstate *yyps_local;]b4_pure_if([[ | |
1314 | int yychar; | |
1315 | YYSTYPE yylval;]b4_locations_if([[ | |
1316 | YYLTYPE yylloc;]])])[ | |
1317 | if (yyps) | |
1318 | yyps_local = yyps; | |
1319 | else | |
1320 | { | |
1321 | yyps_local = yypstate_new (); | |
1322 | if (!yyps_local) | |
1323 | {]b4_pure_if([[ | |
1324 | yyerror (]b4_yyerror_args[YY_("memory exhausted"));]], [[ | |
1325 | if (!yypstate_allocated) | |
1326 | yyerror (]b4_yyerror_args[YY_("memory exhausted"));]])[ | |
1327 | return 2; | |
1328 | } | |
1329 | } | |
1330 | do { | |
1331 | yychar = YYLEX; | |
1332 | yystatus = | |
1333 | yypush_parse (yyps_local]b4_pure_if([[, yychar, &yylval]b4_locations_if([[, &yylloc]])])m4_ifset([b4_parse_param], [, b4_c_args(b4_parse_param)])[); | |
1334 | } while (yystatus == YYPUSH_MORE); | |
1335 | if (!yyps) | |
1336 | yypstate_delete (yyps_local); | |
1337 | return yystatus; | |
1338 | }]])[ | |
1339 | ||
1340 | /* Initialize the parser data structure. */ | |
1341 | ]b4_c_function_def([[yypstate_new]], [[yypstate *]])[ | |
1342 | { | |
1343 | yypstate *yyps;]b4_pure_if([], [[ | |
1344 | if (yypstate_allocated) | |
1345 | return YY_NULL;]])[ | |
1346 | yyps = (yypstate *) malloc (sizeof *yyps); | |
1347 | if (!yyps) | |
1348 | return YY_NULL; | |
1349 | yyps->yynew = 1;]b4_pure_if([], [[ | |
1350 | yypstate_allocated = 1;]])[ | |
1351 | return yyps; | |
1352 | } | |
1353 | ||
1354 | ]b4_c_function_def([[yypstate_delete]], [[void]], | |
1355 | [[[yypstate *yyps]], [[yyps]]])[ | |
1356 | { | |
1357 | #ifndef yyoverflow | |
1358 | /* If the stack was reallocated but the parse did not complete, then the | |
1359 | stack still needs to be freed. */ | |
1360 | if (!yyps->yynew && yyps->yyss != yyps->yyssa) | |
1361 | YYSTACK_FREE (yyps->yyss); | |
1362 | #endif]b4_lac_if([[ | |
1363 | if (!yyps->yynew && yyps->yyes != yyps->yyesa) | |
1364 | YYSTACK_FREE (yyps->yyes);]])[ | |
1365 | free (yyps);]b4_pure_if([], [[ | |
1366 | yypstate_allocated = 0;]])[ | |
1367 | } | |
1368 | ]b4_pure_if([[ | |
1369 | #define ]b4_prefix[nerrs yyps->]b4_prefix[nerrs]])[ | |
1370 | #define yystate yyps->yystate | |
1371 | #define yyerrstatus yyps->yyerrstatus | |
1372 | #define yyssa yyps->yyssa | |
1373 | #define yyss yyps->yyss | |
1374 | #define yyssp yyps->yyssp | |
1375 | #define yyvsa yyps->yyvsa | |
1376 | #define yyvs yyps->yyvs | |
1377 | #define yyvsp yyps->yyvsp]b4_locations_if([[ | |
1378 | #define yylsa yyps->yylsa | |
1379 | #define yyls yyps->yyls | |
1380 | #define yylsp yyps->yylsp | |
1381 | #define yyerror_range yyps->yyerror_range]])[ | |
1382 | #define yystacksize yyps->yystacksize]b4_lac_if([[ | |
1383 | #define yyesa yyps->yyesa | |
1384 | #define yyes yyps->yyes | |
1385 | #define yyes_capacity yyps->yyes_capacity]])[ | |
1386 | ||
1387 | ||
1388 | /*---------------. | |
1389 | | yypush_parse. | | |
1390 | `---------------*/ | |
1391 | ||
1392 | ]b4_c_function_def([[yypush_parse]], [[int]], | |
1393 | [[[yypstate *yyps]], [[yyps]]]b4_pure_if([, | |
1394 | [[[int yypushed_char]], [[yypushed_char]]], | |
1395 | [[[YYSTYPE const *yypushed_val]], [[yypushed_val]]]b4_locations_if([, | |
1396 | [[[YYLTYPE const *yypushed_loc]], [[yypushed_loc]]]])])m4_ifset([b4_parse_param], [, | |
1397 | b4_parse_param]))], [[ | |
1398 | ||
1399 | ||
1400 | /*----------. | |
1401 | | yyparse. | | |
1402 | `----------*/ | |
1403 | ||
1404 | ]b4_c_function_def([yyparse], [int], b4_parse_param)])[ | |
1405 | {]b4_pure_if([b4_declare_scanner_communication_variables | |
1406 | ])b4_push_if([b4_pure_if([], [[ | |
1407 | int yypushed_char = yychar; | |
1408 | YYSTYPE yypushed_val = yylval;]b4_locations_if([[ | |
1409 | YYLTYPE yypushed_loc = yylloc;]]) | |
1410 | ])], | |
1411 | [b4_declare_parser_state_variables | |
1412 | ])b4_lac_if([[ | |
1413 | int yy_lac_established = 0;]])[ | |
1414 | int yyn; | |
1415 | int yyresult; | |
1416 | /* Lookahead token as an internal (translated) token number. */ | |
1417 | int yytoken; | |
1418 | /* The variables used to return semantic value and location from the | |
1419 | action routines. */ | |
1420 | YYSTYPE yyval;]b4_locations_if([[ | |
1421 | YYLTYPE yyloc;]])[ | |
1422 | ||
1423 | #if YYERROR_VERBOSE | |
1424 | /* Buffer for error messages, and its allocated size. */ | |
1425 | char yymsgbuf[128]; | |
1426 | char *yymsg = yymsgbuf; | |
1427 | YYSIZE_T yymsg_alloc = sizeof yymsgbuf; | |
1428 | #endif | |
1429 | ||
1430 | #define YYPOPSTACK(N) (yyvsp -= (N), yyssp -= (N)]b4_locations_if([, yylsp -= (N)])[) | |
1431 | ||
1432 | /* The number of symbols on the RHS of the reduced rule. | |
1433 | Keep to zero when no symbol should be popped. */ | |
1434 | int yylen = 0;]b4_push_if([[ | |
1435 | ||
1436 | if (!yyps->yynew) | |
1437 | { | |
1438 | yyn = yypact[yystate]; | |
1439 | goto yyread_pushed_token; | |
1440 | }]])[ | |
1441 | ||
1442 | yytoken = 0; | |
1443 | yyss = yyssa; | |
1444 | yyvs = yyvsa;]b4_locations_if([[ | |
1445 | yyls = yylsa;]])[ | |
1446 | yystacksize = YYINITDEPTH;]b4_lac_if([[ | |
1447 | ||
1448 | yyes = yyesa; | |
1449 | yyes_capacity = sizeof yyesa / sizeof *yyes; | |
1450 | if (YYMAXDEPTH < yyes_capacity) | |
1451 | yyes_capacity = YYMAXDEPTH;]])[ | |
1452 | ||
1453 | YYDPRINTF ((stderr, "Starting parse\n")); | |
1454 | ||
1455 | yystate = 0; | |
1456 | yyerrstatus = 0; | |
1457 | yynerrs = 0; | |
1458 | yychar = YYEMPTY; /* Cause a token to be read. */ | |
1459 | ||
1460 | /* Initialize stack pointers. | |
1461 | Waste one element of value and location stack | |
1462 | so that they stay on the same level as the state stack. | |
1463 | The wasted elements are never initialized. */ | |
1464 | yyssp = yyss; | |
1465 | yyvsp = yyvs;]b4_locations_if([[ | |
1466 | yylsp = yyls; | |
1467 | ||
1468 | #if defined ]b4_api_PREFIX[LTYPE_IS_TRIVIAL && ]b4_api_PREFIX[LTYPE_IS_TRIVIAL | |
1469 | /* Initialize the default location before parsing starts. */ | |
1470 | yylloc.first_line = yylloc.last_line = ]b4_location_initial_line[; | |
1471 | yylloc.first_column = yylloc.last_column = ]b4_location_initial_column[; | |
1472 | #endif]]) | |
1473 | m4_ifdef([b4_initial_action],[ | |
1474 | b4_dollar_pushdef([m4_define([b4_dollar_dollar_used])yylval], [], | |
1475 | [m4_define([b4_at_dollar_used])yylloc])dnl | |
1476 | /* User initialization code. */ | |
1477 | b4_user_initial_action | |
1478 | b4_dollar_popdef[]dnl | |
1479 | m4_ifdef([b4_dollar_dollar_used],[[ yyvsp[0] = yylval; | |
1480 | ]])dnl | |
1481 | m4_ifdef([b4_at_dollar_used], [[ yylsp[0] = yylloc; | |
1482 | ]])])dnl | |
1483 | [ goto yysetstate; | |
1484 | ||
1485 | /*------------------------------------------------------------. | |
1486 | | yynewstate -- Push a new state, which is found in yystate. | | |
1487 | `------------------------------------------------------------*/ | |
1488 | yynewstate: | |
1489 | /* In all cases, when you get here, the value and location stacks | |
1490 | have just been pushed. So pushing a state here evens the stacks. */ | |
1491 | yyssp++; | |
1492 | ||
1493 | yysetstate: | |
1494 | *yyssp = yystate; | |
1495 | ||
1496 | if (yyss + yystacksize - 1 <= yyssp) | |
1497 | { | |
1498 | /* Get the current used size of the three stacks, in elements. */ | |
1499 | YYSIZE_T yysize = yyssp - yyss + 1; | |
1500 | ||
1501 | #ifdef yyoverflow | |
1502 | { | |
1503 | /* Give user a chance to reallocate the stack. Use copies of | |
1504 | these so that the &'s don't force the real ones into | |
1505 | memory. */ | |
1506 | YYSTYPE *yyvs1 = yyvs; | |
1507 | yytype_int16 *yyss1 = yyss;]b4_locations_if([ | |
1508 | YYLTYPE *yyls1 = yyls;])[ | |
1509 | ||
1510 | /* Each stack pointer address is followed by the size of the | |
1511 | data in use in that stack, in bytes. This used to be a | |
1512 | conditional around just the two extra args, but that might | |
1513 | be undefined if yyoverflow is a macro. */ | |
1514 | yyoverflow (YY_("memory exhausted"), | |
1515 | &yyss1, yysize * sizeof (*yyssp), | |
1516 | &yyvs1, yysize * sizeof (*yyvsp),]b4_locations_if([ | |
1517 | &yyls1, yysize * sizeof (*yylsp),])[ | |
1518 | &yystacksize); | |
1519 | ]b4_locations_if([ | |
1520 | yyls = yyls1;])[ | |
1521 | yyss = yyss1; | |
1522 | yyvs = yyvs1; | |
1523 | } | |
1524 | #else /* no yyoverflow */ | |
1525 | # ifndef YYSTACK_RELOCATE | |
1526 | goto yyexhaustedlab; | |
1527 | # else | |
1528 | /* Extend the stack our own way. */ | |
1529 | if (YYMAXDEPTH <= yystacksize) | |
1530 | goto yyexhaustedlab; | |
1531 | yystacksize *= 2; | |
1532 | if (YYMAXDEPTH < yystacksize) | |
1533 | yystacksize = YYMAXDEPTH; | |
1534 | ||
1535 | { | |
1536 | yytype_int16 *yyss1 = yyss; | |
1537 | union yyalloc *yyptr = | |
1538 | (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize)); | |
1539 | if (! yyptr) | |
1540 | goto yyexhaustedlab; | |
1541 | YYSTACK_RELOCATE (yyss_alloc, yyss); | |
1542 | YYSTACK_RELOCATE (yyvs_alloc, yyvs);]b4_locations_if([ | |
1543 | YYSTACK_RELOCATE (yyls_alloc, yyls);])[ | |
1544 | # undef YYSTACK_RELOCATE | |
1545 | if (yyss1 != yyssa) | |
1546 | YYSTACK_FREE (yyss1); | |
1547 | } | |
1548 | # endif | |
1549 | #endif /* no yyoverflow */ | |
1550 | ||
1551 | yyssp = yyss + yysize - 1; | |
1552 | yyvsp = yyvs + yysize - 1;]b4_locations_if([ | |
1553 | yylsp = yyls + yysize - 1;])[ | |
1554 | ||
1555 | YYDPRINTF ((stderr, "Stack size increased to %lu\n", | |
1556 | (unsigned long int) yystacksize)); | |
1557 | ||
1558 | if (yyss + yystacksize - 1 <= yyssp) | |
1559 | YYABORT; | |
1560 | } | |
1561 | ||
1562 | YYDPRINTF ((stderr, "Entering state %d\n", yystate)); | |
1563 | ||
1564 | if (yystate == YYFINAL) | |
1565 | YYACCEPT; | |
1566 | ||
1567 | goto yybackup; | |
1568 | ||
1569 | /*-----------. | |
1570 | | yybackup. | | |
1571 | `-----------*/ | |
1572 | yybackup: | |
1573 | ||
1574 | /* Do appropriate processing given the current state. Read a | |
1575 | lookahead token if we need one and don't already have one. */ | |
1576 | ||
1577 | /* First try to decide what to do without reference to lookahead token. */ | |
1578 | yyn = yypact[yystate]; | |
1579 | if (yypact_value_is_default (yyn)) | |
1580 | goto yydefault; | |
1581 | ||
1582 | /* Not known => get a lookahead token if don't already have one. */ | |
1583 | ||
1584 | /* YYCHAR is either YYEMPTY or YYEOF or a valid lookahead symbol. */ | |
1585 | if (yychar == YYEMPTY) | |
1586 | {]b4_push_if([[ | |
1587 | if (!yyps->yynew) | |
1588 | {]b4_use_push_for_pull_if([], [[ | |
1589 | YYDPRINTF ((stderr, "Return for a new token:\n"));]])[ | |
1590 | yyresult = YYPUSH_MORE; | |
1591 | goto yypushreturn; | |
1592 | } | |
1593 | yyps->yynew = 0;]b4_pure_if([], [[ | |
1594 | /* Restoring the pushed token is only necessary for the first | |
1595 | yypush_parse invocation since subsequent invocations don't overwrite | |
1596 | it before jumping to yyread_pushed_token. */ | |
1597 | yychar = yypushed_char; | |
1598 | yylval = yypushed_val;]b4_locations_if([[ | |
1599 | yylloc = yypushed_loc;]])])[ | |
1600 | yyread_pushed_token:]])[ | |
1601 | YYDPRINTF ((stderr, "Reading a token: "));]b4_push_if([b4_pure_if([[ | |
1602 | yychar = yypushed_char; | |
1603 | if (yypushed_val) | |
1604 | yylval = *yypushed_val;]b4_locations_if([[ | |
1605 | if (yypushed_loc) | |
1606 | yylloc = *yypushed_loc;]])])], [[ | |
1607 | yychar = YYLEX;]])[ | |
1608 | } | |
1609 | ||
1610 | if (yychar <= YYEOF) | |
1611 | { | |
1612 | yychar = yytoken = YYEOF; | |
1613 | YYDPRINTF ((stderr, "Now at end of input.\n")); | |
1614 | } | |
1615 | else | |
1616 | { | |
1617 | yytoken = YYTRANSLATE (yychar); | |
1618 | YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc); | |
1619 | } | |
1620 | ||
1621 | /* If the proper action on seeing token YYTOKEN is to reduce or to | |
1622 | detect an error, take that action. */ | |
1623 | yyn += yytoken; | |
1624 | if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken)]b4_lac_if([[ | |
1625 | { | |
1626 | YY_LAC_ESTABLISH; | |
1627 | goto yydefault; | |
1628 | }]], [[ | |
1629 | goto yydefault;]])[ | |
1630 | yyn = yytable[yyn]; | |
1631 | if (yyn <= 0) | |
1632 | { | |
1633 | if (yytable_value_is_error (yyn)) | |
1634 | goto yyerrlab;]b4_lac_if([[ | |
1635 | YY_LAC_ESTABLISH;]])[ | |
1636 | yyn = -yyn; | |
1637 | goto yyreduce; | |
1638 | } | |
1639 | ||
1640 | /* Count tokens shifted since error; after three, turn off error | |
1641 | status. */ | |
1642 | if (yyerrstatus) | |
1643 | yyerrstatus--; | |
1644 | ||
1645 | /* Shift the lookahead token. */ | |
1646 | YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc); | |
1647 | ||
1648 | /* Discard the shifted token. */ | |
1649 | yychar = YYEMPTY;]b4_lac_if([[ | |
1650 | YY_LAC_DISCARD ("shift");]])[ | |
1651 | ||
1652 | yystate = yyn; | |
1653 | *++yyvsp = yylval; | |
1654 | ]b4_locations_if([ *++yylsp = yylloc;])[ | |
1655 | goto yynewstate; | |
1656 | ||
1657 | ||
1658 | /*-----------------------------------------------------------. | |
1659 | | yydefault -- do the default action for the current state. | | |
1660 | `-----------------------------------------------------------*/ | |
1661 | yydefault: | |
1662 | yyn = yydefact[yystate]; | |
1663 | if (yyn == 0) | |
1664 | goto yyerrlab; | |
1665 | goto yyreduce; | |
1666 | ||
1667 | ||
1668 | /*-----------------------------. | |
1669 | | yyreduce -- Do a reduction. | | |
1670 | `-----------------------------*/ | |
1671 | yyreduce: | |
1672 | /* yyn is the number of a rule to reduce with. */ | |
1673 | yylen = yyr2[yyn]; | |
1674 | ||
1675 | /* If YYLEN is nonzero, implement the default value of the action: | |
1676 | `$$ = $1'. | |
1677 | ||
1678 | Otherwise, the following line sets YYVAL to garbage. | |
1679 | This behavior is undocumented and Bison | |
1680 | users should not rely upon it. Assigning to YYVAL | |
1681 | unconditionally makes the parser a bit smaller, and it avoids a | |
1682 | GCC warning that YYVAL may be used uninitialized. */ | |
1683 | yyval = yyvsp[1-yylen]; | |
1684 | ||
1685 | ]b4_locations_if( | |
1686 | [[ /* Default location. */ | |
1687 | YYLLOC_DEFAULT (yyloc, (yylsp - yylen), yylen);]])[ | |
1688 | YY_REDUCE_PRINT (yyn);]b4_lac_if([[ | |
1689 | { | |
1690 | int yychar_backup = yychar; | |
1691 | switch (yyn) | |
1692 | { | |
1693 | ]b4_user_actions[ | |
1694 | default: break; | |
1695 | } | |
1696 | if (yychar_backup != yychar) | |
1697 | YY_LAC_DISCARD ("yychar change"); | |
1698 | }]], [[ | |
1699 | switch (yyn) | |
1700 | { | |
1701 | ]b4_user_actions[ | |
1702 | default: break; | |
1703 | }]])[ | |
1704 | /* User semantic actions sometimes alter yychar, and that requires | |
1705 | that yytoken be updated with the new translation. We take the | |
1706 | approach of translating immediately before every use of yytoken. | |
1707 | One alternative is translating here after every semantic action, | |
1708 | but that translation would be missed if the semantic action invokes | |
1709 | YYABORT, YYACCEPT, or YYERROR immediately after altering yychar or | |
1710 | if it invokes YYBACKUP. In the case of YYABORT or YYACCEPT, an | |
1711 | incorrect destructor might then be invoked immediately. In the | |
1712 | case of YYERROR or YYBACKUP, subsequent parser actions might lead | |
1713 | to an incorrect destructor call or verbose syntax error message | |
1714 | before the lookahead is translated. */ | |
1715 | YY_SYMBOL_PRINT ("-> $$ =", yyr1[yyn], &yyval, &yyloc); | |
1716 | ||
1717 | YYPOPSTACK (yylen); | |
1718 | yylen = 0; | |
1719 | YY_STACK_PRINT (yyss, yyssp); | |
1720 | ||
1721 | *++yyvsp = yyval;]b4_locations_if([ | |
1722 | *++yylsp = yyloc;])[ | |
1723 | ||
1724 | /* Now `shift' the result of the reduction. Determine what state | |
1725 | that goes to, based on the state we popped back to and the rule | |
1726 | number reduced by. */ | |
1727 | ||
1728 | yyn = yyr1[yyn]; | |
1729 | ||
1730 | yystate = yypgoto[yyn - YYNTOKENS] + *yyssp; | |
1731 | if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp) | |
1732 | yystate = yytable[yystate]; | |
1733 | else | |
1734 | yystate = yydefgoto[yyn - YYNTOKENS]; | |
1735 | ||
1736 | goto yynewstate; | |
1737 | ||
1738 | ||
1739 | /*--------------------------------------. | |
1740 | | yyerrlab -- here on detecting error. | | |
1741 | `--------------------------------------*/ | |
1742 | yyerrlab: | |
1743 | /* Make sure we have latest lookahead translation. See comments at | |
1744 | user semantic actions for why this is necessary. */ | |
1745 | yytoken = yychar == YYEMPTY ? YYEMPTY : YYTRANSLATE (yychar); | |
1746 | ||
1747 | /* If not already recovering from an error, report this error. */ | |
1748 | if (!yyerrstatus) | |
1749 | { | |
1750 | ++yynerrs; | |
1751 | #if ! YYERROR_VERBOSE | |
1752 | yyerror (]b4_yyerror_args[YY_("syntax error")); | |
1753 | #else | |
1754 | # define YYSYNTAX_ERROR yysyntax_error (&yymsg_alloc, &yymsg, \]b4_lac_if([[ | |
1755 | yyesa, &yyes, &yyes_capacity, \]])[ | |
1756 | yyssp, yytoken) | |
1757 | { | |
1758 | char const *yymsgp = YY_("syntax error"); | |
1759 | int yysyntax_error_status;]b4_lac_if([[ | |
1760 | if (yychar != YYEMPTY) | |
1761 | YY_LAC_ESTABLISH;]])[ | |
1762 | yysyntax_error_status = YYSYNTAX_ERROR; | |
1763 | if (yysyntax_error_status == 0) | |
1764 | yymsgp = yymsg; | |
1765 | else if (yysyntax_error_status == 1) | |
1766 | { | |
1767 | if (yymsg != yymsgbuf) | |
1768 | YYSTACK_FREE (yymsg); | |
1769 | yymsg = (char *) YYSTACK_ALLOC (yymsg_alloc); | |
1770 | if (!yymsg) | |
1771 | { | |
1772 | yymsg = yymsgbuf; | |
1773 | yymsg_alloc = sizeof yymsgbuf; | |
1774 | yysyntax_error_status = 2; | |
1775 | } | |
1776 | else | |
1777 | { | |
1778 | yysyntax_error_status = YYSYNTAX_ERROR; | |
1779 | yymsgp = yymsg; | |
1780 | } | |
1781 | } | |
1782 | yyerror (]b4_yyerror_args[yymsgp); | |
1783 | if (yysyntax_error_status == 2) | |
1784 | goto yyexhaustedlab; | |
1785 | } | |
1786 | # undef YYSYNTAX_ERROR | |
1787 | #endif | |
1788 | } | |
1789 | ||
1790 | ]b4_locations_if([[ yyerror_range[1] = yylloc;]])[ | |
1791 | ||
1792 | if (yyerrstatus == 3) | |
1793 | { | |
1794 | /* If just tried and failed to reuse lookahead token after an | |
1795 | error, discard it. */ | |
1796 | ||
1797 | if (yychar <= YYEOF) | |
1798 | { | |
1799 | /* Return failure if at end of input. */ | |
1800 | if (yychar == YYEOF) | |
1801 | YYABORT; | |
1802 | } | |
1803 | else | |
1804 | { | |
1805 | yydestruct ("Error: discarding", | |
1806 | yytoken, &yylval]b4_locations_if([, &yylloc])[]b4_user_args[); | |
1807 | yychar = YYEMPTY; | |
1808 | } | |
1809 | } | |
1810 | ||
1811 | /* Else will try to reuse lookahead token after shifting the error | |
1812 | token. */ | |
1813 | goto yyerrlab1; | |
1814 | ||
1815 | ||
1816 | /*---------------------------------------------------. | |
1817 | | yyerrorlab -- error raised explicitly by YYERROR. | | |
1818 | `---------------------------------------------------*/ | |
1819 | yyerrorlab: | |
1820 | ||
1821 | /* Pacify compilers like GCC when the user code never invokes | |
1822 | YYERROR and the label yyerrorlab therefore never appears in user | |
1823 | code. */ | |
1824 | if (/*CONSTCOND*/ 0) | |
1825 | goto yyerrorlab; | |
1826 | ||
1827 | ]b4_locations_if([[ yyerror_range[1] = yylsp[1-yylen]; | |
1828 | ]])[ /* Do not reclaim the symbols of the rule which action triggered | |
1829 | this YYERROR. */ | |
1830 | YYPOPSTACK (yylen); | |
1831 | yylen = 0; | |
1832 | YY_STACK_PRINT (yyss, yyssp); | |
1833 | yystate = *yyssp; | |
1834 | goto yyerrlab1; | |
1835 | ||
1836 | ||
1837 | /*-------------------------------------------------------------. | |
1838 | | yyerrlab1 -- common code for both syntax error and YYERROR. | | |
1839 | `-------------------------------------------------------------*/ | |
1840 | yyerrlab1: | |
1841 | yyerrstatus = 3; /* Each real token shifted decrements this. */ | |
1842 | ||
1843 | for (;;) | |
1844 | { | |
1845 | yyn = yypact[yystate]; | |
1846 | if (!yypact_value_is_default (yyn)) | |
1847 | { | |
1848 | yyn += YYTERROR; | |
1849 | if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR) | |
1850 | { | |
1851 | yyn = yytable[yyn]; | |
1852 | if (0 < yyn) | |
1853 | break; | |
1854 | } | |
1855 | } | |
1856 | ||
1857 | /* Pop the current state because it cannot handle the error token. */ | |
1858 | if (yyssp == yyss) | |
1859 | YYABORT; | |
1860 | ||
1861 | ]b4_locations_if([[ yyerror_range[1] = *yylsp;]])[ | |
1862 | yydestruct ("Error: popping", | |
1863 | yystos[yystate], yyvsp]b4_locations_if([, yylsp])[]b4_user_args[); | |
1864 | YYPOPSTACK (1); | |
1865 | yystate = *yyssp; | |
1866 | YY_STACK_PRINT (yyss, yyssp); | |
1867 | }]b4_lac_if([[ | |
1868 | ||
1869 | /* If the stack popping above didn't lose the initial context for the | |
1870 | current lookahead token, the shift below will for sure. */ | |
1871 | YY_LAC_DISCARD ("error recovery");]])[ | |
1872 | ||
1873 | *++yyvsp = yylval; | |
1874 | ]b4_locations_if([[ | |
1875 | yyerror_range[2] = yylloc; | |
1876 | /* Using YYLLOC is tempting, but would change the location of | |
1877 | the lookahead. YYLOC is available though. */ | |
1878 | YYLLOC_DEFAULT (yyloc, yyerror_range, 2); | |
1879 | *++yylsp = yyloc;]])[ | |
1880 | ||
1881 | /* Shift the error token. */ | |
1882 | YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp); | |
1883 | ||
1884 | yystate = yyn; | |
1885 | goto yynewstate; | |
1886 | ||
1887 | ||
1888 | /*-------------------------------------. | |
1889 | | yyacceptlab -- YYACCEPT comes here. | | |
1890 | `-------------------------------------*/ | |
1891 | yyacceptlab: | |
1892 | yyresult = 0; | |
1893 | goto yyreturn; | |
1894 | ||
1895 | /*-----------------------------------. | |
1896 | | yyabortlab -- YYABORT comes here. | | |
1897 | `-----------------------------------*/ | |
1898 | yyabortlab: | |
1899 | yyresult = 1; | |
1900 | goto yyreturn; | |
1901 | ||
1902 | #if ]b4_lac_if([[1]], [[!defined yyoverflow || YYERROR_VERBOSE]])[ | |
1903 | /*-------------------------------------------------. | |
1904 | | yyexhaustedlab -- memory exhaustion comes here. | | |
1905 | `-------------------------------------------------*/ | |
1906 | yyexhaustedlab: | |
1907 | yyerror (]b4_yyerror_args[YY_("memory exhausted")); | |
1908 | yyresult = 2; | |
1909 | /* Fall through. */ | |
1910 | #endif | |
1911 | ||
1912 | yyreturn: | |
1913 | if (yychar != YYEMPTY) | |
1914 | { | |
1915 | /* Make sure we have latest lookahead translation. See comments at | |
1916 | user semantic actions for why this is necessary. */ | |
1917 | yytoken = YYTRANSLATE (yychar); | |
1918 | yydestruct ("Cleanup: discarding lookahead", | |
1919 | yytoken, &yylval]b4_locations_if([, &yylloc])[]b4_user_args[); | |
1920 | } | |
1921 | /* Do not reclaim the symbols of the rule which action triggered | |
1922 | this YYABORT or YYACCEPT. */ | |
1923 | YYPOPSTACK (yylen); | |
1924 | YY_STACK_PRINT (yyss, yyssp); | |
1925 | while (yyssp != yyss) | |
1926 | { | |
1927 | yydestruct ("Cleanup: popping", | |
1928 | yystos[*yyssp], yyvsp]b4_locations_if([, yylsp])[]b4_user_args[); | |
1929 | YYPOPSTACK (1); | |
1930 | } | |
1931 | #ifndef yyoverflow | |
1932 | if (yyss != yyssa) | |
1933 | YYSTACK_FREE (yyss); | |
1934 | #endif]b4_lac_if([[ | |
1935 | if (yyes != yyesa) | |
1936 | YYSTACK_FREE (yyes);]])b4_push_if([[ | |
1937 | yyps->yynew = 1; | |
1938 | ||
1939 | yypushreturn:]])[ | |
1940 | #if YYERROR_VERBOSE | |
1941 | if (yymsg != yymsgbuf) | |
1942 | YYSTACK_FREE (yymsg); | |
1943 | #endif | |
1944 | /* Make sure YYID is used. */ | |
1945 | return YYID (yyresult); | |
1946 | } | |
1947 | ||
1948 | ]b4_epilogue[]dnl | |
1949 | b4_defines_if( | |
1950 | [@output(b4_spec_defines_file@)@ | |
1951 | b4_copyright([Bison interface for Yacc-like parsers in C])[ | |
1952 | ||
1953 | ]b4_shared_declarations[ | |
1954 | ]])dnl b4_defines_if | |
1955 | m4_divert_pop(0) | |
1956 | m4_popdef([b4_copyright_years]) |