PageRenderTime 1684ms CodeModel.GetById 20ms RepoModel.GetById 0ms app.codeStats 2ms

/y.tab.c

http://github.com/fizx/parsley
C | 4235 lines | 3508 code | 395 blank | 332 comment | 343 complexity | 88b75aaf8e1e50a5b88e2f32a247915d MD5 | raw file
  1. /* A Bison parser, made by GNU Bison 2.3. */
  2. /* Skeleton implementation for Bison GLR parsers in C
  3. Copyright (C) 2002, 2003, 2004, 2005, 2006 Free Software Foundation, Inc.
  4. This program is free software; you can redistribute it and/or modify
  5. it under the terms of the GNU General Public License as published by
  6. the Free Software Foundation; either version 2, or (at your option)
  7. any later version.
  8. This program is distributed in the hope that it will be useful,
  9. but WITHOUT ANY WARRANTY; without even the implied warranty of
  10. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  11. GNU General Public License for more details.
  12. You should have received a copy of the GNU General Public License
  13. along with this program; if not, write to the Free Software
  14. Foundation, Inc., 51 Franklin Street, Fifth Floor,
  15. Boston, MA 02110-1301, USA. */
  16. /* As a special exception, you may create a larger work that contains
  17. part or all of the Bison parser skeleton and distribute that work
  18. under terms of your choice, so long as that work isn't itself a
  19. parser generator using the skeleton or a modified version thereof
  20. as a parser skeleton. Alternatively, if you modify or redistribute
  21. the parser skeleton itself, you may (at your option) remove this
  22. special exception, which will cause the skeleton and the resulting
  23. Bison output files to be licensed under the GNU General Public
  24. License without this special exception.
  25. This special exception was added by the Free Software Foundation in
  26. version 2.2 of Bison. */
  27. /* C GLR parser skeleton written by Paul Hilfinger. */
  28. /* Identify Bison output. */
  29. #define YYBISON 1
  30. /* Bison version. */
  31. #define YYBISON_VERSION "2.3"
  32. /* Skeleton name. */
  33. #define YYSKELETON_NAME "glr.c"
  34. /* Pure parsers. */
  35. #define YYPURE 0
  36. /* Using locations. */
  37. #define YYLSP_NEEDED 0
  38. #include "y.tab.h"
  39. /* Enabling traces. */
  40. #ifndef YYDEBUG
  41. # define YYDEBUG 1
  42. #endif
  43. /* Enabling verbose error messages. */
  44. #ifdef YYERROR_VERBOSE
  45. # undef YYERROR_VERBOSE
  46. # define YYERROR_VERBOSE 1
  47. #else
  48. # define YYERROR_VERBOSE 0
  49. #endif
  50. /* Enabling the token table. */
  51. #ifndef YYTOKEN_TABLE
  52. # define YYTOKEN_TABLE 1
  53. #endif
  54. /* Default (constant) value used for initialization for null
  55. right-hand sides. Unlike the standard yacc.c template,
  56. here we set the default value of $$ to a zeroed-out value.
  57. Since the default value is undefined, this behavior is
  58. technically correct. */
  59. static YYSTYPE yyval_default;
  60. /* Copy the second part of user declarations. */
  61. /* Line 234 of glr.c. */
  62. #line 89 "y.tab.c"
  63. #include <stdio.h>
  64. #include <stdlib.h>
  65. #include <string.h>
  66. #include <stdarg.h>
  67. #ifndef YY_
  68. # if defined YYENABLE_NLS && YYENABLE_NLS
  69. # if ENABLE_NLS
  70. # include <libintl.h> /* INFRINGES ON USER NAME SPACE */
  71. # define YY_(msgid) dgettext ("bison-runtime", msgid)
  72. # endif
  73. # endif
  74. # ifndef YY_
  75. # define YY_(msgid) msgid
  76. # endif
  77. #endif
  78. /* Suppress unused-variable warnings by "using" E. */
  79. #if ! defined lint || defined __GNUC__
  80. # define YYUSE(e) ((void) (e))
  81. #else
  82. # define YYUSE(e) /* empty */
  83. #endif
  84. /* Identity function, used to suppress warnings about constant conditions. */
  85. #ifndef lint
  86. # define YYID(n) (n)
  87. #else
  88. #if (defined __STDC__ || defined __C99__FUNC__ \
  89. || defined __cplusplus || defined _MSC_VER)
  90. static int
  91. YYID (int i)
  92. #else
  93. static int
  94. YYID (i)
  95. int i;
  96. #endif
  97. {
  98. return i;
  99. }
  100. #endif
  101. #ifndef YYFREE
  102. # define YYFREE free
  103. #endif
  104. #ifndef YYMALLOC
  105. # define YYMALLOC malloc
  106. #endif
  107. #ifndef YYREALLOC
  108. # define YYREALLOC realloc
  109. #endif
  110. #define YYSIZEMAX ((size_t) -1)
  111. #ifdef __cplusplus
  112. typedef bool yybool;
  113. #else
  114. typedef unsigned char yybool;
  115. #endif
  116. #define yytrue 1
  117. #define yyfalse 0
  118. #ifndef YYSETJMP
  119. # include <setjmp.h>
  120. # define YYJMP_BUF jmp_buf
  121. # define YYSETJMP(env) setjmp (env)
  122. # define YYLONGJMP(env, val) longjmp (env, val)
  123. #endif
  124. /*-----------------.
  125. | GCC extensions. |
  126. `-----------------*/
  127. #ifndef __attribute__
  128. /* This feature is available in gcc versions 2.5 and later. */
  129. # if (! defined __GNUC__ || __GNUC__ < 2 \
  130. || (__GNUC__ == 2 && __GNUC_MINOR__ < 5) || __STRICT_ANSI__)
  131. # define __attribute__(Spec) /* empty */
  132. # endif
  133. #endif
  134. #ifdef __cplusplus
  135. # define YYOPTIONAL_LOC(Name) /* empty */
  136. #else
  137. # define YYOPTIONAL_LOC(Name) Name __attribute__ ((__unused__))
  138. #endif
  139. #ifndef YYASSERT
  140. # define YYASSERT(condition) ((void) ((condition) || (abort (), 0)))
  141. #endif
  142. /* YYFINAL -- State number of the termination state. */
  143. #define YYFINAL 124
  144. /* YYLAST -- Last index in YYTABLE. */
  145. #define YYLAST 2256
  146. /* YYNTOKENS -- Number of terminals. */
  147. #define YYNTOKENS 100
  148. /* YYNNTS -- Number of nonterminals. */
  149. #define YYNNTS 61
  150. /* YYNRULES -- Number of rules. */
  151. #define YYNRULES 208
  152. /* YYNRULES -- Number of states. */
  153. #define YYNSTATES 353
  154. /* YYMAXRHS -- Maximum number of symbols on right-hand side of rule. */
  155. #define YYMAXRHS 9
  156. /* YYMAXLEFT -- Maximum number of symbols to the left of a handle
  157. accessed by $0, $-1, etc., in any rule. */
  158. #define YYMAXLEFT 0
  159. /* YYTRANSLATE(X) -- Bison symbol number corresponding to X. */
  160. #define YYUNDEFTOK 2
  161. #define YYMAXUTOK 354
  162. #define YYTRANSLATE(YYX) \
  163. ((YYX <= 0) ? YYEOF : \
  164. (unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK)
  165. /* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX. */
  166. static const unsigned char yytranslate[] =
  167. {
  168. 0, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  169. 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  170. 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  171. 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  172. 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  173. 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  174. 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  175. 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  176. 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  177. 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  178. 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  179. 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  180. 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  181. 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  182. 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  183. 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  184. 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  185. 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  186. 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  187. 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  188. 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  189. 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  190. 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  191. 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  192. 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  193. 2, 2, 2, 2, 2, 2, 1, 2, 3, 4,
  194. 5, 6, 7, 8, 9, 10, 11, 12, 13, 14,
  195. 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,
  196. 25, 26, 27, 28, 29, 30, 31, 32, 33, 34,
  197. 35, 36, 37, 38, 39, 40, 41, 42, 43, 44,
  198. 45, 46, 47, 48, 49, 50, 51, 52, 53, 54,
  199. 55, 56, 57, 58, 59, 60, 61, 62, 63, 64,
  200. 65, 66, 67, 68, 69, 70, 71, 72, 73, 74,
  201. 75, 76, 77, 78, 79, 80, 81, 82, 83, 84,
  202. 85, 86, 87, 88, 89, 90, 91, 92, 93, 94,
  203. 95, 96, 97, 98, 99
  204. };
  205. #if YYDEBUG
  206. /* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in
  207. YYRHS. */
  208. static const unsigned short int yyprhs[] =
  209. {
  210. 0, 0, 3, 6, 8, 10, 12, 15, 17, 19,
  211. 21, 25, 27, 30, 34, 36, 39, 41, 43, 45,
  212. 47, 49, 51, 53, 55, 57, 59, 61, 63, 65,
  213. 67, 69, 73, 78, 81, 83, 87, 89, 92, 96,
  214. 98, 100, 102, 103, 107, 109, 111, 115, 117, 119,
  215. 121, 126, 128, 129, 133, 135, 139, 141, 145, 147,
  216. 149, 153, 157, 159, 162, 164, 168, 170, 174, 176,
  217. 180, 184, 186, 192, 198, 204, 210, 212, 218, 224,
  218. 226, 232, 238, 244, 246, 249, 251, 253, 256, 260,
  219. 263, 265, 268, 270, 274, 276, 278, 280, 282, 284,
  220. 286, 288, 290, 294, 296, 298, 300, 302, 304, 309,
  221. 311, 313, 318, 322, 324, 327, 330, 333, 335, 337,
  222. 347, 353, 357, 361, 366, 372, 378, 384, 390, 396,
  223. 402, 408, 418, 428, 438, 448, 458, 468, 474, 480,
  224. 483, 486, 489, 492, 495, 498, 501, 504, 507, 510,
  225. 513, 516, 519, 522, 525, 528, 531, 534, 537, 540,
  226. 543, 546, 549, 552, 555, 558, 561, 563, 564, 566,
  227. 568, 571, 573, 576, 579, 581, 583, 586, 588, 590,
  228. 592, 594, 597, 600, 602, 604, 606, 608, 610, 612,
  229. 614, 616, 618, 620, 622, 624, 626, 628, 630, 632,
  230. 634, 636, 638, 640, 642, 644, 646, 648, 650
  231. };
  232. /* YYRHS -- A `-1'-separated list of the rules' RHS. */
  233. static const short int yyrhs[] =
  234. {
  235. 101, 0, -1, 116, 160, -1, 104, -1, 103, -1,
  236. 145, -1, 10, 104, -1, 10, -1, 112, -1, 105,
  237. -1, 104, 10, 105, -1, 113, -1, 106, 108, -1,
  238. 106, 108, 109, -1, 114, -1, 107, 14, -1, 115,
  239. -1, 33, -1, 34, -1, 35, -1, 36, -1, 37,
  240. -1, 38, -1, 39, -1, 40, -1, 41, -1, 42,
  241. -1, 43, -1, 44, -1, 45, -1, 136, -1, 137,
  242. 6, 7, -1, 52, 6, 132, 7, -1, 109, 110,
  243. -1, 110, -1, 21, 111, 22, -1, 116, -1, 11,
  244. 104, -1, 104, 11, 105, -1, 18, -1, 19, -1,
  245. 5, -1, -1, 6, 116, 7, -1, 125, -1, 135,
  246. -1, 6, 116, 7, -1, 132, -1, 133, -1, 118,
  247. -1, 138, 6, 119, 7, -1, 120, -1, -1, 121,
  248. 17, 120, -1, 121, -1, 160, 116, 160, -1, 123,
  249. -1, 122, 8, 123, -1, 102, -1, 124, -1, 124,
  250. 10, 104, -1, 124, 11, 104, -1, 117, -1, 124,
  251. 109, -1, 126, -1, 125, 46, 126, -1, 127, -1,
  252. 126, 47, 127, -1, 128, -1, 127, 27, 128, -1,
  253. 127, 56, 128, -1, 129, -1, 128, 160, 9, 160,
  254. 129, -1, 128, 160, 20, 160, 129, -1, 128, 160,
  255. 28, 160, 129, -1, 128, 160, 29, 160, 129, -1,
  256. 130, -1, 129, 160, 25, 160, 130, -1, 129, 160,
  257. 26, 160, 130, -1, 131, -1, 130, 160, 134, 160,
  258. 131, -1, 130, 160, 48, 160, 131, -1, 130, 160,
  259. 49, 160, 131, -1, 122, -1, 26, 131, -1, 99,
  260. -1, 3, -1, 3, 18, -1, 3, 18, 3, -1,
  261. 18, 3, -1, 24, -1, 30, 139, -1, 24, -1,
  262. 144, 13, 24, -1, 139, -1, 50, -1, 51, -1,
  263. 52, -1, 53, -1, 139, -1, 140, -1, 141, -1,
  264. 142, 13, 143, -1, 143, -1, 144, -1, 144, -1,
  265. 98, -1, 158, -1, 146, 17, 160, 145, -1, 146,
  266. -1, 147, -1, 147, 4, 5, 98, -1, 149, 148,
  267. 147, -1, 149, -1, 25, 160, -1, 20, 160, -1,
  268. 23, 160, -1, 4, -1, 151, -1, 150, 21, 152,
  269. 160, 55, 160, 159, 160, 22, -1, 150, 63, 6,
  270. 145, 7, -1, 150, 16, 157, -1, 150, 18, 157,
  271. -1, 150, 21, 152, 22, -1, 150, 66, 6, 156,
  272. 7, -1, 150, 67, 6, 156, 7, -1, 150, 68,
  273. 6, 156, 7, -1, 150, 70, 6, 159, 7, -1,
  274. 150, 72, 6, 145, 7, -1, 150, 76, 6, 156,
  275. 7, -1, 150, 77, 6, 156, 7, -1, 150, 21,
  276. 152, 160, 27, 160, 159, 160, 22, -1, 150, 21,
  277. 152, 160, 56, 160, 159, 160, 22, -1, 150, 21,
  278. 152, 160, 57, 160, 159, 160, 22, -1, 150, 21,
  279. 152, 160, 58, 160, 159, 160, 22, -1, 150, 21,
  280. 152, 160, 59, 160, 159, 160, 22, -1, 150, 21,
  281. 152, 160, 60, 160, 159, 160, 22, -1, 150, 74,
  282. 6, 156, 7, -1, 150, 75, 6, 156, 7, -1,
  283. 150, 61, -1, 150, 62, -1, 150, 64, -1, 150,
  284. 65, -1, 150, 69, -1, 150, 71, -1, 150, 73,
  285. -1, 150, 80, -1, 150, 81, -1, 150, 83, -1,
  286. 150, 84, -1, 150, 94, -1, 150, 95, -1, 150,
  287. 96, -1, 150, 97, -1, 150, 78, -1, 150, 79,
  288. -1, 150, 82, -1, 150, 85, -1, 150, 86, -1,
  289. 150, 87, -1, 150, 88, -1, 150, 89, -1, 150,
  290. 90, -1, 150, 91, -1, 150, 92, -1, 150, 93,
  291. -1, 149, -1, -1, 152, -1, 155, -1, 153, 154,
  292. -1, 154, -1, 24, 8, -1, 157, 8, -1, 8,
  293. -1, 157, -1, 153, 24, -1, 24, -1, 3, -1,
  294. 98, -1, 31, -1, 98, 157, -1, 31, 157, -1,
  295. 158, -1, 33, -1, 34, -1, 35, -1, 36, -1,
  296. 37, -1, 38, -1, 39, -1, 40, -1, 41, -1,
  297. 42, -1, 43, -1, 44, -1, 45, -1, 46, -1,
  298. 47, -1, 48, -1, 49, -1, 50, -1, 51, -1,
  299. 52, -1, 53, -1, 157, -1, 99, -1, 4, -1,
  300. -1
  301. };
  302. /* YYRLINE[YYN] -- source line where rule number YYN was defined. */
  303. static const unsigned short int yyrline[] =
  304. {
  305. 0, 219, 219, 223, 224, 225, 229, 230, 231, 235,
  306. 236, 237, 241, 242, 243, 247, 248, 251, 252, 253,
  307. 254, 255, 256, 257, 258, 259, 260, 261, 262, 263,
  308. 267, 268, 269, 273, 274, 278, 282, 286, 290, 294,
  309. 295, 299, 300, 303, 304, 307, 308, 309, 310, 311,
  310. 315, 318, 319, 322, 323, 326, 329, 330, 334, 335,
  311. 336, 337, 341, 342, 346, 347, 351, 352, 356, 357,
  312. 358, 362, 363, 364, 365, 366, 370, 371, 372, 376,
  313. 377, 378, 379, 383, 384, 388, 391, 392, 393, 394,
  314. 398, 402, 406, 407, 408, 412, 413, 414, 415, 419,
  315. 423, 424, 428, 432, 436, 440, 444, 445, 449, 450,
  316. 454, 455, 459, 460, 464, 465, 466, 467, 471, 472,
  317. 473, 474, 475, 476, 477, 478, 479, 480, 481, 482,
  318. 483, 484, 485, 486, 487, 488, 489, 490, 491, 492,
  319. 493, 494, 495, 496, 497, 498, 499, 500, 501, 502,
  320. 503, 504, 505, 506, 507, 508, 509, 510, 511, 512,
  321. 513, 514, 515, 516, 517, 518, 522, 523, 527, 528,
  322. 532, 533, 537, 538, 539, 543, 547, 548, 552, 556,
  323. 557, 558, 559, 560, 564, 565, 566, 567, 568, 569,
  324. 570, 571, 572, 573, 574, 575, 576, 577, 578, 579,
  325. 580, 581, 582, 583, 584, 588, 589, 593, 594
  326. };
  327. #endif
  328. #if YYDEBUG || YYERROR_VERBOSE || YYTOKEN_TABLE
  329. /* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.
  330. First, the terminals, then, starting at YYNTOKENS, nonterminals. */
  331. static const char *const yytname[] =
  332. {
  333. "$end", "error", "$undefined", "NUMBER", "S", "AT", "LPAREN", "RPAREN",
  334. "PIPE", "LT", "SLASH", "DBLSLASH", "BANG", "COLON", "DBLCOLON", "QUERY",
  335. "HASH", "COMMA", "DOT", "DBLDOT", "GT", "LBRA", "RBRA", "TILDE", "SPLAT",
  336. "PLUS", "DASH", "EQ", "LTE", "GTE", "DOLLAR", "BSLASHLIT", "OTHER",
  337. "XANCESTOR", "XANCESTORSELF", "XATTR", "XCHILD", "XDESC", "XDESCSELF",
  338. "XFOLLOW", "XFOLLOWSIB", "XNS", "XPARENT", "XPRE", "XPRESIB", "XSELF",
  339. "XOR", "XAND", "XDIV", "XMOD", "XCOMMENT", "XTEXT", "XPI", "XNODE",
  340. "CXEQUATION", "CXOPHE", "CXOPNE", "CXOPSTARTEQ", "CXOPENDEQ",
  341. "CXOPCONTAINS", "CXOPCONTAINS2", "CXFIRST", "CXLAST", "CXNOT", "CXEVEN",
  342. "CXODD", "CXEQ", "CXGT", "CXLT", "CXHEADER", "CXCONTAINS", "CXEMPTY",
  343. "CXHAS", "CXPARENT", "CXNTHCH", "CXNTHLASTCH", "CXNTHTYPE",
  344. "CXNTHLASTTYPE", "CXFIRSTCH", "CXLASTCH", "CXFIRSTTYPE", "CXLASTTYPE",
  345. "CXONLYCH", "CXONLYTYPE", "CXINPUT", "CXTEXT", "CXPASSWORD", "CXRADIO",
  346. "CXCHECKBOX", "CXSUBMIT", "CXIMAGE", "CXRESET", "CXBUTTON", "CXFILE",
  347. "CXENABLED", "CXDISABLED", "CXCHECKED", "CXSELECTED", "NAME", "STRING",
  348. "$accept", "Root", "LocationPath", "AbsoluteLocationPath",
  349. "RelativeLocationPath", "Step", "AxisSpecifier", "AxisName", "NodeTest",
  350. "Predicates", "Predicate", "PredicateExpr",
  351. "AbbreviatedAbsoluteLocationPath", "AbbreviatedRelativeLocationPath",
  352. "AbbreviatedStep", "AbbreviatedAxisSpecifier", "Expr", "PrimaryExpr",
  353. "FunctionCall", "Arguments", "ArgumentSet", "Argument", "UnionExpr",
  354. "PathExpr", "FilterExpr", "OrExpr", "AndExpr", "EqualityExpr",
  355. "RelationalExpr", "AdditiveExpr", "MultiplicativeExpr", "UnaryExpr",
  356. "Literal", "Number", "MultiplyOperator", "VariableReference", "NameTest",
  357. "NodeType", "FunctionName", "QName", "PrefixedName", "UnprefixedName",
  358. "Prefix", "LocalPart", "NCName", "selectors_group",
  359. "attribute_extended_selector", "selector", "combinator",
  360. "simple_selector_sequence", "possibly_empty_sequence",
  361. "simple_selector_anchor", "type_selector", "namespace_prefix",
  362. "element_name", "universal", "NumberLike", "Ident", "keyword",
  363. "StringLike", "OptS", 0
  364. };
  365. #endif
  366. /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */
  367. static const unsigned char yyr1[] =
  368. {
  369. 0, 100, 101, 102, 102, 102, 103, 103, 103, 104,
  370. 104, 104, 105, 105, 105, 106, 106, 107, 107, 107,
  371. 107, 107, 107, 107, 107, 107, 107, 107, 107, 107,
  372. 108, 108, 108, 109, 109, 110, 111, 112, 113, 114,
  373. 114, 115, 115, 116, 116, 117, 117, 117, 117, 117,
  374. 118, 119, 119, 120, 120, 121, 122, 122, 123, 123,
  375. 123, 123, 124, 124, 125, 125, 126, 126, 127, 127,
  376. 127, 128, 128, 128, 128, 128, 129, 129, 129, 130,
  377. 130, 130, 130, 131, 131, 132, 133, 133, 133, 133,
  378. 134, 135, 136, 136, 136, 137, 137, 137, 137, 138,
  379. 139, 139, 140, 141, 142, 143, 144, 144, 145, 145,
  380. 146, 146, 147, 147, 148, 148, 148, 148, 149, 149,
  381. 149, 149, 149, 149, 149, 149, 149, 149, 149, 149,
  382. 149, 149, 149, 149, 149, 149, 149, 149, 149, 149,
  383. 149, 149, 149, 149, 149, 149, 149, 149, 149, 149,
  384. 149, 149, 149, 149, 149, 149, 149, 149, 149, 149,
  385. 149, 149, 149, 149, 149, 149, 150, 150, 151, 151,
  386. 152, 152, 153, 153, 153, 154, 155, 155, 156, 157,
  387. 157, 157, 157, 157, 158, 158, 158, 158, 158, 158,
  388. 158, 158, 158, 158, 158, 158, 158, 158, 158, 158,
  389. 158, 158, 158, 158, 158, 159, 159, 160, 160
  390. };
  391. /* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */
  392. static const unsigned char yyr2[] =
  393. {
  394. 0, 2, 2, 1, 1, 1, 2, 1, 1, 1,
  395. 3, 1, 2, 3, 1, 2, 1, 1, 1, 1,
  396. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  397. 1, 3, 4, 2, 1, 3, 1, 2, 3, 1,
  398. 1, 1, 0, 3, 1, 1, 3, 1, 1, 1,
  399. 4, 1, 0, 3, 1, 3, 1, 3, 1, 1,
  400. 3, 3, 1, 2, 1, 3, 1, 3, 1, 3,
  401. 3, 1, 5, 5, 5, 5, 1, 5, 5, 1,
  402. 5, 5, 5, 1, 2, 1, 1, 2, 3, 2,
  403. 1, 2, 1, 3, 1, 1, 1, 1, 1, 1,
  404. 1, 1, 3, 1, 1, 1, 1, 1, 4, 1,
  405. 1, 4, 3, 1, 2, 2, 2, 1, 1, 9,
  406. 5, 3, 3, 4, 5, 5, 5, 5, 5, 5,
  407. 5, 9, 9, 9, 9, 9, 9, 5, 5, 2,
  408. 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  409. 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  410. 2, 2, 2, 2, 2, 2, 1, 0, 1, 1,
  411. 2, 1, 2, 2, 1, 1, 2, 1, 1, 1,
  412. 1, 2, 2, 1, 1, 1, 1, 1, 1, 1,
  413. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  414. 1, 1, 1, 1, 1, 1, 1, 1, 0
  415. };
  416. /* YYDPREC[RULE-NUM] -- Dynamic precedence of rule #RULE-NUM (0 if none). */
  417. static const unsigned char yydprec[] =
  418. {
  419. 0, 0, 0, 1, 2, 3, 0, 0, 0, 0,
  420. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  421. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  422. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  423. 0, 0, 0, 2, 1, 0, 0, 0, 0, 0,
  424. 0, 0, 0, 2, 1, 0, 0, 0, 0, 0,
  425. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  426. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  427. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  428. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  429. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  430. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  431. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  432. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  433. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  434. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  435. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  436. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  437. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  438. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  439. 0, 0, 0, 0, 0, 0, 0, 0, 0
  440. };
  441. /* YYMERGER[RULE-NUM] -- Index of merging function for rule #RULE-NUM. */
  442. static const unsigned char yymerger[] =
  443. {
  444. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  445. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  446. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  447. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  448. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  449. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  450. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  451. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  452. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  453. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  454. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  455. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  456. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  457. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  458. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  459. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  460. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  461. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  462. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  463. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  464. 0, 0, 0, 0, 0, 0, 0, 0, 0
  465. };
  466. /* YYDEFACT[S] -- default rule to reduce with in state S when YYTABLE
  467. doesn't specify something else to do. Zero means the default is an
  468. error. */
  469. static const unsigned char yydefact[] =
  470. {
  471. 167, 86, 41, 167, 174, 7, 42, 39, 40, 177,
  472. 167, 0, 180, 184, 185, 186, 187, 188, 189, 190,
  473. 191, 192, 193, 194, 195, 196, 197, 198, 199, 200,
  474. 201, 202, 203, 204, 179, 85, 0, 58, 4, 3,
  475. 9, 0, 0, 8, 11, 14, 16, 208, 62, 49,
  476. 83, 56, 59, 44, 64, 66, 68, 71, 76, 79,
  477. 47, 48, 45, 0, 99, 100, 101, 0, 103, 105,
  478. 5, 109, 110, 166, 0, 118, 168, 0, 171, 169,
  479. 175, 183, 87, 0, 39, 17, 18, 19, 20, 21,
  480. 22, 23, 24, 25, 26, 27, 28, 29, 6, 37,
  481. 89, 172, 167, 84, 184, 185, 186, 187, 188, 189,
  482. 190, 191, 192, 193, 194, 195, 196, 106, 91, 107,
  483. 179, 182, 183, 181, 1, 42, 42, 92, 201, 202,
  484. 203, 204, 12, 30, 0, 94, 105, 15, 207, 2,
  485. 167, 42, 42, 167, 63, 34, 167, 167, 167, 167,
  486. 0, 0, 0, 208, 0, 208, 0, 117, 208, 208,
  487. 208, 167, 0, 0, 0, 139, 140, 0, 141, 142,
  488. 0, 0, 0, 143, 0, 144, 0, 145, 0, 0,
  489. 0, 0, 154, 155, 146, 147, 156, 148, 149, 157,
  490. 158, 159, 160, 161, 162, 163, 164, 165, 150, 151,
  491. 152, 153, 176, 170, 175, 173, 88, 46, 0, 10,
  492. 38, 0, 13, 0, 0, 57, 60, 61, 0, 36,
  493. 33, 65, 67, 69, 70, 208, 208, 208, 208, 208,
  494. 208, 90, 208, 208, 208, 0, 51, 54, 167, 102,
  495. 105, 167, 0, 115, 116, 114, 112, 121, 122, 0,
  496. 208, 0, 167, 0, 0, 0, 0, 167, 0, 0,
  497. 0, 0, 46, 0, 31, 93, 35, 167, 167, 167,
  498. 167, 167, 167, 167, 167, 167, 50, 208, 208, 108,
  499. 111, 123, 0, 0, 178, 0, 0, 0, 206, 205,
  500. 0, 0, 0, 0, 0, 0, 32, 72, 73, 74,
  501. 75, 77, 78, 81, 82, 80, 53, 55, 208, 208,
  502. 208, 208, 208, 208, 208, 120, 124, 125, 126, 127,
  503. 128, 137, 138, 129, 130, 0, 0, 0, 0, 0,
  504. 0, 0, 208, 208, 208, 208, 208, 208, 208, 0,
  505. 0, 0, 0, 0, 0, 0, 131, 119, 132, 133,
  506. 134, 135, 136
  507. };
  508. /* YYPDEFGOTO[NTERM-NUM]. */
  509. static const short int yydefgoto[] =
  510. {
  511. -1, 36, 37, 38, 39, 40, 41, 42, 132, 144,
  512. 145, 218, 43, 44, 45, 46, 47, 48, 49, 235,
  513. 236, 237, 50, 51, 52, 53, 54, 55, 56, 57,
  514. 58, 59, 60, 61, 234, 62, 133, 134, 63, 64,
  515. 65, 66, 67, 68, 69, 70, 71, 72, 161, 73,
  516. 74, 75, 76, 77, 78, 79, 285, 80, 81, 290,
  517. 151
  518. };
  519. /* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
  520. STATE-NUM. */
  521. #define YYPACT_NINF -226
  522. static const short int yypact[] =
  523. {
  524. 49, 4, -226, 326, -226, 1653, 265, 30, -226, 34,
  525. 396, 2076, 1984, 42, 57, 67, 91, 93, 98, 105,
  526. 109, 113, 118, 153, 154, 156, -226, -226, -226, -226,
  527. -226, -226, -226, -226, 1719, -226, 116, -226, -226, 18,
  528. -226, 1918, 172, -226, -226, -226, -226, 190, -226, -226,
  529. 187, -226, 151, 160, 149, -15, 102, 114, 13, -226,
  530. -226, -226, -226, 193, -226, -226, -226, 195, -226, 218,
  531. -226, 217, 231, 2130, 1844, -226, -226, 176, -226, -226,
  532. 228, 59, 234, 235, -226, -226, -226, -226, -226, -226,
  533. -226, -226, -226, -226, -226, -226, -226, -226, 18, 18,
  534. -226, -226, 466, -226, -226, -226, -226, -226, -226, -226,
  535. -226, -226, -226, -226, -226, -226, -226, -226, -226, -226,
  536. 2010, -226, -226, -226, -226, 1702, 2127, -226, 232, 237,
  537. 238, 241, 229, -226, 243, -226, 239, -226, -226, -226,
  538. 1586, 2170, 2211, 536, 230, -226, 606, 676, 746, 816,
  539. 6, 51, 80, 17, 2076, 190, 249, -226, 190, 190,
  540. 190, 1785, 2050, 2050, 1851, -226, -226, 252, -226, -226,
  541. 253, 254, 255, -226, 256, -226, 276, -226, 279, 280,
  542. 288, 289, -226, -226, -226, -226, -226, -226, -226, -226,
  543. -226, -226, -226, -226, -226, -226, -226, -226, -226, -226,
  544. -226, -226, -226, -226, -226, -226, -226, 36, 248, -226,
  545. -226, 197, 229, 290, 287, -226, 18, 18, 291, -226,
  546. -226, 149, -15, 117, 129, 190, 190, 190, 190, 190,
  547. 190, -226, 190, 190, 190, 305, -226, 304, 886, -226,
  548. -226, 1785, 240, -226, -226, -226, -226, -226, -226, 322,
  549. 16, 2050, 1785, 330, 330, 330, 1941, 1785, 330, 330,
  550. 330, 330, -226, 328, -226, -226, -226, 956, 1026, 1096,
  551. 1166, 1236, 1306, 1376, 1446, 1516, -226, 190, 190, -226,
  552. -226, -226, -9, 332, -226, 333, 334, 335, -226, -226,
  553. 336, 339, 340, 341, 342, 344, -226, 130, 150, 165,
  554. 167, 15, 21, -226, -226, -226, -226, -226, 190, 190,
  555. 190, 190, 190, 190, 190, -226, -226, -226, -226, -226,
  556. -226, -226, -226, -226, -226, 1941, 1941, 1941, 1941, 1941,
  557. 1941, 1941, 190, 190, 190, 190, 190, 190, 190, 331,
  558. 358, 359, 360, 361, 362, 363, -226, -226, -226, -226,
  559. -226, -226, -226
  560. };
  561. /* YYPGOTO[NTERM-NUM]. */
  562. static const short int yypgoto[] =
  563. {
  564. -226, -226, -226, -226, 0, -1, -226, -226, -226, 222,
  565. -134, -226, -226, -226, -226, -226, 1, -226, -226, -226,
  566. 78, -226, -226, 246, -226, -226, 212, 242, -13, -104,
  567. -98, -2, 177, -226, -226, -226, -226, -226, -226, 3,
  568. -226, -226, -226, 233, -34, -225, -226, 236, -226, -226,
  569. -226, -226, 226, 227, -74, -226, -57, -3, -11, -50,
  570. -45
  571. };
  572. /* YYTABLE[YYPACT[STATE-NUM]]. What to do in state STATE-NUM. If
  573. positive, shift that token. If negative, reduce the rule which
  574. number is the opposite. If zero, do what YYDEFACT says.
  575. If YYTABLE_NINF, syntax error. */
  576. #define YYTABLE_NINF -209
  577. static const short int yytable[] =
  578. {
  579. 119, 122, 139, 203, 83, 98, 99, 136, 103, 121,
  580. 220, 150, 148, 152, 118, 225, 279, 138, 308, 138,
  581. 138, 138, 82, 122, -52, 138, 226, 283, 125, 126,
  582. 119, 123, 291, 100, 227, 228, -43, -208, 281, -208,
  583. -43, 149, 101, -43, 135, -208, 309, 310, 311, 312,
  584. 313, 314, 1, -43, 2, 3, -17, 4, -43, 5,
  585. 6, -208, -208, -208, -208, -107, 122, 7, 8, -208,
  586. -208, -18, -107, 9, 204, 10, 229, 230, 220, 11,
  587. 12, -19, 13, 14, 15, 16, 17, 18, 19, 20,
  588. 21, 22, 23, 24, 25, 26, 27, 28, 29, 30,
  589. 31, 32, 33, 208, 231, -20, 138, -21, 238, 122,
  590. 241, -208, -22, 243, 244, 245, 124, 123, 138, -23,
  591. 240, 138, -208, -24, 209, 210, -208, -25, 232, 233,
  592. -208, -208, -26, 138, 138, 223, 224, -208, -208, -208,
  593. -208, 216, 217, 119, 219, -208, -208, 34, 35, -208,
  594. 122, 122, 122, 122, 138, -208, -208, -208, -208, 247,
  595. 248, 141, 142, 297, 298, 299, 300, -27, -28, 138,
  596. -29, 138, 143, 301, 302, -208, -208, 203, 150, 150,
  597. 267, 268, 269, 270, 271, 272, 137, 273, 274, 275,
  598. -208, -208, -208, -208, 138, 140, 147, 286, 287, 153,
  599. 202, 292, 293, 294, 295, 282, 146, 12, 154, 104,
  600. 105, 106, 107, 108, 109, 110, 111, 112, 113, 114,
  601. 115, 116, 26, 27, 28, 29, 30, 31, 32, 33,
  602. 122, -104, 238, 307, 155, 156, 205, 206, -95, 278,
  603. 122, 122, 207, -96, 211, 122, 122, -98, 204, 213,
  604. 143, 143, 214, 289, 242, 262, 152, 152, 252, 253,
  605. 254, 255, 256, 325, 326, 327, 328, 329, 330, 331,
  606. 2, 303, 304, 305, 120, 332, 333, 334, 335, 336,
  607. 337, 338, 257, 84, 8, 258, 259, 339, 340, 341,
  608. 342, 343, 344, 345, 260, 261, 35, 264, 85, 86,
  609. 87, 88, 89, 90, 91, 92, 93, 94, 95, 96,
  610. 97, 265, 276, 266, 122, 122, 122, 122, 122, 122,
  611. 122, 277, 289, 289, 289, 289, 289, 289, 289, 1,
  612. 101, 2, 3, 284, 4, 296, 5, 6, 280, 315,
  613. 316, 317, 318, 319, 7, 8, 320, 321, 322, 323,
  614. 9, 324, 10, 346, 212, 306, 11, 12, 221, 13,
  615. 14, 15, 16, 17, 18, 19, 20, 21, 22, 23,
  616. 24, 25, 26, 27, 28, 29, 30, 31, 32, 33,
  617. 347, 348, 349, 350, 351, 352, 215, 239, 263, 222,
  618. 250, 251, 0, 0, 0, 0, 0, 246, 0, 1,
  619. 0, 2, 102, 0, 4, 0, 5, 6, 0, 0,
  620. 0, 0, 0, 0, 7, 8, 0, 0, 0, 0,
  621. 9, 0, 10, 0, 34, 35, 11, 12, 0, 13,
  622. 14, 15, 16, 17, 18, 19, 20, 21, 22, 23,
  623. 24, 25, 26, 27, 28, 29, 30, 31, 32, 33,
  624. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  625. 0, 0, 0, 0, 0, 0, 0, 0, 0, 1,
  626. 0, 2, 3, 0, 4, 0, 5, 6, 0, 0,
  627. 0, 0, 0, 0, 7, 8, 0, 0, 0, 0,
  628. 9, 0, 10, 0, 34, 35, 11, 12, 0, 13,
  629. 14, 15, 16, 17, 18, 19, 20, 21, 22, 23,
  630. 24, 25, 26, 27, 28, 29, 30, 31, 32, 33,
  631. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  632. 0, 0, 0, 0, 0, 0, 0, 0, 0, 1,
  633. 0, 2, 3, 0, 4, 0, 5, 6, 0, 0,
  634. 0, 0, 0, 0, 7, 8, 0, 0, 0, 0,
  635. 9, 0, 10, 0, 34, 35, 11, 12, 0, 13,
  636. 14, 15, 16, 17, 18, 19, 20, 21, 22, 23,
  637. 24, 25, 26, 27, 28, 29, 30, 31, 32, 33,
  638. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  639. 0, 0, 0, 0, 0, 0, 0, 0, 0, 1,
  640. 0, 2, 102, 0, 4, 0, 5, 6, 0, 0,
  641. 0, 0, 0, 0, 7, 8, 0, 0, 0, 0,
  642. 9, 0, 10, 0, 34, 35, 11, 12, 0, 13,
  643. 14, 15, 16, 17, 18, 19, 20, 21, 22, 23,
  644. 24, 25, 26, 27, 28, 29, 30, 31, 32, 33,
  645. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  646. 0, 0, 0, 0, 0, 0, 0, 0, 0, 1,
  647. 0, 2, 102, 0, 4, 0, 5, 6, 0, 0,
  648. 0, 0, 0, 0, 7, 8, 0, 0, 0, 0,
  649. 9, 0, 10, 0, 34, 35, 11, 12, 0, 13,
  650. 14, 15, 16, 17, 18, 19, 20, 21, 22, 23,
  651. 24, 25, 26, 27, 28, 29, 30, 31, 32, 33,
  652. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  653. 0, 0, 0, 0, 0, 0, 0, 0, 0, 1,
  654. 0, 2, 102, 0, 4, 0, 5, 6, 0, 0,
  655. 0, 0, 0, 0, 7, 8, 0, 0, 0, 0,
  656. 9, 0, 10, 0, 34, 35, 11, 12, 0, 13,
  657. 14, 15, 16, 17, 18, 19, 20, 21, 22, 23,
  658. 24, 25, 26, 27, 28, 29, 30, 31, 32, 33,
  659. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  660. 0, 0, 0, 0, 0, 0, 0, 0, 0, 1,
  661. 0, 2, 102, 0, 4, 0, 5, 6, 0, 0,
  662. 0, 0, 0, 0, 7, 8, 0, 0, 0, 0,
  663. 9, 0, 10, 0, 34, 35, 11, 12, 0, 13,
  664. 14, 15, 16, 17, 18, 19, 20, 21, 22, 23,
  665. 24, 25, 26, 27, 28, 29, 30, 31, 32, 33,
  666. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  667. 0, 0, 0, 0, 0, 0, 0, 0, 0, 1,
  668. 0, 2, 3, 0, 4, 0, 5, 6, 0, 0,
  669. 0, 0, 0, 0, 7, 8, 0, 0, 0, 0,
  670. 9, 0, 10, 0, 34, 35, 11, 12, 0, 13,
  671. 14, 15, 16, 17, 18, 19, 20, 21, 22, 23,
  672. 24, 25, 26, 27, 28, 29, 30, 31, 32, 33,
  673. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  674. 0, 0, 0, 0, 0, 0, 0, 0, 0, 1,
  675. 0, 2, 102, 0, 4, 0, 5, 6, 0, 0,
  676. 0, 0, 0, 0, 7, 8, 0, 0, 0, 0,
  677. 9, 0, 10, 0, 34, 35, 11, 12, 0, 13,
  678. 14, 15, 16, 17, 18, 19, 20, 21, 22, 23,
  679. 24, 25, 26, 27, 28, 29, 30, 31, 32, 33,
  680. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  681. 0, 0, 0, 0, 0, 0, 0, 0, 0, 1,
  682. 0, 2, 102, 0, 4, 0, 5, 6, 0, 0,
  683. 0, 0, 0, 0, 7, 8, 0, 0, 0, 0,
  684. 9, 0, 10, 0, 34, 35, 11, 12, 0, 13,
  685. 14, 15, 16, 17, 18, 19, 20, 21, 22, 23,
  686. 24, 25, 26, 27, 28, 29, 30, 31, 32, 33,
  687. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  688. 0, 0, 0, 0, 0, 0, 0, 0, 0, 1,
  689. 0, 2, 102, 0, 4, 0, 5, 6, 0, 0,
  690. 0, 0, 0, 0, 7, 8, 0, 0, 0, 0,
  691. 9, 0, 10, 0, 34, 35, 11, 12, 0, 13,
  692. 14, 15, 16, 17, 18, 19, 20, 21, 22, 23,
  693. 24, 25, 26, 27, 28, 29, 30, 31, 32, 33,
  694. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  695. 0, 0, 0, 0, 0, 0, 0, 0, 0, 1,
  696. 0, 2, 102, 0, 4, 0, 5, 6, 0, 0,
  697. 0, 0, 0, 0, 7, 8, 0, 0, 0, 0,
  698. 9, 0, 10, 0, 34, 35, 11, 12, 0, 13,
  699. 14, 15, 16, 17, 18, 19, 20, 21, 22, 23,
  700. 24, 25, 26, 27, 28, 29, 30, 31, 32, 33,
  701. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  702. 0, 0, 0, 0, 0, 0, 0, 0, 0, 1,
  703. 0, 2, 102, 0, 4, 0, 5, 6, 0, 0,
  704. 0, 0, 0, 0, 7, 8, 0, 0, 0, 0,
  705. 9, 0, 10, 0, 34, 35, 11, 12, 0, 13,
  706. 14, 15, 16, 17, 18, 19, 20, 21, 22, 23,
  707. 24, 25, 26, 27, 28, 29, 30, 31, 32, 33,
  708. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  709. 0, 0, 0, 0, 0, 0, 0, 0, 0, 1,
  710. 0, 2, 102, 0, 4, 0, 5, 6, 0, 0,
  711. 0, 0, 0, 0, 7, 8, 0, 0, 0, 0,
  712. 9, 0, 10, 0, 34, 35, 11, 12, 0, 13,
  713. 14, 15, 16, 17, 18, 19, 20, 21, 22, 23,
  714. 24, 25, 26, 27, 28, 29, 30, 31, 32, 33,
  715. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  716. 0, 0, 0, 0, 0, 0, 0, 0, 0, 1,
  717. 0, 2, 102, 0, 4, 0, 5, 6, 0, 0,
  718. 0, 0, 0, 0, 7, 8, 0, 0, 0, 0,
  719. 9, 0, 10, 0, 34, 35, 11, 12, 0, 13,
  720. 14, 15, 16, 17, 18, 19, 20, 21, 22, 23,
  721. 24, 25, 26, 27, 28, 29, 30, 31, 32, 33,
  722. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  723. 0, 0, 0, 0, 0, 0, 0, 0, 0, 1,
  724. 0, 2, 102, 0, 4, 0, 5, 6, 0, 0,
  725. 0, 0, 0, 0, 7, 8, 0, 0, 0, 0,
  726. 9, 0, 10, 0, 34, 35, 11, 12, 0, 13,
  727. 14, 15, 16, 17, 18, 19, 20, 21, 22, 23,
  728. 24, 25, 26, 27, 28, 29, 30, 31, 32, 33,
  729. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  730. 0, 0, 0, 0, 0, 0, 0, 0, 0, 1,
  731. 0, 2, 102, 0, 4, 0, 5, 6, 0, 0,
  732. 0, 0, 0, 0, 7, 8, 0, 0, 0, 0,
  733. 9, 0, 10, 0, 34, 35, 11, 12, 0, 13,
  734. 14, 15, 16, 17, 18, 19, 20, 21, 22, 23,
  735. 24, 25, 26, 27, 28, 29, 30, 31, 32, 33,
  736. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  737. 0, 0, 0, 0, 0, 0, 0, 0, 0, 1,
  738. 0, 2, 102, 0, 4, 0, 5, 6, 0, 0,
  739. 0, 0, 0, 0, 7, 8, 0, 0, 0, 0,
  740. 9, 0, 0, 0, 34, 35, 11, 12, 0, 13,
  741. 14, 15, 16, 17, 18, 19, 20, 21, 22, 23,
  742. 24, 25, 26, 27, 28, 29, 30, 31, 32, 33,
  743. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  744. 0, 0, 0, 0, 0, 0, 0, 0, 2, 0,
  745. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  746. 0, 84, 8, 0, 0, 0, 0, -7, 0, 0,
  747. 0, 0, 0, 0, 34, 35, 85, 86, 87, 88,
  748. 89, 90, 91, 92, 93, 94, 95, 96, 97, -7,
  749. -7, -7, -7, -42, -42, -42, -42, 2, 0, 0,
  750. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  751. 84, 8, 0, 0, 0, -106, 0, 0, 0, 0,
  752. 0, 0, -106, 0, 0, 85, 86, 87, 88, 89,
  753. 90, 91, 92, 93, 94, 95, 96, 97, 0, 0,
  754. 12, -42, 104, 105, 106, 107, 108, 109, 110, 111,
  755. 112, 113, 114, 115, 116, 26, 27, 28, 29, 30,
  756. 31, 32, 33, 0, 0, 0, 0, 0, 0, 0,
  757. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  758. 0, 0, 0, 4, 0, 0, 0, 0, 0, 0,
  759. 0, 0, 0, 0, 0, 0, 0, 0, 0, 9,
  760. 0, 0, 0, 0, 0, 0, 12, 120, 104, 105,
  761. 106, 107, 108, 109, 110, 111, 112, 113, 114, 115,
  762. 116, 26, 27, 28, 29, 30, 31, 32, 33, 0,
  763. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  764. 0, 0, 0, 0, 0, 0, 0, 0, 0, 4,
  765. 162, 0, 163, 0, 0, 164, 0, 0, 0, 0,
  766. 0, 0, 0, 0, 0, 249, 0, 0, 0, 0,
  767. 0, 0, 12, 120, 104, 105, 106, 107, 108, 109,
  768. 110, 111, 112, 113, 114, 115, 116, 26, 27, 28,
  769. 29, 30, 31, 32, 33, 165, 166, 167, 168, 169,
  770. 170, 171, 172, 173, 174, 175, 176, 177, 178, 179,
  771. 180, 181, 182, 183, 184, 185, 186, 187, 188, 189,
  772. 190, 191, 192, 193, 194, 195, 196, 197, 198, 199,
  773. 200, 201, 127, 0, 0, 0, 0, 0, 0, 120,
  774. 0, 104, 105, 106, 107, 108, 109, 110, 111, 112,
  775. 113, 114, 115, 116, 26, 27, 28, 29, 128, 129,
  776. 130, 131, 12, 0, 104, 105, 106, 107, 108, 109,
  777. 110, 111, 112, 113, 114, 115, 116, 26, 27, 28,
  778. 29, 30, 31, 32, 33, 0, 0, 0, 0, 0,
  779. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  780. 0, 0, 0, 0, 0, 12, 117, 104, 105, 106,
  781. 107, 108, 109, 110, 111, 112, 113, 114, 115, 116,
  782. 26, 27, 28, 29, 30, 31, 32, 33, 0, 120,
  783. 288, 12, 0, 104, 105, 106, 107, 108, 109, 110,
  784. 111, 112, 113, 114, 115, 116, 26, 27, 28, 29,
  785. 30, 31, 32, 33, 0, 0, 0, 0, 0, 0,
  786. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  787. 0, 12, 120, 104, 105, 106, 107, 108, 109, 110,
  788. 111, 112, 113, 114, 115, 116, 26, 27, 28, 29,
  789. 30, 31, 32, 33, 0, 0, 0, 0, 120, 104,
  790. 105, 106, 107, 108, 109, 110, 111, 112, 113, 114,
  791. 115, 116, 26, 27, 28, 29, 30, 31, 32, 33,
  792. -113, 0, 2, 0, 157, 0, 0, -113, -113, -113,
  793. 0, 0, 0, 0, 0, 84, 8, -113, 120, 0,
  794. 158, 0, -113, 159, -113, 160, -113, -113, -113, -113,
  795. 85, 86, 87, 88, 89, 90, 91, 92, 93, 94,
  796. 95, 96, 97, 0, 117, 2, -113, -113, -113, -113,
  797. 0, 0, 0, 0, 0, 0, -113, 0, 84, 8,
  798. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  799. 0, 0, 0, 85, 86, 87, 88, 89, 90, 91,
  800. 92, 93, 94, 95, 96, 97, 2, 0, 0, 0,
  801. 0, 0, 0, 0, 0, 0, 0, 0, 0, 84,
  802. 8, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  803. 0, 0, 0, 0, 85, 86, 87, 88, 89, 90,
  804. 91, 92, 93, 94, 95, 96, 97
  805. };
  806. /* YYCONFLP[YYPACT[STATE-NUM]] -- Pointer into YYCONFL of start of
  807. list of conflicting reductions corresponding to action entry for
  808. state STATE-NUM in yytable. 0 means no conflicts. The list in
  809. yyconfl is terminated by a rule number of 0. */
  810. static const unsigned short int yyconflp[] =
  811. {
  812. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  813. 0, 0, 0, 0, 0, 0, 0, 229, 0, 1199,
  814. 0, 0, 0, 0, 0, 1201, 0, 0, 0, 0,
  815. 0, 0, 0, 0, 0, 0, 697, 0, 0, 0,
  816. 699, 0, 159, 701, 0, 0, 0, 0, 0, 0,
  817. 0, 0, 0, 703, 0, 0, 0, 0, 705, 0,
  818. 0, 0, 0, 0, 0, 0, 0, 1, 0, 0,
  819. 0, 0, 0, 3, 0, 0, 0, 0, 0, 0,
  820. 0, 0, 5, 7, 9, 11, 13, 15, 17, 19,
  821. 21, 23, 25, 27, 29, 31, 33, 35, 37, 39,
  822. 41, 43, 45, 0, 0, 0, 225, 0, 0, 0,
  823. 0, 0, 0, 0, 0, 0, 0, 0, 227, 0,
  824. 0, 707, 0, 0, 0, 0, 0, 0, 0, 0,
  825. 0, 0, 0, 709, 1191, 0, 0, 0, 0, 0,
  826. 0, 0, 0, 0, 0, 0, 0, 47, 0, 0,
  827. 0, 0, 0, 0, 1193, 0, 0, 0, 0, 0,
  828. 0, 0, 0, 0, 0, 0, 0, 0, 0, 1195,
  829. 0, 1197, 0, 0, 0, 0, 0, 0, 0, 0,
  830. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  831. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  832. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  833. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  834. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  835. 0, 0, 0, 0, 231, 233, 241, 0, 0, 0,
  836. 0, 0, 0, 0, 351, 0, 0, 0, 0, 0,
  837. 0, 503, 353, 0, 0, 0, 0, 0, 0, 0,
  838. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  839. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  840. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  841. 0, 0, 0, 0, 0, 0, 0, 0, 133, 135,
  842. 137, 139, 141, 143, 145, 147, 149, 151, 153, 155,
  843. 157, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  844. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  845. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  846. 0, 0, 0, 0, 49, 0, 0, 0, 0, 0,
  847. 51, 0, 0, 0, 0, 0, 0, 0, 0, 53,
  848. 55, 57, 59, 61, 63, 65, 67, 69, 71, 73,
  849. 75, 77, 79, 81, 83, 85, 87, 89, 91, 93,
  850. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  851. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  852. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  853. 0, 0, 0, 0, 161, 0, 0, 0, 0, 0,
  854. 163, 0, 0, 0, 95, 0, 0, 0, 0, 165,
  855. 167, 169, 171, 173, 175, 177, 179, 181, 183, 185,
  856. 187, 189, 191, 193, 195, 197, 199, 201, 203, 205,
  857. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  858. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  859. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  860. 0, 0, 0, 0, 243, 0, 0, 0, 0, 0,
  861. 245, 0, 0, 0, 207, 0, 0, 0, 0, 247,
  862. 249, 251, 253, 255, 257, 259, 261, 263, 265, 267,
  863. 269, 271, 273, 275, 277, 279, 281, 283, 285, 287,
  864. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  865. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  866. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  867. 0, 0, 0, 0, 455, 0, 0, 0, 0, 0,
  868. 457, 0, 0, 0, 289, 0, 0, 0, 0, 459,
  869. 461, 463, 465, 467, 469, 471, 473, 475, 477, 479,
  870. 481, 483, 485, 487, 489, 491, 493, 495, 497, 499,
  871. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  872. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  873. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  874. 0, 0, 0, 0, 505, 0, 0, 0, 0, 0,
  875. 507, 0, 0, 0, 501, 0, 0, 0, 0, 509,
  876. 511, 513, 515, 517, 519, 521, 523, 525, 527, 529,
  877. 531, 533, 535, 537, 539, 541, 543, 545, 547, 549,
  878. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  879. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  880. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  881. 0, 0, 0, 0, 553, 0, 0, 0, 0, 0,
  882. 555, 0, 0, 0, 551, 0, 0, 0, 0, 557,
  883. 559, 561, 563, 565, 567, 569, 571, 573, 575, 577,
  884. 579, 581, 583, 585, 587, 589, 591, 593, 595, 597,
  885. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  886. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  887. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  888. 0, 0, 0, 0, 601, 0, 0, 0, 0, 0,
  889. 603, 0, 0, 0, 599, 0, 0, 0, 0, 605,
  890. 607, 609, 611, 613, 615, 617, 619, 621, 623, 625,
  891. 627, 629, 631, 633, 635, 637, 639, 641, 643, 645,
  892. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  893. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  894. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  895. 0, 0, 0, 0, 649, 0, 0, 0, 0, 0,
  896. 651, 0, 0, 0, 647, 0, 0, 0, 0, 653,
  897. 655, 657, 659, 661, 663, 665, 667, 669, 671, 673,
  898. 675, 677, 679, 681, 683, 685, 687, 689, 691, 693,
  899. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  900. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  901. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  902. 0, 0, 0, 0, 711, 0, 0, 0, 0, 0,
  903. 713, 0, 0, 0, 695, 0, 0, 0, 0, 715,
  904. 717, 719, 721, 723, 725, 727, 729, 731, 733, 735,
  905. 737, 739, 741, 743, 745, 747, 749, 751, 753, 755,
  906. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  907. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  908. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  909. 0, 0, 0, 0, 759, 0, 0, 0, 0, 0,
  910. 761, 0, 0, 0, 757, 0, 0, 0, 0, 763,
  911. 765, 767, 769, 771, 773, 775, 777, 779, 781, 783,
  912. 785, 787, 789, 791, 793, 795, 797, 799, 801, 803,
  913. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  914. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  915. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  916. 0, 0, 0, 0, 807, 0, 0, 0, 0, 0,
  917. 809, 0, 0, 0, 805, 0, 0, 0, 0, 811,
  918. 813, 815, 817, 819, 821, 823, 825, 827, 829, 831,
  919. 833, 835, 837, 839, 841, 843, 845, 847, 849, 851,
  920. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  921. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  922. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  923. 0, 0, 0, 0, 855, 0, 0, 0, 0, 0,
  924. 857, 0, 0, 0, 853, 0, 0, 0, 0, 859,
  925. 861, 863, 865, 867, 869, 871, 873, 875, 877, 879,
  926. 881, 883, 885, 887, 889, 891, 893, 895, 897, 899,
  927. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  928. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  929. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  930. 0, 0, 0, 0, 903, 0, 0, 0, 0, 0,
  931. 905, 0, 0, 0, 901, 0, 0, 0, 0, 907,
  932. 909, 911, 913, 915, 917, 919, 921, 923, 925, 927,
  933. 929, 931, 933, 935, 937, 939, 941, 943, 945, 947,
  934. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  935. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  936. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  937. 0, 0, 0, 0, 951, 0, 0, 0, 0, 0,
  938. 953, 0, 0, 0, 949, 0, 0, 0, 0, 955,
  939. 957, 959, 961, 963, 965, 967, 969, 971, 973, 975,
  940. 977, 979, 981, 983, 985, 987, 989, 991, 993, 995,
  941. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  942. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  943. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  944. 0, 0, 0, 0, 999, 0, 0, 0, 0, 0,
  945. 1001, 0, 0, 0, 997, 0, 0, 0, 0, 1003,
  946. 1005, 1007, 1009, 1011, 1013, 1015, 1017, 1019, 1021, 1023,
  947. 1025, 1027, 1029, 1031, 1033, 1035, 1037, 1039, 1041, 1043,
  948. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  949. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  950. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  951. 0, 0, 0, 0, 1047, 0, 0, 0, 0, 0,
  952. 1049, 0, 0, 0, 1045, 0, 0, 0, 0, 1051,
  953. 1053, 1055, 1057, 1059, 1061, 1063, 1065, 1067, 1069, 1071,
  954. 1073, 1075, 1077, 1079, 1081, 1083, 1085, 1087, 1089, 1091,
  955. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  956. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  957. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  958. 0, 0, 0, 0, 1095, 0, 0, 0, 0, 0,
  959. 1097, 0, 0, 0, 1093, 0, 0, 0, 0, 1099,
  960. 1101, 1103, 1105, 1107, 1109, 1111, 1113, 1115, 1117, 1119,
  961. 1121, 1123, 1125, 1127, 1129, 1131, 1133, 1135, 1137, 1139,
  962. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  963. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  964. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  965. 0, 0, 0, 0, 1143, 0, 0, 0, 0, 0,
  966. 1145, 0, 0, 0, 1141, 0, 0, 0, 0, 1147,
  967. 1149, 1151, 1153, 1155, 1157, 1159, 1161, 1163, 1165, 1167,
  968. 1169, 1171, 1173, 1175, 1177, 1179, 1181, 1183, 1185, 1187,
  969. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  970. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  971. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  972. 0, 0, 0, 0, 355, 0, 0, 0, 0, 0,
  973. 357, 0, 0, 0, 1189, 0, 0, 0, 0, 359,
  974. 361, 363, 365, 367, 369, 371, 373, 375, 377, 379,
  975. 381, 383, 385, 387, 389, 391, 393, 395, 397, 399,
  976. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  977. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  978. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  979. 0, 0, 0, 0, 0, 0, 0, 97, 0, 0,
  980. 0, 0, 0, 0, 401, 0, 99, 101, 103, 105,
  981. 107, 109, 111, 113, 115, 117, 119, 121, 123, 125,
  982. 127, 129, 131, 0, 0, 0, 0, 0, 0, 0,
  983. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  984. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  985. 0, 0, 0, 0, 0, 299, 301, 303, 305, 307,
  986. 309, 311, 313, 315, 317, 319, 321, 323, 0, 0,
  987. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  988. 0, 0, 0, 0, 0, 217, 219, 221, 223, 0,
  989. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  990. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  991. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  992. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  993. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  994. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  995. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  996. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  997. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  998. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  999. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  1000. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  1001. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  1002. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  1003. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  1004. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  1005. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  1006. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  1007. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  1008. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  1009. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  1010. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  1011. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  1012. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  1013. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  1014. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  1015. 209, 211, 213, 215, 0, 0, 0, 0, 0, 0,
  1016. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  1017. 0, 0, 0, 0, 0, 0, 291, 293, 295, 297,
  1018. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  1019. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  1020. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  1021. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  1022. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  1023. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  1024. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  1025. 0, 0, 0, 0, 235, 0, 0, 0, 0, 0,
  1026. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  1027. 237, 0, 0, 0, 0, 239, 0, 0, 0, 0,
  1028. 325, 327, 329, 331, 333, 335, 337, 339, 341, 343,
  1029. 345, 347, 349, 0, 0, 0, 0, 0, 0, 0,
  1030. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  1031. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  1032. 0, 0, 0, 403, 405, 407, 409, 411, 413, 415,
  1033. 417, 419, 421, 423, 425, 427, 0, 0, 0, 0,
  1034. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  1035. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  1036. 0, 0, 0, 0, 429, 431, 433, 435, 437, 439,
  1037. 441, 443, 445, 447, 449, 451, 453
  1038. };
  1039. /* YYCONFL[I] -- lists of conflicting rule numbers, each terminated by
  1040. 0, pointed into by YYCONFLP. */
  1041. static const short int yyconfl[] =
  1042. {
  1043. 0, 167, 0, 42, 0, 42, 0, 42, 0, 42,
  1044. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1045. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1046. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1047. 0, 42, 0, 42, 0, 42, 0, 42, 0, 167,
  1048. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1049. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1050. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1051. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1052. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1053. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1054. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1055. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1056. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1057. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1058. 0, 42, 0, 42, 0, 42, 0, 42, 0, 177,
  1059. 0, 167, 0, 42, 0, 42, 0, 42, 0, 42,
  1060. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1061. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1062. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1063. 0, 42, 0, 42, 0, 42, 0, 42, 0, 180,
  1064. 0, 180, 0, 180, 0, 180, 0, 179, 0, 179,
  1065. 0, 179, 0, 179, 0, 68, 0, 71, 0, 76,
  1066. 0, 109, 0, 110, 0, 113, 0, 113, 0, 113,
  1067. 0, 175, 0, 167, 0, 42, 0, 42, 0, 42,
  1068. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1069. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1070. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1071. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1072. 0, 179, 0, 179, 0, 179, 0, 179, 0, 42,
  1073. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1074. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1075. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1076. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1077. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1078. 0, 97, 0, 104, 0, 167, 0, 42, 0, 42,
  1079. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1080. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1081. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1082. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1083. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1084. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1085. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1086. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1087. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1088. 0, 42, 0, 42, 0, 167, 0, 42, 0, 42,
  1089. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1090. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1091. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1092. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1093. 0, 42, 0, 63, 0, 167, 0, 42, 0, 42,
  1094. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1095. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1096. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1097. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1098. 0, 42, 0, 167, 0, 42, 0, 42, 0, 42,
  1099. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1100. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1101. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1102. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1103. 0, 167, 0, 42, 0, 42, 0, 42, 0, 42,
  1104. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1105. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1106. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1107. 0, 42, 0, 42, 0, 42, 0, 42, 0, 167,
  1108. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1109. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1110. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1111. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1112. 0, 42, 0, 42, 0, 42, 0, 46, 0, 46,
  1113. 0, 46, 0, 46, 0, 46, 0, 69, 0, 70,
  1114. 0, 167, 0, 42, 0, 42, 0, 42, 0, 42,
  1115. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1116. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1117. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1118. 0, 42, 0, 42, 0, 42, 0, 42, 0, 167,
  1119. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1120. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1121. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1122. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1123. 0, 42, 0, 42, 0, 42, 0, 167, 0, 42,
  1124. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1125. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1126. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1127. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1128. 0, 42, 0, 42, 0, 167, 0, 42, 0, 42,
  1129. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1130. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1131. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1132. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1133. 0, 42, 0, 167, 0, 42, 0, 42, 0, 42,
  1134. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1135. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1136. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1137. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1138. 0, 167, 0, 42, 0, 42, 0, 42, 0, 42,
  1139. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1140. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1141. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1142. 0, 42, 0, 42, 0, 42, 0, 42, 0, 167,
  1143. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1144. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1145. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1146. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1147. 0, 42, 0, 42, 0, 42, 0, 167, 0, 42,
  1148. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1149. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1150. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1151. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1152. 0, 42, 0, 42, 0, 167, 0, 42, 0, 42,
  1153. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1154. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1155. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1156. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1157. 0, 42, 0, 167, 0, 42, 0, 42, 0, 42,
  1158. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1159. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1160. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1161. 0, 42, 0, 42, 0, 42, 0, 42, 0, 42,
  1162. 0, 72, 0, 73, 0, 74, 0, 75, 0, 77,
  1163. 0, 78, 0
  1164. };
  1165. static const short int yycheck[] =
  1166. {
  1167. 11, 12, 47, 77, 3, 5, 6, 41, 10, 12,
  1168. 144, 56, 27, 58, 11, 9, 241, 4, 27, 4,
  1169. 4, 4, 18, 34, 7, 4, 20, 252, 10, 11,
  1170. 41, 34, 257, 3, 28, 29, 0, 24, 22, 24,
  1171. 4, 56, 8, 7, 41, 24, 55, 56, 57, 58,
  1172. 59, 60, 3, 17, 5, 6, 14, 8, 22, 10,
  1173. 11, 48, 49, 48, 49, 6, 77, 18, 19, 48,
  1174. 49, 14, 13, 24, 77, 26, 25, 26, 212, 30,
  1175. 31, 14, 33, 34, 35, 36, 37, 38, 39, 40,
  1176. 41, 42, 43, 44, 45, 46, 47, 48, 49, 50,
  1177. 51, 52, 53, 102, 24, 14, 4, 14, 153, 120,
  1178. 155, 9, 14, 158, 159, 160, 0, 120, 4, 14,
  1179. 154, 4, 20, 14, 125, 126, 9, 14, 48, 49,
  1180. 28, 29, 14, 4, 4, 148, 149, 20, 9, 25,
  1181. 26, 141, 142, 154, 143, 28, 29, 98, 99, 20,
  1182. 161, 162, 163, 164, 4, 25, 26, 28, 29, 162,
  1183. 163, 10, 11, 267, 268, 269, 270, 14, 14, 4,
  1184. 14, 4, 21, 271, 272, 25, 26, 251, 223, 224,
  1185. 225, 226, 227, 228, 229, 230, 14, 232, 233, 234,
  1186. 25, 26, 25, 26, 4, 8, 47, 254, 255, 6,
  1187. 24, 258, 259, 260, 261, 250, 46, 31, 13, 33,
  1188. 34, 35, 36, 37, 38, 39, 40, 41, 42, 43,
  1189. 44, 45, 46, 47, 48, 49, 50, 51, 52, 53,
  1190. 241, 13, 277, 278, 17, 4, 8, 3, 6, 238,
  1191. 251, 252, 7, 6, 6, 256, 257, 6, 251, 6,
  1192. 21, 21, 13, 256, 5, 7, 301, 302, 6, 6,
  1193. 6, 6, 6, 308, 309, 310, 311, 312, 313, 314,
  1194. 5, 273, 274, 275, 98, 325, 326, 327, 328, 329,
  1195. 330, 331, 6, 18, 19, 6, 6, 332, 333, 334,
  1196. 335, 336, 337, 338, 6, 6, 99, 7, 33, 34,
  1197. 35, 36, 37, 38, 39, 40, 41, 42, 43, 44,
  1198. 45, 24, 7, 22, 325, 326, 327, 328, 329, 330,
  1199. 331, 17, 325, 326, 327, 328, 329, 330, 331, 3,
  1200. 8, 5, 6, 3, 8, 7, 10, 11, 98, 7,
  1201. 7, 7, 7, 7, 18, 19, 7, 7, 7, 7,
  1202. 24, 7, 26, 22, 132, 277, 30, 31, 146, 33,
  1203. 34, 35, 36, 37, 38, 39, 40, 41, 42, 43,
  1204. 44, 45, 46, 47, 48, 49, 50, 51, 52, 53,
  1205. 22, 22, 22, 22, 22, 22, 140, 154, 211, 147,
  1206. 164, 164, -1, -1, -1, -1, -1, 161, -1, 3,
  1207. -1, 5, 6, -1, 8, -1, 10, 11, -1, -1,
  1208. -1, -1, -1, -1, 18, 19, -1, -1, -1, -1,
  1209. 24, -1, 26, -1, 98, 99, 30, 31, -1, 33,
  1210. 34, 35, 36, 37, 38, 39, 40, 41, 42, 43,
  1211. 44, 45, 46, 47, 48, 49, 50, 51, 52, 53,
  1212. -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
  1213. -1, -1, -1, -1, -1, -1, -1, -1, -1, 3,
  1214. -1, 5, 6, -1, 8, -1, 10, 11, -1, -1,
  1215. -1, -1, -1, -1, 18, 19, -1, -1, -1, -1,
  1216. 24, -1, 26, -1, 98, 99, 30, 31, -1, 33,
  1217. 34, 35, 36, 37, 38, 39, 40, 41, 42, 43,
  1218. 44, 45, 46, 47, 48, 49, 50, 51, 52, 53,
  1219. -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
  1220. -1, -1, -1, -1, -1, -1, -1, -1, -1, 3,
  1221. -1, 5, 6, -1, 8, -1, 10, 11, -1, -1,
  1222. -1, -1, -1, -1, 18, 19, -1, -1, -1, -1,
  1223. 24, -1, 26, -1, 98, 99, 30, 31, -1, 33,
  1224. 34, 35, 36, 37, 38, 39, 40, 41, 42, 43,
  1225. 44, 45, 46, 47, 48, 49, 50, 51, 52, 53,
  1226. -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
  1227. -1, -1, -1, -1, -1, -1, -1, -1, -1, 3,
  1228. -1, 5, 6, -1, 8, -1, 10, 11, -1, -1,
  1229. -1, -1, -1, -1, 18, 19, -1, -1, -1, -1,
  1230. 24, -1, 26, -1, 98, 99, 30, 31, -1, 33,
  1231. 34, 35, 36, 37, 38, 39, 40, 41, 42, 43,
  1232. 44, 45, 46, 47, 48, 49, 50, 51, 52, 53,
  1233. -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
  1234. -1, -1, -1, -1, -1, -1, -1, -1, -1, 3,
  1235. -1, 5, 6, -1, 8, -1, 10, 11, -1, -1,
  1236. -1, -1, -1, -1, 18, 19, -1, -1, -1, -1,
  1237. 24, -1, 26, -1, 98, 99, 30, 31, -1, 33,
  1238. 34, 35, 36, 37, 38, 39, 40, 41, 42, 43,
  1239. 44, 45, 46, 47, 48, 49, 50, 51, 52, 53,
  1240. -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
  1241. -1, -1, -1, -1, -1, -1, -1, -1, -1, 3,
  1242. -1, 5, 6, -1, 8, -1, 10, 11, -1, -1,
  1243. -1, -1, -1, -1, 18, 19, -1, -1, -1, -1,
  1244. 24, -1, 26, -1, 98, 99, 30, 31, -1, 33,
  1245. 34, 35, 36, 37, 38, 39, 40, 41, 42, 43,
  1246. 44, 45, 46, 47, 48, 49, 50, 51, 52, 53,
  1247. -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
  1248. -1, -1, -1, -1, -1, -1, -1, -1, -1, 3,
  1249. -1, 5, 6, -1, 8, -1, 10, 11, -1, -1,
  1250. -1, -1, -1, -1, 18, 19, -1, -1, -1, -1,
  1251. 24, -1, 26, -1, 98, 99, 30, 31, -1, 33,
  1252. 34, 35, 36, 37, 38, 39, 40, 41, 42, 43,
  1253. 44, 45, 46, 47, 48, 49, 50, 51, 52, 53,
  1254. -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
  1255. -1, -1, -1, -1, -1, -1, -1, -1, -1, 3,
  1256. -1, 5, 6, -1, 8, -1, 10, 11, -1, -1,
  1257. -1, -1, -1, -1, 18, 19, -1, -1, -1, -1,
  1258. 24, -1, 26, -1, 98, 99, 30, 31, -1, 33,
  1259. 34, 35, 36, 37, 38, 39, 40, 41, 42, 43,
  1260. 44, 45, 46, 47, 48, 49, 50, 51, 52, 53,
  1261. -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
  1262. -1, -1, -1, -1, -1, -1, -1, -1, -1, 3,
  1263. -1, 5, 6, -1, 8, -1, 10, 11, -1, -1,
  1264. -1, -1, -1, -1, 18, 19, -1, -1, -1, -1,
  1265. 24, -1, 26, -1, 98, 99, 30, 31, -1, 33,
  1266. 34, 35, 36, 37, 38, 39, 40, 41, 42, 43,
  1267. 44, 45, 46, 47, 48, 49, 50, 51, 52, 53,
  1268. -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
  1269. -1, -1, -1, -1, -1, -1, -1, -1, -1, 3,
  1270. -1, 5, 6, -1, 8, -1, 10, 11, -1, -1,
  1271. -1, -1, -1, -1, 18, 19, -1, -1, -1, -1,
  1272. 24, -1, 26, -1, 98, 99, 30, 31, -1, 33,
  1273. 34, 35, 36, 37, 38, 39, 40, 41, 42, 43,
  1274. 44, 45, 46, 47, 48, 49, 50, 51, 52, 53,
  1275. -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
  1276. -1, -1, -1, -1, -1, -1, -1, -1, -1, 3,
  1277. -1, 5, 6, -1, 8, -1, 10, 11, -1, -1,
  1278. -1, -1, -1, -1, 18, 19, -1, -1, -1, -1,
  1279. 24, -1, 26, -1, 98, 99, 30, 31, -1, 33,
  1280. 34, 35, 36, 37, 38, 39, 40, 41, 42, 43,
  1281. 44, 45, 46, 47, 48, 49, 50, 51, 52, 53,
  1282. -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
  1283. -1, -1, -1, -1, -1, -1, -1, -1, -1, 3,
  1284. -1, 5, 6, -1, 8, -1, 10, 11, -1, -1,
  1285. -1, -1, -1, -1, 18, 19, -1, -1, -1, -1,
  1286. 24, -1, 26, -1, 98, 99, 30, 31, -1, 33,
  1287. 34, 35, 36, 37, 38, 39, 40, 41, 42, 43,
  1288. 44, 45, 46, 47, 48, 49, 50, 51, 52, 53,
  1289. -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
  1290. -1, -1, -1, -1, -1, -1, -1, -1, -1, 3,
  1291. -1, 5, 6, -1, 8, -1, 10, 11, -1, -1,
  1292. -1, -1, -1, -1, 18, 19, -1, -1, -1, -1,
  1293. 24, -1, 26, -1, 98, 99, 30, 31, -1, 33,
  1294. 34, 35, 36, 37, 38, 39, 40, 41, 42, 43,
  1295. 44, 45, 46, 47, 48, 49, 50, 51, 52, 53,
  1296. -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
  1297. -1, -1, -1, -1, -1, -1, -1, -1, -1, 3,
  1298. -1, 5, 6, -1, 8, -1, 10, 11, -1, -1,
  1299. -1, -1, -1, -1, 18, 19, -1, -1, -1, -1,
  1300. 24, -1, 26, -1, 98, 99, 30, 31, -1, 33,
  1301. 34, 35, 36, 37, 38, 39, 40, 41, 42, 43,
  1302. 44, 45, 46, 47, 48, 49, 50, 51, 52, 53,
  1303. -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
  1304. -1, -1, -1, -1, -1, -1, -1, -1, -1, 3,
  1305. -1, 5, 6, -1, 8, -1, 10, 11, -1, -1,
  1306. -1, -1, -1, -1, 18, 19, -1, -1, -1, -1,
  1307. 24, -1, 26, -1, 98, 99, 30, 31, -1, 33,
  1308. 34, 35, 36, 37, 38, 39, 40, 41, 42, 43,
  1309. 44, 45, 46, 47, 48, 49, 50, 51, 52, 53,
  1310. -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
  1311. -1, -1, -1, -1, -1, -1, -1, -1, -1, 3,
  1312. -1, 5, 6, -1, 8, -1, 10, 11, -1, -1,
  1313. -1, -1, -1, -1, 18, 19, -1, -1, -1, -1,
  1314. 24, -1, 26, -1, 98, 99, 30, 31, -1, 33,
  1315. 34, 35, 36, 37, 38, 39, 40, 41, 42, 43,
  1316. 44, 45, 46, 47, 48, 49, 50, 51, 52, 53,
  1317. -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
  1318. -1, -1, -1, -1, -1, -1, -1, -1, -1, 3,
  1319. -1, 5, 6, -1, 8, -1, 10, 11, -1, -1,
  1320. -1, -1, -1, -1, 18, 19, -1, -1, -1, -1,
  1321. 24, -1, 26, -1, 98, 99, 30, 31, -1, 33,
  1322. 34, 35, 36, 37, 38, 39, 40, 41, 42, 43,
  1323. 44, 45, 46, 47, 48, 49, 50, 51, 52, 53,
  1324. -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
  1325. -1, -1, -1, -1, -1, -1, -1, -1, -1, 3,
  1326. -1, 5, 6, -1, 8, -1, 10, 11, -1, -1,
  1327. -1, -1, -1, -1, 18, 19, -1, -1, -1, -1,
  1328. 24, -1, -1, -1, 98, 99, 30, 31, -1, 33,
  1329. 34, 35, 36, 37, 38, 39, 40, 41, 42, 43,
  1330. 44, 45, 46, 47, 48, 49, 50, 51, 52, 53,
  1331. -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
  1332. -1, -1, -1, -1, -1, -1, -1, -1, 5, -1,
  1333. -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
  1334. -1, 18, 19, -1, -1, -1, -1, 24, -1, -1,
  1335. -1, -1, -1, -1, 98, 99, 33, 34, 35, 36,
  1336. 37, 38, 39, 40, 41, 42, 43, 44, 45, 46,
  1337. 47, 48, 49, 50, 51, 52, 53, 5, -1, -1,
  1338. -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
  1339. 18, 19, -1, -1, -1, 6, -1, -1, -1, -1,
  1340. -1, -1, 13, -1, -1, 33, 34, 35, 36, 37,
  1341. 38, 39, 40, 41, 42, 43, 44, 45, -1, -1,
  1342. 31, 98, 33, 34, 35, 36, 37, 38, 39, 40,
  1343. 41, 42, 43, 44, 45, 46, 47, 48, 49, 50,
  1344. 51, 52, 53, -1, -1, -1, -1, -1, -1, -1,
  1345. -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
  1346. -1, -1, -1, 8, -1, -1, -1, -1, -1, -1,
  1347. -1, -1, -1, -1, -1, -1, -1, -1, -1, 24,
  1348. -1, -1, -1, -1, -1, -1, 31, 98, 33, 34,
  1349. 35, 36, 37, 38, 39, 40, 41, 42, 43, 44,
  1350. 45, 46, 47, 48, 49, 50, 51, 52, 53, -1,
  1351. -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
  1352. -1, -1, -1, -1, -1, -1, -1, -1, -1, 8,
  1353. 16, -1, 18, -1, -1, 21, -1, -1, -1, -1,
  1354. -1, -1, -1, -1, -1, 24, -1, -1, -1, -1,
  1355. -1, -1, 31, 98, 33, 34, 35, 36, 37, 38,
  1356. 39, 40, 41, 42, 43, 44, 45, 46, 47, 48,
  1357. 49, 50, 51, 52, 53, 61, 62, 63, 64, 65,
  1358. 66, 67, 68, 69, 70, 71, 72, 73, 74, 75,
  1359. 76, 77, 78, 79, 80, 81, 82, 83, 84, 85,
  1360. 86, 87, 88, 89, 90, 91, 92, 93, 94, 95,
  1361. 96, 97, 24, -1, -1, -1, -1, -1, -1, 98,
  1362. -1, 33, 34, 35, 36, 37, 38, 39, 40, 41,
  1363. 42, 43, 44, 45, 46, 47, 48, 49, 50, 51,
  1364. 52, 53, 31, -1, 33, 34, 35, 36, 37, 38,
  1365. 39, 40, 41, 42, 43, 44, 45, 46, 47, 48,
  1366. 49, 50, 51, 52, 53, -1, -1, -1, -1, -1,
  1367. -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
  1368. -1, -1, -1, -1, -1, 31, 98, 33, 34, 35,
  1369. 36, 37, 38, 39, 40, 41, 42, 43, 44, 45,
  1370. 46, 47, 48, 49, 50, 51, 52, 53, -1, 98,
  1371. 99, 31, -1, 33, 34, 35, 36, 37, 38, 39,
  1372. 40, 41, 42, 43, 44, 45, 46, 47, 48, 49,
  1373. 50, 51, 52, 53, -1, -1, -1, -1, -1, -1,
  1374. -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
  1375. -1, 31, 98, 33, 34, 35, 36, 37, 38, 39,
  1376. 40, 41, 42, 43, 44, 45, 46, 47, 48, 49,
  1377. 50, 51, 52, 53, -1, -1, -1, -1, 98, 33,
  1378. 34, 35, 36, 37, 38, 39, 40, 41, 42, 43,
  1379. 44, 45, 46, 47, 48, 49, 50, 51, 52, 53,
  1380. 0, -1, 5, -1, 4, -1, -1, 7, 8, 9,
  1381. -1, -1, -1, -1, -1, 18, 19, 17, 98, -1,
  1382. 20, -1, 22, 23, 24, 25, 26, 27, 28, 29,
  1383. 33, 34, 35, 36, 37, 38, 39, 40, 41, 42,
  1384. 43, 44, 45, -1, 98, 5, 46, 47, 48, 49,
  1385. -1, -1, -1, -1, -1, -1, 56, -1, 18, 19,
  1386. -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
  1387. -1, -1, -1, 33, 34, 35, 36, 37, 38, 39,
  1388. 40, 41, 42, 43, 44, 45, 5, -1, -1, -1,
  1389. -1, -1, -1, -1, -1, -1, -1, -1, -1, 18,
  1390. 19, -1, -1, -1, -1, -1, -1, -1, -1, -1,
  1391. -1, -1, -1, -1, 33, 34, 35, 36, 37, 38,
  1392. 39, 40, 41, 42, 43, 44, 45
  1393. };
  1394. /* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
  1395. symbol of state STATE-NUM. */
  1396. static const unsigned char yystos[] =
  1397. {
  1398. 0, 3, 5, 6, 8, 10, 11, 18, 19, 24,
  1399. 26, 30, 31, 33, 34, 35, 36, 37, 38, 39,
  1400. 40, 41, 42, 43, 44, 45, 46, 47, 48, 49,
  1401. 50, 51, 52, 53, 98, 99, 101, 102, 103, 104,
  1402. 105, 106, 107, 112, 113, 114, 115, 116, 117, 118,
  1403. 122, 123, 124, 125, 126, 127, 128, 129, 130, 131,
  1404. 132, 133, 135, 138, 139, 140, 141, 142, 143, 144,
  1405. 145, 146, 147, 149, 150, 151, 152, 153, 154, 155,
  1406. 157, 158, 18, 116, 18, 33, 34, 35, 36, 37,
  1407. 38, 39, 40, 41, 42, 43, 44, 45, 104, 104,
  1408. 3, 8, 6, 131, 33, 34, 35, 36, 37, 38,
  1409. 39, 40, 41, 42, 43, 44, 45, 98, 139, 158,
  1410. 98, 157, 158, 157, 0, 10, 11, 24, 50, 51,
  1411. 52, 53, 108, 136, 137, 139, 144, 14, 4, 160,
  1412. 8, 10, 11, 21, 109, 110, 46, 47, 27, 56,
  1413. 160, 160, 160, 6, 13, 17, 4, 4, 20, 23,
  1414. 25, 148, 16, 18, 21, 61, 62, 63, 64, 65,
  1415. 66, 67, 68, 69, 70, 71, 72, 73, 74, 75,
  1416. 76, 77, 78, 79, 80, 81, 82, 83, 84, 85,
  1417. 86, 87, 88, 89, 90, 91, 92, 93, 94, 95,
  1418. 96, 97, 24, 154, 157, 8, 3, 7, 116, 105,
  1419. 105, 6, 109, 6, 13, 123, 104, 104, 111, 116,
  1420. 110, 126, 127, 128, 128, 9, 20, 28, 29, 25,
  1421. 26, 24, 48, 49, 134, 119, 120, 121, 160, 143,
  1422. 144, 160, 5, 160, 160, 160, 147, 157, 157, 24,
  1423. 152, 153, 6, 6, 6, 6, 6, 6, 6, 6,
  1424. 6, 6, 7, 132, 7, 24, 22, 160, 160, 160,
  1425. 160, 160, 160, 160, 160, 160, 7, 17, 116, 145,
  1426. 98, 22, 160, 145, 3, 156, 156, 156, 99, 157,
  1427. 159, 145, 156, 156, 156, 156, 7, 129, 129, 129,
  1428. 129, 130, 130, 131, 131, 131, 120, 160, 27, 55,
  1429. 56, 57, 58, 59, 60, 7, 7, 7, 7, 7,
  1430. 7, 7, 7, 7, 7, 160, 160, 160, 160, 160,
  1431. 160, 160, 159, 159, 159, 159, 159, 159, 159, 160,
  1432. 160, 160, 160, 160, 160, 160, 22, 22, 22, 22,
  1433. 22, 22, 22
  1434. };
  1435. /* Prevent warning if -Wmissing-prototypes. */
  1436. int yyparse (void);
  1437. /* Error token number */
  1438. #define YYTERROR 1
  1439. /* YYLLOC_DEFAULT -- Set CURRENT to span from RHS[1] to RHS[N].
  1440. If N is 0, then set CURRENT to the empty location which ends
  1441. the previous symbol: RHS[0] (always defined). */
  1442. #ifndef YYLLOC_DEFAULT
  1443. # define YYLLOC_DEFAULT(Current, Rhs, N) ((void) 0)
  1444. #endif
  1445. #ifndef YY_LOCATION_PRINT
  1446. # define YY_LOCATION_PRINT(File, Loc) ((void) 0)
  1447. #endif
  1448. /* YYLEX -- calling `yylex' with the right arguments. */
  1449. #define YYLEX yylex ()
  1450. YYSTYPE yylval;
  1451. YYLTYPE yylloc;
  1452. int yynerrs;
  1453. int yychar;
  1454. static const int YYEOF = 0;
  1455. static const int YYEMPTY = -2;
  1456. typedef enum { yyok, yyaccept, yyabort, yyerr } YYRESULTTAG;
  1457. #define YYCHK(YYE) \
  1458. do { YYRESULTTAG yyflag = YYE; if (yyflag != yyok) return yyflag; } \
  1459. while (YYID (0))
  1460. #if YYDEBUG
  1461. # ifndef YYFPRINTF
  1462. # define YYFPRINTF fprintf
  1463. # endif
  1464. # define YYDPRINTF(Args) \
  1465. do { \
  1466. if (yydebug) \
  1467. YYFPRINTF Args; \
  1468. } while (YYID (0))
  1469. /*--------------------------------.
  1470. | Print this symbol on YYOUTPUT. |
  1471. `--------------------------------*/
  1472. /*ARGSUSED*/
  1473. static void
  1474. yy_symbol_value_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep)
  1475. {
  1476. if (!yyvaluep)
  1477. return;
  1478. # ifdef YYPRINT
  1479. if (yytype < YYNTOKENS)
  1480. YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep);
  1481. # else
  1482. YYUSE (yyoutput);
  1483. # endif
  1484. switch (yytype)
  1485. {
  1486. default:
  1487. break;
  1488. }
  1489. }
  1490. /*--------------------------------.
  1491. | Print this symbol on YYOUTPUT. |
  1492. `--------------------------------*/
  1493. static void
  1494. yy_symbol_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep)
  1495. {
  1496. if (yytype < YYNTOKENS)
  1497. YYFPRINTF (yyoutput, "token %s (", yytname[yytype]);
  1498. else
  1499. YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]);
  1500. yy_symbol_value_print (yyoutput, yytype, yyvaluep);
  1501. YYFPRINTF (yyoutput, ")");
  1502. }
  1503. # define YY_SYMBOL_PRINT(Title, Type, Value, Location) \
  1504. do { \
  1505. if (yydebug) \
  1506. { \
  1507. YYFPRINTF (stderr, "%s ", Title); \
  1508. yy_symbol_print (stderr, Type, \
  1509. Value); \
  1510. YYFPRINTF (stderr, "\n"); \
  1511. } \
  1512. } while (YYID (0))
  1513. /* Nonzero means print parse trace. It is left uninitialized so that
  1514. multiple parsers can coexist. */
  1515. int yydebug;
  1516. #else /* !YYDEBUG */
  1517. # define YYDPRINTF(Args)
  1518. # define YY_SYMBOL_PRINT(Title, Type, Value, Location)
  1519. #endif /* !YYDEBUG */
  1520. /* YYINITDEPTH -- initial size of the parser's stacks. */
  1521. #ifndef YYINITDEPTH
  1522. # define YYINITDEPTH 200
  1523. #endif
  1524. /* YYMAXDEPTH -- maximum size the stacks can grow to (effective only
  1525. if the built-in stack extension method is used).
  1526. Do not make this value too large; the results are undefined if
  1527. SIZE_MAX < YYMAXDEPTH * sizeof (GLRStackItem)
  1528. evaluated with infinite-precision integer arithmetic. */
  1529. #ifndef YYMAXDEPTH
  1530. # define YYMAXDEPTH 10000
  1531. #endif
  1532. /* Minimum number of free items on the stack allowed after an
  1533. allocation. This is to allow allocation and initialization
  1534. to be completed by functions that call yyexpandGLRStack before the
  1535. stack is expanded, thus insuring that all necessary pointers get
  1536. properly redirected to new data. */
  1537. #define YYHEADROOM 2
  1538. #ifndef YYSTACKEXPANDABLE
  1539. # if (! defined __cplusplus \
  1540. || (defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL))
  1541. # define YYSTACKEXPANDABLE 1
  1542. # else
  1543. # define YYSTACKEXPANDABLE 0
  1544. # endif
  1545. #endif
  1546. #if YYSTACKEXPANDABLE
  1547. # define YY_RESERVE_GLRSTACK(Yystack) \
  1548. do { \
  1549. if (Yystack->yyspaceLeft < YYHEADROOM) \
  1550. yyexpandGLRStack (Yystack); \
  1551. } while (YYID (0))
  1552. #else
  1553. # define YY_RESERVE_GLRSTACK(Yystack) \
  1554. do { \
  1555. if (Yystack->yyspaceLeft < YYHEADROOM) \
  1556. yyMemoryExhausted (Yystack); \
  1557. } while (YYID (0))
  1558. #endif
  1559. #if YYERROR_VERBOSE
  1560. # ifndef yystpcpy
  1561. # if defined __GLIBC__ && defined _STRING_H && defined _GNU_SOURCE
  1562. # define yystpcpy stpcpy
  1563. # else
  1564. /* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in
  1565. YYDEST. */
  1566. static char *
  1567. yystpcpy (char *yydest, const char *yysrc)
  1568. {
  1569. char *yyd = yydest;
  1570. const char *yys = yysrc;
  1571. while ((*yyd++ = *yys++) != '\0')
  1572. continue;
  1573. return yyd - 1;
  1574. }
  1575. # endif
  1576. # endif
  1577. # ifndef yytnamerr
  1578. /* Copy to YYRES the contents of YYSTR after stripping away unnecessary
  1579. quotes and backslashes, so that it's suitable for yyerror. The
  1580. heuristic is that double-quoting is unnecessary unless the string
  1581. contains an apostrophe, a comma, or backslash (other than
  1582. backslash-backslash). YYSTR is taken from yytname. If YYRES is
  1583. null, do not copy; instead, return the length of what the result
  1584. would have been. */
  1585. static size_t
  1586. yytnamerr (char *yyres, const char *yystr)
  1587. {
  1588. if (*yystr == '"')
  1589. {
  1590. size_t yyn = 0;
  1591. char const *yyp = yystr;
  1592. for (;;)
  1593. switch (*++yyp)
  1594. {
  1595. case '\'':
  1596. case ',':
  1597. goto do_not_strip_quotes;
  1598. case '\\':
  1599. if (*++yyp != '\\')
  1600. goto do_not_strip_quotes;
  1601. /* Fall through. */
  1602. default:
  1603. if (yyres)
  1604. yyres[yyn] = *yyp;
  1605. yyn++;
  1606. break;
  1607. case '"':
  1608. if (yyres)
  1609. yyres[yyn] = '\0';
  1610. return yyn;
  1611. }
  1612. do_not_strip_quotes: ;
  1613. }
  1614. if (! yyres)
  1615. return strlen (yystr);
  1616. return yystpcpy (yyres, yystr) - yyres;
  1617. }
  1618. # endif
  1619. #endif /* !YYERROR_VERBOSE */
  1620. /** State numbers, as in LALR(1) machine */
  1621. typedef int yyStateNum;
  1622. /** Rule numbers, as in LALR(1) machine */
  1623. typedef int yyRuleNum;
  1624. /** Grammar symbol */
  1625. typedef short int yySymbol;
  1626. /** Item references, as in LALR(1) machine */
  1627. typedef short int yyItemNum;
  1628. typedef struct yyGLRState yyGLRState;
  1629. typedef struct yyGLRStateSet yyGLRStateSet;
  1630. typedef struct yySemanticOption yySemanticOption;
  1631. typedef union yyGLRStackItem yyGLRStackItem;
  1632. typedef struct yyGLRStack yyGLRStack;
  1633. struct yyGLRState {
  1634. /** Type tag: always true. */
  1635. yybool yyisState;
  1636. /** Type tag for yysemantics. If true, yysval applies, otherwise
  1637. * yyfirstVal applies. */
  1638. yybool yyresolved;
  1639. /** Number of corresponding LALR(1) machine state. */
  1640. yyStateNum yylrState;
  1641. /** Preceding state in this stack */
  1642. yyGLRState* yypred;
  1643. /** Source position of the first token produced by my symbol */
  1644. size_t yyposn;
  1645. union {
  1646. /** First in a chain of alternative reductions producing the
  1647. * non-terminal corresponding to this state, threaded through
  1648. * yynext. */
  1649. yySemanticOption* yyfirstVal;
  1650. /** Semantic value for this state. */
  1651. YYSTYPE yysval;
  1652. } yysemantics;
  1653. /** Source location for this state. */
  1654. YYLTYPE yyloc;
  1655. };
  1656. struct yyGLRStateSet {
  1657. yyGLRState** yystates;
  1658. /** During nondeterministic operation, yylookaheadNeeds tracks which
  1659. * stacks have actually needed the current lookahead. During deterministic
  1660. * operation, yylookaheadNeeds[0] is not maintained since it would merely
  1661. * duplicate yychar != YYEMPTY. */
  1662. yybool* yylookaheadNeeds;
  1663. size_t yysize, yycapacity;
  1664. };
  1665. struct yySemanticOption {
  1666. /** Type tag: always false. */
  1667. yybool yyisState;
  1668. /** Rule number for this reduction */
  1669. yyRuleNum yyrule;
  1670. /** The last RHS state in the list of states to be reduced. */
  1671. yyGLRState* yystate;
  1672. /** The lookahead for this reduction. */
  1673. int yyrawchar;
  1674. YYSTYPE yyval;
  1675. YYLTYPE yyloc;
  1676. /** Next sibling in chain of options. To facilitate merging,
  1677. * options are chained in decreasing order by address. */
  1678. yySemanticOption* yynext;
  1679. };
  1680. /** Type of the items in the GLR stack. The yyisState field
  1681. * indicates which item of the union is valid. */
  1682. union yyGLRStackItem {
  1683. yyGLRState yystate;
  1684. yySemanticOption yyoption;
  1685. };
  1686. struct yyGLRStack {
  1687. int yyerrState;
  1688. YYJMP_BUF yyexception_buffer;
  1689. yyGLRStackItem* yyitems;
  1690. yyGLRStackItem* yynextFree;
  1691. size_t yyspaceLeft;
  1692. yyGLRState* yysplitPoint;
  1693. yyGLRState* yylastDeleted;
  1694. yyGLRStateSet yytops;
  1695. };
  1696. #if YYSTACKEXPANDABLE
  1697. static void yyexpandGLRStack (yyGLRStack* yystackp);
  1698. #endif
  1699. static void yyFail (yyGLRStack* yystackp, const char* yymsg)
  1700. __attribute__ ((__noreturn__));
  1701. static void
  1702. yyFail (yyGLRStack* yystackp, const char* yymsg)
  1703. {
  1704. if (yymsg != NULL)
  1705. yyerror (yymsg);
  1706. YYLONGJMP (yystackp->yyexception_buffer, 1);
  1707. }
  1708. static void yyMemoryExhausted (yyGLRStack* yystackp)
  1709. __attribute__ ((__noreturn__));
  1710. static void
  1711. yyMemoryExhausted (yyGLRStack* yystackp)
  1712. {
  1713. YYLONGJMP (yystackp->yyexception_buffer, 2);
  1714. }
  1715. #if YYDEBUG || YYERROR_VERBOSE
  1716. /** A printable representation of TOKEN. */
  1717. static inline const char*
  1718. yytokenName (yySymbol yytoken)
  1719. {
  1720. if (yytoken == YYEMPTY)
  1721. return "";
  1722. return yytname[yytoken];
  1723. }
  1724. #endif
  1725. /** Fill in YYVSP[YYLOW1 .. YYLOW0-1] from the chain of states starting
  1726. * at YYVSP[YYLOW0].yystate.yypred. Leaves YYVSP[YYLOW1].yystate.yypred
  1727. * containing the pointer to the next state in the chain. */
  1728. static void yyfillin (yyGLRStackItem *, int, int) __attribute__ ((__unused__));
  1729. static void
  1730. yyfillin (yyGLRStackItem *yyvsp, int yylow0, int yylow1)
  1731. {
  1732. yyGLRState* s;
  1733. int i;
  1734. s = yyvsp[yylow0].yystate.yypred;
  1735. for (i = yylow0-1; i >= yylow1; i -= 1)
  1736. {
  1737. YYASSERT (s->yyresolved);
  1738. yyvsp[i].yystate.yyresolved = yytrue;
  1739. yyvsp[i].yystate.yysemantics.yysval = s->yysemantics.yysval;
  1740. yyvsp[i].yystate.yyloc = s->yyloc;
  1741. s = yyvsp[i].yystate.yypred = s->yypred;
  1742. }
  1743. }
  1744. /* Do nothing if YYNORMAL or if *YYLOW <= YYLOW1. Otherwise, fill in
  1745. * YYVSP[YYLOW1 .. *YYLOW-1] as in yyfillin and set *YYLOW = YYLOW1.
  1746. * For convenience, always return YYLOW1. */
  1747. static inline int yyfill (yyGLRStackItem *, int *, int, yybool)
  1748. __attribute__ ((__unused__));
  1749. static inline int
  1750. yyfill (yyGLRStackItem *yyvsp, int *yylow, int yylow1, yybool yynormal)
  1751. {
  1752. if (!yynormal && yylow1 < *yylow)
  1753. {
  1754. yyfillin (yyvsp, *yylow, yylow1);
  1755. *yylow = yylow1;
  1756. }
  1757. return yylow1;
  1758. }
  1759. /** Perform user action for rule number YYN, with RHS length YYRHSLEN,
  1760. * and top stack item YYVSP. YYLVALP points to place to put semantic
  1761. * value ($$), and yylocp points to place for location information
  1762. * (@$). Returns yyok for normal return, yyaccept for YYACCEPT,
  1763. * yyerr for YYERROR, yyabort for YYABORT. */
  1764. /*ARGSUSED*/ static YYRESULTTAG
  1765. yyuserAction (yyRuleNum yyn, int yyrhslen, yyGLRStackItem* yyvsp,
  1766. YYSTYPE* yyvalp,
  1767. YYLTYPE* YYOPTIONAL_LOC (yylocp),
  1768. yyGLRStack* yystackp
  1769. )
  1770. {
  1771. yybool yynormal __attribute__ ((__unused__)) =
  1772. (yystackp->yysplitPoint == NULL);
  1773. int yylow;
  1774. # undef yyerrok
  1775. # define yyerrok (yystackp->yyerrState = 0)
  1776. # undef YYACCEPT
  1777. # define YYACCEPT return yyaccept
  1778. # undef YYABORT
  1779. # define YYABORT return yyabort
  1780. # undef YYERROR
  1781. # define YYERROR return yyerrok, yyerr
  1782. # undef YYRECOVERING
  1783. # define YYRECOVERING() (yystackp->yyerrState != 0)
  1784. # undef yyclearin
  1785. # define yyclearin (yychar = YYEMPTY)
  1786. # undef YYFILL
  1787. # define YYFILL(N) yyfill (yyvsp, &yylow, N, yynormal)
  1788. # undef YYBACKUP
  1789. # define YYBACKUP(Token, Value) \
  1790. return yyerror (YY_("syntax error: cannot back up")), \
  1791. yyerrok, yyerr
  1792. yylow = 1;
  1793. if (yyrhslen == 0)
  1794. *yyvalp = yyval_default;
  1795. else
  1796. *yyvalp = yyvsp[YYFILL (1-yyrhslen)].yystate.yysemantics.yysval;
  1797. YYLLOC_DEFAULT ((*yylocp), (yyvsp - yyrhslen), yyrhslen);
  1798. switch (yyn)
  1799. {
  1800. case 2:
  1801. #line 219 "parser.y"
  1802. { answer((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval.node)); }
  1803. break;
  1804. case 6:
  1805. #line 229 "parser.y"
  1806. { ((*yyvalp).node) = PREP_OP((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval.string), (((yyGLRStackItem const *)yyvsp)[YYFILL ((2) - (2))].yystate.yysemantics.yysval.node)); }
  1807. break;
  1808. case 7:
  1809. #line 230 "parser.y"
  1810. { ((*yyvalp).node) = PXP((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (1))].yystate.yysemantics.yysval.string)); }
  1811. break;
  1812. case 10:
  1813. #line 236 "parser.y"
  1814. { ((*yyvalp).node) = BIN_OP((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (3))].yystate.yysemantics.yysval.node), (((yyGLRStackItem const *)yyvsp)[YYFILL ((2) - (3))].yystate.yysemantics.yysval.string), (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (3))].yystate.yysemantics.yysval.node)); }
  1815. break;
  1816. case 12:
  1817. #line 241 "parser.y"
  1818. { ((*yyvalp).node) = pxpath_cat_paths(2, (((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval.node), (((yyGLRStackItem const *)yyvsp)[YYFILL ((2) - (2))].yystate.yysemantics.yysval.node)); }
  1819. break;
  1820. case 13:
  1821. #line 242 "parser.y"
  1822. { ((*yyvalp).node) = pxpath_cat_paths(3, (((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (3))].yystate.yysemantics.yysval.node), (((yyGLRStackItem const *)yyvsp)[YYFILL ((2) - (3))].yystate.yysemantics.yysval.node), (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (3))].yystate.yysemantics.yysval.node)); }
  1823. break;
  1824. case 14:
  1825. #line 243 "parser.y"
  1826. { ((*yyvalp).node) = PXP((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (1))].yystate.yysemantics.yysval.string)); }
  1827. break;
  1828. case 15:
  1829. #line 247 "parser.y"
  1830. { ((*yyvalp).node) = pxpath_new_path(2, (((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval.string), (((yyGLRStackItem const *)yyvsp)[YYFILL ((2) - (2))].yystate.yysemantics.yysval.string)); }
  1831. break;
  1832. case 16:
  1833. #line 248 "parser.y"
  1834. { ((*yyvalp).node) = PXP((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (1))].yystate.yysemantics.yysval.string)); }
  1835. break;
  1836. case 31:
  1837. #line 268 "parser.y"
  1838. { ((*yyvalp).node) = pxpath_new_path(3, (((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (3))].yystate.yysemantics.yysval.string), (((yyGLRStackItem const *)yyvsp)[YYFILL ((2) - (3))].yystate.yysemantics.yysval.string), (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (3))].yystate.yysemantics.yysval.string)); }
  1839. break;
  1840. case 32:
  1841. #line 269 "parser.y"
  1842. { ((*yyvalp).node) = pxpath_new_path(4, (((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (4))].yystate.yysemantics.yysval.string), (((yyGLRStackItem const *)yyvsp)[YYFILL ((2) - (4))].yystate.yysemantics.yysval.string), (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (4))].yystate.yysemantics.yysval.string), (((yyGLRStackItem const *)yyvsp)[YYFILL ((4) - (4))].yystate.yysemantics.yysval.string)); }
  1843. break;
  1844. case 33:
  1845. #line 273 "parser.y"
  1846. { ((*yyvalp).node) = pxpath_cat_paths(2, (((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval.node), (((yyGLRStackItem const *)yyvsp)[YYFILL ((2) - (2))].yystate.yysemantics.yysval.node)); }
  1847. break;
  1848. case 35:
  1849. #line 278 "parser.y"
  1850. { ((*yyvalp).node) = PXPWRAP((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (3))].yystate.yysemantics.yysval.string), (((yyGLRStackItem const *)yyvsp)[YYFILL ((2) - (3))].yystate.yysemantics.yysval.node), (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (3))].yystate.yysemantics.yysval.string)); }
  1851. break;
  1852. case 37:
  1853. #line 286 "parser.y"
  1854. { ((*yyvalp).node) = PREP_OP((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval.string), (((yyGLRStackItem const *)yyvsp)[YYFILL ((2) - (2))].yystate.yysemantics.yysval.node)); }
  1855. break;
  1856. case 38:
  1857. #line 290 "parser.y"
  1858. { ((*yyvalp).node) = BIN_OP((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (3))].yystate.yysemantics.yysval.node), (((yyGLRStackItem const *)yyvsp)[YYFILL ((2) - (3))].yystate.yysemantics.yysval.string), (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (3))].yystate.yysemantics.yysval.node)); }
  1859. break;
  1860. case 42:
  1861. #line 300 "parser.y"
  1862. { ((*yyvalp).string) = ""; }
  1863. break;
  1864. case 43:
  1865. #line 303 "parser.y"
  1866. { ((*yyvalp).node) = PXPWRAP((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (3))].yystate.yysemantics.yysval.string), (((yyGLRStackItem const *)yyvsp)[YYFILL ((2) - (3))].yystate.yysemantics.yysval.node), (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (3))].yystate.yysemantics.yysval.string)); }
  1867. break;
  1868. case 46:
  1869. #line 308 "parser.y"
  1870. { ((*yyvalp).node) = PXPWRAP((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (3))].yystate.yysemantics.yysval.string), (((yyGLRStackItem const *)yyvsp)[YYFILL ((2) - (3))].yystate.yysemantics.yysval.node), (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (3))].yystate.yysemantics.yysval.string)); }
  1871. break;
  1872. case 47:
  1873. #line 309 "parser.y"
  1874. { ((*yyvalp).node) = LIT((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (1))].yystate.yysemantics.yysval.string)); }
  1875. break;
  1876. case 50:
  1877. #line 315 "parser.y"
  1878. { ((*yyvalp).node) = pxpath_new_func(xpath_alias(pxpath_to_string((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (4))].yystate.yysemantics.yysval.node))), (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (4))].yystate.yysemantics.yysval.node)); }
  1879. break;
  1880. case 52:
  1881. #line 319 "parser.y"
  1882. { ((*yyvalp).node) = NULL; }
  1883. break;
  1884. case 53:
  1885. #line 322 "parser.y"
  1886. { ((*yyvalp).node) = (((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (3))].yystate.yysemantics.yysval.node); (((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (3))].yystate.yysemantics.yysval.node)->next = (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (3))].yystate.yysemantics.yysval.node); }
  1887. break;
  1888. case 55:
  1889. #line 326 "parser.y"
  1890. { ((*yyvalp).node) = (((yyGLRStackItem const *)yyvsp)[YYFILL ((2) - (3))].yystate.yysemantics.yysval.node); }
  1891. break;
  1892. case 57:
  1893. #line 330 "parser.y"
  1894. { ((*yyvalp).node) = BIN_OP((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (3))].yystate.yysemantics.yysval.node), (((yyGLRStackItem const *)yyvsp)[YYFILL ((2) - (3))].yystate.yysemantics.yysval.string), (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (3))].yystate.yysemantics.yysval.node)); }
  1895. break;
  1896. case 60:
  1897. #line 336 "parser.y"
  1898. { ((*yyvalp).node) = BIN_OP((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (3))].yystate.yysemantics.yysval.node), (((yyGLRStackItem const *)yyvsp)[YYFILL ((2) - (3))].yystate.yysemantics.yysval.string), (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (3))].yystate.yysemantics.yysval.node)); }
  1899. break;
  1900. case 61:
  1901. #line 337 "parser.y"
  1902. { ((*yyvalp).node) = BIN_OP((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (3))].yystate.yysemantics.yysval.node), (((yyGLRStackItem const *)yyvsp)[YYFILL ((2) - (3))].yystate.yysemantics.yysval.string), (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (3))].yystate.yysemantics.yysval.node)); }
  1903. break;
  1904. case 63:
  1905. #line 342 "parser.y"
  1906. { ((*yyvalp).node) = pxpath_cat_paths(2, (((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval.node), (((yyGLRStackItem const *)yyvsp)[YYFILL ((2) - (2))].yystate.yysemantics.yysval.node)); }
  1907. break;
  1908. case 65:
  1909. #line 347 "parser.y"
  1910. { ((*yyvalp).node) = LIT_BIN_OP((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (3))].yystate.yysemantics.yysval.node), (((yyGLRStackItem const *)yyvsp)[YYFILL ((2) - (3))].yystate.yysemantics.yysval.string), (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (3))].yystate.yysemantics.yysval.node)); }
  1911. break;
  1912. case 67:
  1913. #line 352 "parser.y"
  1914. { ((*yyvalp).node) = LIT_BIN_OP((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (3))].yystate.yysemantics.yysval.node), (((yyGLRStackItem const *)yyvsp)[YYFILL ((2) - (3))].yystate.yysemantics.yysval.string), (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (3))].yystate.yysemantics.yysval.node)); }
  1915. break;
  1916. case 69:
  1917. #line 357 "parser.y"
  1918. { ((*yyvalp).node) = LIT_BIN_OP((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (3))].yystate.yysemantics.yysval.node), (((yyGLRStackItem const *)yyvsp)[YYFILL ((2) - (3))].yystate.yysemantics.yysval.string), (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (3))].yystate.yysemantics.yysval.node)); }
  1919. break;
  1920. case 70:
  1921. #line 358 "parser.y"
  1922. { ((*yyvalp).node) = LIT_BIN_OP((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (3))].yystate.yysemantics.yysval.node), (((yyGLRStackItem const *)yyvsp)[YYFILL ((2) - (3))].yystate.yysemantics.yysval.string), (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (3))].yystate.yysemantics.yysval.node)); }
  1923. break;
  1924. case 72:
  1925. #line 363 "parser.y"
  1926. { ((*yyvalp).node) = LIT_BIN_OP((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (5))].yystate.yysemantics.yysval.node), (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (5))].yystate.yysemantics.yysval.string), (((yyGLRStackItem const *)yyvsp)[YYFILL ((5) - (5))].yystate.yysemantics.yysval.node)); }
  1927. break;
  1928. case 73:
  1929. #line 364 "parser.y"
  1930. { ((*yyvalp).node) = LIT_BIN_OP((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (5))].yystate.yysemantics.yysval.node), (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (5))].yystate.yysemantics.yysval.string), (((yyGLRStackItem const *)yyvsp)[YYFILL ((5) - (5))].yystate.yysemantics.yysval.node)); }
  1931. break;
  1932. case 74:
  1933. #line 365 "parser.y"
  1934. { ((*yyvalp).node) = LIT_BIN_OP((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (5))].yystate.yysemantics.yysval.node), (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (5))].yystate.yysemantics.yysval.string), (((yyGLRStackItem const *)yyvsp)[YYFILL ((5) - (5))].yystate.yysemantics.yysval.node)); }
  1935. break;
  1936. case 75:
  1937. #line 366 "parser.y"
  1938. { ((*yyvalp).node) = LIT_BIN_OP((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (5))].yystate.yysemantics.yysval.node), (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (5))].yystate.yysemantics.yysval.string), (((yyGLRStackItem const *)yyvsp)[YYFILL ((5) - (5))].yystate.yysemantics.yysval.node)); }
  1939. break;
  1940. case 77:
  1941. #line 371 "parser.y"
  1942. { ((*yyvalp).node) = LIT_BIN_OP((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (5))].yystate.yysemantics.yysval.node), (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (5))].yystate.yysemantics.yysval.string), (((yyGLRStackItem const *)yyvsp)[YYFILL ((5) - (5))].yystate.yysemantics.yysval.node)); }
  1943. break;
  1944. case 78:
  1945. #line 372 "parser.y"
  1946. { ((*yyvalp).node) = LIT_BIN_OP((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (5))].yystate.yysemantics.yysval.node), (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (5))].yystate.yysemantics.yysval.string), (((yyGLRStackItem const *)yyvsp)[YYFILL ((5) - (5))].yystate.yysemantics.yysval.node)); }
  1947. break;
  1948. case 80:
  1949. #line 377 "parser.y"
  1950. { ((*yyvalp).node) = LIT_BIN_OP((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (5))].yystate.yysemantics.yysval.node), (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (5))].yystate.yysemantics.yysval.string), (((yyGLRStackItem const *)yyvsp)[YYFILL ((5) - (5))].yystate.yysemantics.yysval.node)); }
  1951. break;
  1952. case 81:
  1953. #line 378 "parser.y"
  1954. { ((*yyvalp).node) = LIT_BIN_OP((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (5))].yystate.yysemantics.yysval.node), (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (5))].yystate.yysemantics.yysval.string), (((yyGLRStackItem const *)yyvsp)[YYFILL ((5) - (5))].yystate.yysemantics.yysval.node)); }
  1955. break;
  1956. case 82:
  1957. #line 379 "parser.y"
  1958. { ((*yyvalp).node) = LIT_BIN_OP((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (5))].yystate.yysemantics.yysval.node), (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (5))].yystate.yysemantics.yysval.string), (((yyGLRStackItem const *)yyvsp)[YYFILL ((5) - (5))].yystate.yysemantics.yysval.node)); }
  1959. break;
  1960. case 84:
  1961. #line 384 "parser.y"
  1962. { ((*yyvalp).node) = PREP_OP((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval.string), (((yyGLRStackItem const *)yyvsp)[YYFILL ((2) - (2))].yystate.yysemantics.yysval.node)); }
  1963. break;
  1964. case 86:
  1965. #line 391 "parser.y"
  1966. { ((*yyvalp).node) = LIT((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (1))].yystate.yysemantics.yysval.string)); }
  1967. break;
  1968. case 87:
  1969. #line 392 "parser.y"
  1970. { ((*yyvalp).node) = pxpath_new_literal(2, (((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval.string), (((yyGLRStackItem const *)yyvsp)[YYFILL ((2) - (2))].yystate.yysemantics.yysval.string)); }
  1971. break;
  1972. case 88:
  1973. #line 393 "parser.y"
  1974. { ((*yyvalp).node) = pxpath_new_literal(3, (((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (3))].yystate.yysemantics.yysval.string), (((yyGLRStackItem const *)yyvsp)[YYFILL ((2) - (3))].yystate.yysemantics.yysval.string), (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (3))].yystate.yysemantics.yysval.string)); }
  1975. break;
  1976. case 89:
  1977. #line 394 "parser.y"
  1978. { ((*yyvalp).node) = pxpath_new_literal(2, (((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval.string), (((yyGLRStackItem const *)yyvsp)[YYFILL ((2) - (2))].yystate.yysemantics.yysval.string)); }
  1979. break;
  1980. case 91:
  1981. #line 402 "parser.y"
  1982. { ((*yyvalp).node) = PREP_OP((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval.string), (((yyGLRStackItem const *)yyvsp)[YYFILL ((2) - (2))].yystate.yysemantics.yysval.node)); }
  1983. break;
  1984. case 92:
  1985. #line 406 "parser.y"
  1986. { ((*yyvalp).node) = PXP((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (1))].yystate.yysemantics.yysval.string)); }
  1987. break;
  1988. case 93:
  1989. #line 407 "parser.y"
  1990. { ((*yyvalp).node) = pxpath_new_path(3, (((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (3))].yystate.yysemantics.yysval.string), (((yyGLRStackItem const *)yyvsp)[YYFILL ((2) - (3))].yystate.yysemantics.yysval.string), (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (3))].yystate.yysemantics.yysval.string)); }
  1991. break;
  1992. case 101:
  1993. #line 424 "parser.y"
  1994. { ((*yyvalp).node) = PXP((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (1))].yystate.yysemantics.yysval.string)); }
  1995. break;
  1996. case 102:
  1997. #line 428 "parser.y"
  1998. { ((*yyvalp).node) = pxpath_new_path(3, (((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (3))].yystate.yysemantics.yysval.string), (((yyGLRStackItem const *)yyvsp)[YYFILL ((2) - (3))].yystate.yysemantics.yysval.string), (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (3))].yystate.yysemantics.yysval.string)); }
  1999. break;
  2000. case 108:
  2001. #line 449 "parser.y"
  2002. { ((*yyvalp).node) = pxpath_cat_paths(4, pxpath_new_literal(1, ".//"), (((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (4))].yystate.yysemantics.yysval.node), pxpath_new_literal(1, "|"), (((yyGLRStackItem const *)yyvsp)[YYFILL ((4) - (4))].yystate.yysemantics.yysval.node)); }
  2003. break;
  2004. case 109:
  2005. #line 450 "parser.y"
  2006. { ((*yyvalp).node) = pxpath_cat_paths(2, pxpath_new_literal(1, ".//"), (((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (1))].yystate.yysemantics.yysval.node)); }
  2007. break;
  2008. case 111:
  2009. #line 455 "parser.y"
  2010. { ((*yyvalp).node) = pxpath_cat_paths(3, (((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (4))].yystate.yysemantics.yysval.node), PXP("/@"), PXP((((yyGLRStackItem const *)yyvsp)[YYFILL ((4) - (4))].yystate.yysemantics.yysval.string))); }
  2011. break;
  2012. case 112:
  2013. #line 459 "parser.y"
  2014. { ((*yyvalp).node) = pxpath_cat_paths(3, (((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (3))].yystate.yysemantics.yysval.node), PXP((((yyGLRStackItem const *)yyvsp)[YYFILL ((2) - (3))].yystate.yysemantics.yysval.string)), (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (3))].yystate.yysemantics.yysval.node)); }
  2015. break;
  2016. case 114:
  2017. #line 464 "parser.y"
  2018. { ((*yyvalp).string) = "/following-sibling::*[1]/self::"; }
  2019. break;
  2020. case 115:
  2021. #line 465 "parser.y"
  2022. { ((*yyvalp).string) = "/"; }
  2023. break;
  2024. case 116:
  2025. #line 466 "parser.y"
  2026. { ((*yyvalp).string) = "/following-sibling::*/self::"; }
  2027. break;
  2028. case 117:
  2029. #line 467 "parser.y"
  2030. { ((*yyvalp).string) = "//"; }
  2031. break;
  2032. case 119:
  2033. #line 472 "parser.y"
  2034. { ((*yyvalp).node) = pxpath_cat_paths(10, (((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (9))].yystate.yysemantics.yysval.node), PXP("[@"), (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (9))].yystate.yysemantics.yysval.node), PXP(" = "), (((yyGLRStackItem const *)yyvsp)[YYFILL ((7) - (9))].yystate.yysemantics.yysval.node), PXP(" or starts-with(@"), (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (9))].yystate.yysemantics.yysval.node), PXP(", concat("), (((yyGLRStackItem const *)yyvsp)[YYFILL ((7) - (9))].yystate.yysemantics.yysval.node), PXP(", '-' ))]")); }
  2035. break;
  2036. case 120:
  2037. #line 473 "parser.y"
  2038. { ((*yyvalp).node) = pxpath_cat_paths(5, PXP("set-difference("), (((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (5))].yystate.yysemantics.yysval.node), PXP(", "), (((yyGLRStackItem const *)yyvsp)[YYFILL ((4) - (5))].yystate.yysemantics.yysval.node), PXP(")")); }
  2039. break;
  2040. case 121:
  2041. #line 474 "parser.y"
  2042. { ((*yyvalp).node) = P4E((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (3))].yystate.yysemantics.yysval.node), "[@id='", (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (3))].yystate.yysemantics.yysval.node), "']"); }
  2043. break;
  2044. case 122:
  2045. #line 475 "parser.y"
  2046. { ((*yyvalp).node) = P4E((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (3))].yystate.yysemantics.yysval.node), "[contains(concat( ' ', @class, ' ' ), concat( ' ', '", (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (3))].yystate.yysemantics.yysval.node), "', ' ' ))]"); }
  2047. break;
  2048. case 123:
  2049. #line 476 "parser.y"
  2050. { ((*yyvalp).node) = P4E((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (4))].yystate.yysemantics.yysval.node), "[@", (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (4))].yystate.yysemantics.yysval.node), "]"); }
  2051. break;
  2052. case 124:
  2053. #line 477 "parser.y"
  2054. { ((*yyvalp).node) = P4E((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (5))].yystate.yysemantics.yysval.node), "[position() = ", (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (5))].yystate.yysemantics.yysval.string), "]"); }
  2055. break;
  2056. case 125:
  2057. #line 478 "parser.y"
  2058. { ((*yyvalp).node) = P4E((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (5))].yystate.yysemantics.yysval.node), "[position() > ", (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (5))].yystate.yysemantics.yysval.string), "]"); }
  2059. break;
  2060. case 126:
  2061. #line 479 "parser.y"
  2062. { ((*yyvalp).node) = P4E((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (5))].yystate.yysemantics.yysval.node), "[position() < ", (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (5))].yystate.yysemantics.yysval.string), "]"); }
  2063. break;
  2064. case 127:
  2065. #line 480 "parser.y"
  2066. { ((*yyvalp).node) = P4E((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (5))].yystate.yysemantics.yysval.node), "[contains(., ", (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (5))].yystate.yysemantics.yysval.string), "]"); }
  2067. break;
  2068. case 128:
  2069. #line 481 "parser.y"
  2070. { ((*yyvalp).node) = P4E((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (5))].yystate.yysemantics.yysval.node), "[", (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (5))].yystate.yysemantics.yysval.string), "]"); }
  2071. break;
  2072. case 129:
  2073. #line 482 "parser.y"
  2074. { ((*yyvalp).node) = P4E((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (5))].yystate.yysemantics.yysval.node), "[position() = ", (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (5))].yystate.yysemantics.yysval.string), "]"); }
  2075. break;
  2076. case 130:
  2077. #line 483 "parser.y"
  2078. { ((*yyvalp).node) = P4E((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (5))].yystate.yysemantics.yysval.node), "[position() = last() - ", (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (5))].yystate.yysemantics.yysval.string), "]"); }
  2079. break;
  2080. case 131:
  2081. #line 484 "parser.y"
  2082. { ((*yyvalp).node) = P6E((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (9))].yystate.yysemantics.yysval.node), "[@", (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (9))].yystate.yysemantics.yysval.node), " = ", (((yyGLRStackItem const *)yyvsp)[YYFILL ((7) - (9))].yystate.yysemantics.yysval.node), "]"); }
  2083. break;
  2084. case 132:
  2085. #line 485 "parser.y"
  2086. { ((*yyvalp).node) = P6E((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (9))].yystate.yysemantics.yysval.node), "[@", (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (9))].yystate.yysemantics.yysval.node), " != ", (((yyGLRStackItem const *)yyvsp)[YYFILL ((7) - (9))].yystate.yysemantics.yysval.node), "]"); }
  2087. break;
  2088. case 133:
  2089. #line 486 "parser.y"
  2090. { ((*yyvalp).node) = P6E((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (9))].yystate.yysemantics.yysval.node), "[starts-with(@", (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (9))].yystate.yysemantics.yysval.node), ", ", (((yyGLRStackItem const *)yyvsp)[YYFILL ((7) - (9))].yystate.yysemantics.yysval.node), ")]"); }
  2091. break;
  2092. case 134:
  2093. #line 487 "parser.y"
  2094. { ((*yyvalp).node) = P6E((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (9))].yystate.yysemantics.yysval.node), "[ends-with(@", (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (9))].yystate.yysemantics.yysval.node), ", ", (((yyGLRStackItem const *)yyvsp)[YYFILL ((7) - (9))].yystate.yysemantics.yysval.node), ")]"); }
  2095. break;
  2096. case 135:
  2097. #line 488 "parser.y"
  2098. { ((*yyvalp).node) = P6E((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (9))].yystate.yysemantics.yysval.node), "[contains(@", (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (9))].yystate.yysemantics.yysval.node), ", ", (((yyGLRStackItem const *)yyvsp)[YYFILL ((7) - (9))].yystate.yysemantics.yysval.node), ")]"); }
  2099. break;
  2100. case 136:
  2101. #line 489 "parser.y"
  2102. { ((*yyvalp).node) = P6E((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (9))].yystate.yysemantics.yysval.node), "[contains(@", (((yyGLRStackItem const *)yyvsp)[YYFILL ((3) - (9))].yystate.yysemantics.yysval.node), ", ", (((yyGLRStackItem const *)yyvsp)[YYFILL ((7) - (9))].yystate.yysemantics.yysval.node), ")]"); }
  2103. break;
  2104. case 137:
  2105. #line 490 "parser.y"
  2106. { ((*yyvalp).node) = P4O("*[", (((yyGLRStackItem const *)yyvsp)[YYFILL ((4) - (5))].yystate.yysemantics.yysval.node), "]/self::", (((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (5))].yystate.yysemantics.yysval.node)); }
  2107. break;
  2108. case 138:
  2109. #line 491 "parser.y"
  2110. { ((*yyvalp).node) = P4O("*[last() - ", (((yyGLRStackItem const *)yyvsp)[YYFILL ((4) - (5))].yystate.yysemantics.yysval.node), "]/self::", (((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (5))].yystate.yysemantics.yysval.node)); }
  2111. break;
  2112. case 139:
  2113. #line 492 "parser.y"
  2114. { ((*yyvalp).node) = APPEND((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval.node), "[1]"); }
  2115. break;
  2116. case 140:
  2117. #line 493 "parser.y"
  2118. { ((*yyvalp).node) = APPEND((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval.node), "[last()]"); }
  2119. break;
  2120. case 141:
  2121. #line 494 "parser.y"
  2122. { ((*yyvalp).node) = APPEND((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval.node), "[position() % 2 = 0]"); }
  2123. break;
  2124. case 142:
  2125. #line 495 "parser.y"
  2126. { ((*yyvalp).node) = APPEND((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval.node), "[position() % 2 = 1]"); }
  2127. break;
  2128. case 143:
  2129. #line 496 "parser.y"
  2130. { ((*yyvalp).node) = APPEND((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval.node), "[contains('h1 h2 h3 h4 h5 h6', lower-case(local-name()))]"); }
  2131. break;
  2132. case 144:
  2133. #line 497 "parser.y"
  2134. { ((*yyvalp).node) = APPEND((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval.node), "[not(node())]"); }
  2135. break;
  2136. case 145:
  2137. #line 498 "parser.y"
  2138. { ((*yyvalp).node) = APPEND((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval.node), "[node()]"); }
  2139. break;
  2140. case 146:
  2141. #line 499 "parser.y"
  2142. { ((*yyvalp).node) = APPEND((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval.node), "[1]"); }
  2143. break;
  2144. case 147:
  2145. #line 500 "parser.y"
  2146. { ((*yyvalp).node) = APPEND((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval.node), "[last()]"); }
  2147. break;
  2148. case 148:
  2149. #line 501 "parser.y"
  2150. { ((*yyvalp).node) = APPEND((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval.node), "[count()=1]"); }
  2151. break;
  2152. case 149:
  2153. #line 502 "parser.y"
  2154. { ((*yyvalp).node) = APPEND((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval.node), "[lower-case(name())='input']"); }
  2155. break;
  2156. case 150:
  2157. #line 503 "parser.y"
  2158. { ((*yyvalp).node) = APPEND((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval.node), "[lower-case(name())='input' and not(@disabled)]"); }
  2159. break;
  2160. case 151:
  2161. #line 504 "parser.y"
  2162. { ((*yyvalp).node) = APPEND((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval.node), "[lower-case(name())='input' and @disabled]"); }
  2163. break;
  2164. case 152:
  2165. #line 505 "parser.y"
  2166. { ((*yyvalp).node) = APPEND((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval.node), "[@checked]"); }
  2167. break;
  2168. case 153:
  2169. #line 506 "parser.y"
  2170. { ((*yyvalp).node) = APPEND((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval.node), "[@selected]"); }
  2171. break;
  2172. case 154:
  2173. #line 507 "parser.y"
  2174. { ((*yyvalp).node) = PREPEND((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval.node), "*[1]/self::"); }
  2175. break;
  2176. case 155:
  2177. #line 508 "parser.y"
  2178. { ((*yyvalp).node) = PREPEND((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval.node), "*[last()]/self::"); }
  2179. break;
  2180. case 156:
  2181. #line 509 "parser.y"
  2182. { ((*yyvalp).node) = PREPEND((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval.node), "*[count()=1]/self::"); }
  2183. break;
  2184. case 157:
  2185. #line 510 "parser.y"
  2186. { ((*yyvalp).node) = INPUT_TYPE((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval.node), text); }
  2187. break;
  2188. case 158:
  2189. #line 511 "parser.y"
  2190. { ((*yyvalp).node) = INPUT_TYPE((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval.node), password); }
  2191. break;
  2192. case 159:
  2193. #line 512 "parser.y"
  2194. { ((*yyvalp).node) = INPUT_TYPE((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval.node), radio); }
  2195. break;
  2196. case 160:
  2197. #line 513 "parser.y"
  2198. { ((*yyvalp).node) = INPUT_TYPE((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval.node), checkbox); }
  2199. break;
  2200. case 161:
  2201. #line 514 "parser.y"
  2202. { ((*yyvalp).node) = INPUT_TYPE((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval.node), submit); }
  2203. break;
  2204. case 162:
  2205. #line 515 "parser.y"
  2206. { ((*yyvalp).node) = INPUT_TYPE((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval.node), image); }
  2207. break;
  2208. case 163:
  2209. #line 516 "parser.y"
  2210. { ((*yyvalp).node) = INPUT_TYPE((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval.node), reset); }
  2211. break;
  2212. case 164:
  2213. #line 517 "parser.y"
  2214. { ((*yyvalp).node) = INPUT_TYPE((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval.node), button); }
  2215. break;
  2216. case 165:
  2217. #line 518 "parser.y"
  2218. { ((*yyvalp).node) = INPUT_TYPE((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval.node), file); }
  2219. break;
  2220. case 167:
  2221. #line 523 "parser.y"
  2222. { ((*yyvalp).node) = PXP("*"); }
  2223. break;
  2224. case 170:
  2225. #line 532 "parser.y"
  2226. { ((*yyvalp).node) = pxpath_cat_paths(3, (((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval.node), PXP(":"), (((yyGLRStackItem const *)yyvsp)[YYFILL ((2) - (2))].yystate.yysemantics.yysval.node)); }
  2227. break;
  2228. case 172:
  2229. #line 537 "parser.y"
  2230. { ((*yyvalp).node) = PXP("*"); }
  2231. break;
  2232. case 173:
  2233. #line 538 "parser.y"
  2234. { ((*yyvalp).node) = (((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval.node); }
  2235. break;
  2236. case 174:
  2237. #line 539 "parser.y"
  2238. { ((*yyvalp).node) = PXP("*"); }
  2239. break;
  2240. case 175:
  2241. #line 543 "parser.y"
  2242. { ((*yyvalp).node) = (((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (1))].yystate.yysemantics.yysval.node); }
  2243. break;
  2244. case 176:
  2245. #line 547 "parser.y"
  2246. { ((*yyvalp).node) = pxpath_cat_paths(3, (((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval.node), PXP(":"), PXP((((yyGLRStackItem const *)yyvsp)[YYFILL ((2) - (2))].yystate.yysemantics.yysval.string))); }
  2247. break;
  2248. case 177:
  2249. #line 548 "parser.y"
  2250. { ((*yyvalp).node) = PXP((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (1))].yystate.yysemantics.yysval.string)); }
  2251. break;
  2252. case 178:
  2253. #line 552 "parser.y"
  2254. { ((*yyvalp).node) = PXP((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (1))].yystate.yysemantics.yysval.string)); }
  2255. break;
  2256. case 179:
  2257. #line 556 "parser.y"
  2258. { ((*yyvalp).node) = PXP((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (1))].yystate.yysemantics.yysval.string)); }
  2259. break;
  2260. case 180:
  2261. #line 557 "parser.y"
  2262. { ((*yyvalp).node) = PXP((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (1))].yystate.yysemantics.yysval.string) + 1); }
  2263. break;
  2264. case 181:
  2265. #line 558 "parser.y"
  2266. { ((*yyvalp).node) = pxpath_cat_paths(2, PXP((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval.string)), (((yyGLRStackItem const *)yyvsp)[YYFILL ((2) - (2))].yystate.yysemantics.yysval.node)); }
  2267. break;
  2268. case 182:
  2269. #line 559 "parser.y"
  2270. { ((*yyvalp).node) = pxpath_cat_paths(2, PXP((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (2))].yystate.yysemantics.yysval.string) + 1), (((yyGLRStackItem const *)yyvsp)[YYFILL ((2) - (2))].yystate.yysemantics.yysval.node)); }
  2271. break;
  2272. case 183:
  2273. #line 560 "parser.y"
  2274. { ((*yyvalp).node) = PXP((((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (1))].yystate.yysemantics.yysval.string)); }
  2275. break;
  2276. case 206:
  2277. #line 589 "parser.y"
  2278. { ((*yyvalp).node) = pxpath_new_literal(1, (((yyGLRStackItem const *)yyvsp)[YYFILL ((1) - (1))].yystate.yysemantics.yysval.string)); }
  2279. break;
  2280. case 207:
  2281. #line 593 "parser.y"
  2282. { ((*yyvalp).empty) = 0; }
  2283. break;
  2284. case 208:
  2285. #line 594 "parser.y"
  2286. { ((*yyvalp).empty) = 0; }
  2287. break;
  2288. /* Line 930 of glr.c. */
  2289. #line 2546 "y.tab.c"
  2290. default: break;
  2291. }
  2292. return yyok;
  2293. # undef yyerrok
  2294. # undef YYABORT
  2295. # undef YYACCEPT
  2296. # undef YYERROR
  2297. # undef YYBACKUP
  2298. # undef yyclearin
  2299. # undef YYRECOVERING
  2300. }
  2301. /*ARGSUSED*/ static void
  2302. yyuserMerge (int yyn, YYSTYPE* yy0, YYSTYPE* yy1)
  2303. {
  2304. YYUSE (yy0);
  2305. YYUSE (yy1);
  2306. switch (yyn)
  2307. {
  2308. default: break;
  2309. }
  2310. }
  2311. /* Bison grammar-table manipulation. */
  2312. /*-----------------------------------------------.
  2313. | Release the memory associated to this symbol. |
  2314. `-----------------------------------------------*/
  2315. /*ARGSUSED*/
  2316. static void
  2317. yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep)
  2318. {
  2319. YYUSE (yyvaluep);
  2320. if (!yymsg)
  2321. yymsg = "Deleting";
  2322. YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp);
  2323. switch (yytype)
  2324. {
  2325. default:
  2326. break;
  2327. }
  2328. }
  2329. /** Number of symbols composing the right hand side of rule #RULE. */
  2330. static inline int
  2331. yyrhsLength (yyRuleNum yyrule)
  2332. {
  2333. return yyr2[yyrule];
  2334. }
  2335. static void
  2336. yydestroyGLRState (char const *yymsg, yyGLRState *yys)
  2337. {
  2338. if (yys->yyresolved)
  2339. yydestruct (yymsg, yystos[yys->yylrState],
  2340. &yys->yysemantics.yysval);
  2341. else
  2342. {
  2343. #if YYDEBUG
  2344. if (yydebug)
  2345. {
  2346. if (yys->yysemantics.yyfirstVal)
  2347. YYFPRINTF (stderr, "%s unresolved ", yymsg);
  2348. else
  2349. YYFPRINTF (stderr, "%s incomplete ", yymsg);
  2350. yy_symbol_print (stderr, yystos[yys->yylrState],
  2351. NULL);
  2352. YYFPRINTF (stderr, "\n");
  2353. }
  2354. #endif
  2355. if (yys->yysemantics.yyfirstVal)
  2356. {
  2357. yySemanticOption *yyoption = yys->yysemantics.yyfirstVal;
  2358. yyGLRState *yyrh;
  2359. int yyn;
  2360. for (yyrh = yyoption->yystate, yyn = yyrhsLength (yyoption->yyrule);
  2361. yyn > 0;
  2362. yyrh = yyrh->yypred, yyn -= 1)
  2363. yydestroyGLRState (yymsg, yyrh);
  2364. }
  2365. }
  2366. }
  2367. /** Left-hand-side symbol for rule #RULE. */
  2368. static inline yySymbol
  2369. yylhsNonterm (yyRuleNum yyrule)
  2370. {
  2371. return yyr1[yyrule];
  2372. }
  2373. #define yyis_pact_ninf(yystate) \
  2374. ((yystate) == YYPACT_NINF)
  2375. /** True iff LR state STATE has only a default reduction (regardless
  2376. * of token). */
  2377. static inline yybool
  2378. yyisDefaultedState (yyStateNum yystate)
  2379. {
  2380. return yyis_pact_ninf (yypact[yystate]);
  2381. }
  2382. /** The default reduction for STATE, assuming it has one. */
  2383. static inline yyRuleNum
  2384. yydefaultAction (yyStateNum yystate)
  2385. {
  2386. return yydefact[yystate];
  2387. }
  2388. #define yyis_table_ninf(yytable_value) \
  2389. YYID (0)
  2390. /** Set *YYACTION to the action to take in YYSTATE on seeing YYTOKEN.
  2391. * Result R means
  2392. * R < 0: Reduce on rule -R.
  2393. * R = 0: Error.
  2394. * R > 0: Shift to state R.
  2395. * Set *CONFLICTS to a pointer into yyconfl to 0-terminated list of
  2396. * conflicting reductions.
  2397. */
  2398. static inline void
  2399. yygetLRActions (yyStateNum yystate, int yytoken,
  2400. int* yyaction, const short int** yyconflicts)
  2401. {
  2402. int yyindex = yypact[yystate] + yytoken;
  2403. if (yyindex < 0 || YYLAST < yyindex || yycheck[yyindex] != yytoken)
  2404. {
  2405. *yyaction = -yydefact[yystate];
  2406. *yyconflicts = yyconfl;
  2407. }
  2408. else if (! yyis_table_ninf (yytable[yyindex]))
  2409. {
  2410. *yyaction = yytable[yyindex];
  2411. *yyconflicts = yyconfl + yyconflp[yyindex];
  2412. }
  2413. else
  2414. {
  2415. *yyaction = 0;
  2416. *yyconflicts = yyconfl + yyconflp[yyindex];
  2417. }
  2418. }
  2419. static inline yyStateNum
  2420. yyLRgotoState (yyStateNum yystate, yySymbol yylhs)
  2421. {
  2422. int yyr;
  2423. yyr = yypgoto[yylhs - YYNTOKENS] + yystate;
  2424. if (0 <= yyr && yyr <= YYLAST && yycheck[yyr] == yystate)
  2425. return yytable[yyr];
  2426. else
  2427. return yydefgoto[yylhs - YYNTOKENS];
  2428. }
  2429. static inline yybool
  2430. yyisShiftAction (int yyaction)
  2431. {
  2432. return 0 < yyaction;
  2433. }
  2434. static inline yybool
  2435. yyisErrorAction (int yyaction)
  2436. {
  2437. return yyaction == 0;
  2438. }
  2439. /* GLRStates */
  2440. /** Return a fresh GLRStackItem. Callers should call
  2441. * YY_RESERVE_GLRSTACK afterwards to make sure there is sufficient
  2442. * headroom. */
  2443. static inline yyGLRStackItem*
  2444. yynewGLRStackItem (yyGLRStack* yystackp, yybool yyisState)
  2445. {
  2446. yyGLRStackItem* yynewItem = yystackp->yynextFree;
  2447. yystackp->yyspaceLeft -= 1;
  2448. yystackp->yynextFree += 1;
  2449. yynewItem->yystate.yyisState = yyisState;
  2450. return yynewItem;
  2451. }
  2452. /** Add a new semantic action that will execute the action for rule
  2453. * RULENUM on the semantic values in RHS to the list of
  2454. * alternative actions for STATE. Assumes that RHS comes from
  2455. * stack #K of *STACKP. */
  2456. static void
  2457. yyaddDeferredAction (yyGLRStack* yystackp, size_t yyk, yyGLRState* yystate,
  2458. yyGLRState* rhs, yyRuleNum yyrule)
  2459. {
  2460. yySemanticOption* yynewOption =
  2461. &yynewGLRStackItem (yystackp, yyfalse)->yyoption;
  2462. yynewOption->yystate = rhs;
  2463. yynewOption->yyrule = yyrule;
  2464. if (yystackp->yytops.yylookaheadNeeds[yyk])
  2465. {
  2466. yynewOption->yyrawchar = yychar;
  2467. yynewOption->yyval = yylval;
  2468. yynewOption->yyloc = yylloc;
  2469. }
  2470. else
  2471. yynewOption->yyrawchar = YYEMPTY;
  2472. yynewOption->yynext = yystate->yysemantics.yyfirstVal;
  2473. yystate->yysemantics.yyfirstVal = yynewOption;
  2474. YY_RESERVE_GLRSTACK (yystackp);
  2475. }
  2476. /* GLRStacks */
  2477. /** Initialize SET to a singleton set containing an empty stack. */
  2478. static yybool
  2479. yyinitStateSet (yyGLRStateSet* yyset)
  2480. {
  2481. yyset->yysize = 1;
  2482. yyset->yycapacity = 16;
  2483. yyset->yystates = (yyGLRState**) YYMALLOC (16 * sizeof yyset->yystates[0]);
  2484. if (! yyset->yystates)
  2485. return yyfalse;
  2486. yyset->yystates[0] = NULL;
  2487. yyset->yylookaheadNeeds =
  2488. (yybool*) YYMALLOC (16 * sizeof yyset->yylookaheadNeeds[0]);
  2489. if (! yyset->yylookaheadNeeds)
  2490. {
  2491. YYFREE (yyset->yystates);
  2492. return yyfalse;
  2493. }
  2494. return yytrue;
  2495. }
  2496. static void yyfreeStateSet (yyGLRStateSet* yyset)
  2497. {
  2498. YYFREE (yyset->yystates);
  2499. YYFREE (yyset->yylookaheadNeeds);
  2500. }
  2501. /** Initialize STACK to a single empty stack, with total maximum
  2502. * capacity for all stacks of SIZE. */
  2503. static yybool
  2504. yyinitGLRStack (yyGLRStack* yystackp, size_t yysize)
  2505. {
  2506. yystackp->yyerrState = 0;
  2507. yynerrs = 0;
  2508. yystackp->yyspaceLeft = yysize;
  2509. yystackp->yyitems =
  2510. (yyGLRStackItem*) YYMALLOC (yysize * sizeof yystackp->yynextFree[0]);
  2511. if (!yystackp->yyitems)
  2512. return yyfalse;
  2513. yystackp->yynextFree = yystackp->yyitems;
  2514. yystackp->yysplitPoint = NULL;
  2515. yystackp->yylastDeleted = NULL;
  2516. return yyinitStateSet (&yystackp->yytops);
  2517. }
  2518. #if YYSTACKEXPANDABLE
  2519. # define YYRELOC(YYFROMITEMS,YYTOITEMS,YYX,YYTYPE) \
  2520. &((YYTOITEMS) - ((YYFROMITEMS) - (yyGLRStackItem*) (YYX)))->YYTYPE
  2521. /** If STACK is expandable, extend it. WARNING: Pointers into the
  2522. stack from outside should be considered invalid after this call.
  2523. We always expand when there are 1 or fewer items left AFTER an
  2524. allocation, so that we can avoid having external pointers exist
  2525. across an allocation. */
  2526. static void
  2527. yyexpandGLRStack (yyGLRStack* yystackp)
  2528. {
  2529. yyGLRStackItem* yynewItems;
  2530. yyGLRStackItem* yyp0, *yyp1;
  2531. size_t yysize, yynewSize;
  2532. size_t yyn;
  2533. yysize = yystackp->yynextFree - yystackp->yyitems;
  2534. if (YYMAXDEPTH - YYHEADROOM < yysize)
  2535. yyMemoryExhausted (yystackp);
  2536. yynewSize = 2*yysize;
  2537. if (YYMAXDEPTH < yynewSize)
  2538. yynewSize = YYMAXDEPTH;
  2539. yynewItems = (yyGLRStackItem*) YYMALLOC (yynewSize * sizeof yynewItems[0]);
  2540. if (! yynewItems)
  2541. yyMemoryExhausted (yystackp);
  2542. for (yyp0 = yystackp->yyitems, yyp1 = yynewItems, yyn = yysize;
  2543. 0 < yyn;
  2544. yyn -= 1, yyp0 += 1, yyp1 += 1)
  2545. {
  2546. *yyp1 = *yyp0;
  2547. if (*(yybool *) yyp0)
  2548. {
  2549. yyGLRState* yys0 = &yyp0->yystate;
  2550. yyGLRState* yys1 = &yyp1->yystate;
  2551. if (yys0->yypred != NULL)
  2552. yys1->yypred =
  2553. YYRELOC (yyp0, yyp1, yys0->yypred, yystate);
  2554. if (! yys0->yyresolved && yys0->yysemantics.yyfirstVal != NULL)
  2555. yys1->yysemantics.yyfirstVal =
  2556. YYRELOC(yyp0, yyp1, yys0->yysemantics.yyfirstVal, yyoption);
  2557. }
  2558. else
  2559. {
  2560. yySemanticOption* yyv0 = &yyp0->yyoption;
  2561. yySemanticOption* yyv1 = &yyp1->yyoption;
  2562. if (yyv0->yystate != NULL)
  2563. yyv1->yystate = YYRELOC (yyp0, yyp1, yyv0->yystate, yystate);
  2564. if (yyv0->yynext != NULL)
  2565. yyv1->yynext = YYRELOC (yyp0, yyp1, yyv0->yynext, yyoption);
  2566. }
  2567. }
  2568. if (yystackp->yysplitPoint != NULL)
  2569. yystackp->yysplitPoint = YYRELOC (yystackp->yyitems, yynewItems,
  2570. yystackp->yysplitPoint, yystate);
  2571. for (yyn = 0; yyn < yystackp->yytops.yysize; yyn += 1)
  2572. if (yystackp->yytops.yystates[yyn] != NULL)
  2573. yystackp->yytops.yystates[yyn] =
  2574. YYRELOC (yystackp->yyitems, yynewItems,
  2575. yystackp->yytops.yystates[yyn], yystate);
  2576. YYFREE (yystackp->yyitems);
  2577. yystackp->yyitems = yynewItems;
  2578. yystackp->yynextFree = yynewItems + yysize;
  2579. yystackp->yyspaceLeft = yynewSize - yysize;
  2580. }
  2581. #endif
  2582. static void
  2583. yyfreeGLRStack (yyGLRStack* yystackp)
  2584. {
  2585. YYFREE (yystackp->yyitems);
  2586. yyfreeStateSet (&yystackp->yytops);
  2587. }
  2588. /** Assuming that S is a GLRState somewhere on STACK, update the
  2589. * splitpoint of STACK, if needed, so that it is at least as deep as
  2590. * S. */
  2591. static inline void
  2592. yyupdateSplit (yyGLRStack* yystackp, yyGLRState* yys)
  2593. {
  2594. if (yystackp->yysplitPoint != NULL && yystackp->yysplitPoint > yys)
  2595. yystackp->yysplitPoint = yys;
  2596. }
  2597. /** Invalidate stack #K in STACK. */
  2598. static inline void
  2599. yymarkStackDeleted (yyGLRStack* yystackp, size_t yyk)
  2600. {
  2601. if (yystackp->yytops.yystates[yyk] != NULL)
  2602. yystackp->yylastDeleted = yystackp->yytops.yystates[yyk];
  2603. yystackp->yytops.yystates[yyk] = NULL;
  2604. }
  2605. /** Undelete the last stack that was marked as deleted. Can only be
  2606. done once after a deletion, and only when all other stacks have
  2607. been deleted. */
  2608. static void
  2609. yyundeleteLastStack (yyGLRStack* yystackp)
  2610. {
  2611. if (yystackp->yylastDeleted == NULL || yystackp->yytops.yysize != 0)
  2612. return;
  2613. yystackp->yytops.yystates[0] = yystackp->yylastDeleted;
  2614. yystackp->yytops.yysize = 1;
  2615. YYDPRINTF ((stderr, "Restoring last deleted stack as stack #0.\n"));
  2616. yystackp->yylastDeleted = NULL;
  2617. }
  2618. static inline void
  2619. yyremoveDeletes (yyGLRStack* yystackp)
  2620. {
  2621. size_t yyi, yyj;
  2622. yyi = yyj = 0;
  2623. while (yyj < yystackp->yytops.yysize)
  2624. {
  2625. if (yystackp->yytops.yystates[yyi] == NULL)
  2626. {
  2627. if (yyi == yyj)
  2628. {
  2629. YYDPRINTF ((stderr, "Removing dead stacks.\n"));
  2630. }
  2631. yystackp->yytops.yysize -= 1;
  2632. }
  2633. else
  2634. {
  2635. yystackp->yytops.yystates[yyj] = yystackp->yytops.yystates[yyi];
  2636. /* In the current implementation, it's unnecessary to copy
  2637. yystackp->yytops.yylookaheadNeeds[yyi] since, after
  2638. yyremoveDeletes returns, the parser immediately either enters
  2639. deterministic operation or shifts a token. However, it doesn't
  2640. hurt, and the code might evolve to need it. */
  2641. yystackp->yytops.yylookaheadNeeds[yyj] =
  2642. yystackp->yytops.yylookaheadNeeds[yyi];
  2643. if (yyj != yyi)
  2644. {
  2645. YYDPRINTF ((stderr, "Rename stack %lu -> %lu.\n",
  2646. (unsigned long int) yyi, (unsigned long int) yyj));
  2647. }
  2648. yyj += 1;
  2649. }
  2650. yyi += 1;
  2651. }
  2652. }
  2653. /** Shift to a new state on stack #K of STACK, corresponding to LR state
  2654. * LRSTATE, at input position POSN, with (resolved) semantic value SVAL. */
  2655. static inline void
  2656. yyglrShift (yyGLRStack* yystackp, size_t yyk, yyStateNum yylrState,
  2657. size_t yyposn,
  2658. YYSTYPE* yyvalp, YYLTYPE* yylocp)
  2659. {
  2660. yyGLRState* yynewState = &yynewGLRStackItem (yystackp, yytrue)->yystate;
  2661. yynewState->yylrState = yylrState;
  2662. yynewState->yyposn = yyposn;
  2663. yynewState->yyresolved = yytrue;
  2664. yynewState->yypred = yystackp->yytops.yystates[yyk];
  2665. yynewState->yysemantics.yysval = *yyvalp;
  2666. yynewState->yyloc = *yylocp;
  2667. yystackp->yytops.yystates[yyk] = yynewState;
  2668. YY_RESERVE_GLRSTACK (yystackp);
  2669. }
  2670. /** Shift stack #K of YYSTACK, to a new state corresponding to LR
  2671. * state YYLRSTATE, at input position YYPOSN, with the (unresolved)
  2672. * semantic value of YYRHS under the action for YYRULE. */
  2673. static inline void
  2674. yyglrShiftDefer (yyGLRStack* yystackp, size_t yyk, yyStateNum yylrState,
  2675. size_t yyposn, yyGLRState* rhs, yyRuleNum yyrule)
  2676. {
  2677. yyGLRState* yynewState = &yynewGLRStackItem (yystackp, yytrue)->yystate;
  2678. yynewState->yylrState = yylrState;
  2679. yynewState->yyposn = yyposn;
  2680. yynewState->yyresolved = yyfalse;
  2681. yynewState->yypred = yystackp->yytops.yystates[yyk];
  2682. yynewState->yysemantics.yyfirstVal = NULL;
  2683. yystackp->yytops.yystates[yyk] = yynewState;
  2684. /* Invokes YY_RESERVE_GLRSTACK. */
  2685. yyaddDeferredAction (yystackp, yyk, yynewState, rhs, yyrule);
  2686. }
  2687. /** Pop the symbols consumed by reduction #RULE from the top of stack
  2688. * #K of STACK, and perform the appropriate semantic action on their
  2689. * semantic values. Assumes that all ambiguities in semantic values
  2690. * have been previously resolved. Set *VALP to the resulting value,
  2691. * and *LOCP to the computed location (if any). Return value is as
  2692. * for userAction. */
  2693. static inline YYRESULTTAG
  2694. yydoAction (yyGLRStack* yystackp, size_t yyk, yyRuleNum yyrule,
  2695. YYSTYPE* yyvalp, YYLTYPE* yylocp)
  2696. {
  2697. int yynrhs = yyrhsLength (yyrule);
  2698. if (yystackp->yysplitPoint == NULL)
  2699. {
  2700. /* Standard special case: single stack. */
  2701. yyGLRStackItem* rhs = (yyGLRStackItem*) yystackp->yytops.yystates[yyk];
  2702. YYASSERT (yyk == 0);
  2703. yystackp->yynextFree -= yynrhs;
  2704. yystackp->yyspaceLeft += yynrhs;
  2705. yystackp->yytops.yystates[0] = & yystackp->yynextFree[-1].yystate;
  2706. return yyuserAction (yyrule, yynrhs, rhs,
  2707. yyvalp, yylocp, yystackp);
  2708. }
  2709. else
  2710. {
  2711. /* At present, doAction is never called in nondeterministic
  2712. * mode, so this branch is never taken. It is here in
  2713. * anticipation of a future feature that will allow immediate
  2714. * evaluation of selected actions in nondeterministic mode. */
  2715. int yyi;
  2716. yyGLRState* yys;
  2717. yyGLRStackItem yyrhsVals[YYMAXRHS + YYMAXLEFT + 1];
  2718. yys = yyrhsVals[YYMAXRHS + YYMAXLEFT].yystate.yypred
  2719. = yystackp->yytops.yystates[yyk];
  2720. for (yyi = 0; yyi < yynrhs; yyi += 1)
  2721. {
  2722. yys = yys->yypred;
  2723. YYASSERT (yys);
  2724. }
  2725. yyupdateSplit (yystackp, yys);
  2726. yystackp->yytops.yystates[yyk] = yys;
  2727. return yyuserAction (yyrule, yynrhs, yyrhsVals + YYMAXRHS + YYMAXLEFT - 1,
  2728. yyvalp, yylocp, yystackp);
  2729. }
  2730. }
  2731. #if !YYDEBUG
  2732. # define YY_REDUCE_PRINT(Args)
  2733. #else
  2734. # define YY_REDUCE_PRINT(Args) \
  2735. do { \
  2736. if (yydebug) \
  2737. yy_reduce_print Args; \
  2738. } while (YYID (0))
  2739. /*----------------------------------------------------------.
  2740. | Report that the RULE is going to be reduced on stack #K. |
  2741. `----------------------------------------------------------*/
  2742. /*ARGSUSED*/ static inline void
  2743. yy_reduce_print (yyGLRStack* yystackp, size_t yyk, yyRuleNum yyrule,
  2744. YYSTYPE* yyvalp, YYLTYPE* yylocp)
  2745. {
  2746. int yynrhs = yyrhsLength (yyrule);
  2747. yybool yynormal __attribute__ ((__unused__)) =
  2748. (yystackp->yysplitPoint == NULL);
  2749. yyGLRStackItem* yyvsp = (yyGLRStackItem*) yystackp->yytops.yystates[yyk];
  2750. int yylow = 1;
  2751. int yyi;
  2752. YYUSE (yyvalp);
  2753. YYUSE (yylocp);
  2754. YYFPRINTF (stderr, "Reducing stack %lu by rule %d (line %lu):\n",
  2755. (unsigned long int) yyk, yyrule - 1,
  2756. (unsigned long int) yyrline[yyrule]);
  2757. /* The symbols being reduced. */
  2758. for (yyi = 0; yyi < yynrhs; yyi++)
  2759. {
  2760. fprintf (stderr, " $%d = ", yyi + 1);
  2761. yy_symbol_print (stderr, yyrhs[yyprhs[yyrule] + yyi],
  2762. &(((yyGLRStackItem const *)yyvsp)[YYFILL ((yyi + 1) - (yynrhs))].yystate.yysemantics.yysval)
  2763. );
  2764. fprintf (stderr, "\n");
  2765. }
  2766. }
  2767. #endif
  2768. /** Pop items off stack #K of STACK according to grammar rule RULE,
  2769. * and push back on the resulting nonterminal symbol. Perform the
  2770. * semantic action associated with RULE and store its value with the
  2771. * newly pushed state, if FORCEEVAL or if STACK is currently
  2772. * unambiguous. Otherwise, store the deferred semantic action with
  2773. * the new state. If the new state would have an identical input
  2774. * position, LR state, and predecessor to an existing state on the stack,
  2775. * it is identified with that existing state, eliminating stack #K from
  2776. * the STACK. In this case, the (necessarily deferred) semantic value is
  2777. * added to the options for the existing state's semantic value.
  2778. */
  2779. static inline YYRESULTTAG
  2780. yyglrReduce (yyGLRStack* yystackp, size_t yyk, yyRuleNum yyrule,
  2781. yybool yyforceEval)
  2782. {
  2783. size_t yyposn = yystackp->yytops.yystates[yyk]->yyposn;
  2784. if (yyforceEval || yystackp->yysplitPoint == NULL)
  2785. {
  2786. YYSTYPE yysval;
  2787. YYLTYPE yyloc;
  2788. YY_REDUCE_PRINT ((yystackp, yyk, yyrule, &yysval, &yyloc));
  2789. YYCHK (yydoAction (yystackp, yyk, yyrule, &yysval,
  2790. &yyloc));
  2791. YY_SYMBOL_PRINT ("-> $$ =", yyr1[yyrule], &yysval, &yyloc);
  2792. yyglrShift (yystackp, yyk,
  2793. yyLRgotoState (yystackp->yytops.yystates[yyk]->yylrState,
  2794. yylhsNonterm (yyrule)),
  2795. yyposn, &yysval, &yyloc);
  2796. }
  2797. else
  2798. {
  2799. size_t yyi;
  2800. int yyn;
  2801. yyGLRState* yys, *yys0 = yystackp->yytops.yystates[yyk];
  2802. yyStateNum yynewLRState;
  2803. for (yys = yystackp->yytops.yystates[yyk], yyn = yyrhsLength (yyrule);
  2804. 0 < yyn; yyn -= 1)
  2805. {
  2806. yys = yys->yypred;
  2807. YYASSERT (yys);
  2808. }
  2809. yyupdateSplit (yystackp, yys);
  2810. yynewLRState = yyLRgotoState (yys->yylrState, yylhsNonterm (yyrule));
  2811. YYDPRINTF ((stderr,
  2812. "Reduced stack %lu by rule #%d; action deferred. Now in state %d.\n",
  2813. (unsigned long int) yyk, yyrule - 1, yynewLRState));
  2814. for (yyi = 0; yyi < yystackp->yytops.yysize; yyi += 1)
  2815. if (yyi != yyk && yystackp->yytops.yystates[yyi] != NULL)
  2816. {
  2817. yyGLRState* yyp, *yysplit = yystackp->yysplitPoint;
  2818. yyp = yystackp->yytops.yystates[yyi];
  2819. while (yyp != yys && yyp != yysplit && yyp->yyposn >= yyposn)
  2820. {
  2821. if (yyp->yylrState == yynewLRState && yyp->yypred == yys)
  2822. {
  2823. yyaddDeferredAction (yystackp, yyk, yyp, yys0, yyrule);
  2824. yymarkStackDeleted (yystackp, yyk);
  2825. YYDPRINTF ((stderr, "Merging stack %lu into stack %lu.\n",
  2826. (unsigned long int) yyk,
  2827. (unsigned long int) yyi));
  2828. return yyok;
  2829. }
  2830. yyp = yyp->yypred;
  2831. }
  2832. }
  2833. yystackp->yytops.yystates[yyk] = yys;
  2834. yyglrShiftDefer (yystackp, yyk, yynewLRState, yyposn, yys0, yyrule);
  2835. }
  2836. return yyok;
  2837. }
  2838. static size_t
  2839. yysplitStack (yyGLRStack* yystackp, size_t yyk)
  2840. {
  2841. if (yystackp->yysplitPoint == NULL)
  2842. {
  2843. YYASSERT (yyk == 0);
  2844. yystackp->yysplitPoint = yystackp->yytops.yystates[yyk];
  2845. }
  2846. if (yystackp->yytops.yysize >= yystackp->yytops.yycapacity)
  2847. {
  2848. yyGLRState** yynewStates;
  2849. yybool* yynewLookaheadNeeds;
  2850. yynewStates = NULL;
  2851. if (yystackp->yytops.yycapacity
  2852. > (YYSIZEMAX / (2 * sizeof yynewStates[0])))
  2853. yyMemoryExhausted (yystackp);
  2854. yystackp->yytops.yycapacity *= 2;
  2855. yynewStates =
  2856. (yyGLRState**) YYREALLOC (yystackp->yytops.yystates,
  2857. (yystackp->yytops.yycapacity
  2858. * sizeof yynewStates[0]));
  2859. if (yynewStates == NULL)
  2860. yyMemoryExhausted (yystackp);
  2861. yystackp->yytops.yystates = yynewStates;
  2862. yynewLookaheadNeeds =
  2863. (yybool*) YYREALLOC (yystackp->yytops.yylookaheadNeeds,
  2864. (yystackp->yytops.yycapacity
  2865. * sizeof yynewLookaheadNeeds[0]));
  2866. if (yynewLookaheadNeeds == NULL)
  2867. yyMemoryExhausted (yystackp);
  2868. yystackp->yytops.yylookaheadNeeds = yynewLookaheadNeeds;
  2869. }
  2870. yystackp->yytops.yystates[yystackp->yytops.yysize]
  2871. = yystackp->yytops.yystates[yyk];
  2872. yystackp->yytops.yylookaheadNeeds[yystackp->yytops.yysize]
  2873. = yystackp->yytops.yylookaheadNeeds[yyk];
  2874. yystackp->yytops.yysize += 1;
  2875. return yystackp->yytops.yysize-1;
  2876. }
  2877. /** True iff Y0 and Y1 represent identical options at the top level.
  2878. * That is, they represent the same rule applied to RHS symbols
  2879. * that produce the same terminal symbols. */
  2880. static yybool
  2881. yyidenticalOptions (yySemanticOption* yyy0, yySemanticOption* yyy1)
  2882. {
  2883. if (yyy0->yyrule == yyy1->yyrule)
  2884. {
  2885. yyGLRState *yys0, *yys1;
  2886. int yyn;
  2887. for (yys0 = yyy0->yystate, yys1 = yyy1->yystate,
  2888. yyn = yyrhsLength (yyy0->yyrule);
  2889. yyn > 0;
  2890. yys0 = yys0->yypred, yys1 = yys1->yypred, yyn -= 1)
  2891. if (yys0->yyposn != yys1->yyposn)
  2892. return yyfalse;
  2893. return yytrue;
  2894. }
  2895. else
  2896. return yyfalse;
  2897. }
  2898. /** Assuming identicalOptions (Y0,Y1), destructively merge the
  2899. * alternative semantic values for the RHS-symbols of Y1 and Y0. */
  2900. static void
  2901. yymergeOptionSets (yySemanticOption* yyy0, yySemanticOption* yyy1)
  2902. {
  2903. yyGLRState *yys0, *yys1;
  2904. int yyn;
  2905. for (yys0 = yyy0->yystate, yys1 = yyy1->yystate,
  2906. yyn = yyrhsLength (yyy0->yyrule);
  2907. yyn > 0;
  2908. yys0 = yys0->yypred, yys1 = yys1->yypred, yyn -= 1)
  2909. {
  2910. if (yys0 == yys1)
  2911. break;
  2912. else if (yys0->yyresolved)
  2913. {
  2914. yys1->yyresolved = yytrue;
  2915. yys1->yysemantics.yysval = yys0->yysemantics.yysval;
  2916. }
  2917. else if (yys1->yyresolved)
  2918. {
  2919. yys0->yyresolved = yytrue;
  2920. yys0->yysemantics.yysval = yys1->yysemantics.yysval;
  2921. }
  2922. else
  2923. {
  2924. yySemanticOption** yyz0p;
  2925. yySemanticOption* yyz1;
  2926. yyz0p = &yys0->yysemantics.yyfirstVal;
  2927. yyz1 = yys1->yysemantics.yyfirstVal;
  2928. while (YYID (yytrue))
  2929. {
  2930. if (yyz1 == *yyz0p || yyz1 == NULL)
  2931. break;
  2932. else if (*yyz0p == NULL)
  2933. {
  2934. *yyz0p = yyz1;
  2935. break;
  2936. }
  2937. else if (*yyz0p < yyz1)
  2938. {
  2939. yySemanticOption* yyz = *yyz0p;
  2940. *yyz0p = yyz1;
  2941. yyz1 = yyz1->yynext;
  2942. (*yyz0p)->yynext = yyz;
  2943. }
  2944. yyz0p = &(*yyz0p)->yynext;
  2945. }
  2946. yys1->yysemantics.yyfirstVal = yys0->yysemantics.yyfirstVal;
  2947. }
  2948. }
  2949. }
  2950. /** Y0 and Y1 represent two possible actions to take in a given
  2951. * parsing state; return 0 if no combination is possible,
  2952. * 1 if user-mergeable, 2 if Y0 is preferred, 3 if Y1 is preferred. */
  2953. static int
  2954. yypreference (yySemanticOption* y0, yySemanticOption* y1)
  2955. {
  2956. yyRuleNum r0 = y0->yyrule, r1 = y1->yyrule;
  2957. int p0 = yydprec[r0], p1 = yydprec[r1];
  2958. if (p0 == p1)
  2959. {
  2960. if (yymerger[r0] == 0 || yymerger[r0] != yymerger[r1])
  2961. return 0;
  2962. else
  2963. return 1;
  2964. }
  2965. if (p0 == 0 || p1 == 0)
  2966. return 0;
  2967. if (p0 < p1)
  2968. return 3;
  2969. if (p1 < p0)
  2970. return 2;
  2971. return 0;
  2972. }
  2973. static YYRESULTTAG yyresolveValue (yyGLRState* yys,
  2974. yyGLRStack* yystackp);
  2975. /** Resolve the previous N states starting at and including state S. If result
  2976. * != yyok, some states may have been left unresolved possibly with empty
  2977. * semantic option chains. Regardless of whether result = yyok, each state
  2978. * has been left with consistent data so that yydestroyGLRState can be invoked
  2979. * if necessary. */
  2980. static YYRESULTTAG
  2981. yyresolveStates (yyGLRState* yys, int yyn,
  2982. yyGLRStack* yystackp)
  2983. {
  2984. if (0 < yyn)
  2985. {
  2986. YYASSERT (yys->yypred);
  2987. YYCHK (yyresolveStates (yys->yypred, yyn-1, yystackp));
  2988. if (! yys->yyresolved)
  2989. YYCHK (yyresolveValue (yys, yystackp));
  2990. }
  2991. return yyok;
  2992. }
  2993. /** Resolve the states for the RHS of OPT, perform its user action, and return
  2994. * the semantic value and location. Regardless of whether result = yyok, all
  2995. * RHS states have been destroyed (assuming the user action destroys all RHS
  2996. * semantic values if invoked). */
  2997. static YYRESULTTAG
  2998. yyresolveAction (yySemanticOption* yyopt, yyGLRStack* yystackp,
  2999. YYSTYPE* yyvalp, YYLTYPE* yylocp)
  3000. {
  3001. yyGLRStackItem yyrhsVals[YYMAXRHS + YYMAXLEFT + 1];
  3002. int yynrhs;
  3003. int yychar_current;
  3004. YYSTYPE yylval_current;
  3005. YYLTYPE yylloc_current;
  3006. YYRESULTTAG yyflag;
  3007. yynrhs = yyrhsLength (yyopt->yyrule);
  3008. yyflag = yyresolveStates (yyopt->yystate, yynrhs, yystackp);
  3009. if (yyflag != yyok)
  3010. {
  3011. yyGLRState *yys;
  3012. for (yys = yyopt->yystate; yynrhs > 0; yys = yys->yypred, yynrhs -= 1)
  3013. yydestroyGLRState ("Cleanup: popping", yys);
  3014. return yyflag;
  3015. }
  3016. yyrhsVals[YYMAXRHS + YYMAXLEFT].yystate.yypred = yyopt->yystate;
  3017. yychar_current = yychar;
  3018. yylval_current = yylval;
  3019. yylloc_current = yylloc;
  3020. yychar = yyopt->yyrawchar;
  3021. yylval = yyopt->yyval;
  3022. yylloc = yyopt->yyloc;
  3023. yyflag = yyuserAction (yyopt->yyrule, yynrhs,
  3024. yyrhsVals + YYMAXRHS + YYMAXLEFT - 1,
  3025. yyvalp, yylocp, yystackp);
  3026. yychar = yychar_current;
  3027. yylval = yylval_current;
  3028. yylloc = yylloc_current;
  3029. return yyflag;
  3030. }
  3031. #if YYDEBUG
  3032. static void
  3033. yyreportTree (yySemanticOption* yyx, int yyindent)
  3034. {
  3035. int yynrhs = yyrhsLength (yyx->yyrule);
  3036. int yyi;
  3037. yyGLRState* yys;
  3038. yyGLRState* yystates[1 + YYMAXRHS];
  3039. yyGLRState yyleftmost_state;
  3040. for (yyi = yynrhs, yys = yyx->yystate; 0 < yyi; yyi -= 1, yys = yys->yypred)
  3041. yystates[yyi] = yys;
  3042. if (yys == NULL)
  3043. {
  3044. yyleftmost_state.yyposn = 0;
  3045. yystates[0] = &yyleftmost_state;
  3046. }
  3047. else
  3048. yystates[0] = yys;
  3049. if (yyx->yystate->yyposn < yys->yyposn + 1)
  3050. YYFPRINTF (stderr, "%*s%s -> <Rule %d, empty>\n",
  3051. yyindent, "", yytokenName (yylhsNonterm (yyx->yyrule)),
  3052. yyx->yyrule - 1);
  3053. else
  3054. YYFPRINTF (stderr, "%*s%s -> <Rule %d, tokens %lu .. %lu>\n",
  3055. yyindent, "", yytokenName (yylhsNonterm (yyx->yyrule)),
  3056. yyx->yyrule - 1, (unsigned long int) (yys->yyposn + 1),
  3057. (unsigned long int) yyx->yystate->yyposn);
  3058. for (yyi = 1; yyi <= yynrhs; yyi += 1)
  3059. {
  3060. if (yystates[yyi]->yyresolved)
  3061. {
  3062. if (yystates[yyi-1]->yyposn+1 > yystates[yyi]->yyposn)
  3063. YYFPRINTF (stderr, "%*s%s <empty>\n", yyindent+2, "",
  3064. yytokenName (yyrhs[yyprhs[yyx->yyrule]+yyi-1]));
  3065. else
  3066. YYFPRINTF (stderr, "%*s%s <tokens %lu .. %lu>\n", yyindent+2, "",
  3067. yytokenName (yyrhs[yyprhs[yyx->yyrule]+yyi-1]),
  3068. (unsigned long int) (yystates[yyi - 1]->yyposn + 1),
  3069. (unsigned long int) yystates[yyi]->yyposn);
  3070. }
  3071. else
  3072. yyreportTree (yystates[yyi]->yysemantics.yyfirstVal, yyindent+2);
  3073. }
  3074. }
  3075. #endif
  3076. /*ARGSUSED*/ static YYRESULTTAG
  3077. yyreportAmbiguity (yySemanticOption* yyx0,
  3078. yySemanticOption* yyx1)
  3079. {
  3080. YYUSE (yyx0);
  3081. YYUSE (yyx1);
  3082. #if YYDEBUG
  3083. YYFPRINTF (stderr, "Ambiguity detected.\n");
  3084. YYFPRINTF (stderr, "Option 1,\n");
  3085. yyreportTree (yyx0, 2);
  3086. YYFPRINTF (stderr, "\nOption 2,\n");
  3087. yyreportTree (yyx1, 2);
  3088. YYFPRINTF (stderr, "\n");
  3089. #endif
  3090. yyerror (YY_("syntax is ambiguous"));
  3091. return yyabort;
  3092. }
  3093. /** Starting at and including state S1, resolve the location for each of the
  3094. * previous N1 states that is unresolved. The first semantic option of a state
  3095. * is always chosen. */
  3096. static void
  3097. yyresolveLocations (yyGLRState* yys1, int yyn1,
  3098. yyGLRStack *yystackp)
  3099. {
  3100. if (0 < yyn1)
  3101. {
  3102. yyresolveLocations (yys1->yypred, yyn1 - 1, yystackp);
  3103. if (!yys1->yyresolved)
  3104. {
  3105. yySemanticOption *yyoption;
  3106. yyGLRStackItem yyrhsloc[1 + YYMAXRHS];
  3107. int yynrhs;
  3108. int yychar_current;
  3109. YYSTYPE yylval_current;
  3110. YYLTYPE yylloc_current;
  3111. yyoption = yys1->yysemantics.yyfirstVal;
  3112. YYASSERT (yyoption != NULL);
  3113. yynrhs = yyrhsLength (yyoption->yyrule);
  3114. if (yynrhs > 0)
  3115. {
  3116. yyGLRState *yys;
  3117. int yyn;
  3118. yyresolveLocations (yyoption->yystate, yynrhs,
  3119. yystackp);
  3120. for (yys = yyoption->yystate, yyn = yynrhs;
  3121. yyn > 0;
  3122. yys = yys->yypred, yyn -= 1)
  3123. yyrhsloc[yyn].yystate.yyloc = yys->yyloc;
  3124. }
  3125. else
  3126. {
  3127. /* Both yyresolveAction and yyresolveLocations traverse the GSS
  3128. in reverse rightmost order. It is only necessary to invoke
  3129. yyresolveLocations on a subforest for which yyresolveAction
  3130. would have been invoked next had an ambiguity not been
  3131. detected. Thus the location of the previous state (but not
  3132. necessarily the previous state itself) is guaranteed to be
  3133. resolved already. */
  3134. yyGLRState *yyprevious = yyoption->yystate;
  3135. yyrhsloc[0].yystate.yyloc = yyprevious->yyloc;
  3136. }
  3137. yychar_current = yychar;
  3138. yylval_current = yylval;
  3139. yylloc_current = yylloc;
  3140. yychar = yyoption->yyrawchar;
  3141. yylval = yyoption->yyval;
  3142. yylloc = yyoption->yyloc;
  3143. YYLLOC_DEFAULT ((yys1->yyloc), yyrhsloc, yynrhs);
  3144. yychar = yychar_current;
  3145. yylval = yylval_current;
  3146. yylloc = yylloc_current;
  3147. }
  3148. }
  3149. }
  3150. /** Resolve the ambiguity represented in state S, perform the indicated
  3151. * actions, and set the semantic value of S. If result != yyok, the chain of
  3152. * semantic options in S has been cleared instead or it has been left
  3153. * unmodified except that redundant options may have been removed. Regardless
  3154. * of whether result = yyok, S has been left with consistent data so that
  3155. * yydestroyGLRState can be invoked if necessary. */
  3156. static YYRESULTTAG
  3157. yyresolveValue (yyGLRState* yys, yyGLRStack* yystackp)
  3158. {
  3159. yySemanticOption* yyoptionList = yys->yysemantics.yyfirstVal;
  3160. yySemanticOption* yybest;
  3161. yySemanticOption** yypp;
  3162. yybool yymerge;
  3163. YYSTYPE yysval;
  3164. YYRESULTTAG yyflag;
  3165. YYLTYPE *yylocp = &yys->yyloc;
  3166. yybest = yyoptionList;
  3167. yymerge = yyfalse;
  3168. for (yypp = &yyoptionList->yynext; *yypp != NULL; )
  3169. {
  3170. yySemanticOption* yyp = *yypp;
  3171. if (yyidenticalOptions (yybest, yyp))
  3172. {
  3173. yymergeOptionSets (yybest, yyp);
  3174. *yypp = yyp->yynext;
  3175. }
  3176. else
  3177. {
  3178. switch (yypreference (yybest, yyp))
  3179. {
  3180. case 0:
  3181. yyresolveLocations (yys, 1, yystackp);
  3182. return yyreportAmbiguity (yybest, yyp);
  3183. break;
  3184. case 1:
  3185. yymerge = yytrue;
  3186. break;
  3187. case 2:
  3188. break;
  3189. case 3:
  3190. yybest = yyp;
  3191. yymerge = yyfalse;
  3192. break;
  3193. default:
  3194. /* This cannot happen so it is not worth a YYASSERT (yyfalse),
  3195. but some compilers complain if the default case is
  3196. omitted. */
  3197. break;
  3198. }
  3199. yypp = &yyp->yynext;
  3200. }
  3201. }
  3202. if (yymerge)
  3203. {
  3204. yySemanticOption* yyp;
  3205. int yyprec = yydprec[yybest->yyrule];
  3206. yyflag = yyresolveAction (yybest, yystackp, &yysval,
  3207. yylocp);
  3208. if (yyflag == yyok)
  3209. for (yyp = yybest->yynext; yyp != NULL; yyp = yyp->yynext)
  3210. {
  3211. if (yyprec == yydprec[yyp->yyrule])
  3212. {
  3213. YYSTYPE yysval_other;
  3214. YYLTYPE yydummy;
  3215. yyflag = yyresolveAction (yyp, yystackp, &yysval_other,
  3216. &yydummy);
  3217. if (yyflag != yyok)
  3218. {
  3219. yydestruct ("Cleanup: discarding incompletely merged value for",
  3220. yystos[yys->yylrState],
  3221. &yysval);
  3222. break;
  3223. }
  3224. yyuserMerge (yymerger[yyp->yyrule], &yysval, &yysval_other);
  3225. }
  3226. }
  3227. }
  3228. else
  3229. yyflag = yyresolveAction (yybest, yystackp, &yysval, yylocp);
  3230. if (yyflag == yyok)
  3231. {
  3232. yys->yyresolved = yytrue;
  3233. yys->yysemantics.yysval = yysval;
  3234. }
  3235. else
  3236. yys->yysemantics.yyfirstVal = NULL;
  3237. return yyflag;
  3238. }
  3239. static YYRESULTTAG
  3240. yyresolveStack (yyGLRStack* yystackp)
  3241. {
  3242. if (yystackp->yysplitPoint != NULL)
  3243. {
  3244. yyGLRState* yys;
  3245. int yyn;
  3246. for (yyn = 0, yys = yystackp->yytops.yystates[0];
  3247. yys != yystackp->yysplitPoint;
  3248. yys = yys->yypred, yyn += 1)
  3249. continue;
  3250. YYCHK (yyresolveStates (yystackp->yytops.yystates[0], yyn, yystackp
  3251. ));
  3252. }
  3253. return yyok;
  3254. }
  3255. static void
  3256. yycompressStack (yyGLRStack* yystackp)
  3257. {
  3258. yyGLRState* yyp, *yyq, *yyr;
  3259. if (yystackp->yytops.yysize != 1 || yystackp->yysplitPoint == NULL)
  3260. return;
  3261. for (yyp = yystackp->yytops.yystates[0], yyq = yyp->yypred, yyr = NULL;
  3262. yyp != yystackp->yysplitPoint;
  3263. yyr = yyp, yyp = yyq, yyq = yyp->yypred)
  3264. yyp->yypred = yyr;
  3265. yystackp->yyspaceLeft += yystackp->yynextFree - yystackp->yyitems;
  3266. yystackp->yynextFree = ((yyGLRStackItem*) yystackp->yysplitPoint) + 1;
  3267. yystackp->yyspaceLeft -= yystackp->yynextFree - yystackp->yyitems;
  3268. yystackp->yysplitPoint = NULL;
  3269. yystackp->yylastDeleted = NULL;
  3270. while (yyr != NULL)
  3271. {
  3272. yystackp->yynextFree->yystate = *yyr;
  3273. yyr = yyr->yypred;
  3274. yystackp->yynextFree->yystate.yypred = &yystackp->yynextFree[-1].yystate;
  3275. yystackp->yytops.yystates[0] = &yystackp->yynextFree->yystate;
  3276. yystackp->yynextFree += 1;
  3277. yystackp->yyspaceLeft -= 1;
  3278. }
  3279. }
  3280. static YYRESULTTAG
  3281. yyprocessOneStack (yyGLRStack* yystackp, size_t yyk,
  3282. size_t yyposn)
  3283. {
  3284. int yyaction;
  3285. const short int* yyconflicts;
  3286. yyRuleNum yyrule;
  3287. while (yystackp->yytops.yystates[yyk] != NULL)
  3288. {
  3289. yyStateNum yystate = yystackp->yytops.yystates[yyk]->yylrState;
  3290. YYDPRINTF ((stderr, "Stack %lu Entering state %d\n",
  3291. (unsigned long int) yyk, yystate));
  3292. YYASSERT (yystate != YYFINAL);
  3293. if (yyisDefaultedState (yystate))
  3294. {
  3295. yyrule = yydefaultAction (yystate);
  3296. if (yyrule == 0)
  3297. {
  3298. YYDPRINTF ((stderr, "Stack %lu dies.\n",
  3299. (unsigned long int) yyk));
  3300. yymarkStackDeleted (yystackp, yyk);
  3301. return yyok;
  3302. }
  3303. YYCHK (yyglrReduce (yystackp, yyk, yyrule, yyfalse));
  3304. }
  3305. else
  3306. {
  3307. yySymbol yytoken;
  3308. yystackp->yytops.yylookaheadNeeds[yyk] = yytrue;
  3309. if (yychar == YYEMPTY)
  3310. {
  3311. YYDPRINTF ((stderr, "Reading a token: "));
  3312. yychar = YYLEX;
  3313. yytoken = YYTRANSLATE (yychar);
  3314. YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc);
  3315. }
  3316. else
  3317. yytoken = YYTRANSLATE (yychar);
  3318. yygetLRActions (yystate, yytoken, &yyaction, &yyconflicts);
  3319. while (*yyconflicts != 0)
  3320. {
  3321. size_t yynewStack = yysplitStack (yystackp, yyk);
  3322. YYDPRINTF ((stderr, "Splitting off stack %lu from %lu.\n",
  3323. (unsigned long int) yynewStack,
  3324. (unsigned long int) yyk));
  3325. YYCHK (yyglrReduce (yystackp, yynewStack,
  3326. *yyconflicts, yyfalse));
  3327. YYCHK (yyprocessOneStack (yystackp, yynewStack,
  3328. yyposn));
  3329. yyconflicts += 1;
  3330. }
  3331. if (yyisShiftAction (yyaction))
  3332. break;
  3333. else if (yyisErrorAction (yyaction))
  3334. {
  3335. YYDPRINTF ((stderr, "Stack %lu dies.\n",
  3336. (unsigned long int) yyk));
  3337. yymarkStackDeleted (yystackp, yyk);
  3338. break;
  3339. }
  3340. else
  3341. YYCHK (yyglrReduce (yystackp, yyk, -yyaction,
  3342. yyfalse));
  3343. }
  3344. }
  3345. return yyok;
  3346. }
  3347. /*ARGSUSED*/ static void
  3348. yyreportSyntaxError (yyGLRStack* yystackp)
  3349. {
  3350. if (yystackp->yyerrState == 0)
  3351. {
  3352. #if YYERROR_VERBOSE
  3353. int yyn;
  3354. yyn = yypact[yystackp->yytops.yystates[0]->yylrState];
  3355. if (YYPACT_NINF < yyn && yyn <= YYLAST)
  3356. {
  3357. yySymbol yytoken = YYTRANSLATE (yychar);
  3358. size_t yysize0 = yytnamerr (NULL, yytokenName (yytoken));
  3359. size_t yysize = yysize0;
  3360. size_t yysize1;
  3361. yybool yysize_overflow = yyfalse;
  3362. char* yymsg = NULL;
  3363. enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 };
  3364. char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM];
  3365. int yyx;
  3366. char *yyfmt;
  3367. char const *yyf;
  3368. static char const yyunexpected[] = "syntax error, unexpected %s";
  3369. static char const yyexpecting[] = ", expecting %s";
  3370. static char const yyor[] = " or %s";
  3371. char yyformat[sizeof yyunexpected
  3372. + sizeof yyexpecting - 1
  3373. + ((YYERROR_VERBOSE_ARGS_MAXIMUM - 2)
  3374. * (sizeof yyor - 1))];
  3375. char const *yyprefix = yyexpecting;
  3376. /* Start YYX at -YYN if negative to avoid negative indexes in
  3377. YYCHECK. */
  3378. int yyxbegin = yyn < 0 ? -yyn : 0;
  3379. /* Stay within bounds of both yycheck and yytname. */
  3380. int yychecklim = YYLAST - yyn + 1;
  3381. int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS;
  3382. int yycount = 1;
  3383. yyarg[0] = yytokenName (yytoken);
  3384. yyfmt = yystpcpy (yyformat, yyunexpected);
  3385. for (yyx = yyxbegin; yyx < yyxend; ++yyx)
  3386. if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR)
  3387. {
  3388. if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM)
  3389. {
  3390. yycount = 1;
  3391. yysize = yysize0;
  3392. yyformat[sizeof yyunexpected - 1] = '\0';
  3393. break;
  3394. }
  3395. yyarg[yycount++] = yytokenName (yyx);
  3396. yysize1 = yysize + yytnamerr (NULL, yytokenName (yyx));
  3397. yysize_overflow |= yysize1 < yysize;
  3398. yysize = yysize1;
  3399. yyfmt = yystpcpy (yyfmt, yyprefix);
  3400. yyprefix = yyor;
  3401. }
  3402. yyf = YY_(yyformat);
  3403. yysize1 = yysize + strlen (yyf);
  3404. yysize_overflow |= yysize1 < yysize;
  3405. yysize = yysize1;
  3406. if (!yysize_overflow)
  3407. yymsg = (char *) YYMALLOC (yysize);
  3408. if (yymsg)
  3409. {
  3410. char *yyp = yymsg;
  3411. int yyi = 0;
  3412. while ((*yyp = *yyf))
  3413. {
  3414. if (*yyp == '%' && yyf[1] == 's' && yyi < yycount)
  3415. {
  3416. yyp += yytnamerr (yyp, yyarg[yyi++]);
  3417. yyf += 2;
  3418. }
  3419. else
  3420. {
  3421. yyp++;
  3422. yyf++;
  3423. }
  3424. }
  3425. yyerror (yymsg);
  3426. YYFREE (yymsg);
  3427. }
  3428. else
  3429. {
  3430. yyerror (YY_("syntax error"));
  3431. yyMemoryExhausted (yystackp);
  3432. }
  3433. }
  3434. else
  3435. #endif /* YYERROR_VERBOSE */
  3436. yyerror (YY_("syntax error"));
  3437. yynerrs += 1;
  3438. }
  3439. }
  3440. /* Recover from a syntax error on *YYSTACKP, assuming that *YYSTACKP->YYTOKENP,
  3441. yylval, and yylloc are the syntactic category, semantic value, and location
  3442. of the look-ahead. */
  3443. /*ARGSUSED*/ static void
  3444. yyrecoverSyntaxError (yyGLRStack* yystackp)
  3445. {
  3446. size_t yyk;
  3447. int yyj;
  3448. if (yystackp->yyerrState == 3)
  3449. /* We just shifted the error token and (perhaps) took some
  3450. reductions. Skip tokens until we can proceed. */
  3451. while (YYID (yytrue))
  3452. {
  3453. yySymbol yytoken;
  3454. if (yychar == YYEOF)
  3455. yyFail (yystackp, NULL);
  3456. if (yychar != YYEMPTY)
  3457. {
  3458. yytoken = YYTRANSLATE (yychar);
  3459. yydestruct ("Error: discarding",
  3460. yytoken, &yylval);
  3461. }
  3462. YYDPRINTF ((stderr, "Reading a token: "));
  3463. yychar = YYLEX;
  3464. yytoken = YYTRANSLATE (yychar);
  3465. YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc);
  3466. yyj = yypact[yystackp->yytops.yystates[0]->yylrState];
  3467. if (yyis_pact_ninf (yyj))
  3468. return;
  3469. yyj += yytoken;
  3470. if (yyj < 0 || YYLAST < yyj || yycheck[yyj] != yytoken)
  3471. {
  3472. if (yydefact[yystackp->yytops.yystates[0]->yylrState] != 0)
  3473. return;
  3474. }
  3475. else if (yytable[yyj] != 0 && ! yyis_table_ninf (yytable[yyj]))
  3476. return;
  3477. }
  3478. /* Reduce to one stack. */
  3479. for (yyk = 0; yyk < yystackp->yytops.yysize; yyk += 1)
  3480. if (yystackp->yytops.yystates[yyk] != NULL)
  3481. break;
  3482. if (yyk >= yystackp->yytops.yysize)
  3483. yyFail (yystackp, NULL);
  3484. for (yyk += 1; yyk < yystackp->yytops.yysize; yyk += 1)
  3485. yymarkStackDeleted (yystackp, yyk);
  3486. yyremoveDeletes (yystackp);
  3487. yycompressStack (yystackp);
  3488. /* Now pop stack until we find a state that shifts the error token. */
  3489. yystackp->yyerrState = 3;
  3490. while (yystackp->yytops.yystates[0] != NULL)
  3491. {
  3492. yyGLRState *yys = yystackp->yytops.yystates[0];
  3493. yyj = yypact[yys->yylrState];
  3494. if (! yyis_pact_ninf (yyj))
  3495. {
  3496. yyj += YYTERROR;
  3497. if (0 <= yyj && yyj <= YYLAST && yycheck[yyj] == YYTERROR
  3498. && yyisShiftAction (yytable[yyj]))
  3499. {
  3500. /* Shift the error token having adjusted its location. */
  3501. YYLTYPE yyerrloc;
  3502. YY_SYMBOL_PRINT ("Shifting", yystos[yytable[yyj]],
  3503. &yylval, &yyerrloc);
  3504. yyglrShift (yystackp, 0, yytable[yyj],
  3505. yys->yyposn, &yylval, &yyerrloc);
  3506. yys = yystackp->yytops.yystates[0];
  3507. break;
  3508. }
  3509. }
  3510. yydestroyGLRState ("Error: popping", yys);
  3511. yystackp->yytops.yystates[0] = yys->yypred;
  3512. yystackp->yynextFree -= 1;
  3513. yystackp->yyspaceLeft += 1;
  3514. }
  3515. if (yystackp->yytops.yystates[0] == NULL)
  3516. yyFail (yystackp, NULL);
  3517. }
  3518. #define YYCHK1(YYE) \
  3519. do { \
  3520. switch (YYE) { \
  3521. case yyok: \
  3522. break; \
  3523. case yyabort: \
  3524. goto yyabortlab; \
  3525. case yyaccept: \
  3526. goto yyacceptlab; \
  3527. case yyerr: \
  3528. goto yyuser_error; \
  3529. default: \
  3530. goto yybuglab; \
  3531. } \
  3532. } while (YYID (0))
  3533. /*----------.
  3534. | yyparse. |
  3535. `----------*/
  3536. int
  3537. yyparse (void)
  3538. {
  3539. int yyresult;
  3540. yyGLRStack yystack;
  3541. yyGLRStack* const yystackp = &yystack;
  3542. size_t yyposn;
  3543. YYDPRINTF ((stderr, "Starting parse\n"));
  3544. yychar = YYEMPTY;
  3545. yylval = yyval_default;
  3546. if (! yyinitGLRStack (yystackp, YYINITDEPTH))
  3547. goto yyexhaustedlab;
  3548. switch (YYSETJMP (yystack.yyexception_buffer))
  3549. {
  3550. case 0: break;
  3551. case 1: goto yyabortlab;
  3552. case 2: goto yyexhaustedlab;
  3553. default: goto yybuglab;
  3554. }
  3555. yyglrShift (&yystack, 0, 0, 0, &yylval, &yylloc);
  3556. yyposn = 0;
  3557. while (YYID (yytrue))
  3558. {
  3559. /* For efficiency, we have two loops, the first of which is
  3560. specialized to deterministic operation (single stack, no
  3561. potential ambiguity). */
  3562. /* Standard mode */
  3563. while (YYID (yytrue))
  3564. {
  3565. yyRuleNum yyrule;
  3566. int yyaction;
  3567. const short int* yyconflicts;
  3568. yyStateNum yystate = yystack.yytops.yystates[0]->yylrState;
  3569. YYDPRINTF ((stderr, "Entering state %d\n", yystate));
  3570. if (yystate == YYFINAL)
  3571. goto yyacceptlab;
  3572. if (yyisDefaultedState (yystate))
  3573. {
  3574. yyrule = yydefaultAction (yystate);
  3575. if (yyrule == 0)
  3576. {
  3577. yyreportSyntaxError (&yystack);
  3578. goto yyuser_error;
  3579. }
  3580. YYCHK1 (yyglrReduce (&yystack, 0, yyrule, yytrue));
  3581. }
  3582. else
  3583. {
  3584. yySymbol yytoken;
  3585. if (yychar == YYEMPTY)
  3586. {
  3587. YYDPRINTF ((stderr, "Reading a token: "));
  3588. yychar = YYLEX;
  3589. yytoken = YYTRANSLATE (yychar);
  3590. YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc);
  3591. }
  3592. else
  3593. yytoken = YYTRANSLATE (yychar);
  3594. yygetLRActions (yystate, yytoken, &yyaction, &yyconflicts);
  3595. if (*yyconflicts != 0)
  3596. break;
  3597. if (yyisShiftAction (yyaction))
  3598. {
  3599. YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc);
  3600. if (yychar != YYEOF)
  3601. yychar = YYEMPTY;
  3602. yyposn += 1;
  3603. yyglrShift (&yystack, 0, yyaction, yyposn, &yylval, &yylloc);
  3604. if (0 < yystack.yyerrState)
  3605. yystack.yyerrState -= 1;
  3606. }
  3607. else if (yyisErrorAction (yyaction))
  3608. {
  3609. yyreportSyntaxError (&yystack);
  3610. goto yyuser_error;
  3611. }
  3612. else
  3613. YYCHK1 (yyglrReduce (&yystack, 0, -yyaction, yytrue));
  3614. }
  3615. }
  3616. while (YYID (yytrue))
  3617. {
  3618. yySymbol yytoken_to_shift;
  3619. size_t yys;
  3620. for (yys = 0; yys < yystack.yytops.yysize; yys += 1)
  3621. yystackp->yytops.yylookaheadNeeds[yys] = yychar != YYEMPTY;
  3622. /* yyprocessOneStack returns one of three things:
  3623. - An error flag. If the caller is yyprocessOneStack, it
  3624. immediately returns as well. When the caller is finally
  3625. yyparse, it jumps to an error label via YYCHK1.
  3626. - yyok, but yyprocessOneStack has invoked yymarkStackDeleted
  3627. (&yystack, yys), which sets the top state of yys to NULL. Thus,
  3628. yyparse's following invocation of yyremoveDeletes will remove
  3629. the stack.
  3630. - yyok, when ready to shift a token.
  3631. Except in the first case, yyparse will invoke yyremoveDeletes and
  3632. then shift the next token onto all remaining stacks. This
  3633. synchronization of the shift (that is, after all preceding
  3634. reductions on all stacks) helps prevent double destructor calls
  3635. on yylval in the event of memory exhaustion. */
  3636. for (yys = 0; yys < yystack.yytops.yysize; yys += 1)
  3637. YYCHK1 (yyprocessOneStack (&yystack, yys, yyposn));
  3638. yyremoveDeletes (&yystack);
  3639. if (yystack.yytops.yysize == 0)
  3640. {
  3641. yyundeleteLastStack (&yystack);
  3642. if (yystack.yytops.yysize == 0)
  3643. yyFail (&yystack, YY_("syntax error"));
  3644. YYCHK1 (yyresolveStack (&yystack));
  3645. YYDPRINTF ((stderr, "Returning to deterministic operation.\n"));
  3646. yyreportSyntaxError (&yystack);
  3647. goto yyuser_error;
  3648. }
  3649. /* If any yyglrShift call fails, it will fail after shifting. Thus,
  3650. a copy of yylval will already be on stack 0 in the event of a
  3651. failure in the following loop. Thus, yychar is set to YYEMPTY
  3652. before the loop to make sure the user destructor for yylval isn't
  3653. called twice. */
  3654. yytoken_to_shift = YYTRANSLATE (yychar);
  3655. yychar = YYEMPTY;
  3656. yyposn += 1;
  3657. for (yys = 0; yys < yystack.yytops.yysize; yys += 1)
  3658. {
  3659. int yyaction;
  3660. const short int* yyconflicts;
  3661. yyStateNum yystate = yystack.yytops.yystates[yys]->yylrState;
  3662. yygetLRActions (yystate, yytoken_to_shift, &yyaction,
  3663. &yyconflicts);
  3664. /* Note that yyconflicts were handled by yyprocessOneStack. */
  3665. YYDPRINTF ((stderr, "On stack %lu, ", (unsigned long int) yys));
  3666. YY_SYMBOL_PRINT ("shifting", yytoken_to_shift, &yylval, &yylloc);
  3667. yyglrShift (&yystack, yys, yyaction, yyposn,
  3668. &yylval, &yylloc);
  3669. YYDPRINTF ((stderr, "Stack %lu now in state #%d\n",
  3670. (unsigned long int) yys,
  3671. yystack.yytops.yystates[yys]->yylrState));
  3672. }
  3673. if (yystack.yytops.yysize == 1)
  3674. {
  3675. YYCHK1 (yyresolveStack (&yystack));
  3676. YYDPRINTF ((stderr, "Returning to deterministic operation.\n"));
  3677. yycompressStack (&yystack);
  3678. break;
  3679. }
  3680. }
  3681. continue;
  3682. yyuser_error:
  3683. yyrecoverSyntaxError (&yystack);
  3684. yyposn = yystack.yytops.yystates[0]->yyposn;
  3685. }
  3686. yyacceptlab:
  3687. yyresult = 0;
  3688. goto yyreturn;
  3689. yybuglab:
  3690. YYASSERT (yyfalse);
  3691. goto yyabortlab;
  3692. yyabortlab:
  3693. yyresult = 1;
  3694. goto yyreturn;
  3695. yyexhaustedlab:
  3696. yyerror (YY_("memory exhausted"));
  3697. yyresult = 2;
  3698. goto yyreturn;
  3699. yyreturn:
  3700. if (yychar != YYEOF && yychar != YYEMPTY)
  3701. yydestruct ("Cleanup: discarding lookahead",
  3702. YYTRANSLATE (yychar),
  3703. &yylval);
  3704. /* If the stack is well-formed, pop the stack until it is empty,
  3705. destroying its entries as we go. But free the stack regardless
  3706. of whether it is well-formed. */
  3707. if (yystack.yyitems)
  3708. {
  3709. yyGLRState** yystates = yystack.yytops.yystates;
  3710. if (yystates)
  3711. {
  3712. size_t yysize = yystack.yytops.yysize;
  3713. size_t yyk;
  3714. for (yyk = 0; yyk < yysize; yyk += 1)
  3715. if (yystates[yyk])
  3716. {
  3717. while (yystates[yyk])
  3718. {
  3719. yyGLRState *yys = yystates[yyk];
  3720. yydestroyGLRState ("Cleanup: popping", yys);
  3721. yystates[yyk] = yys->yypred;
  3722. yystack.yynextFree -= 1;
  3723. yystack.yyspaceLeft += 1;
  3724. }
  3725. break;
  3726. }
  3727. }
  3728. yyfreeGLRStack (&yystack);
  3729. }
  3730. /* Make sure YYID is used. */
  3731. return YYID (yyresult);
  3732. }
  3733. /* DEBUGGING ONLY */
  3734. #ifdef YYDEBUG
  3735. static void yypstack (yyGLRStack* yystackp, size_t yyk)
  3736. __attribute__ ((__unused__));
  3737. static void yypdumpstack (yyGLRStack* yystackp) __attribute__ ((__unused__));
  3738. static void
  3739. yy_yypstack (yyGLRState* yys)
  3740. {
  3741. if (yys->yypred)
  3742. {
  3743. yy_yypstack (yys->yypred);
  3744. fprintf (stderr, " -> ");
  3745. }
  3746. fprintf (stderr, "%d@%lu", yys->yylrState, (unsigned long int) yys->yyposn);
  3747. }
  3748. static void
  3749. yypstates (yyGLRState* yyst)
  3750. {
  3751. if (yyst == NULL)
  3752. fprintf (stderr, "<null>");
  3753. else
  3754. yy_yypstack (yyst);
  3755. fprintf (stderr, "\n");
  3756. }
  3757. static void
  3758. yypstack (yyGLRStack* yystackp, size_t yyk)
  3759. {
  3760. yypstates (yystackp->yytops.yystates[yyk]);
  3761. }
  3762. #define YYINDEX(YYX) \
  3763. ((YYX) == NULL ? -1 : (yyGLRStackItem*) (YYX) - yystackp->yyitems)
  3764. static void
  3765. yypdumpstack (yyGLRStack* yystackp)
  3766. {
  3767. yyGLRStackItem* yyp;
  3768. size_t yyi;
  3769. for (yyp = yystackp->yyitems; yyp < yystackp->yynextFree; yyp += 1)
  3770. {
  3771. fprintf (stderr, "%3lu. ", (unsigned long int) (yyp - yystackp->yyitems));
  3772. if (*(yybool *) yyp)
  3773. {
  3774. fprintf (stderr, "Res: %d, LR State: %d, posn: %lu, pred: %ld",
  3775. yyp->yystate.yyresolved, yyp->yystate.yylrState,
  3776. (unsigned long int) yyp->yystate.yyposn,
  3777. (long int) YYINDEX (yyp->yystate.yypred));
  3778. if (! yyp->yystate.yyresolved)
  3779. fprintf (stderr, ", firstVal: %ld",
  3780. (long int) YYINDEX (yyp->yystate.yysemantics.yyfirstVal));
  3781. }
  3782. else
  3783. {
  3784. fprintf (stderr, "Option. rule: %d, state: %ld, next: %ld",
  3785. yyp->yyoption.yyrule - 1,
  3786. (long int) YYINDEX (yyp->yyoption.yystate),
  3787. (long int) YYINDEX (yyp->yyoption.yynext));
  3788. }
  3789. fprintf (stderr, "\n");
  3790. }
  3791. fprintf (stderr, "Tops:");
  3792. for (yyi = 0; yyi < yystackp->yytops.yysize; yyi += 1)
  3793. fprintf (stderr, "%lu: %ld; ", (unsigned long int) yyi,
  3794. (long int) YYINDEX (yystackp->yytops.yystates[yyi]));
  3795. fprintf (stderr, "\n");
  3796. }
  3797. #endif
  3798. #line 597 "parser.y"
  3799. char* xpath_alias(char* key) {
  3800. char* value = (char*) xmlHashLookup(alias_hash, key);
  3801. return value == NULL ? key : value;
  3802. }
  3803. void init_xpath_alias() {
  3804. alias_hash = xmlHashCreate(100);
  3805. xmlHashAddEntry(alias_hash, "html", "lib:html-document");
  3806. xmlHashAddEntry(alias_hash, "match", "regexp:match");
  3807. xmlHashAddEntry(alias_hash, "replace", "regexp:replace");
  3808. xmlHashAddEntry(alias_hash, "test", "regexp:test");
  3809. xmlHashAddEntry(alias_hash, "with-newlines", "lib:nl");
  3810. }
  3811. pxpathPtr myparse(char* string){
  3812. // start_debugging();
  3813. parsed_answer = NULL;
  3814. prepare_parse(string);
  3815. yyparse();
  3816. cleanup_parse();
  3817. return parsed_answer;
  3818. }
  3819. void answer(pxpathPtr a){
  3820. parsed_answer = a;
  3821. }
  3822. void start_debugging(){
  3823. yydebug = 1;
  3824. return;
  3825. }