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