1 /* A Bison parser, made by GNU Bison 2.3. */
\r
3 /* Skeleton implementation for Bison's Yacc-like parsers in C
\r
5 Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004, 2005, 2006
\r
6 Free Software Foundation, Inc.
\r
8 This program is free software; you can redistribute it and/or modify
\r
9 it under the terms of the GNU General Public License as published by
\r
10 the Free Software Foundation; either version 2, or (at your option)
\r
13 This program is distributed in the hope that it will be useful,
\r
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
\r
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
\r
16 GNU General Public License for more details.
\r
18 You should have received a copy of the GNU General Public License
\r
19 along with this program; if not, write to the Free Software
\r
20 Foundation, Inc., 51 Franklin Street, Fifth Floor,
\r
21 Boston, MA 02110-1301, USA. */
\r
23 /* As a special exception, you may create a larger work that contains
\r
24 part or all of the Bison parser skeleton and distribute that work
\r
25 under terms of your choice, so long as that work isn't itself a
\r
26 parser generator using the skeleton or a modified version thereof
\r
27 as a parser skeleton. Alternatively, if you modify or redistribute
\r
28 the parser skeleton itself, you may (at your option) remove this
\r
29 special exception, which will cause the skeleton and the resulting
\r
30 Bison output files to be licensed under the GNU General Public
\r
31 License without this special exception.
\r
33 This special exception was added by the Free Software Foundation in
\r
34 version 2.2 of Bison. */
\r
36 /* C LALR(1) parser skeleton written by Richard Stallman, by
\r
37 simplifying the original so-called "semantic" parser. */
\r
39 /* All symbols defined below should begin with yy or YY, to avoid
\r
40 infringing on user name space. This should be done even for local
\r
41 variables, as they might otherwise be expanded by user macros.
\r
42 There are some unavoidable exceptions within include files to
\r
43 define necessary library symbols; they are noted "INFRINGES ON
\r
44 USER NAME SPACE" below. */
\r
46 /* Identify Bison output. */
\r
49 /* Bison version. */
\r
50 #define YYBISON_VERSION "2.3"
\r
52 /* Skeleton name. */
\r
53 #define YYSKELETON_NAME "yacc.c"
\r
58 /* Using locations. */
\r
59 #define YYLSP_NEEDED 0
\r
61 /* Substitute the variable and function names. */
\r
62 #define yyparse xmlParserparse
\r
63 #define yylex xmlParserlex
\r
64 #define yyerror xmlParsererror
\r
65 #define yylval xmlParserlval
\r
66 #define yychar xmlParserchar
\r
67 #define yydebug xmlParserdebug
\r
68 #define yynerrs xmlParsernerrs
\r
73 # define YYTOKENTYPE
\r
74 /* Put the tokens into the symbol table, so that GDB and other debuggers
\r
83 #define STRING_TOKEN 259
\r
88 /* Copy the first part of user declarations. */
\r
95 /* Some addn'l includes, necessary but not included by the
\r
96 bison generated code.
\r
101 /* prototypes for the parser callbacks.
\r
107 extern xml_t *xml_result;
\r
109 extern int xmlParserdebug;
\r
110 extern void xmlParsererror(char *s);
\r
111 extern int xmlParserlex();
\r
118 /* Enabling traces. */
\r
123 /* Enabling verbose error messages. */
\r
124 #ifdef YYERROR_VERBOSE
\r
125 # undef YYERROR_VERBOSE
\r
126 # define YYERROR_VERBOSE 1
\r
128 # define YYERROR_VERBOSE 0
\r
131 /* Enabling the token table. */
\r
132 #ifndef YYTOKEN_TABLE
\r
133 # define YYTOKEN_TABLE 0
\r
136 #if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
\r
137 typedef union YYSTYPE
\r
144 struct name_val_pair_t *nvpt;
\r
145 struct name_val_list_t *nvpl;
\r
146 struct tag_t *tg_t;
\r
147 struct xml_list_t *xlist_t;
\r
150 /* Line 193 of yacc.c. */
\r
151 #line 152 "xml.tab.cc"
\r
153 # define yystype YYSTYPE /* obsolescent; will be withdrawn */
\r
154 # define YYSTYPE_IS_DECLARED 1
\r
155 # define YYSTYPE_IS_TRIVIAL 1
\r
160 /* Copy the second part of user declarations. */
\r
163 /* Line 216 of yacc.c. */
\r
164 #line 165 "xml.tab.cc"
\r
170 #ifdef YYTYPE_UINT8
\r
171 typedef YYTYPE_UINT8 yytype_uint8;
\r
173 typedef unsigned char yytype_uint8;
\r
177 typedef YYTYPE_INT8 yytype_int8;
\r
178 #elif (defined __STDC__ || defined __C99__FUNC__ \
\r
179 || defined __cplusplus || defined _MSC_VER)
\r
180 typedef signed char yytype_int8;
\r
182 typedef short int yytype_int8;
\r
185 #ifdef YYTYPE_UINT16
\r
186 typedef YYTYPE_UINT16 yytype_uint16;
\r
188 typedef unsigned short int yytype_uint16;
\r
191 #ifdef YYTYPE_INT16
\r
192 typedef YYTYPE_INT16 yytype_int16;
\r
194 typedef short int yytype_int16;
\r
198 # ifdef __SIZE_TYPE__
\r
199 # define YYSIZE_T __SIZE_TYPE__
\r
200 # elif defined size_t
\r
201 # define YYSIZE_T size_t
\r
202 # elif ! defined YYSIZE_T && (defined __STDC__ || defined __C99__FUNC__ \
\r
203 || defined __cplusplus || defined _MSC_VER)
\r
204 # include <stddef.h> /* INFRINGES ON USER NAME SPACE */
\r
205 # define YYSIZE_T size_t
\r
207 # define YYSIZE_T unsigned int
\r
211 #define YYSIZE_MAXIMUM ((YYSIZE_T) -1)
\r
216 # include <libintl.h> /* INFRINGES ON USER NAME SPACE */
\r
217 # define YY_(msgid) dgettext ("bison-runtime", msgid)
\r
221 # define YY_(msgid) msgid
\r
225 /* Suppress unused-variable warnings by "using" E. */
\r
226 #if ! defined lint || defined __GNUC__
\r
227 # define YYUSE(e) ((void) (e))
\r
229 # define YYUSE(e) /* empty */
\r
232 /* Identity function, used to suppress warnings about constant conditions. */
\r
234 # define YYID(n) (n)
\r
236 #if (defined __STDC__ || defined __C99__FUNC__ \
\r
237 || defined __cplusplus || defined _MSC_VER)
\r
250 #if ! defined yyoverflow || YYERROR_VERBOSE
\r
252 /* The parser invokes alloca or malloc; define the necessary symbols. */
\r
254 # ifdef YYSTACK_USE_ALLOCA
\r
255 # if YYSTACK_USE_ALLOCA
\r
257 # define YYSTACK_ALLOC __builtin_alloca
\r
258 # elif defined __BUILTIN_VA_ARG_INCR
\r
259 # include <alloca.h> /* INFRINGES ON USER NAME SPACE */
\r
260 # elif defined _AIX
\r
261 # define YYSTACK_ALLOC __alloca
\r
262 # elif defined _MSC_VER
\r
263 # include <malloc.h> /* INFRINGES ON USER NAME SPACE */
\r
264 # define alloca _alloca
\r
266 # define YYSTACK_ALLOC alloca
\r
267 # if ! defined _ALLOCA_H && ! defined _STDLIB_H && (defined __STDC__ || defined __C99__FUNC__ \
\r
268 || defined __cplusplus || defined _MSC_VER)
\r
269 # include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
\r
271 # define _STDLIB_H 1
\r
278 # ifdef YYSTACK_ALLOC
\r
279 /* Pacify GCC's `empty if-body' warning. */
\r
280 # define YYSTACK_FREE(Ptr) do { /* empty */; } while (YYID (0))
\r
281 # ifndef YYSTACK_ALLOC_MAXIMUM
\r
282 /* The OS might guarantee only one guard page at the bottom of the stack,
\r
283 and a page size can be as small as 4096 bytes. So we cannot safely
\r
284 invoke alloca (N) if N exceeds 4096. Use a slightly smaller number
\r
285 to allow for a few compiler-allocated temporary stack slots. */
\r
286 # define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2006 */
\r
289 # define YYSTACK_ALLOC YYMALLOC
\r
290 # define YYSTACK_FREE YYFREE
\r
291 # ifndef YYSTACK_ALLOC_MAXIMUM
\r
292 # define YYSTACK_ALLOC_MAXIMUM YYSIZE_MAXIMUM
\r
294 # if (defined __cplusplus && ! defined _STDLIB_H \
\r
295 && ! ((defined YYMALLOC || defined malloc) \
\r
296 && (defined YYFREE || defined free)))
\r
297 # include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
\r
299 # define _STDLIB_H 1
\r
303 # define YYMALLOC malloc
\r
304 # if ! defined malloc && ! defined _STDLIB_H && (defined __STDC__ || defined __C99__FUNC__ \
\r
305 || defined __cplusplus || defined _MSC_VER)
\r
306 void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */
\r
310 # define YYFREE free
\r
311 # if ! defined free && ! defined _STDLIB_H && (defined __STDC__ || defined __C99__FUNC__ \
\r
312 || defined __cplusplus || defined _MSC_VER)
\r
313 void free (void *); /* INFRINGES ON USER NAME SPACE */
\r
317 #endif /* ! defined yyoverflow || YYERROR_VERBOSE */
\r
320 #if (! defined yyoverflow \
\r
321 && (! defined __cplusplus \
\r
322 || (defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL)))
\r
324 /* A type that is properly aligned for any stack member. */
\r
331 /* The size of the maximum gap between one aligned stack and the next. */
\r
332 # define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1)
\r
334 /* The size of an array large to enough to hold all stacks, each with
\r
336 # define YYSTACK_BYTES(N) \
\r
337 ((N) * (sizeof (yytype_int16) + sizeof (YYSTYPE)) \
\r
338 + YYSTACK_GAP_MAXIMUM)
\r
340 /* Copy COUNT objects from FROM to TO. The source and destination do
\r
343 # if defined __GNUC__ && 1 < __GNUC__
\r
344 # define YYCOPY(To, From, Count) \
\r
345 __builtin_memcpy (To, From, (Count) * sizeof (*(From)))
\r
347 # define YYCOPY(To, From, Count) \
\r
351 for (yyi = 0; yyi < (Count); yyi++) \
\r
352 (To)[yyi] = (From)[yyi]; \
\r
358 /* Relocate STACK from its old location to the new one. The
\r
359 local variables YYSIZE and YYSTACKSIZE give the old and new number of
\r
360 elements in the stack, and YYPTR gives the new location of the
\r
361 stack. Advance YYPTR to a properly aligned location for the next
\r
363 # define YYSTACK_RELOCATE(Stack) \
\r
366 YYSIZE_T yynewbytes; \
\r
367 YYCOPY (&yyptr->Stack, Stack, yysize); \
\r
368 Stack = &yyptr->Stack; \
\r
369 yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \
\r
370 yyptr += yynewbytes / sizeof (*yyptr); \
\r
376 /* YYFINAL -- State number of the termination state. */
\r
378 /* YYLAST -- Last index in YYTABLE. */
\r
381 /* YYNTOKENS -- Number of terminals. */
\r
382 #define YYNTOKENS 9
\r
383 /* YYNNTS -- Number of nonterminals. */
\r
385 /* YYNRULES -- Number of rules. */
\r
386 #define YYNRULES 14
\r
387 /* YYNRULES -- Number of states. */
\r
388 #define YYNSTATES 26
\r
390 /* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */
\r
391 #define YYUNDEFTOK 2
\r
392 #define YYMAXUTOK 259
\r
394 #define YYTRANSLATE(YYX) \
\r
395 ((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK)
\r
397 /* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX. */
\r
398 static const yytype_uint8 yytranslate[] =
\r
400 0, 2, 2, 2, 2, 2, 2, 2, 2, 2,
\r
401 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
\r
402 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
\r
403 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
\r
404 2, 2, 2, 2, 2, 2, 2, 6, 2, 2,
\r
405 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
\r
406 5, 8, 7, 2, 2, 2, 2, 2, 2, 2,
\r
407 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
\r
408 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
\r
409 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
\r
410 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
\r
411 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
\r
412 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
\r
413 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
\r
414 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
\r
415 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
\r
416 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
\r
417 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
\r
418 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
\r
419 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
\r
420 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
\r
421 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
\r
422 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
\r
423 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
\r
424 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
\r
425 2, 2, 2, 2, 2, 2, 1, 2, 3, 4
\r
429 /* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in
\r
431 static const yytype_uint8 yyprhs[] =
\r
433 0, 0, 3, 5, 9, 12, 18, 23, 28, 30,
\r
437 /* YYRHS -- A `-1'-separated list of the rules' RHS. */
\r
438 static const yytype_int8 yyrhs[] =
\r
440 10, 0, -1, 11, -1, 12, 14, 13, -1, 12,
\r
441 13, -1, 5, 3, 15, 6, 7, -1, 5, 3,
\r
442 15, 7, -1, 5, 6, 3, 7, -1, 11, -1,
\r
443 14, 11, -1, 16, -1, -1, 17, -1, 16, 17,
\r
447 /* YYRLINE[YYN] -- source line where rule number YYN was defined. */
\r
448 static const yytype_uint8 yyrline[] =
\r
450 0, 65, 65, 69, 70, 71, 75, 79, 84, 85,
\r
455 #if YYDEBUG || YYERROR_VERBOSE || YYTOKEN_TABLE
\r
456 /* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.
\r
457 First, the terminals, then, starting at YYNTOKENS, nonterminals. */
\r
458 static const char *const yytname[] =
\r
460 "$end", "error", "$undefined", "NAME", "STRING_TOKEN", "'<'", "'/'",
\r
461 "'>'", "'='", "$accept", "parse_result", "resource", "start_tag",
\r
462 "end_tag", "xml_list", "opt_val_list", "val_list", "val", 0
\r
467 /* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to
\r
468 token YYLEX-NUM. */
\r
469 static const yytype_uint16 yytoknum[] =
\r
471 0, 256, 257, 258, 259, 60, 47, 62, 61
\r
475 /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */
\r
476 static const yytype_uint8 yyr1[] =
\r
478 0, 9, 10, 11, 11, 11, 12, 13, 14, 14,
\r
482 /* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */
\r
483 static const yytype_uint8 yyr2[] =
\r
485 0, 2, 1, 3, 2, 5, 4, 4, 1, 2,
\r
489 /* YYDEFACT[STATE-NAME] -- Default rule to reduce with in state
\r
490 STATE-NUM when YYTABLE doesn't specify something else to do. Zero
\r
491 means the default is an error. */
\r
492 static const yytype_uint8 yydefact[] =
\r
494 0, 0, 0, 2, 0, 11, 1, 0, 8, 4,
\r
495 0, 0, 0, 10, 12, 0, 9, 3, 0, 0,
\r
499 /* YYDEFGOTO[NTERM-NUM]. */
\r
500 static const yytype_int8 yydefgoto[] =
\r
502 -1, 2, 3, 4, 9, 10, 12, 13, 14
\r
505 /* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
\r
507 #define YYPACT_NINF -5
\r
508 static const yytype_int8 yypact[] =
\r
510 -3, 0, 5, -5, 4, 7, -5, -2, -5, -5,
\r
511 4, 3, 1, 7, -5, 9, -5, -5, 10, 6,
\r
512 -5, -5, 8, -5, -5, -5
\r
515 /* YYPGOTO[NTERM-NUM]. */
\r
516 static const yytype_int8 yypgoto[] =
\r
518 -5, -5, -4, -5, 11, -5, -5, -5, 12
\r
521 /* YYTABLE[YYPACT[STATE-NUM]]. What to do in state STATE-NUM. If
\r
522 positive, shift that token. If negative, reduce the rule which
\r
523 number is the opposite. If zero, do what YYDEFACT says.
\r
524 If YYTABLE_NINF, syntax error. */
\r
525 #define YYTABLE_NINF -1
\r
526 static const yytype_uint8 yytable[] =
\r
528 8, 5, 1, 5, 15, 6, 16, 19, 20, 7,
\r
529 11, 18, 22, 24, 23, 25, 0, 0, 0, 0,
\r
533 static const yytype_int8 yycheck[] =
\r
535 4, 3, 5, 3, 6, 0, 10, 6, 7, 5,
\r
536 3, 8, 3, 7, 4, 7, -1, -1, -1, -1,
\r
537 -1, 10, -1, -1, -1, 13
\r
540 /* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
\r
541 symbol of state STATE-NUM. */
\r
542 static const yytype_uint8 yystos[] =
\r
544 0, 5, 10, 11, 12, 3, 0, 5, 11, 13,
\r
545 14, 3, 15, 16, 17, 6, 11, 13, 8, 6,
\r
549 #define yyerrok (yyerrstatus = 0)
\r
550 #define yyclearin (yychar = YYEMPTY)
\r
551 #define YYEMPTY (-2)
\r
554 #define YYACCEPT goto yyacceptlab
\r
555 #define YYABORT goto yyabortlab
\r
556 #define YYERROR goto yyerrorlab
\r
559 /* Like YYERROR except do call yyerror. This remains here temporarily
\r
560 to ease the transition to the new meaning of YYERROR, for GCC.
\r
561 Once GCC version 2 has supplanted version 1, this can go. */
\r
563 #define YYFAIL goto yyerrlab
\r
565 #define YYRECOVERING() (!!yyerrstatus)
\r
567 #define YYBACKUP(Token, Value) \
\r
569 if (yychar == YYEMPTY && yylen == 1) \
\r
571 yychar = (Token); \
\r
572 yylval = (Value); \
\r
573 yytoken = YYTRANSLATE (yychar); \
\r
579 yyerror (YY_("syntax error: cannot back up")); \
\r
586 #define YYERRCODE 256
\r
589 /* YYLLOC_DEFAULT -- Set CURRENT to span from RHS[1] to RHS[N].
\r
590 If N is 0, then set CURRENT to the empty location which ends
\r
591 the previous symbol: RHS[0] (always defined). */
\r
593 #define YYRHSLOC(Rhs, K) ((Rhs)[K])
\r
594 #ifndef YYLLOC_DEFAULT
\r
595 # define YYLLOC_DEFAULT(Current, Rhs, N) \
\r
599 (Current).first_line = YYRHSLOC (Rhs, 1).first_line; \
\r
600 (Current).first_column = YYRHSLOC (Rhs, 1).first_column; \
\r
601 (Current).last_line = YYRHSLOC (Rhs, N).last_line; \
\r
602 (Current).last_column = YYRHSLOC (Rhs, N).last_column; \
\r
606 (Current).first_line = (Current).last_line = \
\r
607 YYRHSLOC (Rhs, 0).last_line; \
\r
608 (Current).first_column = (Current).last_column = \
\r
609 YYRHSLOC (Rhs, 0).last_column; \
\r
615 /* YY_LOCATION_PRINT -- Print the location on the stream.
\r
616 This macro was not mandated originally: define only if we know
\r
617 we won't break user code: when these are the locations we know. */
\r
619 #ifndef YY_LOCATION_PRINT
\r
620 # if YYLTYPE_IS_TRIVIAL
\r
621 # define YY_LOCATION_PRINT(File, Loc) \
\r
622 fprintf (File, "%d.%d-%d.%d", \
\r
623 (Loc).first_line, (Loc).first_column, \
\r
624 (Loc).last_line, (Loc).last_column)
\r
626 # define YY_LOCATION_PRINT(File, Loc) ((void) 0)
\r
631 /* YYLEX -- calling `yylex' with the right arguments. */
\r
634 # define YYLEX yylex (YYLEX_PARAM)
\r
636 # define YYLEX yylex ()
\r
639 /* Enable debugging if requested. */
\r
643 # include <stdio.h> /* INFRINGES ON USER NAME SPACE */
\r
644 # define YYFPRINTF fprintf
\r
647 # define YYDPRINTF(Args) \
\r
653 # define YY_SYMBOL_PRINT(Title, Type, Value, Location) \
\r
657 YYFPRINTF (stderr, "%s ", Title); \
\r
658 yy_symbol_print (stderr, \
\r
660 YYFPRINTF (stderr, "\n"); \
\r
665 /*--------------------------------.
\r
666 | Print this symbol on YYOUTPUT. |
\r
667 `--------------------------------*/
\r
670 #if (defined __STDC__ || defined __C99__FUNC__ \
\r
671 || defined __cplusplus || defined _MSC_VER)
\r
673 yy_symbol_value_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep)
\r
676 yy_symbol_value_print (yyoutput, yytype, yyvaluep)
\r
679 YYSTYPE const * const yyvaluep;
\r
685 if (yytype < YYNTOKENS)
\r
686 YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep);
\r
698 /*--------------------------------.
\r
699 | Print this symbol on YYOUTPUT. |
\r
700 `--------------------------------*/
\r
702 #if (defined __STDC__ || defined __C99__FUNC__ \
\r
703 || defined __cplusplus || defined _MSC_VER)
\r
705 yy_symbol_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep)
\r
708 yy_symbol_print (yyoutput, yytype, yyvaluep)
\r
711 YYSTYPE const * const yyvaluep;
\r
714 if (yytype < YYNTOKENS)
\r
715 YYFPRINTF (yyoutput, "token %s (", yytname[yytype]);
\r
717 YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]);
\r
719 yy_symbol_value_print (yyoutput, yytype, yyvaluep);
\r
720 YYFPRINTF (yyoutput, ")");
\r
723 /*------------------------------------------------------------------.
\r
724 | yy_stack_print -- Print the state stack from its BOTTOM up to its |
\r
725 | TOP (included). |
\r
726 `------------------------------------------------------------------*/
\r
728 #if (defined __STDC__ || defined __C99__FUNC__ \
\r
729 || defined __cplusplus || defined _MSC_VER)
\r
731 yy_stack_print (yytype_int16 *bottom, yytype_int16 *top)
\r
734 yy_stack_print (bottom, top)
\r
735 yytype_int16 *bottom;
\r
739 YYFPRINTF (stderr, "Stack now");
\r
740 for (; bottom <= top; ++bottom)
\r
741 YYFPRINTF (stderr, " %d", *bottom);
\r
742 YYFPRINTF (stderr, "\n");
\r
745 # define YY_STACK_PRINT(Bottom, Top) \
\r
748 yy_stack_print ((Bottom), (Top)); \
\r
752 /*------------------------------------------------.
\r
753 | Report that the YYRULE is going to be reduced. |
\r
754 `------------------------------------------------*/
\r
756 #if (defined __STDC__ || defined __C99__FUNC__ \
\r
757 || defined __cplusplus || defined _MSC_VER)
\r
759 yy_reduce_print (YYSTYPE *yyvsp, int yyrule)
\r
762 yy_reduce_print (yyvsp, yyrule)
\r
767 int yynrhs = yyr2[yyrule];
\r
769 unsigned long int yylno = yyrline[yyrule];
\r
770 YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n",
\r
771 yyrule - 1, yylno);
\r
772 /* The symbols being reduced. */
\r
773 for (yyi = 0; yyi < yynrhs; yyi++)
\r
775 fprintf (stderr, " $%d = ", yyi + 1);
\r
776 yy_symbol_print (stderr, yyrhs[yyprhs[yyrule] + yyi],
\r
777 &(yyvsp[(yyi + 1) - (yynrhs)])
\r
779 fprintf (stderr, "\n");
\r
783 # define YY_REDUCE_PRINT(Rule) \
\r
786 yy_reduce_print (yyvsp, Rule); \
\r
789 /* Nonzero means print parse trace. It is left uninitialized so that
\r
790 multiple parsers can coexist. */
\r
792 #else /* !YYDEBUG */
\r
793 # define YYDPRINTF(Args)
\r
794 # define YY_SYMBOL_PRINT(Title, Type, Value, Location)
\r
795 # define YY_STACK_PRINT(Bottom, Top)
\r
796 # define YY_REDUCE_PRINT(Rule)
\r
797 #endif /* !YYDEBUG */
\r
800 /* YYINITDEPTH -- initial size of the parser's stacks. */
\r
801 #ifndef YYINITDEPTH
\r
802 # define YYINITDEPTH 200
\r
805 /* YYMAXDEPTH -- maximum size the stacks can grow to (effective only
\r
806 if the built-in stack extension method is used).
\r
808 Do not make this value too large; the results are undefined if
\r
809 YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH)
\r
810 evaluated with infinite-precision integer arithmetic. */
\r
813 # define YYMAXDEPTH 10000
\r
818 #if YYERROR_VERBOSE
\r
821 # if defined __GLIBC__ && defined _STRING_H
\r
822 # define yystrlen strlen
\r
824 /* Return the length of YYSTR. */
\r
825 #if (defined __STDC__ || defined __C99__FUNC__ \
\r
826 || defined __cplusplus || defined _MSC_VER)
\r
828 yystrlen (const char *yystr)
\r
836 for (yylen = 0; yystr[yylen]; yylen++)
\r
844 # if defined __GLIBC__ && defined _STRING_H && defined _GNU_SOURCE
\r
845 # define yystpcpy stpcpy
\r
847 /* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in
\r
849 #if (defined __STDC__ || defined __C99__FUNC__ \
\r
850 || defined __cplusplus || defined _MSC_VER)
\r
852 yystpcpy (char *yydest, const char *yysrc)
\r
855 yystpcpy (yydest, yysrc)
\r
860 char *yyd = yydest;
\r
861 const char *yys = yysrc;
\r
863 while ((*yyd++ = *yys++) != '\0')
\r
872 /* Copy to YYRES the contents of YYSTR after stripping away unnecessary
\r
873 quotes and backslashes, so that it's suitable for yyerror. The
\r
874 heuristic is that double-quoting is unnecessary unless the string
\r
875 contains an apostrophe, a comma, or backslash (other than
\r
876 backslash-backslash). YYSTR is taken from yytname. If YYRES is
\r
877 null, do not copy; instead, return the length of what the result
\r
878 would have been. */
\r
880 yytnamerr (char *yyres, const char *yystr)
\r
885 char const *yyp = yystr;
\r
892 goto do_not_strip_quotes;
\r
895 if (*++yyp != '\\')
\r
896 goto do_not_strip_quotes;
\r
897 /* Fall through. */
\r
909 do_not_strip_quotes: ;
\r
913 return yystrlen (yystr);
\r
915 return yystpcpy (yyres, yystr) - yyres;
\r
919 /* Copy into YYRESULT an error message about the unexpected token
\r
920 YYCHAR while in state YYSTATE. Return the number of bytes copied,
\r
921 including the terminating null byte. If YYRESULT is null, do not
\r
922 copy anything; just return the number of bytes that would be
\r
923 copied. As a special case, return 0 if an ordinary "syntax error"
\r
924 message will do. Return YYSIZE_MAXIMUM if overflow occurs during
\r
925 size calculation. */
\r
927 yysyntax_error (char *yyresult, int yystate, int yychar)
\r
929 int yyn = yypact[yystate];
\r
931 if (! (YYPACT_NINF < yyn && yyn <= YYLAST))
\r
935 int yytype = YYTRANSLATE (yychar);
\r
936 YYSIZE_T yysize0 = yytnamerr (0, yytname[yytype]);
\r
937 YYSIZE_T yysize = yysize0;
\r
939 int yysize_overflow = 0;
\r
940 enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 };
\r
941 char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM];
\r
945 /* This is so xgettext sees the translatable formats that are
\r
946 constructed on the fly. */
\r
947 YY_("syntax error, unexpected %s");
\r
948 YY_("syntax error, unexpected %s, expecting %s");
\r
949 YY_("syntax error, unexpected %s, expecting %s or %s");
\r
950 YY_("syntax error, unexpected %s, expecting %s or %s or %s");
\r
951 YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s");
\r
955 static char const yyunexpected[] = "syntax error, unexpected %s";
\r
956 static char const yyexpecting[] = ", expecting %s";
\r
957 static char const yyor[] = " or %s";
\r
958 char yyformat[sizeof yyunexpected
\r
959 + sizeof yyexpecting - 1
\r
960 + ((YYERROR_VERBOSE_ARGS_MAXIMUM - 2)
\r
961 * (sizeof yyor - 1))];
\r
962 char const *yyprefix = yyexpecting;
\r
964 /* Start YYX at -YYN if negative to avoid negative indexes in
\r
966 int yyxbegin = yyn < 0 ? -yyn : 0;
\r
968 /* Stay within bounds of both yycheck and yytname. */
\r
969 int yychecklim = YYLAST - yyn + 1;
\r
970 int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS;
\r
973 yyarg[0] = yytname[yytype];
\r
974 yyfmt = yystpcpy (yyformat, yyunexpected);
\r
976 for (yyx = yyxbegin; yyx < yyxend; ++yyx)
\r
977 if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR)
\r
979 if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM)
\r
983 yyformat[sizeof yyunexpected - 1] = '\0';
\r
986 yyarg[yycount++] = yytname[yyx];
\r
987 yysize1 = yysize + yytnamerr (0, yytname[yyx]);
\r
988 yysize_overflow |= (yysize1 < yysize);
\r
990 yyfmt = yystpcpy (yyfmt, yyprefix);
\r
994 yyf = YY_(yyformat);
\r
995 yysize1 = yysize + yystrlen (yyf);
\r
996 yysize_overflow |= (yysize1 < yysize);
\r
999 if (yysize_overflow)
\r
1000 return YYSIZE_MAXIMUM;
\r
1004 /* Avoid sprintf, as that infringes on the user's name space.
\r
1005 Don't have undefined behavior even if the translation
\r
1006 produced a string with the wrong number of "%s"s. */
\r
1007 char *yyp = yyresult;
\r
1009 while ((*yyp = *yyf) != '\0')
\r
1011 if (*yyp == '%' && yyf[1] == 's' && yyi < yycount)
\r
1013 yyp += yytnamerr (yyp, yyarg[yyi++]);
\r
1026 #endif /* YYERROR_VERBOSE */
\r
1029 /*-----------------------------------------------.
\r
1030 | Release the memory associated to this symbol. |
\r
1031 `-----------------------------------------------*/
\r
1034 #if (defined __STDC__ || defined __C99__FUNC__ \
\r
1035 || defined __cplusplus || defined _MSC_VER)
\r
1037 yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep)
\r
1040 yydestruct (yymsg, yytype, yyvaluep)
\r
1041 const char *yymsg;
\r
1043 YYSTYPE *yyvaluep;
\r
1049 yymsg = "Deleting";
\r
1050 YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp);
\r
1061 /* Prevent warnings from -Wmissing-prototypes. */
\r
1063 #ifdef YYPARSE_PARAM
\r
1064 #if defined __STDC__ || defined __cplusplus
\r
1065 int yyparse (void *YYPARSE_PARAM);
\r
1069 #else /* ! YYPARSE_PARAM */
\r
1070 #if defined __STDC__ || defined __cplusplus
\r
1071 int yyparse (void);
\r
1075 #endif /* ! YYPARSE_PARAM */
\r
1079 /* The look-ahead symbol. */
\r
1082 /* The semantic value of the look-ahead symbol. */
\r
1085 /* Number of syntax errors so far. */
\r
1094 #ifdef YYPARSE_PARAM
\r
1095 #if (defined __STDC__ || defined __C99__FUNC__ \
\r
1096 || defined __cplusplus || defined _MSC_VER)
\r
1098 yyparse (void *YYPARSE_PARAM)
\r
1101 yyparse (YYPARSE_PARAM)
\r
1102 void *YYPARSE_PARAM;
\r
1104 #else /* ! YYPARSE_PARAM */
\r
1105 #if (defined __STDC__ || defined __C99__FUNC__ \
\r
1106 || defined __cplusplus || defined _MSC_VER)
\r
1120 /* Number of tokens to shift before error messages enabled. */
\r
1122 /* Look-ahead token as an internal (translated) token number. */
\r
1124 #if YYERROR_VERBOSE
\r
1125 /* Buffer for error messages, and its allocated size. */
\r
1126 char yymsgbuf[128];
\r
1127 char *yymsg = yymsgbuf;
\r
1128 YYSIZE_T yymsg_alloc = sizeof yymsgbuf;
\r
1131 /* Three stacks and their tools:
\r
1132 `yyss': related to states,
\r
1133 `yyvs': related to semantic values,
\r
1134 `yyls': related to locations.
\r
1136 Refer to the stacks thru separate pointers, to allow yyoverflow
\r
1137 to reallocate them elsewhere. */
\r
1139 /* The state stack. */
\r
1140 yytype_int16 yyssa[YYINITDEPTH];
\r
1141 yytype_int16 *yyss = yyssa;
\r
1142 yytype_int16 *yyssp;
\r
1144 /* The semantic value stack. */
\r
1145 YYSTYPE yyvsa[YYINITDEPTH];
\r
1146 YYSTYPE *yyvs = yyvsa;
\r
1151 #define YYPOPSTACK(N) (yyvsp -= (N), yyssp -= (N))
\r
1153 YYSIZE_T yystacksize = YYINITDEPTH;
\r
1155 /* The variables used to return semantic value and location from the
\r
1156 action routines. */
\r
1160 /* The number of symbols on the RHS of the reduced rule.
\r
1161 Keep to zero when no symbol should be popped. */
\r
1164 YYDPRINTF ((stderr, "Starting parse\n"));
\r
1169 yychar = YYEMPTY; /* Cause a token to be read. */
\r
1171 /* Initialize stack pointers.
\r
1172 Waste one element of value and location stack
\r
1173 so that they stay on the same level as the state stack.
\r
1174 The wasted elements are never initialized. */
\r
1181 /*------------------------------------------------------------.
\r
1182 | yynewstate -- Push a new state, which is found in yystate. |
\r
1183 `------------------------------------------------------------*/
\r
1185 /* In all cases, when you get here, the value and location stacks
\r
1186 have just been pushed. So pushing a state here evens the stacks. */
\r
1192 if (yyss + yystacksize - 1 <= yyssp)
\r
1194 /* Get the current used size of the three stacks, in elements. */
\r
1195 YYSIZE_T yysize = yyssp - yyss + 1;
\r
1199 /* Give user a chance to reallocate the stack. Use copies of
\r
1200 these so that the &'s don't force the real ones into
\r
1202 YYSTYPE *yyvs1 = yyvs;
\r
1203 yytype_int16 *yyss1 = yyss;
\r
1206 /* Each stack pointer address is followed by the size of the
\r
1207 data in use in that stack, in bytes. This used to be a
\r
1208 conditional around just the two extra args, but that might
\r
1209 be undefined if yyoverflow is a macro. */
\r
1210 yyoverflow (YY_("memory exhausted"),
\r
1211 &yyss1, yysize * sizeof (*yyssp),
\r
1212 &yyvs1, yysize * sizeof (*yyvsp),
\r
1219 #else /* no yyoverflow */
\r
1220 # ifndef YYSTACK_RELOCATE
\r
1221 goto yyexhaustedlab;
\r
1223 /* Extend the stack our own way. */
\r
1224 if (YYMAXDEPTH <= yystacksize)
\r
1225 goto yyexhaustedlab;
\r
1227 if (YYMAXDEPTH < yystacksize)
\r
1228 yystacksize = YYMAXDEPTH;
\r
1231 yytype_int16 *yyss1 = yyss;
\r
1232 union yyalloc *yyptr =
\r
1233 (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize));
\r
1235 goto yyexhaustedlab;
\r
1236 YYSTACK_RELOCATE (yyss);
\r
1237 YYSTACK_RELOCATE (yyvs);
\r
1239 # undef YYSTACK_RELOCATE
\r
1240 if (yyss1 != yyssa)
\r
1241 YYSTACK_FREE (yyss1);
\r
1244 #endif /* no yyoverflow */
\r
1246 yyssp = yyss + yysize - 1;
\r
1247 yyvsp = yyvs + yysize - 1;
\r
1250 YYDPRINTF ((stderr, "Stack size increased to %lu\n",
\r
1251 (unsigned long int) yystacksize));
\r
1253 if (yyss + yystacksize - 1 <= yyssp)
\r
1257 YYDPRINTF ((stderr, "Entering state %d\n", yystate));
\r
1266 /* Do appropriate processing given the current state. Read a
\r
1267 look-ahead token if we need one and don't already have one. */
\r
1269 /* First try to decide what to do without reference to look-ahead token. */
\r
1270 yyn = yypact[yystate];
\r
1271 if (yyn == YYPACT_NINF)
\r
1274 /* Not known => get a look-ahead token if don't already have one. */
\r
1276 /* YYCHAR is either YYEMPTY or YYEOF or a valid look-ahead symbol. */
\r
1277 if (yychar == YYEMPTY)
\r
1279 YYDPRINTF ((stderr, "Reading a token: "));
\r
1283 if (yychar <= YYEOF)
\r
1285 yychar = yytoken = YYEOF;
\r
1286 YYDPRINTF ((stderr, "Now at end of input.\n"));
\r
1290 yytoken = YYTRANSLATE (yychar);
\r
1291 YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc);
\r
1294 /* If the proper action on seeing token YYTOKEN is to reduce or to
\r
1295 detect an error, take that action. */
\r
1297 if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken)
\r
1299 yyn = yytable[yyn];
\r
1302 if (yyn == 0 || yyn == YYTABLE_NINF)
\r
1308 if (yyn == YYFINAL)
\r
1311 /* Count tokens shifted since error; after three, turn off error
\r
1316 /* Shift the look-ahead token. */
\r
1317 YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc);
\r
1319 /* Discard the shifted token unless it is eof. */
\r
1320 if (yychar != YYEOF)
\r
1324 *++yyvsp = yylval;
\r
1329 /*-----------------------------------------------------------.
\r
1330 | yydefault -- do the default action for the current state. |
\r
1331 `-----------------------------------------------------------*/
\r
1333 yyn = yydefact[yystate];
\r
1339 /*-----------------------------.
\r
1340 | yyreduce -- Do a reduction. |
\r
1341 `-----------------------------*/
\r
1343 /* yyn is the number of a rule to reduce with. */
\r
1344 yylen = yyr2[yyn];
\r
1346 /* If YYLEN is nonzero, implement the default value of the action:
\r
1349 Otherwise, the following line sets YYVAL to garbage.
\r
1350 This behavior is undocumented and Bison
\r
1351 users should not rely upon it. Assigning to YYVAL
\r
1352 unconditionally makes the parser a bit smaller, and it avoids a
\r
1353 GCC warning that YYVAL may be used uninitialized. */
\r
1354 yyval = yyvsp[1-yylen];
\r
1357 YY_REDUCE_PRINT (yyn);
\r
1362 {xml_result = (yyvsp[(1) - (1)].x_t);;}
\r
1367 {(yyval.x_t) = new xml_t((yyvsp[(1) - (3)].tg_t),(yyvsp[(2) - (3)].xlist_t),(yyvsp[(3) - (3)].strval));;}
\r
1372 {(yyval.x_t)=new xml_t((yyvsp[(1) - (2)].tg_t),(yyvsp[(2) - (2)].strval));;}
\r
1377 {(yyval.x_t)=new xml_t((yyvsp[(2) - (5)].strval),(yyvsp[(3) - (5)].nvpl));;}
\r
1382 {(yyval.tg_t) = new tag_t((yyvsp[(2) - (4)].strval), (yyvsp[(3) - (4)].nvpl));;}
\r
1387 {(yyval.strval)=(yyvsp[(3) - (4)].strval);;}
\r
1392 {(yyval.xlist_t)=new xml_list_t((yyvsp[(1) - (1)].x_t));;}
\r
1397 {(yyval.xlist_t)=(yyvsp[(1) - (2)].xlist_t)->append((yyvsp[(2) - (2)].x_t));;}
\r
1402 {(yyval.nvpl)=(yyvsp[(1) - (1)].nvpl);;}
\r
1407 {(yyval.nvpl)=new name_val_list_t();;}
\r
1412 {(yyval.nvpl) = new name_val_list_t((yyvsp[(1) - (1)].nvpt));;}
\r
1417 {(yyval.nvpl) = (yyvsp[(1) - (2)].nvpl)->append((yyvsp[(2) - (2)].nvpt));;}
\r
1422 {(yyval.nvpt) = new name_val_pair_t((yyvsp[(1) - (3)].strval),(yyvsp[(3) - (3)].strval));;}
\r
1426 /* Line 1267 of yacc.c. */
\r
1427 #line 1428 "xml.tab.cc"
\r
1430 YY_SYMBOL_PRINT ("-> $$ =", yyr1[yyn], &yyval, &yyloc);
\r
1432 YYPOPSTACK (yylen);
\r
1434 YY_STACK_PRINT (yyss, yyssp);
\r
1439 /* Now `shift' the result of the reduction. Determine what state
\r
1440 that goes to, based on the state we popped back to and the rule
\r
1441 number reduced by. */
\r
1445 yystate = yypgoto[yyn - YYNTOKENS] + *yyssp;
\r
1446 if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp)
\r
1447 yystate = yytable[yystate];
\r
1449 yystate = yydefgoto[yyn - YYNTOKENS];
\r
1454 /*------------------------------------.
\r
1455 | yyerrlab -- here on detecting error |
\r
1456 `------------------------------------*/
\r
1458 /* If not already recovering from an error, report this error. */
\r
1462 #if ! YYERROR_VERBOSE
\r
1463 yyerror (YY_("syntax error"));
\r
1466 YYSIZE_T yysize = yysyntax_error (0, yystate, yychar);
\r
1467 if (yymsg_alloc < yysize && yymsg_alloc < YYSTACK_ALLOC_MAXIMUM)
\r
1469 YYSIZE_T yyalloc = 2 * yysize;
\r
1470 if (! (yysize <= yyalloc && yyalloc <= YYSTACK_ALLOC_MAXIMUM))
\r
1471 yyalloc = YYSTACK_ALLOC_MAXIMUM;
\r
1472 if (yymsg != yymsgbuf)
\r
1473 YYSTACK_FREE (yymsg);
\r
1474 yymsg = (char *) YYSTACK_ALLOC (yyalloc);
\r
1476 yymsg_alloc = yyalloc;
\r
1480 yymsg_alloc = sizeof yymsgbuf;
\r
1484 if (0 < yysize && yysize <= yymsg_alloc)
\r
1486 (void) yysyntax_error (yymsg, yystate, yychar);
\r
1491 yyerror (YY_("syntax error"));
\r
1493 goto yyexhaustedlab;
\r
1501 if (yyerrstatus == 3)
\r
1503 /* If just tried and failed to reuse look-ahead token after an
\r
1504 error, discard it. */
\r
1506 if (yychar <= YYEOF)
\r
1508 /* Return failure if at end of input. */
\r
1509 if (yychar == YYEOF)
\r
1514 yydestruct ("Error: discarding",
\r
1515 yytoken, &yylval);
\r
1520 /* Else will try to reuse look-ahead token after shifting the error
\r
1525 /*---------------------------------------------------.
\r
1526 | yyerrorlab -- error raised explicitly by YYERROR. |
\r
1527 `---------------------------------------------------*/
\r
1530 /* Pacify compilers like GCC when the user code never invokes
\r
1531 YYERROR and the label yyerrorlab therefore never appears in user
\r
1533 if (/*CONSTCOND*/ 0)
\r
1536 /* Do not reclaim the symbols of the rule which action triggered
\r
1538 YYPOPSTACK (yylen);
\r
1540 YY_STACK_PRINT (yyss, yyssp);
\r
1545 /*-------------------------------------------------------------.
\r
1546 | yyerrlab1 -- common code for both syntax error and YYERROR. |
\r
1547 `-------------------------------------------------------------*/
\r
1549 yyerrstatus = 3; /* Each real token shifted decrements this. */
\r
1553 yyn = yypact[yystate];
\r
1554 if (yyn != YYPACT_NINF)
\r
1557 if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR)
\r
1559 yyn = yytable[yyn];
\r
1565 /* Pop the current state because it cannot handle the error token. */
\r
1566 if (yyssp == yyss)
\r
1570 yydestruct ("Error: popping",
\r
1571 yystos[yystate], yyvsp);
\r
1574 YY_STACK_PRINT (yyss, yyssp);
\r
1577 if (yyn == YYFINAL)
\r
1580 *++yyvsp = yylval;
\r
1583 /* Shift the error token. */
\r
1584 YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp);
\r
1590 /*-------------------------------------.
\r
1591 | yyacceptlab -- YYACCEPT comes here. |
\r
1592 `-------------------------------------*/
\r
1597 /*-----------------------------------.
\r
1598 | yyabortlab -- YYABORT comes here. |
\r
1599 `-----------------------------------*/
\r
1604 #ifndef yyoverflow
\r
1605 /*-------------------------------------------------.
\r
1606 | yyexhaustedlab -- memory exhaustion comes here. |
\r
1607 `-------------------------------------------------*/
\r
1609 yyerror (YY_("memory exhausted"));
\r
1611 /* Fall through. */
\r
1615 if (yychar != YYEOF && yychar != YYEMPTY)
\r
1616 yydestruct ("Cleanup: discarding lookahead",
\r
1617 yytoken, &yylval);
\r
1618 /* Do not reclaim the symbols of the rule which action triggered
\r
1619 this YYABORT or YYACCEPT. */
\r
1620 YYPOPSTACK (yylen);
\r
1621 YY_STACK_PRINT (yyss, yyssp);
\r
1622 while (yyssp != yyss)
\r
1624 yydestruct ("Cleanup: popping",
\r
1625 yystos[*yyssp], yyvsp);
\r
1628 #ifndef yyoverflow
\r
1629 if (yyss != yyssa)
\r
1630 YYSTACK_FREE (yyss);
\r
1632 #if YYERROR_VERBOSE
\r
1633 if (yymsg != yymsgbuf)
\r
1634 YYSTACK_FREE (yymsg);
\r
1636 /* Make sure YYID is used. */
\r
1637 return YYID (yyresult);
\r