Parser.cs 39 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107
  1. // created by jay 0.7 (c) 1998 [email protected]
  2. // line 2 "Parser.jay"
  3. // XPath parser
  4. //
  5. // Author - Piers Haken <[email protected]>
  6. //
  7. // TODO: FUNCTION_CALL should be a QName, not just a NCName
  8. // TODO: PROCESSING_INSTRUCTION's optional parameter
  9. // TODO: flatten argument/predicate lists in place
  10. using System;
  11. using System.Xml.XPath;
  12. //using Test.Xml.XPath;
  13. namespace Mono.Xml.XPath
  14. {
  15. public class XPathParser
  16. {
  17. internal object yyparseSafe (Tokenizer tok)
  18. {
  19. return yyparseSafe (tok, null);
  20. }
  21. internal object yyparseSafe (Tokenizer tok, object yyDebug)
  22. {
  23. try
  24. {
  25. return yyparse (tok, yyDebug);
  26. }
  27. catch (XPathException e)
  28. {
  29. throw e;
  30. }
  31. catch (Exception e)
  32. {
  33. throw new XPathException ("Error during parse", e);
  34. }
  35. }
  36. internal object yyparseDebug (Tokenizer tok)
  37. {
  38. return yyparseSafe (tok, new yydebug.yyDebugSimple ());
  39. }
  40. // line 48 "-"
  41. /** simplified error message.
  42. @see <a href="#yyerror(java.lang.String, java.lang.String[])">yyerror</a>
  43. */
  44. public void yyerror (string message) {
  45. yyerror(message, null);
  46. }
  47. /** (syntax) error message.
  48. Can be overwritten to control message format.
  49. @param message text to be displayed.
  50. @param expected vector of acceptable tokens, if available.
  51. */
  52. public void yyerror (string message, string[] expected) {
  53. if ((expected != null) && (expected.Length > 0)) {
  54. System.Console.Write (message+", expecting");
  55. for (int n = 0; n < expected.Length; ++ n)
  56. System.Console.Write (" "+expected[n]);
  57. System.Console.WriteLine ();
  58. } else
  59. System.Console.WriteLine (message);
  60. }
  61. /** debugging support, requires the package jay.yydebug.
  62. Set to null to suppress debugging messages.
  63. */
  64. protected yydebug.yyDebug debug;
  65. protected static int yyFinal = 25;
  66. public static string [] yyRule = {
  67. "$accept : Expr",
  68. "Expr : OrExpr",
  69. "OrExpr : AndExpr",
  70. "OrExpr : OrExpr OR AndExpr",
  71. "AndExpr : EqualityExpr",
  72. "AndExpr : AndExpr AND EqualityExpr",
  73. "EqualityExpr : RelationalExpr",
  74. "EqualityExpr : EqualityExpr EQ RelationalExpr",
  75. "EqualityExpr : EqualityExpr NE RelationalExpr",
  76. "RelationalExpr : AdditiveExpr",
  77. "RelationalExpr : RelationalExpr LT AdditiveExpr",
  78. "RelationalExpr : RelationalExpr GT AdditiveExpr",
  79. "RelationalExpr : RelationalExpr LE AdditiveExpr",
  80. "RelationalExpr : RelationalExpr GE AdditiveExpr",
  81. "AdditiveExpr : MultiplicativeExpr",
  82. "AdditiveExpr : AdditiveExpr PLUS MultiplicativeExpr",
  83. "AdditiveExpr : AdditiveExpr MINUS MultiplicativeExpr",
  84. "MultiplicativeExpr : UnaryExpr",
  85. "MultiplicativeExpr : MultiplicativeExpr ASTERISK UnaryExpr",
  86. "MultiplicativeExpr : MultiplicativeExpr DIV UnaryExpr",
  87. "MultiplicativeExpr : MultiplicativeExpr MOD UnaryExpr",
  88. "UnaryExpr : UnionExpr",
  89. "UnaryExpr : MINUS UnaryExpr",
  90. "UnionExpr : PathExpr",
  91. "UnionExpr : UnionExpr BAR PathExpr",
  92. "PathExpr : RelativeLocationPath",
  93. "PathExpr : SLASH",
  94. "PathExpr : SLASH RelativeLocationPath",
  95. "PathExpr : SLASH2 RelativeLocationPath",
  96. "PathExpr : FilterExpr",
  97. "PathExpr : FilterExpr SLASH RelativeLocationPath",
  98. "PathExpr : FilterExpr SLASH2 RelativeLocationPath",
  99. "RelativeLocationPath : Step",
  100. "RelativeLocationPath : RelativeLocationPath SLASH Step",
  101. "RelativeLocationPath : RelativeLocationPath SLASH2 Step",
  102. "Step : AxisSpecifier QName ZeroOrMorePredicates",
  103. "Step : AxisSpecifier ASTERISK ZeroOrMorePredicates",
  104. "Step : AxisSpecifier NodeType PAREN_OPEN OptionalLiteral PAREN_CLOSE ZeroOrMorePredicates",
  105. "Step : DOT",
  106. "Step : DOT2",
  107. "AxisSpecifier :",
  108. "AxisSpecifier : AT",
  109. "AxisSpecifier : AxisName COLON2",
  110. "NodeType : COMMENT",
  111. "NodeType : TEXT",
  112. "NodeType : PROCESSING_INSTRUCTION",
  113. "NodeType : NODE",
  114. "FilterExpr : PrimaryExpr",
  115. "FilterExpr : FilterExpr Predicate",
  116. "PrimaryExpr : DOLLAR QName",
  117. "PrimaryExpr : PAREN_OPEN Expr PAREN_CLOSE",
  118. "PrimaryExpr : LITERAL",
  119. "PrimaryExpr : NUMBER",
  120. "PrimaryExpr : FunctionCall",
  121. "FunctionCall : FUNCTION_NAME PAREN_OPEN OptionalArgumentList PAREN_CLOSE",
  122. "OptionalArgumentList :",
  123. "OptionalArgumentList : Expr OptionalArgumentListTail",
  124. "OptionalArgumentListTail :",
  125. "OptionalArgumentListTail : COMMA Expr OptionalArgumentListTail",
  126. "ZeroOrMorePredicates :",
  127. "ZeroOrMorePredicates : Predicate ZeroOrMorePredicates",
  128. "Predicate : BRACKET_OPEN Expr BRACKET_CLOSE",
  129. "AxisName : ANCESTOR",
  130. "AxisName : ANCESTOR_OR_SELF",
  131. "AxisName : ATTRIBUTE",
  132. "AxisName : CHILD",
  133. "AxisName : DESCENDANT",
  134. "AxisName : DESCENDANT_OR_SELF",
  135. "AxisName : FOLLOWING",
  136. "AxisName : FOLLOWING_SIBLING",
  137. "AxisName : NAMESPACE",
  138. "AxisName : PARENT",
  139. "AxisName : PRECEDING",
  140. "AxisName : PRECEDING_SIBLING",
  141. "AxisName : SELF",
  142. "OptionalLiteral :",
  143. "OptionalLiteral : LITERAL",
  144. "QName : NCName",
  145. "QName : NCName COLON ASTERISK",
  146. "QName : NCName COLON NCName",
  147. };
  148. protected static string [] yyName = {
  149. "end-of-file",null,null,null,null,null,null,null,null,null,null,null,
  150. null,null,null,null,null,null,null,null,null,null,null,null,null,null,
  151. null,null,null,null,null,null,null,null,null,null,null,null,null,null,
  152. null,null,null,null,null,null,null,null,null,null,null,null,null,null,
  153. null,null,null,null,null,null,null,null,null,null,null,null,null,null,
  154. null,null,null,null,null,null,null,null,null,null,null,null,null,null,
  155. null,null,null,null,null,null,null,null,null,null,null,null,null,null,
  156. null,null,null,null,null,null,null,null,null,null,null,null,null,null,
  157. null,null,null,null,null,null,null,null,null,null,null,null,null,null,
  158. null,null,null,null,null,null,null,null,null,null,null,null,null,null,
  159. null,null,null,null,null,null,null,null,null,null,null,null,null,null,
  160. null,null,null,null,null,null,null,null,null,null,null,null,null,null,
  161. null,null,null,null,null,null,null,null,null,null,null,null,null,null,
  162. null,null,null,null,null,null,null,null,null,null,null,null,null,null,
  163. null,null,null,null,null,null,null,null,null,null,null,null,null,null,
  164. null,null,null,null,null,null,null,null,null,null,null,null,null,null,
  165. null,null,null,null,null,null,null,null,null,null,null,null,null,null,
  166. null,null,null,null,null,null,null,null,null,null,null,null,null,null,
  167. null,null,null,null,null,null,null,"ERROR","EOF","SLASH","SLASH2",
  168. "DOT","DOT2","COLON","COLON2","COMMA","AT","FUNCTION_NAME",
  169. "BRACKET_OPEN","BRACKET_CLOSE","PAREN_OPEN","PAREN_CLOSE","AND","OR",
  170. "DIV","MOD","PLUS","MINUS","ASTERISK","DOLLAR","BAR","EQ","NE","LE",
  171. "GE","LT","GT","ANCESTOR","ANCESTOR_OR_SELF","ATTRIBUTE","CHILD",
  172. "DESCENDANT","DESCENDANT_OR_SELF","FOLLOWING","FOLLOWING_SIBLING",
  173. "NAMESPACE","PARENT","PRECEDING","PRECEDING_SIBLING","SELF","COMMENT",
  174. "TEXT","PROCESSING_INSTRUCTION","NODE","NUMBER","LITERAL","NCName",
  175. };
  176. /** index-checked interface to yyName[].
  177. @param token single character or %token value.
  178. @return token name or [illegal] or [unknown].
  179. */
  180. public static string yyname (int token) {
  181. if ((token < 0) || (token > yyName.Length)) return "[illegal]";
  182. string name;
  183. if ((name = yyName[token]) != null) return name;
  184. return "[unknown]";
  185. }
  186. /** computes list of expected tokens on error by tracing the tables.
  187. @param state for which to compute the list.
  188. @return list of token names.
  189. */
  190. protected string[] yyExpecting (int state) {
  191. int token, n, len = 0;
  192. bool[] ok = new bool[yyName.Length];
  193. if ((n = yySindex[state]) != 0)
  194. for (token = n < 0 ? -n : 0;
  195. (token < yyName.Length) && (n+token < yyTable.Length); ++ token)
  196. if (yyCheck[n+token] == token && !ok[token] && yyName[token] != null) {
  197. ++ len;
  198. ok[token] = true;
  199. }
  200. if ((n = yyRindex[state]) != 0)
  201. for (token = n < 0 ? -n : 0;
  202. (token < yyName.Length) && (n+token < yyTable.Length); ++ token)
  203. if (yyCheck[n+token] == token && !ok[token] && yyName[token] != null) {
  204. ++ len;
  205. ok[token] = true;
  206. }
  207. string [] result = new string[len];
  208. for (n = token = 0; n < len; ++ token)
  209. if (ok[token]) result[n++] = yyName[token];
  210. return result;
  211. }
  212. /** the generated parser, with debugging messages.
  213. Maintains a state and a value stack, currently with fixed maximum size.
  214. @param yyLex scanner.
  215. @param yydebug debug message writer implementing yyDebug, or null.
  216. @return result of the last reduction, if any.
  217. @throws yyException on irrecoverable parse error.
  218. */
  219. public Object yyparse (yyParser.yyInput yyLex, Object yyd)
  220. {
  221. this.debug = (yydebug.yyDebug)yyd;
  222. return yyparse(yyLex);
  223. }
  224. /** initial size and increment of the state/value stack [default 256].
  225. This is not final so that it can be overwritten outside of invocations
  226. of yyparse().
  227. */
  228. protected int yyMax;
  229. /** executed at the beginning of a reduce action.
  230. Used as $$ = yyDefault($1), prior to the user-specified action, if any.
  231. Can be overwritten to provide deep copy, etc.
  232. @param first value for $1, or null.
  233. @return first.
  234. */
  235. protected Object yyDefault (Object first) {
  236. return first;
  237. }
  238. /** the generated parser.
  239. Maintains a state and a value stack, currently with fixed maximum size.
  240. @param yyLex scanner.
  241. @return result of the last reduction, if any.
  242. @throws yyException on irrecoverable parse error.
  243. */
  244. public Object yyparse (yyParser.yyInput yyLex)
  245. {
  246. if (yyMax <= 0) yyMax = 256; // initial size
  247. int yyState = 0; // state stack ptr
  248. int [] yyStates = new int[yyMax]; // state stack
  249. Object yyVal = null; // value stack ptr
  250. Object [] yyVals = new Object[yyMax]; // value stack
  251. int yyToken = -1; // current input
  252. int yyErrorFlag = 0; // #tks to shift
  253. int yyTop = 0;
  254. goto skip;
  255. yyLoop:
  256. yyTop++;
  257. skip:
  258. for (;; ++ yyTop) {
  259. if (yyTop >= yyStates.Length) { // dynamically increase
  260. int[] i = new int[yyStates.Length+yyMax];
  261. yyStates.CopyTo (i, 0);
  262. yyStates = i;
  263. Object[] o = new Object[yyVals.Length+yyMax];
  264. yyVals.CopyTo (o, 0);
  265. yyVals = o;
  266. }
  267. yyStates[yyTop] = yyState;
  268. yyVals[yyTop] = yyVal;
  269. if (debug != null) debug.push(yyState, yyVal);
  270. yyDiscarded: for (;;) { // discarding a token does not change stack
  271. int yyN;
  272. if ((yyN = yyDefRed[yyState]) == 0) { // else [default] reduce (yyN)
  273. if (yyToken < 0) {
  274. yyToken = yyLex.advance() ? yyLex.token() : 0;
  275. if (debug != null)
  276. debug.lex(yyState, yyToken, yyname(yyToken), yyLex.value());
  277. }
  278. if ((yyN = yySindex[yyState]) != 0 && ((yyN += yyToken) >= 0)
  279. && (yyN < yyTable.Length) && (yyCheck[yyN] == yyToken)) {
  280. if (debug != null)
  281. debug.shift(yyState, yyTable[yyN], yyErrorFlag-1);
  282. yyState = yyTable[yyN]; // shift to yyN
  283. yyVal = yyLex.value();
  284. yyToken = -1;
  285. if (yyErrorFlag > 0) -- yyErrorFlag;
  286. goto yyLoop;
  287. }
  288. if ((yyN = yyRindex[yyState]) != 0 && (yyN += yyToken) >= 0
  289. && yyN < yyTable.Length && yyCheck[yyN] == yyToken)
  290. yyN = yyTable[yyN]; // reduce (yyN)
  291. else
  292. switch (yyErrorFlag) {
  293. case 0:
  294. yyerror("syntax error", yyExpecting(yyState));
  295. if (debug != null) debug.error("syntax error");
  296. goto case 1;
  297. case 1: case 2:
  298. yyErrorFlag = 3;
  299. do {
  300. if ((yyN = yySindex[yyStates[yyTop]]) != 0
  301. && (yyN += Token.yyErrorCode) >= 0 && yyN < yyTable.Length
  302. && yyCheck[yyN] == Token.yyErrorCode) {
  303. if (debug != null)
  304. debug.shift(yyStates[yyTop], yyTable[yyN], 3);
  305. yyState = yyTable[yyN];
  306. yyVal = yyLex.value();
  307. goto yyLoop;
  308. }
  309. if (debug != null) debug.pop(yyStates[yyTop]);
  310. } while (-- yyTop >= 0);
  311. if (debug != null) debug.reject();
  312. throw new yyParser.yyException("irrecoverable syntax error");
  313. case 3:
  314. if (yyToken == 0) {
  315. if (debug != null) debug.reject();
  316. throw new yyParser.yyException("irrecoverable syntax error at end-of-file");
  317. }
  318. if (debug != null)
  319. debug.discard(yyState, yyToken, yyname(yyToken),
  320. yyLex.value());
  321. yyToken = -1;
  322. goto yyDiscarded; // leave stack alone
  323. }
  324. }
  325. int yyV = yyTop + 1-yyLen[yyN];
  326. if (debug != null)
  327. debug.reduce(yyState, yyStates[yyV-1], yyN, yyRule[yyN], yyLen[yyN]);
  328. yyVal = yyDefault(yyV > yyTop ? null : yyVals[yyV]);
  329. switch (yyN) {
  330. case 3:
  331. // line 133 "Parser.jay"
  332. {
  333. yyVal = new ExprOR ((Expression) yyVals[-2+yyTop], (Expression) yyVals[0+yyTop]);
  334. }
  335. break;
  336. case 5:
  337. // line 141 "Parser.jay"
  338. {
  339. yyVal = new ExprAND ((Expression) yyVals[-2+yyTop], (Expression) yyVals[0+yyTop]);
  340. }
  341. break;
  342. case 7:
  343. // line 149 "Parser.jay"
  344. {
  345. yyVal = new ExprEQ ((Expression) yyVals[-2+yyTop], (Expression) yyVals[0+yyTop]);
  346. }
  347. break;
  348. case 8:
  349. // line 153 "Parser.jay"
  350. {
  351. yyVal = new ExprNE ((Expression) yyVals[-2+yyTop], (Expression) yyVals[0+yyTop]);
  352. }
  353. break;
  354. case 10:
  355. // line 161 "Parser.jay"
  356. {
  357. yyVal = new ExprLT ((Expression) yyVals[-2+yyTop], (Expression) yyVals[0+yyTop]);
  358. }
  359. break;
  360. case 11:
  361. // line 165 "Parser.jay"
  362. {
  363. yyVal = new ExprGT ((Expression) yyVals[-2+yyTop], (Expression) yyVals[0+yyTop]);
  364. }
  365. break;
  366. case 12:
  367. // line 169 "Parser.jay"
  368. {
  369. yyVal = new ExprLE ((Expression) yyVals[-2+yyTop], (Expression) yyVals[0+yyTop]);
  370. }
  371. break;
  372. case 13:
  373. // line 173 "Parser.jay"
  374. {
  375. yyVal = new ExprGE ((Expression) yyVals[-2+yyTop], (Expression) yyVals[0+yyTop]);
  376. }
  377. break;
  378. case 15:
  379. // line 181 "Parser.jay"
  380. {
  381. yyVal = new ExprPLUS ((Expression) yyVals[-2+yyTop], (Expression) yyVals[0+yyTop]);
  382. }
  383. break;
  384. case 16:
  385. // line 185 "Parser.jay"
  386. {
  387. yyVal = new ExprMINUS ((Expression) yyVals[-2+yyTop], (Expression) yyVals[0+yyTop]);
  388. }
  389. break;
  390. case 18:
  391. // line 193 "Parser.jay"
  392. {
  393. yyVal = new ExprMULT ((Expression) yyVals[-2+yyTop], (Expression) yyVals[0+yyTop]);
  394. }
  395. break;
  396. case 19:
  397. // line 197 "Parser.jay"
  398. {
  399. yyVal = new ExprDIV ((Expression) yyVals[-2+yyTop], (Expression) yyVals[0+yyTop]);
  400. }
  401. break;
  402. case 20:
  403. // line 201 "Parser.jay"
  404. {
  405. yyVal = new ExprMOD ((Expression) yyVals[-2+yyTop], (Expression) yyVals[0+yyTop]);
  406. }
  407. break;
  408. case 22:
  409. // line 209 "Parser.jay"
  410. {
  411. yyVal = new ExprNEG ((Expression) yyVals[0+yyTop]);
  412. }
  413. break;
  414. case 24:
  415. // line 217 "Parser.jay"
  416. {
  417. yyVal = new ExprUNION ((NodeSet) yyVals[-2+yyTop], (NodeSet) yyVals[0+yyTop]);
  418. }
  419. break;
  420. case 26:
  421. // line 225 "Parser.jay"
  422. {
  423. yyVal = new ExprRoot ();
  424. }
  425. break;
  426. case 27:
  427. // line 229 "Parser.jay"
  428. {
  429. yyVal = new ExprSLASH (new ExprRoot (), (NodeSet) yyVals[0+yyTop]);
  430. }
  431. break;
  432. case 28:
  433. // line 233 "Parser.jay"
  434. {
  435. ExprStep exprStep = new ExprStep (new NodeTypeTest (Axes.DescendantOrSelf, XPathNodeType.All));
  436. yyVal = new ExprSLASH (new ExprSLASH (new ExprRoot (), exprStep), (NodeSet) yyVals[0+yyTop]);
  437. }
  438. break;
  439. case 30:
  440. // line 239 "Parser.jay"
  441. {
  442. yyVal = new ExprSLASH ((Expression) yyVals[-2+yyTop], (NodeSet) yyVals[0+yyTop]);
  443. }
  444. break;
  445. case 31:
  446. // line 243 "Parser.jay"
  447. {
  448. ExprStep exprStep = new ExprStep (new NodeTypeTest (Axes.DescendantOrSelf, XPathNodeType.All));
  449. yyVal = new ExprSLASH (new ExprSLASH ((Expression) yyVals[-2+yyTop], exprStep), (NodeSet) yyVals[0+yyTop]);
  450. }
  451. break;
  452. case 33:
  453. // line 252 "Parser.jay"
  454. {
  455. yyVal = new ExprSLASH ((Expression) yyVals[-2+yyTop], (NodeSet) yyVals[0+yyTop]);
  456. }
  457. break;
  458. case 34:
  459. // line 256 "Parser.jay"
  460. {
  461. ExprStep exprStep = new ExprStep (new NodeTypeTest (Axes.DescendantOrSelf, XPathNodeType.All));
  462. yyVal = new ExprSLASH (new ExprSLASH ((Expression) yyVals[-2+yyTop], exprStep), (NodeSet) yyVals[0+yyTop]);
  463. }
  464. break;
  465. case 35:
  466. // line 264 "Parser.jay"
  467. {
  468. yyVal = new ExprStep (new NodeNameTest ((Axes) yyVals[-2+yyTop], (QName) yyVals[-1+yyTop]), (ExprPredicates) yyVals[0+yyTop]);
  469. }
  470. break;
  471. case 36:
  472. // line 268 "Parser.jay"
  473. {
  474. yyVal = new ExprStep (new NodeTypeTest ((Axes) yyVals[-2+yyTop]), (ExprPredicates) yyVals[0+yyTop]);
  475. }
  476. break;
  477. case 37:
  478. // line 272 "Parser.jay"
  479. {
  480. yyVal = new ExprStep (new NodeTypeTest ((Axes) yyVals[-5+yyTop], (XPathNodeType) yyVals[-4+yyTop], (String) yyVals[-2+yyTop]), (ExprPredicates) yyVals[0+yyTop]);
  481. }
  482. break;
  483. case 38:
  484. // line 276 "Parser.jay"
  485. {
  486. yyVal = new ExprStep (new NodeTypeTest (Axes.Self, XPathNodeType.All));
  487. }
  488. break;
  489. case 39:
  490. // line 280 "Parser.jay"
  491. {
  492. yyVal = new ExprStep (new NodeTypeTest (Axes.Parent, XPathNodeType.All));
  493. }
  494. break;
  495. case 40:
  496. // line 287 "Parser.jay"
  497. {
  498. yyVal = Axes.Child;
  499. }
  500. break;
  501. case 41:
  502. // line 291 "Parser.jay"
  503. {
  504. yyVal = Axes.Attribute;
  505. }
  506. break;
  507. case 42:
  508. // line 295 "Parser.jay"
  509. {
  510. yyVal = yyVals[-1+yyTop];
  511. }
  512. break;
  513. case 43:
  514. // line 301 "Parser.jay"
  515. { yyVal = XPathNodeType.Comment; }
  516. break;
  517. case 44:
  518. // line 302 "Parser.jay"
  519. { yyVal = XPathNodeType.Text; }
  520. break;
  521. case 45:
  522. // line 303 "Parser.jay"
  523. { yyVal = XPathNodeType.ProcessingInstruction; }
  524. break;
  525. case 46:
  526. // line 304 "Parser.jay"
  527. { yyVal = XPathNodeType.All; }
  528. break;
  529. case 48:
  530. // line 311 "Parser.jay"
  531. {
  532. yyVal = new ExprFilter ((Expression) yyVals[-1+yyTop], (Expression) yyVals[0+yyTop]);
  533. }
  534. break;
  535. case 49:
  536. // line 318 "Parser.jay"
  537. {
  538. yyVal = new ExprVariable ((QName) yyVals[0+yyTop]);
  539. }
  540. break;
  541. case 50:
  542. // line 322 "Parser.jay"
  543. {
  544. yyVal = yyVals[-1+yyTop];
  545. }
  546. break;
  547. case 51:
  548. // line 326 "Parser.jay"
  549. {
  550. yyVal = new ExprLiteral ((String) yyVals[0+yyTop]);
  551. }
  552. break;
  553. case 52:
  554. // line 330 "Parser.jay"
  555. {
  556. yyVal = new ExprNumber ((double) yyVals[0+yyTop]);
  557. }
  558. break;
  559. case 54:
  560. // line 338 "Parser.jay"
  561. {
  562. yyVal = new ExprFunctionCall ((String) yyVals[-3+yyTop], (FunctionArguments) yyVals[-1+yyTop]);
  563. }
  564. break;
  565. case 56:
  566. // line 346 "Parser.jay"
  567. {
  568. yyVal = new FunctionArguments ((Expression) yyVals[-1+yyTop], (FunctionArguments) yyVals[0+yyTop]);
  569. }
  570. break;
  571. case 58:
  572. // line 354 "Parser.jay"
  573. {
  574. yyVal = new FunctionArguments ((Expression) yyVals[-1+yyTop], (FunctionArguments) yyVals[0+yyTop]);
  575. }
  576. break;
  577. case 60:
  578. // line 363 "Parser.jay"
  579. {
  580. yyVal = new ExprPredicates ((Expression) yyVals[-1+yyTop], (ExprPredicates) yyVals[0+yyTop]);
  581. }
  582. break;
  583. case 61:
  584. // line 370 "Parser.jay"
  585. {
  586. yyVal = yyVals[-1+yyTop];
  587. }
  588. break;
  589. case 62:
  590. // line 376 "Parser.jay"
  591. { yyVal = Axes.Ancestor; }
  592. break;
  593. case 63:
  594. // line 377 "Parser.jay"
  595. { yyVal = Axes.AncestorOrSelf; }
  596. break;
  597. case 64:
  598. // line 378 "Parser.jay"
  599. { yyVal = Axes.Attribute; }
  600. break;
  601. case 65:
  602. // line 379 "Parser.jay"
  603. { yyVal = Axes.Child; }
  604. break;
  605. case 66:
  606. // line 380 "Parser.jay"
  607. { yyVal = Axes.Descendant; }
  608. break;
  609. case 67:
  610. // line 381 "Parser.jay"
  611. { yyVal = Axes.DescendantOrSelf; }
  612. break;
  613. case 68:
  614. // line 382 "Parser.jay"
  615. { yyVal = Axes.Following; }
  616. break;
  617. case 69:
  618. // line 383 "Parser.jay"
  619. { yyVal = Axes.FollowingSibling; }
  620. break;
  621. case 70:
  622. // line 384 "Parser.jay"
  623. { yyVal = Axes.Namespace; }
  624. break;
  625. case 71:
  626. // line 385 "Parser.jay"
  627. { yyVal = Axes.Parent; }
  628. break;
  629. case 72:
  630. // line 386 "Parser.jay"
  631. { yyVal = Axes.Preceding; }
  632. break;
  633. case 73:
  634. // line 387 "Parser.jay"
  635. { yyVal = Axes.PrecedingSibling; }
  636. break;
  637. case 74:
  638. // line 388 "Parser.jay"
  639. { yyVal = Axes.Self; }
  640. break;
  641. case 77:
  642. // line 398 "Parser.jay"
  643. {
  644. yyVal = new NCName ((String) yyVals[0+yyTop]);
  645. }
  646. break;
  647. case 78:
  648. // line 402 "Parser.jay"
  649. {
  650. yyVal = new QName ((String) yyVals[-2+yyTop], null);
  651. }
  652. break;
  653. case 79:
  654. // line 406 "Parser.jay"
  655. {
  656. yyVal = new QName ((String) yyVals[-2+yyTop], (String) yyVals[0+yyTop]);
  657. }
  658. break;
  659. // line 683 "-"
  660. }
  661. yyTop -= yyLen[yyN];
  662. yyState = yyStates[yyTop];
  663. int yyM = yyLhs[yyN];
  664. if (yyState == 0 && yyM == 0) {
  665. if (debug != null) debug.shift(0, yyFinal);
  666. yyState = yyFinal;
  667. if (yyToken < 0) {
  668. yyToken = yyLex.advance() ? yyLex.token() : 0;
  669. if (debug != null)
  670. debug.lex(yyState, yyToken,yyname(yyToken), yyLex.value());
  671. }
  672. if (yyToken == 0) {
  673. if (debug != null) debug.accept(yyVal);
  674. return yyVal;
  675. }
  676. goto yyLoop;
  677. }
  678. if (((yyN = yyGindex[yyM]) != 0) && ((yyN += yyState) >= 0)
  679. && (yyN < yyTable.Length) && (yyCheck[yyN] == yyState))
  680. yyState = yyTable[yyN];
  681. else
  682. yyState = yyDgoto[yyM];
  683. if (debug != null) debug.shift(yyStates[yyTop], yyState);
  684. goto yyLoop;
  685. }
  686. }
  687. }
  688. static short [] yyLhs = { -1,
  689. 0, 1, 1, 2, 2, 3, 3, 3, 4, 4,
  690. 4, 4, 4, 5, 5, 5, 6, 6, 6, 6,
  691. 7, 7, 8, 8, 9, 9, 9, 9, 9, 9,
  692. 9, 10, 10, 10, 12, 12, 12, 12, 12, 13,
  693. 13, 13, 16, 16, 16, 16, 11, 11, 19, 19,
  694. 19, 19, 19, 21, 22, 22, 23, 23, 15, 15,
  695. 20, 18, 18, 18, 18, 18, 18, 18, 18, 18,
  696. 18, 18, 18, 18, 17, 17, 14, 14, 14,
  697. };
  698. static short [] yyLen = { 2,
  699. 1, 1, 3, 1, 3, 1, 3, 3, 1, 3,
  700. 3, 3, 3, 1, 3, 3, 1, 3, 3, 3,
  701. 1, 2, 1, 3, 1, 1, 2, 2, 1, 3,
  702. 3, 1, 3, 3, 3, 3, 6, 1, 1, 0,
  703. 1, 2, 1, 1, 1, 1, 1, 2, 2, 3,
  704. 1, 1, 1, 4, 0, 2, 0, 3, 0, 2,
  705. 3, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  706. 1, 1, 1, 1, 0, 1, 1, 3, 3,
  707. };
  708. static short [] yyDefRed = { 0,
  709. 0, 0, 38, 39, 41, 0, 0, 0, 0, 62,
  710. 63, 64, 65, 66, 67, 68, 69, 70, 71, 72,
  711. 73, 74, 52, 51, 0, 0, 0, 0, 0, 0,
  712. 0, 17, 0, 23, 0, 0, 32, 0, 0, 47,
  713. 53, 0, 0, 0, 0, 22, 0, 49, 0, 0,
  714. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  715. 0, 0, 0, 0, 0, 0, 0, 48, 0, 43,
  716. 44, 45, 46, 0, 0, 42, 0, 0, 50, 0,
  717. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  718. 19, 20, 18, 24, 33, 34, 0, 0, 0, 36,
  719. 0, 35, 0, 0, 56, 54, 78, 79, 61, 60,
  720. 76, 0, 0, 0, 58, 37,
  721. };
  722. protected static short [] yyDgoto = { 25,
  723. 26, 27, 28, 29, 30, 31, 32, 33, 34, 35,
  724. 36, 37, 38, 48, 100, 75, 112, 39, 40, 101,
  725. 41, 78, 105,
  726. };
  727. protected static short [] yySindex = { -188,
  728. -85, -85, 0, 0, 0, -258, -188, -188, -297, 0,
  729. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  730. 0, 0, 0, 0, 0, -215, -257, -253, -265, -245,
  731. -261, 0, -221, 0, -218, -252, 0, -256, -203, 0,
  732. 0, -218, -218, -188, -209, 0, -200, 0, -188, -188,
  733. -188, -188, -188, -188, -188, -188, -188, -188, -188, -188,
  734. -188, -130, -85, -85, -85, -85, -188, 0, -204, 0,
  735. 0, 0, 0, -204, -195, 0, -199, -194, 0, -268,
  736. -257, -253, -265, -265, -245, -245, -245, -245, -261, -261,
  737. 0, 0, 0, 0, 0, 0, -218, -218, -202, 0,
  738. -204, 0, -229, -188, 0, 0, 0, 0, 0, 0,
  739. 0, -191, -199, -204, 0, 0,
  740. };
  741. protected static short [] yyRindex = { -182,
  742. 1, -182, 0, 0, 0, 0, -182, -182, 0, 0,
  743. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  744. 0, 0, 0, 0, 0, 253, 65, 23, 435, 319,
  745. 244, 0, 222, 0, 90, 112, 0, 0, 0, 0,
  746. 0, 134, 156, -267, 0, 0, 40, 0, -182, -182,
  747. -182, -182, -182, -182, -182, -182, -182, -182, -182, -182,
  748. -182, -182, -182, -182, -182, -182, -182, 0, 68, 0,
  749. 0, 0, 0, 68, 0, 0, -190, 0, 0, 0,
  750. 510, 501, 457, 479, 347, 369, 391, 413, 267, 289,
  751. 0, 0, 0, 0, 0, 0, 178, 200, 0, 0,
  752. 68, 0, -187, -182, 0, 0, 0, 0, 0, 0,
  753. 0, 0, -190, 68, 0, 0,
  754. };
  755. protected static short [] yyGindex = { -7,
  756. 0, 34, 35, -3, -29, -1, -6, 0, 24, 4,
  757. 0, -12, 0, 49, -71, 0, 0, 0, 0, 52,
  758. 0, 0, -21,
  759. };
  760. protected static short [] yyTable = { 45,
  761. 26, 46, 102, 55, 42, 43, 65, 66, 47, 107,
  762. 40, 44, 59, 60, 50, 67, 61, 53, 54, 55,
  763. 56, 69, 4, 85, 86, 87, 88, 51, 52, 110,
  764. 57, 58, 40, 40, 40, 40, 77, 108, 40, 77,
  765. 63, 64, 116, 70, 71, 72, 73, 83, 84, 47,
  766. 95, 96, 91, 92, 93, 89, 90, 49, 62, 99,
  767. 76, 79, 80, 67, 2, 104, 109, 59, 97, 98,
  768. 1, 2, 3, 4, 103, 111, 106, 5, 6, 114,
  769. 57, 7, 81, 75, 82, 94, 74, 68, 8, 25,
  770. 9, 115, 0, 0, 0, 40, 113, 0, 10, 11,
  771. 12, 13, 14, 15, 16, 17, 18, 19, 20, 21,
  772. 22, 29, 0, 0, 0, 23, 24, 40, 40, 40,
  773. 40, 0, 0, 40, 0, 0, 0, 0, 1, 2,
  774. 3, 4, 0, 27, 0, 5, 6, 0, 0, 7,
  775. 0, 0, 0, 0, 0, 0, 0, 0, 9, 0,
  776. 0, 0, 0, 0, 0, 28, 10, 11, 12, 13,
  777. 14, 15, 16, 17, 18, 19, 20, 21, 22, 0,
  778. 0, 0, 0, 23, 24, 3, 4, 30, 0, 0,
  779. 5, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  780. 0, 0, 0, 0, 0, 0, 0, 0, 0, 31,
  781. 0, 10, 11, 12, 13, 14, 15, 16, 17, 18,
  782. 19, 20, 21, 22, 0, 0, 0, 0, 0, 0,
  783. 0, 21, 0, 0, 0, 0, 0, 0, 0, 0,
  784. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  785. 0, 0, 0, 14, 0, 0, 0, 0, 0, 0,
  786. 0, 0, 1, 0, 0, 0, 0, 0, 0, 0,
  787. 0, 0, 0, 0, 0, 26, 15, 0, 0, 26,
  788. 0, 26, 26, 26, 26, 26, 26, 26, 26, 0,
  789. 26, 26, 26, 26, 26, 26, 26, 4, 16, 0,
  790. 0, 4, 0, 4, 4, 4, 0, 0, 77, 77,
  791. 40, 40, 40, 40, 77, 0, 40, 77, 77, 0,
  792. 77, 77, 77, 77, 77, 77, 77, 77, 9, 77,
  793. 77, 77, 77, 77, 77, 77, 59, 59, 0, 2,
  794. 0, 0, 59, 2, 0, 2, 59, 2, 59, 59,
  795. 59, 59, 59, 59, 59, 59, 12, 59, 59, 59,
  796. 59, 59, 59, 59, 25, 0, 0, 0, 25, 0,
  797. 25, 25, 25, 25, 25, 25, 25, 25, 13, 25,
  798. 25, 25, 25, 25, 25, 25, 29, 0, 0, 0,
  799. 29, 0, 29, 29, 29, 29, 29, 29, 29, 29,
  800. 10, 29, 29, 29, 29, 29, 29, 29, 27, 0,
  801. 0, 0, 27, 0, 27, 27, 27, 27, 27, 27,
  802. 27, 27, 11, 27, 27, 27, 27, 27, 27, 27,
  803. 28, 0, 0, 0, 28, 0, 28, 28, 28, 28,
  804. 28, 28, 28, 28, 6, 28, 28, 28, 28, 28,
  805. 28, 28, 30, 0, 0, 0, 30, 0, 30, 30,
  806. 30, 30, 30, 30, 30, 30, 7, 30, 30, 30,
  807. 30, 30, 30, 30, 31, 0, 0, 0, 31, 0,
  808. 31, 31, 31, 31, 31, 31, 31, 31, 8, 31,
  809. 31, 31, 31, 31, 31, 31, 21, 0, 0, 0,
  810. 21, 0, 21, 21, 21, 21, 21, 21, 21, 21,
  811. 5, 0, 21, 21, 21, 21, 21, 21, 14, 3,
  812. 0, 0, 14, 0, 14, 14, 14, 1, 0, 14,
  813. 14, 1, 0, 1, 14, 14, 14, 14, 14, 14,
  814. 0, 15, 0, 0, 0, 15, 0, 15, 15, 15,
  815. 0, 0, 15, 15, 0, 0, 0, 15, 15, 15,
  816. 15, 15, 15, 16, 0, 0, 0, 16, 0, 16,
  817. 16, 16, 0, 0, 16, 16, 0, 0, 0, 16,
  818. 16, 16, 16, 16, 16, 0, 0, 0, 0, 0,
  819. 0, 0, 0, 9, 0, 0, 0, 9, 0, 9,
  820. 9, 9, 0, 0, 0, 0, 0, 0, 0, 9,
  821. 9, 9, 9, 9, 9, 0, 0, 0, 0, 0,
  822. 0, 12, 0, 0, 0, 12, 0, 12, 12, 12,
  823. 0, 0, 0, 0, 0, 0, 0, 12, 12, 12,
  824. 12, 12, 12, 13, 0, 0, 0, 13, 0, 13,
  825. 13, 13, 0, 0, 0, 0, 0, 0, 0, 13,
  826. 13, 13, 13, 13, 13, 10, 0, 0, 0, 10,
  827. 0, 10, 10, 10, 0, 0, 0, 0, 0, 0,
  828. 0, 10, 10, 10, 10, 10, 10, 11, 0, 0,
  829. 0, 11, 0, 11, 11, 11, 0, 0, 0, 0,
  830. 0, 0, 0, 11, 11, 11, 11, 11, 11, 6,
  831. 0, 0, 0, 6, 0, 6, 6, 6, 0, 0,
  832. 0, 0, 0, 0, 0, 6, 6, 0, 0, 0,
  833. 0, 7, 0, 0, 0, 7, 0, 7, 7, 7,
  834. 0, 0, 0, 0, 0, 0, 0, 7, 7, 0,
  835. 0, 0, 0, 8, 0, 0, 0, 8, 0, 8,
  836. 8, 8, 0, 0, 0, 0, 0, 0, 0, 8,
  837. 8, 0, 0, 0, 0, 5, 0, 0, 0, 5,
  838. 0, 5, 5, 5, 3, 0, 0, 0, 3, 0,
  839. 3, 0, 3,
  840. };
  841. protected static short [] yyCheck = { 7,
  842. 0, 8, 74, 271, 1, 2, 259, 260, 306, 278,
  843. 278, 270, 274, 275, 272, 268, 278, 283, 284, 285,
  844. 286, 278, 0, 53, 54, 55, 56, 281, 282, 101,
  845. 276, 277, 300, 301, 302, 303, 44, 306, 306, 0,
  846. 259, 260, 114, 300, 301, 302, 303, 51, 52, 306,
  847. 63, 64, 59, 60, 61, 57, 58, 273, 280, 67,
  848. 264, 271, 263, 268, 0, 265, 269, 0, 65, 66,
  849. 259, 260, 261, 262, 270, 305, 271, 266, 267, 271,
  850. 271, 270, 49, 271, 50, 62, 38, 36, 277, 0,
  851. 279, 113, -1, -1, -1, 278, 104, -1, 287, 288,
  852. 289, 290, 291, 292, 293, 294, 295, 296, 297, 298,
  853. 299, 0, -1, -1, -1, 304, 305, 300, 301, 302,
  854. 303, -1, -1, 306, -1, -1, -1, -1, 259, 260,
  855. 261, 262, -1, 0, -1, 266, 267, -1, -1, 270,
  856. -1, -1, -1, -1, -1, -1, -1, -1, 279, -1,
  857. -1, -1, -1, -1, -1, 0, 287, 288, 289, 290,
  858. 291, 292, 293, 294, 295, 296, 297, 298, 299, -1,
  859. -1, -1, -1, 304, 305, 261, 262, 0, -1, -1,
  860. 266, -1, -1, -1, -1, -1, -1, -1, -1, -1,
  861. -1, -1, -1, -1, -1, -1, -1, -1, -1, 0,
  862. -1, 287, 288, 289, 290, 291, 292, 293, 294, 295,
  863. 296, 297, 298, 299, -1, -1, -1, -1, -1, -1,
  864. -1, 0, -1, -1, -1, -1, -1, -1, -1, -1,
  865. -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
  866. -1, -1, -1, 0, -1, -1, -1, -1, -1, -1,
  867. -1, -1, 0, -1, -1, -1, -1, -1, -1, -1,
  868. -1, -1, -1, -1, -1, 265, 0, -1, -1, 269,
  869. -1, 271, 272, 273, 274, 275, 276, 277, 278, -1,
  870. 280, 281, 282, 283, 284, 285, 286, 265, 0, -1,
  871. -1, 269, -1, 271, 272, 273, -1, -1, 259, 260,
  872. 300, 301, 302, 303, 265, -1, 306, 268, 269, -1,
  873. 271, 272, 273, 274, 275, 276, 277, 278, 0, 280,
  874. 281, 282, 283, 284, 285, 286, 259, 260, -1, 265,
  875. -1, -1, 265, 269, -1, 271, 269, 273, 271, 272,
  876. 273, 274, 275, 276, 277, 278, 0, 280, 281, 282,
  877. 283, 284, 285, 286, 265, -1, -1, -1, 269, -1,
  878. 271, 272, 273, 274, 275, 276, 277, 278, 0, 280,
  879. 281, 282, 283, 284, 285, 286, 265, -1, -1, -1,
  880. 269, -1, 271, 272, 273, 274, 275, 276, 277, 278,
  881. 0, 280, 281, 282, 283, 284, 285, 286, 265, -1,
  882. -1, -1, 269, -1, 271, 272, 273, 274, 275, 276,
  883. 277, 278, 0, 280, 281, 282, 283, 284, 285, 286,
  884. 265, -1, -1, -1, 269, -1, 271, 272, 273, 274,
  885. 275, 276, 277, 278, 0, 280, 281, 282, 283, 284,
  886. 285, 286, 265, -1, -1, -1, 269, -1, 271, 272,
  887. 273, 274, 275, 276, 277, 278, 0, 280, 281, 282,
  888. 283, 284, 285, 286, 265, -1, -1, -1, 269, -1,
  889. 271, 272, 273, 274, 275, 276, 277, 278, 0, 280,
  890. 281, 282, 283, 284, 285, 286, 265, -1, -1, -1,
  891. 269, -1, 271, 272, 273, 274, 275, 276, 277, 278,
  892. 0, -1, 281, 282, 283, 284, 285, 286, 265, 0,
  893. -1, -1, 269, -1, 271, 272, 273, 265, -1, 276,
  894. 277, 269, -1, 271, 281, 282, 283, 284, 285, 286,
  895. -1, 265, -1, -1, -1, 269, -1, 271, 272, 273,
  896. -1, -1, 276, 277, -1, -1, -1, 281, 282, 283,
  897. 284, 285, 286, 265, -1, -1, -1, 269, -1, 271,
  898. 272, 273, -1, -1, 276, 277, -1, -1, -1, 281,
  899. 282, 283, 284, 285, 286, -1, -1, -1, -1, -1,
  900. -1, -1, -1, 265, -1, -1, -1, 269, -1, 271,
  901. 272, 273, -1, -1, -1, -1, -1, -1, -1, 281,
  902. 282, 283, 284, 285, 286, -1, -1, -1, -1, -1,
  903. -1, 265, -1, -1, -1, 269, -1, 271, 272, 273,
  904. -1, -1, -1, -1, -1, -1, -1, 281, 282, 283,
  905. 284, 285, 286, 265, -1, -1, -1, 269, -1, 271,
  906. 272, 273, -1, -1, -1, -1, -1, -1, -1, 281,
  907. 282, 283, 284, 285, 286, 265, -1, -1, -1, 269,
  908. -1, 271, 272, 273, -1, -1, -1, -1, -1, -1,
  909. -1, 281, 282, 283, 284, 285, 286, 265, -1, -1,
  910. -1, 269, -1, 271, 272, 273, -1, -1, -1, -1,
  911. -1, -1, -1, 281, 282, 283, 284, 285, 286, 265,
  912. -1, -1, -1, 269, -1, 271, 272, 273, -1, -1,
  913. -1, -1, -1, -1, -1, 281, 282, -1, -1, -1,
  914. -1, 265, -1, -1, -1, 269, -1, 271, 272, 273,
  915. -1, -1, -1, -1, -1, -1, -1, 281, 282, -1,
  916. -1, -1, -1, 265, -1, -1, -1, 269, -1, 271,
  917. 272, 273, -1, -1, -1, -1, -1, -1, -1, 281,
  918. 282, -1, -1, -1, -1, 265, -1, -1, -1, 269,
  919. -1, 271, 272, 273, 265, -1, -1, -1, 269, -1,
  920. 271, -1, 273,
  921. };
  922. // line 412 "Parser.jay"
  923. }
  924. // line 950 "-"
  925. namespace yydebug {
  926. using System;
  927. public interface yyDebug {
  928. void push (int state, Object value);
  929. void lex (int state, int token, string name, Object value);
  930. void shift (int from, int to, int errorFlag);
  931. void pop (int state);
  932. void discard (int state, int token, string name, Object value);
  933. void reduce (int from, int to, int rule, string text, int len);
  934. void shift (int from, int to);
  935. void accept (Object value);
  936. void error (string message);
  937. void reject ();
  938. }
  939. class yyDebugSimple : yyDebug {
  940. void println (string s){
  941. Console.WriteLine (s);
  942. }
  943. public void push (int state, Object value) {
  944. println ("push\tstate "+state+"\tvalue "+value);
  945. }
  946. public void lex (int state, int token, string name, Object value) {
  947. println("lex\tstate "+state+"\treading "+name+"\tvalue "+value);
  948. }
  949. public void shift (int from, int to, int errorFlag) {
  950. switch (errorFlag) {
  951. default: // normally
  952. println("shift\tfrom state "+from+" to "+to);
  953. break;
  954. case 0: case 1: case 2: // in error recovery
  955. println("shift\tfrom state "+from+" to "+to
  956. +"\t"+errorFlag+" left to recover");
  957. break;
  958. case 3: // normally
  959. println("shift\tfrom state "+from+" to "+to+"\ton error");
  960. break;
  961. }
  962. }
  963. public void pop (int state) {
  964. println("pop\tstate "+state+"\ton error");
  965. }
  966. public void discard (int state, int token, string name, Object value) {
  967. println("discard\tstate "+state+"\ttoken "+name+"\tvalue "+value);
  968. }
  969. public void reduce (int from, int to, int rule, string text, int len) {
  970. println("reduce\tstate "+from+"\tuncover "+to
  971. +"\trule ("+rule+") "+text);
  972. }
  973. public void shift (int from, int to) {
  974. println("goto\tfrom state "+from+" to "+to);
  975. }
  976. public void accept (Object value) {
  977. println("accept\tvalue "+value);
  978. }
  979. public void error (string message) {
  980. println("error\t"+message);
  981. }
  982. public void reject () {
  983. println("reject");
  984. }
  985. }
  986. }
  987. // %token constants
  988. class Token {
  989. public const int ERROR = 257;
  990. public const int EOF = 258;
  991. public const int SLASH = 259;
  992. public const int SLASH2 = 260;
  993. public const int DOT = 261;
  994. public const int DOT2 = 262;
  995. public const int COLON = 263;
  996. public const int COLON2 = 264;
  997. public const int COMMA = 265;
  998. public const int AT = 266;
  999. public const int FUNCTION_NAME = 267;
  1000. public const int BRACKET_OPEN = 268;
  1001. public const int BRACKET_CLOSE = 269;
  1002. public const int PAREN_OPEN = 270;
  1003. public const int PAREN_CLOSE = 271;
  1004. public const int AND = 272;
  1005. public const int OR = 273;
  1006. public const int DIV = 274;
  1007. public const int MOD = 275;
  1008. public const int PLUS = 276;
  1009. public const int MINUS = 277;
  1010. public const int ASTERISK = 278;
  1011. public const int DOLLAR = 279;
  1012. public const int BAR = 280;
  1013. public const int EQ = 281;
  1014. public const int NE = 282;
  1015. public const int LE = 283;
  1016. public const int GE = 284;
  1017. public const int LT = 285;
  1018. public const int GT = 286;
  1019. public const int ANCESTOR = 287;
  1020. public const int ANCESTOR_OR_SELF = 288;
  1021. public const int ATTRIBUTE = 289;
  1022. public const int CHILD = 290;
  1023. public const int DESCENDANT = 291;
  1024. public const int DESCENDANT_OR_SELF = 292;
  1025. public const int FOLLOWING = 293;
  1026. public const int FOLLOWING_SIBLING = 294;
  1027. public const int NAMESPACE = 295;
  1028. public const int PARENT = 296;
  1029. public const int PRECEDING = 297;
  1030. public const int PRECEDING_SIBLING = 298;
  1031. public const int SELF = 299;
  1032. public const int COMMENT = 300;
  1033. public const int TEXT = 301;
  1034. public const int PROCESSING_INSTRUCTION = 302;
  1035. public const int NODE = 303;
  1036. public const int NUMBER = 304;
  1037. public const int LITERAL = 305;
  1038. public const int NCName = 306;
  1039. public const int yyErrorCode = 256;
  1040. }
  1041. namespace yyParser {
  1042. using System;
  1043. /** thrown for irrecoverable syntax errors and stack overflow.
  1044. */
  1045. public class yyException : System.Exception {
  1046. public yyException (string message) : base (message) {
  1047. }
  1048. }
  1049. /** must be implemented by a scanner object to supply input to the parser.
  1050. */
  1051. public interface yyInput {
  1052. /** move on to next token.
  1053. @return false if positioned beyond tokens.
  1054. @throws IOException on input error.
  1055. */
  1056. bool advance (); // throws java.io.IOException;
  1057. /** classifies current token.
  1058. Should not be called if advance() returned false.
  1059. @return current %token or single character.
  1060. */
  1061. int token ();
  1062. /** associated with current token.
  1063. Should not be called if advance() returned false.
  1064. @return value for token().
  1065. */
  1066. Object value ();
  1067. }
  1068. }
  1069. } // close outermost namespace, that MUST HAVE BEEN opened in the prolog