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