PageRenderTime 61ms CodeModel.GetById 25ms RepoModel.GetById 0ms app.codeStats 1ms

/bundles/plugins-trunk/XML/sidekick/css/parser/CSS2ParserTokenManager.java

#
Java | 1921 lines | 1913 code | 4 blank | 4 comment | 776 complexity | ee4c76a7dc5bea33e5659e143254961b MD5 | raw file
Possible License(s): BSD-3-Clause, AGPL-1.0, Apache-2.0, LGPL-2.0, LGPL-3.0, GPL-2.0, CC-BY-SA-3.0, LGPL-2.1, GPL-3.0, MPL-2.0-no-copyleft-exception, IPL-1.0

Large files files are truncated, but you can click here to view the full file

  1. /* Generated By:JavaCC: Do not edit this line. CSS2ParserTokenManager.java */
  2. package sidekick.css.parser;
  3. import java.io.*;
  4. import java.net.*;
  5. import java.text.MessageFormat;
  6. import java.util.*;
  7. import java.util.regex.*;
  8. import sidekick.util.*;
  9. /** Token Manager. */
  10. public class CSS2ParserTokenManager implements CSS2ParserConstants
  11. {
  12. private boolean _quiet = true;
  13. private String trimBy(CharSequence s, int left, int right) {
  14. int end = s.length();
  15. return s.toString().substring(left, end-right);
  16. }
  17. private String trimUrl(CharSequence s) {
  18. StringBuffer s1 = new StringBuffer( trimBy(s, 4, 1).trim() );
  19. if (s1.length() == 0)
  20. {
  21. return s1.toString();
  22. }
  23. int end = s1.length() - 1;
  24. if ((s1.charAt(0) == '"' && s1.charAt(end) == '"')
  25. || (s1.charAt(0) == '\u005c'' && s1.charAt(end) == '\u005c''))
  26. return trimBy(s1, 1, 1);
  27. else
  28. return s1.toString();
  29. }
  30. /** Debug output. */
  31. public java.io.PrintStream debugStream = System.out;
  32. /** Set debug output. */
  33. public void setDebugStream(java.io.PrintStream ds) { debugStream = ds; }
  34. private final int jjStopStringLiteralDfa_0(int pos, long active0)
  35. {
  36. switch (pos)
  37. {
  38. case 0:
  39. if ((active0 & 0x7c0000000L) != 0L)
  40. return 61;
  41. if ((active0 & 0x100002000000000L) != 0L)
  42. {
  43. jjmatchedKind = 58;
  44. return 426;
  45. }
  46. if ((active0 & 0x400L) != 0L)
  47. return 427;
  48. if ((active0 & 0x8010000L) != 0L)
  49. return 426;
  50. return -1;
  51. case 1:
  52. if ((active0 & 0x100002008000000L) != 0L)
  53. {
  54. jjmatchedKind = 58;
  55. jjmatchedPos = 1;
  56. return 426;
  57. }
  58. if ((active0 & 0x7c0000000L) != 0L)
  59. {
  60. jjmatchedKind = 35;
  61. jjmatchedPos = 1;
  62. return 428;
  63. }
  64. return -1;
  65. case 2:
  66. if ((active0 & 0x7c0000000L) != 0L)
  67. {
  68. jjmatchedKind = 35;
  69. jjmatchedPos = 2;
  70. return 428;
  71. }
  72. if ((active0 & 0x100002000000000L) != 0L)
  73. {
  74. jjmatchedKind = 58;
  75. jjmatchedPos = 2;
  76. return 426;
  77. }
  78. return -1;
  79. case 3:
  80. if ((active0 & 0x2000000000L) != 0L)
  81. {
  82. jjmatchedKind = 58;
  83. jjmatchedPos = 3;
  84. return 426;
  85. }
  86. if ((active0 & 0x7c0000000L) != 0L)
  87. {
  88. jjmatchedKind = 35;
  89. jjmatchedPos = 3;
  90. return 428;
  91. }
  92. return -1;
  93. case 4:
  94. if ((active0 & 0x80000000L) != 0L)
  95. return 428;
  96. if ((active0 & 0x740000000L) != 0L)
  97. {
  98. jjmatchedKind = 35;
  99. jjmatchedPos = 4;
  100. return 428;
  101. }
  102. if ((active0 & 0x2000000000L) != 0L)
  103. {
  104. jjmatchedKind = 58;
  105. jjmatchedPos = 4;
  106. return 426;
  107. }
  108. return -1;
  109. case 5:
  110. if ((active0 & 0x100000000L) != 0L)
  111. return 428;
  112. if ((active0 & 0x640000000L) != 0L)
  113. {
  114. jjmatchedKind = 35;
  115. jjmatchedPos = 5;
  116. return 428;
  117. }
  118. if ((active0 & 0x2000000000L) != 0L)
  119. {
  120. jjmatchedKind = 58;
  121. jjmatchedPos = 5;
  122. return 426;
  123. }
  124. return -1;
  125. case 6:
  126. if ((active0 & 0x40000000L) != 0L)
  127. return 428;
  128. if ((active0 & 0x2000000000L) != 0L)
  129. return 426;
  130. if ((active0 & 0x600000000L) != 0L)
  131. {
  132. jjmatchedKind = 35;
  133. jjmatchedPos = 6;
  134. return 428;
  135. }
  136. return -1;
  137. case 7:
  138. if ((active0 & 0x400000000L) != 0L)
  139. return 428;
  140. if ((active0 & 0x200000000L) != 0L)
  141. {
  142. jjmatchedKind = 35;
  143. jjmatchedPos = 7;
  144. return 428;
  145. }
  146. return -1;
  147. case 8:
  148. if ((active0 & 0x200000000L) != 0L)
  149. {
  150. jjmatchedKind = 35;
  151. jjmatchedPos = 8;
  152. return 428;
  153. }
  154. return -1;
  155. default :
  156. return -1;
  157. }
  158. }
  159. private final int jjStartNfa_0(int pos, long active0)
  160. {
  161. return jjMoveNfa_0(jjStopStringLiteralDfa_0(pos, active0), pos + 1);
  162. }
  163. private int jjStopAtPos(int pos, int kind)
  164. {
  165. jjmatchedKind = kind;
  166. jjmatchedPos = pos;
  167. return pos + 1;
  168. }
  169. private int jjMoveStringLiteralDfa0_0()
  170. {
  171. switch(curChar)
  172. {
  173. case 41:
  174. return jjStopAtPos(0, 23);
  175. case 42:
  176. return jjStopAtPos(0, 13);
  177. case 43:
  178. return jjStopAtPos(0, 15);
  179. case 44:
  180. return jjStopAtPos(0, 9);
  181. case 45:
  182. jjmatchedKind = 16;
  183. return jjMoveStringLiteralDfa1_0(0x8000000L);
  184. case 46:
  185. return jjStartNfaWithStates_0(0, 10, 427);
  186. case 47:
  187. jjmatchedKind = 14;
  188. return jjMoveStringLiteralDfa1_0(0x4L);
  189. case 58:
  190. return jjStopAtPos(0, 12);
  191. case 59:
  192. return jjStopAtPos(0, 11);
  193. case 60:
  194. return jjMoveStringLiteralDfa1_0(0x4000008L);
  195. case 61:
  196. return jjStopAtPos(0, 17);
  197. case 62:
  198. return jjStopAtPos(0, 18);
  199. case 64:
  200. return jjMoveStringLiteralDfa1_0(0x7c0000000L);
  201. case 91:
  202. return jjStopAtPos(0, 19);
  203. case 93:
  204. return jjStopAtPos(0, 20);
  205. case 73:
  206. case 105:
  207. return jjMoveStringLiteralDfa1_0(0x2000000000L);
  208. case 82:
  209. case 114:
  210. return jjMoveStringLiteralDfa1_0(0x100000000000000L);
  211. case 123:
  212. return jjStopAtPos(0, 7);
  213. case 124:
  214. return jjMoveStringLiteralDfa1_0(0x20000000L);
  215. case 125:
  216. return jjStopAtPos(0, 8);
  217. case 126:
  218. return jjMoveStringLiteralDfa1_0(0x10000000L);
  219. default :
  220. return jjMoveNfa_0(1, 0);
  221. }
  222. }
  223. private int jjMoveStringLiteralDfa1_0(long active0)
  224. {
  225. try { curChar = input_stream.readChar(); }
  226. catch(java.io.IOException e) {
  227. jjStopStringLiteralDfa_0(0, active0);
  228. return 1;
  229. }
  230. switch(curChar)
  231. {
  232. case 33:
  233. return jjMoveStringLiteralDfa2_0(active0, 0x4000000L);
  234. case 37:
  235. if ((active0 & 0x8L) != 0L)
  236. return jjStopAtPos(1, 3);
  237. break;
  238. case 42:
  239. if ((active0 & 0x4L) != 0L)
  240. return jjStopAtPos(1, 2);
  241. break;
  242. case 45:
  243. return jjMoveStringLiteralDfa2_0(active0, 0x8000000L);
  244. case 61:
  245. if ((active0 & 0x10000000L) != 0L)
  246. return jjStopAtPos(1, 28);
  247. else if ((active0 & 0x20000000L) != 0L)
  248. return jjStopAtPos(1, 29);
  249. break;
  250. case 67:
  251. case 99:
  252. return jjMoveStringLiteralDfa2_0(active0, 0x400000000L);
  253. case 70:
  254. case 102:
  255. return jjMoveStringLiteralDfa2_0(active0, 0x200000000L);
  256. case 71:
  257. case 103:
  258. return jjMoveStringLiteralDfa2_0(active0, 0x100000000000000L);
  259. case 73:
  260. case 105:
  261. return jjMoveStringLiteralDfa2_0(active0, 0x40000000L);
  262. case 77:
  263. case 109:
  264. return jjMoveStringLiteralDfa2_0(active0, 0x100000000L);
  265. case 78:
  266. case 110:
  267. return jjMoveStringLiteralDfa2_0(active0, 0x2000000000L);
  268. case 80:
  269. case 112:
  270. return jjMoveStringLiteralDfa2_0(active0, 0x80000000L);
  271. default :
  272. break;
  273. }
  274. return jjStartNfa_0(0, active0);
  275. }
  276. private int jjMoveStringLiteralDfa2_0(long old0, long active0)
  277. {
  278. if (((active0 &= old0)) == 0L)
  279. return jjStartNfa_0(0, old0);
  280. try { curChar = input_stream.readChar(); }
  281. catch(java.io.IOException e) {
  282. jjStopStringLiteralDfa_0(1, active0);
  283. return 2;
  284. }
  285. switch(curChar)
  286. {
  287. case 45:
  288. return jjMoveStringLiteralDfa3_0(active0, 0x4000000L);
  289. case 62:
  290. if ((active0 & 0x8000000L) != 0L)
  291. return jjStopAtPos(2, 27);
  292. break;
  293. case 65:
  294. case 97:
  295. return jjMoveStringLiteralDfa3_0(active0, 0x80000000L);
  296. case 66:
  297. case 98:
  298. return jjMoveStringLiteralDfa3_0(active0, 0x100000000000000L);
  299. case 69:
  300. case 101:
  301. return jjMoveStringLiteralDfa3_0(active0, 0x100000000L);
  302. case 72:
  303. case 104:
  304. return jjMoveStringLiteralDfa3_0(active0, 0x2400000000L);
  305. case 77:
  306. case 109:
  307. return jjMoveStringLiteralDfa3_0(active0, 0x40000000L);
  308. case 79:
  309. case 111:
  310. return jjMoveStringLiteralDfa3_0(active0, 0x200000000L);
  311. default :
  312. break;
  313. }
  314. return jjStartNfa_0(1, active0);
  315. }
  316. private int jjMoveStringLiteralDfa3_0(long old0, long active0)
  317. {
  318. if (((active0 &= old0)) == 0L)
  319. return jjStartNfa_0(1, old0);
  320. try { curChar = input_stream.readChar(); }
  321. catch(java.io.IOException e) {
  322. jjStopStringLiteralDfa_0(2, active0);
  323. return 3;
  324. }
  325. switch(curChar)
  326. {
  327. case 40:
  328. if ((active0 & 0x100000000000000L) != 0L)
  329. return jjStopAtPos(3, 56);
  330. break;
  331. case 45:
  332. if ((active0 & 0x4000000L) != 0L)
  333. return jjStopAtPos(3, 26);
  334. break;
  335. case 65:
  336. case 97:
  337. return jjMoveStringLiteralDfa4_0(active0, 0x400000000L);
  338. case 68:
  339. case 100:
  340. return jjMoveStringLiteralDfa4_0(active0, 0x100000000L);
  341. case 69:
  342. case 101:
  343. return jjMoveStringLiteralDfa4_0(active0, 0x2000000000L);
  344. case 71:
  345. case 103:
  346. return jjMoveStringLiteralDfa4_0(active0, 0x80000000L);
  347. case 78:
  348. case 110:
  349. return jjMoveStringLiteralDfa4_0(active0, 0x200000000L);
  350. case 80:
  351. case 112:
  352. return jjMoveStringLiteralDfa4_0(active0, 0x40000000L);
  353. default :
  354. break;
  355. }
  356. return jjStartNfa_0(2, active0);
  357. }
  358. private int jjMoveStringLiteralDfa4_0(long old0, long active0)
  359. {
  360. if (((active0 &= old0)) == 0L)
  361. return jjStartNfa_0(2, old0);
  362. try { curChar = input_stream.readChar(); }
  363. catch(java.io.IOException e) {
  364. jjStopStringLiteralDfa_0(3, active0);
  365. return 4;
  366. }
  367. switch(curChar)
  368. {
  369. case 69:
  370. case 101:
  371. if ((active0 & 0x80000000L) != 0L)
  372. return jjStartNfaWithStates_0(4, 31, 428);
  373. break;
  374. case 73:
  375. case 105:
  376. return jjMoveStringLiteralDfa5_0(active0, 0x100000000L);
  377. case 79:
  378. case 111:
  379. return jjMoveStringLiteralDfa5_0(active0, 0x40000000L);
  380. case 82:
  381. case 114:
  382. return jjMoveStringLiteralDfa5_0(active0, 0x2400000000L);
  383. case 84:
  384. case 116:
  385. return jjMoveStringLiteralDfa5_0(active0, 0x200000000L);
  386. default :
  387. break;
  388. }
  389. return jjStartNfa_0(3, active0);
  390. }
  391. private int jjMoveStringLiteralDfa5_0(long old0, long active0)
  392. {
  393. if (((active0 &= old0)) == 0L)
  394. return jjStartNfa_0(3, old0);
  395. try { curChar = input_stream.readChar(); }
  396. catch(java.io.IOException e) {
  397. jjStopStringLiteralDfa_0(4, active0);
  398. return 5;
  399. }
  400. switch(curChar)
  401. {
  402. case 45:
  403. return jjMoveStringLiteralDfa6_0(active0, 0x200000000L);
  404. case 65:
  405. case 97:
  406. if ((active0 & 0x100000000L) != 0L)
  407. return jjStartNfaWithStates_0(5, 32, 428);
  408. break;
  409. case 73:
  410. case 105:
  411. return jjMoveStringLiteralDfa6_0(active0, 0x2000000000L);
  412. case 82:
  413. case 114:
  414. return jjMoveStringLiteralDfa6_0(active0, 0x40000000L);
  415. case 83:
  416. case 115:
  417. return jjMoveStringLiteralDfa6_0(active0, 0x400000000L);
  418. default :
  419. break;
  420. }
  421. return jjStartNfa_0(4, active0);
  422. }
  423. private int jjMoveStringLiteralDfa6_0(long old0, long active0)
  424. {
  425. if (((active0 &= old0)) == 0L)
  426. return jjStartNfa_0(4, old0);
  427. try { curChar = input_stream.readChar(); }
  428. catch(java.io.IOException e) {
  429. jjStopStringLiteralDfa_0(5, active0);
  430. return 6;
  431. }
  432. switch(curChar)
  433. {
  434. case 69:
  435. case 101:
  436. return jjMoveStringLiteralDfa7_0(active0, 0x400000000L);
  437. case 70:
  438. case 102:
  439. return jjMoveStringLiteralDfa7_0(active0, 0x200000000L);
  440. case 84:
  441. case 116:
  442. if ((active0 & 0x40000000L) != 0L)
  443. return jjStartNfaWithStates_0(6, 30, 428);
  444. else if ((active0 & 0x2000000000L) != 0L)
  445. return jjStartNfaWithStates_0(6, 37, 426);
  446. break;
  447. default :
  448. break;
  449. }
  450. return jjStartNfa_0(5, active0);
  451. }
  452. private int jjMoveStringLiteralDfa7_0(long old0, long active0)
  453. {
  454. if (((active0 &= old0)) == 0L)
  455. return jjStartNfa_0(5, old0);
  456. try { curChar = input_stream.readChar(); }
  457. catch(java.io.IOException e) {
  458. jjStopStringLiteralDfa_0(6, active0);
  459. return 7;
  460. }
  461. switch(curChar)
  462. {
  463. case 65:
  464. case 97:
  465. return jjMoveStringLiteralDfa8_0(active0, 0x200000000L);
  466. case 84:
  467. case 116:
  468. if ((active0 & 0x400000000L) != 0L)
  469. return jjStartNfaWithStates_0(7, 34, 428);
  470. break;
  471. default :
  472. break;
  473. }
  474. return jjStartNfa_0(6, active0);
  475. }
  476. private int jjMoveStringLiteralDfa8_0(long old0, long active0)
  477. {
  478. if (((active0 &= old0)) == 0L)
  479. return jjStartNfa_0(6, old0);
  480. try { curChar = input_stream.readChar(); }
  481. catch(java.io.IOException e) {
  482. jjStopStringLiteralDfa_0(7, active0);
  483. return 8;
  484. }
  485. switch(curChar)
  486. {
  487. case 67:
  488. case 99:
  489. return jjMoveStringLiteralDfa9_0(active0, 0x200000000L);
  490. default :
  491. break;
  492. }
  493. return jjStartNfa_0(7, active0);
  494. }
  495. private int jjMoveStringLiteralDfa9_0(long old0, long active0)
  496. {
  497. if (((active0 &= old0)) == 0L)
  498. return jjStartNfa_0(7, old0);
  499. try { curChar = input_stream.readChar(); }
  500. catch(java.io.IOException e) {
  501. jjStopStringLiteralDfa_0(8, active0);
  502. return 9;
  503. }
  504. switch(curChar)
  505. {
  506. case 69:
  507. case 101:
  508. if ((active0 & 0x200000000L) != 0L)
  509. return jjStartNfaWithStates_0(9, 33, 428);
  510. break;
  511. default :
  512. break;
  513. }
  514. return jjStartNfa_0(8, active0);
  515. }
  516. private int jjStartNfaWithStates_0(int pos, int kind, int state)
  517. {
  518. jjmatchedKind = kind;
  519. jjmatchedPos = pos;
  520. try { curChar = input_stream.readChar(); }
  521. catch(java.io.IOException e) { return pos + 1; }
  522. return jjMoveNfa_0(state, pos + 1);
  523. }
  524. static final long[] jjbitVec0 = {
  525. 0xfffffffffffffffeL, 0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffffffffffffffL
  526. };
  527. static final long[] jjbitVec2 = {
  528. 0x0L, 0x0L, 0xffffffffffffffffL, 0xffffffffffffffffL
  529. };
  530. private int jjMoveNfa_0(int startState, int curPos)
  531. {
  532. int startsAt = 0;
  533. jjnewStateCnt = 426;
  534. int i = 1;
  535. jjstateSet[0] = startState;
  536. int kind = 0x7fffffff;
  537. for (;;)
  538. {
  539. if (++jjround == 0x7fffffff)
  540. ReInitRounds();
  541. if (curChar < 64)
  542. {
  543. long l = 1L << curChar;
  544. do
  545. {
  546. switch(jjstateSet[--i])
  547. {
  548. case 428:
  549. case 62:
  550. if ((0x3ff200000000000L & l) == 0L)
  551. break;
  552. if (kind > 35)
  553. kind = 35;
  554. jjCheckNAddTwoStates(62, 63);
  555. break;
  556. case 427:
  557. if ((0x3ff000000000000L & l) != 0L)
  558. {
  559. if (kind > 60)
  560. kind = 60;
  561. jjCheckNAdd(308);
  562. }
  563. if ((0x3ff000000000000L & l) != 0L)
  564. {
  565. if (kind > 55)
  566. kind = 55;
  567. jjCheckNAdd(307);
  568. }
  569. if ((0x3ff000000000000L & l) != 0L)
  570. jjCheckNAddTwoStates(305, 306);
  571. if ((0x3ff000000000000L & l) != 0L)
  572. jjCheckNAddStates(0, 2);
  573. if ((0x3ff000000000000L & l) != 0L)
  574. jjCheckNAddTwoStates(270, 273);
  575. if ((0x3ff000000000000L & l) != 0L)
  576. jjCheckNAddTwoStates(267, 269);
  577. if ((0x3ff000000000000L & l) != 0L)
  578. jjCheckNAddTwoStates(265, 266);
  579. if ((0x3ff000000000000L & l) != 0L)
  580. jjCheckNAddTwoStates(262, 264);
  581. if ((0x3ff000000000000L & l) != 0L)
  582. jjCheckNAddTwoStates(257, 261);
  583. if ((0x3ff000000000000L & l) != 0L)
  584. jjCheckNAddTwoStates(253, 256);
  585. if ((0x3ff000000000000L & l) != 0L)
  586. jjCheckNAddTwoStates(249, 252);
  587. if ((0x3ff000000000000L & l) != 0L)
  588. jjCheckNAddTwoStates(246, 248);
  589. if ((0x3ff000000000000L & l) != 0L)
  590. jjCheckNAddTwoStates(243, 245);
  591. if ((0x3ff000000000000L & l) != 0L)
  592. jjCheckNAddTwoStates(240, 242);
  593. if ((0x3ff000000000000L & l) != 0L)
  594. jjCheckNAddTwoStates(237, 239);
  595. if ((0x3ff000000000000L & l) != 0L)
  596. jjCheckNAddTwoStates(234, 236);
  597. if ((0x3ff000000000000L & l) != 0L)
  598. jjCheckNAddTwoStates(231, 233);
  599. if ((0x3ff000000000000L & l) != 0L)
  600. jjCheckNAddTwoStates(228, 230);
  601. if ((0x3ff000000000000L & l) != 0L)
  602. jjCheckNAddTwoStates(225, 227);
  603. break;
  604. case 61:
  605. if (curChar != 45)
  606. break;
  607. if (kind > 35)
  608. kind = 35;
  609. jjCheckNAddTwoStates(62, 63);
  610. break;
  611. case 1:
  612. if ((0x3ff000000000000L & l) != 0L)
  613. {
  614. if (kind > 55)
  615. kind = 55;
  616. jjCheckNAddStates(3, 77);
  617. }
  618. else if ((0x100003600L & l) != 0L)
  619. {
  620. if (kind > 1)
  621. kind = 1;
  622. jjCheckNAdd(0);
  623. }
  624. else if (curChar == 45)
  625. {
  626. if (kind > 58)
  627. kind = 58;
  628. jjCheckNAddStates(78, 82);
  629. }
  630. else if (curChar == 46)
  631. jjCheckNAddStates(83, 101);
  632. else if (curChar == 33)
  633. jjCheckNAddTwoStates(92, 101);
  634. else if (curChar == 39)
  635. jjCheckNAddStates(102, 104);
  636. else if (curChar == 34)
  637. jjCheckNAddStates(105, 107);
  638. else if (curChar == 35)
  639. jjCheckNAddTwoStates(2, 3);
  640. break;
  641. case 426:
  642. if ((0x3ff200000000000L & l) != 0L)
  643. {
  644. if (kind > 58)
  645. kind = 58;
  646. jjCheckNAddTwoStates(327, 328);
  647. }
  648. else if (curChar == 40)
  649. {
  650. if (kind > 57)
  651. kind = 57;
  652. }
  653. if ((0x3ff200000000000L & l) != 0L)
  654. jjCheckNAddStates(108, 110);
  655. break;
  656. case 0:
  657. if ((0x100003600L & l) == 0L)
  658. break;
  659. if (kind > 1)
  660. kind = 1;
  661. jjCheckNAdd(0);
  662. break;
  663. case 2:
  664. if ((0x3ff200000000000L & l) == 0L)
  665. break;
  666. if (kind > 21)
  667. kind = 21;
  668. jjCheckNAddTwoStates(2, 3);
  669. break;
  670. case 4:
  671. if ((0xffffffff00000000L & l) == 0L)
  672. break;
  673. if (kind > 21)
  674. kind = 21;
  675. jjCheckNAddTwoStates(2, 3);
  676. break;
  677. case 5:
  678. if ((0x3ff000000000000L & l) == 0L)
  679. break;
  680. if (kind > 21)
  681. kind = 21;
  682. jjCheckNAddStates(111, 118);
  683. break;
  684. case 6:
  685. if ((0x3ff000000000000L & l) == 0L)
  686. break;
  687. if (kind > 21)
  688. kind = 21;
  689. jjCheckNAddStates(119, 121);
  690. break;
  691. case 7:
  692. if ((0x100003600L & l) == 0L)
  693. break;
  694. if (kind > 21)
  695. kind = 21;
  696. jjCheckNAddTwoStates(2, 3);
  697. break;
  698. case 8:
  699. case 10:
  700. case 13:
  701. case 17:
  702. if ((0x3ff000000000000L & l) != 0L)
  703. jjCheckNAdd(6);
  704. break;
  705. case 9:
  706. if ((0x3ff000000000000L & l) != 0L)
  707. jjstateSet[jjnewStateCnt++] = 10;
  708. break;
  709. case 11:
  710. if ((0x3ff000000000000L & l) != 0L)
  711. jjstateSet[jjnewStateCnt++] = 12;
  712. break;
  713. case 12:
  714. if ((0x3ff000000000000L & l) != 0L)
  715. jjstateSet[jjnewStateCnt++] = 13;
  716. break;
  717. case 14:
  718. if ((0x3ff000000000000L & l) != 0L)
  719. jjstateSet[jjnewStateCnt++] = 15;
  720. break;
  721. case 15:
  722. if ((0x3ff000000000000L & l) != 0L)
  723. jjstateSet[jjnewStateCnt++] = 16;
  724. break;
  725. case 16:
  726. if ((0x3ff000000000000L & l) != 0L)
  727. jjstateSet[jjnewStateCnt++] = 17;
  728. break;
  729. case 18:
  730. if (curChar == 34)
  731. jjCheckNAddStates(105, 107);
  732. break;
  733. case 19:
  734. if ((0xfffffffb00000200L & l) != 0L)
  735. jjCheckNAddStates(105, 107);
  736. break;
  737. case 20:
  738. if (curChar == 34 && kind > 22)
  739. kind = 22;
  740. break;
  741. case 22:
  742. if ((0x3400L & l) != 0L)
  743. jjCheckNAddStates(105, 107);
  744. break;
  745. case 23:
  746. if (curChar == 10)
  747. jjCheckNAddStates(105, 107);
  748. break;
  749. case 24:
  750. if (curChar == 13)
  751. jjstateSet[jjnewStateCnt++] = 23;
  752. break;
  753. case 25:
  754. if ((0xffffffff00000000L & l) != 0L)
  755. jjCheckNAddStates(105, 107);
  756. break;
  757. case 26:
  758. if ((0x3ff000000000000L & l) != 0L)
  759. jjCheckNAddStates(122, 130);
  760. break;
  761. case 27:
  762. if ((0x3ff000000000000L & l) != 0L)
  763. jjCheckNAddStates(131, 134);
  764. break;
  765. case 28:
  766. if ((0x100003600L & l) != 0L)
  767. jjCheckNAddStates(105, 107);
  768. break;
  769. case 29:
  770. case 31:
  771. case 34:
  772. case 38:
  773. if ((0x3ff000000000000L & l) != 0L)
  774. jjCheckNAdd(27);
  775. break;
  776. case 30:
  777. if ((0x3ff000000000000L & l) != 0L)
  778. jjstateSet[jjnewStateCnt++] = 31;
  779. break;
  780. case 32:
  781. if ((0x3ff000000000000L & l) != 0L)
  782. jjstateSet[jjnewStateCnt++] = 33;
  783. break;
  784. case 33:
  785. if ((0x3ff000000000000L & l) != 0L)
  786. jjstateSet[jjnewStateCnt++] = 34;
  787. break;
  788. case 35:
  789. if ((0x3ff000000000000L & l) != 0L)
  790. jjstateSet[jjnewStateCnt++] = 36;
  791. break;
  792. case 36:
  793. if ((0x3ff000000000000L & l) != 0L)
  794. jjstateSet[jjnewStateCnt++] = 37;
  795. break;
  796. case 37:
  797. if ((0x3ff000000000000L & l) != 0L)
  798. jjstateSet[jjnewStateCnt++] = 38;
  799. break;
  800. case 39:
  801. if (curChar == 39)
  802. jjCheckNAddStates(102, 104);
  803. break;
  804. case 40:
  805. if ((0xffffff7f00000200L & l) != 0L)
  806. jjCheckNAddStates(102, 104);
  807. break;
  808. case 41:
  809. if (curChar == 39 && kind > 22)
  810. kind = 22;
  811. break;
  812. case 43:
  813. if ((0x3400L & l) != 0L)
  814. jjCheckNAddStates(102, 104);
  815. break;
  816. case 44:
  817. if (curChar == 10)
  818. jjCheckNAddStates(102, 104);
  819. break;
  820. case 45:
  821. if (curChar == 13)
  822. jjstateSet[jjnewStateCnt++] = 44;
  823. break;
  824. case 46:
  825. if ((0xffffffff00000000L & l) != 0L)
  826. jjCheckNAddStates(102, 104);
  827. break;
  828. case 47:
  829. if ((0x3ff000000000000L & l) != 0L)
  830. jjCheckNAddStates(135, 143);
  831. break;
  832. case 48:
  833. if ((0x3ff000000000000L & l) != 0L)
  834. jjCheckNAddStates(144, 147);
  835. break;
  836. case 49:
  837. if ((0x100003600L & l) != 0L)
  838. jjCheckNAddStates(102, 104);
  839. break;
  840. case 50:
  841. case 52:
  842. case 55:
  843. case 59:
  844. if ((0x3ff000000000000L & l) != 0L)
  845. jjCheckNAdd(48);
  846. break;
  847. case 51:
  848. if ((0x3ff000000000000L & l) != 0L)
  849. jjstateSet[jjnewStateCnt++] = 52;
  850. break;
  851. case 53:
  852. if ((0x3ff000000000000L & l) != 0L)
  853. jjstateSet[jjnewStateCnt++] = 54;
  854. break;
  855. case 54:
  856. if ((0x3ff000000000000L & l) != 0L)
  857. jjstateSet[jjnewStateCnt++] = 55;
  858. break;
  859. case 56:
  860. if ((0x3ff000000000000L & l) != 0L)
  861. jjstateSet[jjnewStateCnt++] = 57;
  862. break;
  863. case 57:
  864. if ((0x3ff000000000000L & l) != 0L)
  865. jjstateSet[jjnewStateCnt++] = 58;
  866. break;
  867. case 58:
  868. if ((0x3ff000000000000L & l) != 0L)
  869. jjstateSet[jjnewStateCnt++] = 59;
  870. break;
  871. case 64:
  872. if ((0xffffffff00000000L & l) == 0L)
  873. break;
  874. if (kind > 35)
  875. kind = 35;
  876. jjCheckNAddTwoStates(62, 63);
  877. break;
  878. case 65:
  879. if ((0x3ff000000000000L & l) == 0L)
  880. break;
  881. if (kind > 35)
  882. kind = 35;
  883. jjCheckNAddStates(148, 155);
  884. break;
  885. case 66:
  886. if ((0x3ff000000000000L & l) == 0L)
  887. break;
  888. if (kind > 35)
  889. kind = 35;
  890. jjCheckNAddStates(156, 158);
  891. break;
  892. case 67:
  893. if ((0x100003600L & l) == 0L)
  894. break;
  895. if (kind > 35)
  896. kind = 35;
  897. jjCheckNAddTwoStates(62, 63);
  898. break;
  899. case 68:
  900. case 70:
  901. case 73:
  902. case 77:
  903. if ((0x3ff000000000000L & l) != 0L)
  904. jjCheckNAdd(66);
  905. break;
  906. case 69:
  907. if ((0x3ff000000000000L & l) != 0L)
  908. jjstateSet[jjnewStateCnt++] = 70;
  909. break;
  910. case 71:
  911. if ((0x3ff000000000000L & l) != 0L)
  912. jjstateSet[jjnewStateCnt++] = 72;
  913. break;
  914. case 72:
  915. if ((0x3ff000000000000L & l) != 0L)
  916. jjstateSet[jjnewStateCnt++] = 73;
  917. break;
  918. case 74:
  919. if ((0x3ff000000000000L & l) != 0L)
  920. jjstateSet[jjnewStateCnt++] = 75;
  921. break;
  922. case 75:
  923. if ((0x3ff000000000000L & l) != 0L)
  924. jjstateSet[jjnewStateCnt++] = 76;
  925. break;
  926. case 76:
  927. if ((0x3ff000000000000L & l) != 0L)
  928. jjstateSet[jjnewStateCnt++] = 77;
  929. break;
  930. case 79:
  931. if ((0x3ff000000000000L & l) == 0L)
  932. break;
  933. if (kind > 35)
  934. kind = 35;
  935. jjCheckNAddStates(159, 166);
  936. break;
  937. case 80:
  938. if ((0x3ff000000000000L & l) == 0L)
  939. break;
  940. if (kind > 35)
  941. kind = 35;
  942. jjCheckNAddStates(167, 169);
  943. break;
  944. case 81:
  945. case 83:
  946. case 86:
  947. case 90:
  948. if ((0x3ff000000000000L & l) != 0L)
  949. jjCheckNAdd(80);
  950. break;
  951. case 82:
  952. if ((0x3ff000000000000L & l) != 0L)
  953. jjstateSet[jjnewStateCnt++] = 83;
  954. break;
  955. case 84:
  956. if ((0x3ff000000000000L & l) != 0L)
  957. jjstateSet[jjnewStateCnt++] = 85;
  958. break;
  959. case 85:
  960. if ((0x3ff000000000000L & l) != 0L)
  961. jjstateSet[jjnewStateCnt++] = 86;
  962. break;
  963. case 87:
  964. if ((0x3ff000000000000L & l) != 0L)
  965. jjstateSet[jjnewStateCnt++] = 88;
  966. break;
  967. case 88:
  968. if ((0x3ff000000000000L & l) != 0L)
  969. jjstateSet[jjnewStateCnt++] = 89;
  970. break;
  971. case 89:
  972. if ((0x3ff000000000000L & l) != 0L)
  973. jjstateSet[jjnewStateCnt++] = 90;
  974. break;
  975. case 91:
  976. if (curChar == 33)
  977. jjCheckNAddTwoStates(92, 101);
  978. break;
  979. case 92:
  980. if ((0x100003600L & l) != 0L)
  981. jjCheckNAddTwoStates(92, 101);
  982. break;
  983. case 103:
  984. if (curChar == 40)
  985. jjCheckNAddStates(170, 175);
  986. break;
  987. case 104:
  988. if ((0xfffffc7a00000000L & l) != 0L)
  989. jjCheckNAddStates(176, 179);
  990. break;
  991. case 105:
  992. if ((0x100003600L & l) != 0L)
  993. jjCheckNAddTwoStates(105, 106);
  994. break;
  995. case 106:
  996. if (curChar == 41 && kind > 25)
  997. kind = 25;
  998. break;
  999. case 108:
  1000. if ((0xffffffff00000000L & l) != 0L)
  1001. jjCheckNAddStates(176, 179);
  1002. break;
  1003. case 109:
  1004. if ((0x3ff000000000000L & l) != 0L)
  1005. jjCheckNAddStates(180, 188);
  1006. break;
  1007. case 110:
  1008. if ((0x3ff000000000000L & l) != 0L)
  1009. jjCheckNAddStates(189, 192);
  1010. break;
  1011. case 111:
  1012. if ((0x100003600L & l) != 0L)
  1013. jjCheckNAddStates(176, 179);
  1014. break;
  1015. case 112:
  1016. case 114:
  1017. case 117:
  1018. case 121:
  1019. if ((0x3ff000000000000L & l) != 0L)
  1020. jjCheckNAdd(110);
  1021. break;
  1022. case 113:
  1023. if ((0x3ff000000000000L & l) != 0L)
  1024. jjstateSet[jjnewStateCnt++] = 114;
  1025. break;
  1026. case 115:
  1027. if ((0x3ff000000000000L & l) != 0L)
  1028. jjstateSet[jjnewStateCnt++] = 116;
  1029. break;
  1030. case 116:
  1031. if ((0x3ff000000000000L & l) != 0L)
  1032. jjstateSet[jjnewStateCnt++] = 117;
  1033. break;
  1034. case 118:
  1035. if ((0x3ff000000000000L & l) != 0L)
  1036. jjstateSet[jjnewStateCnt++] = 119;
  1037. break;
  1038. case 119:
  1039. if ((0x3ff000000000000L & l) != 0L)
  1040. jjstateSet[jjnewStateCnt++] = 120;
  1041. break;
  1042. case 120:
  1043. if ((0x3ff000000000000L & l) != 0L)
  1044. jjstateSet[jjnewStateCnt++] = 121;
  1045. break;
  1046. case 122:
  1047. if (curChar == 39)
  1048. jjCheckNAddStates(193, 195);
  1049. break;
  1050. case 123:
  1051. if ((0xffffff7f00000200L & l) != 0L)
  1052. jjCheckNAddStates(193, 195);
  1053. break;
  1054. case 124:
  1055. if (curChar == 39)
  1056. jjCheckNAddTwoStates(105, 106);
  1057. break;
  1058. case 126:
  1059. if ((0x3400L & l) != 0L)
  1060. jjCheckNAddStates(193, 195);
  1061. break;
  1062. case 127:
  1063. if (curChar == 10)
  1064. jjCheckNAddStates(193, 195);
  1065. break;
  1066. case 128:
  1067. if (curChar == 13)
  1068. jjstateSet[jjnewStateCnt++] = 127;
  1069. break;
  1070. case 129:
  1071. if ((0xffffffff00000000L & l) != 0L)
  1072. jjCheckNAddStates(193, 195);
  1073. break;
  1074. case 130:
  1075. if ((0x3ff000000000000L & l) != 0L)
  1076. jjCheckNAddStates(196, 204);
  1077. break;
  1078. case 131:
  1079. if ((0x3ff000000000000L & l) != 0L)
  1080. jjCheckNAddStates(205, 208);
  1081. break;
  1082. case 132:
  1083. if ((0x100003600L & l) != 0L)
  1084. jjCheckNAddStates(193, 195);
  1085. break;
  1086. case 133:
  1087. case 135:
  1088. case 138:
  1089. case 142:
  1090. if ((0x3ff000000000000L & l) != 0L)
  1091. jjCheckNAdd(131);
  1092. break;
  1093. case 134:
  1094. if ((0x3ff000000000000L & l) != 0L)
  1095. jjstateSet[jjnewStateCnt++] = 135;
  1096. break;
  1097. case 136:
  1098. if ((0x3ff000000000000L & l) != 0L)
  1099. jjstateSet[jjnewStateCnt++] = 137;
  1100. break;
  1101. case 137:
  1102. if ((0x3ff000000000000L & l) != 0L)
  1103. jjstateSet[jjnewStateCnt++] = 138;
  1104. break;
  1105. case 139:
  1106. if ((0x3ff000000000000L & l) != 0L)
  1107. jjstateSet[jjnewStateCnt++] = 140;
  1108. break;
  1109. case 140:
  1110. if ((0x3ff000000000000L & l) != 0L)
  1111. jjstateSet[jjnewStateCnt++] = 141;
  1112. break;
  1113. case 141:
  1114. if ((0x3ff000000000000L & l) != 0L)
  1115. jjstateSet[jjnewStateCnt++] = 142;
  1116. break;
  1117. case 143:
  1118. if (curChar == 34)
  1119. jjCheckNAddStates(209, 211);
  1120. break;
  1121. case 144:
  1122. if ((0xfffffffb00000200L & l) != 0L)
  1123. jjCheckNAddStates(209, 211);
  1124. break;
  1125. case 145:
  1126. if (curChar == 34)
  1127. jjCheckNAddTwoStates(105, 106);
  1128. break;
  1129. case 147:
  1130. if ((0x3400L & l) != 0L)
  1131. jjCheckNAddStates(209, 211);
  1132. break;
  1133. case 148:
  1134. if (curChar == 10)
  1135. jjCheckNAddStates(209, 211);
  1136. break;
  1137. case 149:
  1138. if (curChar == 13)
  1139. jjstateSet[jjnewStateCnt++] = 148;
  1140. break;
  1141. case 150:
  1142. if ((0xffffffff00000000L & l) != 0L)
  1143. jjCheckNAddStates(209, 211);
  1144. break;
  1145. case 151:
  1146. if ((0x3ff000000000000L & l) != 0L)
  1147. jjCheckNAddStates(212, 220);
  1148. break;
  1149. case 152:
  1150. if ((0x3ff000000000000L & l) != 0L)
  1151. jjCheckNAddStates(221, 224);
  1152. break;
  1153. case 153:
  1154. if ((0x100003600L & l) != 0L)
  1155. jjCheckNAddStates(209, 211);
  1156. break;
  1157. case 154:
  1158. case 156:
  1159. case 159:
  1160. case 163:
  1161. if ((0x3ff000000000000L & l) != 0L)
  1162. jjCheckNAdd(152);
  1163. break;
  1164. case 155:
  1165. if ((0x3ff000000000000L & l) != 0L)
  1166. jjstateSet[jjnewStateCnt++] = 156;
  1167. break;
  1168. case 157:
  1169. if ((0x3ff000000000000L & l) != 0L)
  1170. jjstateSet[jjnewStateCnt++] = 158;
  1171. break;
  1172. case 158:
  1173. if ((0x3ff000000000000L & l) != 0L)
  1174. jjstateSet[jjnewStateCnt++] = 159;
  1175. break;
  1176. case 160:
  1177. if ((0x3ff000000000000L & l) != 0L)
  1178. jjstateSet[jjnewStateCnt++] = 161;
  1179. break;
  1180. case 161:
  1181. if ((0x3ff000000000000L & l) != 0L)
  1182. jjstateSet[jjnewStateCnt++] = 162;
  1183. break;
  1184. case 162:
  1185. if ((0x3ff000000000000L & l) != 0L)
  1186. jjstateSet[jjnewStateCnt++] = 163;
  1187. break;
  1188. case 164:
  1189. if ((0x100003600L & l) != 0L)
  1190. jjCheckNAddStates(225, 231);
  1191. break;
  1192. case 167:
  1193. if (curChar == 43)
  1194. jjCheckNAddStates(232, 234);
  1195. break;
  1196. case 168:
  1197. case 197:
  1198. if (curChar == 63 && kind > 61)
  1199. kind = 61;
  1200. break;
  1201. case 169:
  1202. if ((0x3ff000000000000L & l) == 0L)
  1203. break;
  1204. if (kind > 61)
  1205. kind = 61;
  1206. jjCheckNAddStates(235, 243);
  1207. break;
  1208. case 170:
  1209. if ((0x3ff000000000000L & l) != 0L)
  1210. jjCheckNAdd(171);
  1211. break;
  1212. case 171:
  1213. if (curChar == 45)
  1214. jjstateSet[jjnewStateCnt++] = 172;
  1215. break;
  1216. case 172:
  1217. if ((0x3ff000000000000L & l) == 0L)
  1218. break;
  1219. if (kind > 61)
  1220. kind = 61;
  1221. jjCheckNAddStates(244, 248);
  1222. break;
  1223. case 173:
  1224. if ((0x3ff000000000000L & l) != 0L && kind > 61)
  1225. kind = 61;
  1226. break;
  1227. case 174:
  1228. case 176:
  1229. case 179:
  1230. case 183:
  1231. if ((0x3ff000000000000L & l) != 0L)
  1232. jjCheckNAdd(173);
  1233. break;
  1234. case 175:
  1235. if ((0x3ff000000000000L & l) != 0L)
  1236. jjstateSet[jjnewStateCnt++] = 176;
  1237. break;
  1238. case 177:
  1239. if ((0x3ff000000000000L & l) != 0L)
  1240. jjstateSet[jjnewStateCnt++] = 178;
  1241. break;
  1242. case 178:
  1243. if ((0x3ff000000000000L & l) != 0L)
  1244. jjstateSet[jjnewStateCnt++] = 179;
  1245. break;
  1246. case 180:
  1247. if ((0x3ff000000000000L & l) != 0L)
  1248. jjstateSet[jjnewStateCnt++] = 181;
  1249. break;
  1250. case 181:
  1251. if ((0x3ff000000000000L & l) != 0L)
  1252. jjstateSet[jjnewStateCnt++] = 182;
  1253. break;
  1254. case 182:
  1255. if ((0x3ff000000000000L & l) != 0L)
  1256. jjstateSet[jjnewStateCnt++] = 183;
  1257. break;
  1258. case 184:
  1259. case 186:
  1260. case 189:
  1261. case 193:
  1262. if ((0x3ff000000000000L & l) != 0L)
  1263. jjCheckNAdd(170);
  1264. break;
  1265. case 185:
  1266. if ((0x3ff000000000000L & l) != 0L)
  1267. jjstateSet[jjnewStateCnt++] = 186;
  1268. break;
  1269. case 187:
  1270. if ((0x3ff000000000000L & l) != 0L)
  1271. jjstateSet[jjnewStateCnt++] = 188;
  1272. break;
  1273. case 188:
  1274. if ((0x3ff000000000000L & l) != 0L)
  1275. jjstateSet[jjnewStateCnt++] = 189;
  1276. break;
  1277. case 190:
  1278. if ((0x3ff000000000000L & l) != 0L)
  1279. jjstateSet[jjnewStateCnt++] = 191;
  1280. break;
  1281. case 191:
  1282. if ((0x3ff000000000000L & l) != 0L)
  1283. jjstateSet[jjnewStateCnt++] = 192;
  1284. break;
  1285. case 192:
  1286. if ((0x3ff000000000000L & l) != 0L)
  1287. jjstateSet[jjnewStateCnt++] = 193;
  1288. break;
  1289. case 194:
  1290. if ((0x3ff000000000000L & l) == 0L)
  1291. break;
  1292. if (kind > 61)
  1293. kind = 61;
  1294. jjCheckNAddStates(249, 251);
  1295. break;
  1296. case 195:
  1297. if ((0x3ff000000000000L & l) == 0L)
  1298. break;
  1299. if (kind > 61)
  1300. kind = 61;
  1301. jjCheckNAddStates(252, 254);
  1302. break;
  1303. case 196:
  1304. if ((0x3ff000000000000L & l) == 0L)
  1305. break;
  1306. if (kind > 61)
  1307. kind = 61;
  1308. jjCheckNAddStates(255, 257);
  1309. break;
  1310. case 198:
  1311. case 201:
  1312. case 203:
  1313. case 204:
  1314. case 207:
  1315. case 208:
  1316. case 210:
  1317. case 214:
  1318. case 218:
  1319. case 221:
  1320. case 223:
  1321. if (curChar == 63)
  1322. jjCheckNAdd(197);
  1323. break;
  1324. case 199:
  1325. if ((0x3ff000000000000L & l) == 0L)
  1326. break;
  1327. if (kind > 61)
  1328. kind = 61;
  1329. jjCheckNAddTwoStates(168, 173);
  1330. break;
  1331. case 200:
  1332. if (curChar == 63)
  1333. jjCheckNAddTwoStates(197, 201);
  1334. break;
  1335. case 202:
  1336. if (curChar == 63)
  1337. jjCheckNAddStates(258, 260);
  1338. break;
  1339. case 205:
  1340. if (curChar == 63)
  1341. jjstateSet[jjnewStateCnt++] = 204;
  1342. break;
  1343. case 206:
  1344. if (curChar == 63)
  1345. jjCheckNAddStates(261, 264);
  1346. break;
  1347. case 209:
  1348. if (curChar == 63)
  1349. jjstateSet[jjnewStateCnt++] = 208;
  1350. break;
  1351. case 211:
  1352. if (curChar == 63)
  1353. jjstateSet[jjnewStateCnt++] = 210;
  1354. break;
  1355. case 212:
  1356. if (curChar == 63)
  1357. jjstateSet[jjnewStateCnt++] = 211;
  1358. break;
  1359. case 213:
  1360. if (curChar == 63)
  1361. jjCheckNAddStates(265, 269);
  1362. break;
  1363. case 215:
  1364. if (curChar == 63)
  1365. jjstateSet[jjnewStateCnt++] = 214;
  1366. break;
  1367. case 216:
  1368. if (curChar == 63)
  1369. jjstateSet[jjnewStateCnt++] = 215;
  1370. break;
  1371. case 217:
  1372. if (curChar == 63)
  1373. jjstateSet[jjnewStateCnt++] = 216;
  1374. break;
  1375. case 219:
  1376. if (curChar == 63)
  1377. jjstateSet[jjnewStateCnt++] = 218;
  1378. break;
  1379. case 220:
  1380. if (curChar == 63)
  1381. jjstateSet[jjnewStateCnt++] = 219;
  1382. break;
  1383. case 222:
  1384. if (curChar == 63)
  1385. jjstateSet[jjnewStateCnt++] = 221;
  1386. break;
  1387. case 224:
  1388. if (curChar == 46)
  1389. jjCheckNAddStates(83, 101);
  1390. break;
  1391. case 225:
  1392. if ((0x3ff000000000000L & l) != 0L)
  1393. jjCheckNAddTwoStates(225, 227);
  1394. break;
  1395. case 228:
  1396. if ((0x3ff000000000000L & l) != 0L)
  1397. jjCheckNAddTwoStates(228, 230);
  1398. break;
  1399. case 231:
  1400. if ((0x3ff000000000000L & l) != 0L)
  1401. jjCheckNAddTwoStates(231, 233);
  1402. break;
  1403. case 234:
  1404. if ((0x3ff000000000000L & l) != 0L)
  1405. jjCheckNAddTwoStates(234, 236);
  1406. break;
  1407. case 237:
  1408. if ((0x3ff000000000000L & l) != 0L)
  1409. jjCheckNAddTwoStates(237, 239);
  1410. break;
  1411. case 240:
  1412. if ((0x3ff000000000000L & l) != 0L)
  1413. jjCheckNAddTwoStates(240, 242);
  1414. break;
  1415. case 243:
  1416. if ((0x3ff000000000000L & l) != 0L)
  1417. jjCheckNAddTwoStates(243, 245);
  1418. break;
  1419. case 246:
  1420. if ((0x3ff000000000000L & l) != 0L)
  1421. jjCheckNAddTwoStates(246, 248);
  1422. break;
  1423. case 249:
  1424. if ((0x3ff000000000000L & l) != 0L)
  1425. jjCheckNAddTwoStates(249, 252);
  1426. break;
  1427. case 253:
  1428. if ((0x3ff000000000000L & l) != 0L)
  1429. jjCheckNAddTwoStates(253, 256);
  1430. break;
  1431. case 257:
  1432. if ((0x3ff000000000000L & l) != 0L)
  1433. jjCheckNAddTwoStates(257, 261);
  1434. break;
  1435. case 262:
  1436. if ((0x3ff000000000000L & l) != 0L)
  1437. jjCheckNAddTwoStates(262, 264);
  1438. break;
  1439. case 265:
  1440. if ((0x3ff000000000000L & l) != 0L)
  1441. jjCheckNAddTwoStates(265, 266);
  1442. break;
  1443. case 267:
  1444. if ((0x3ff000000000000L & l) != 0L)
  1445. jjCheckNAddTwoStates(267, 269);
  1446. break;
  1447. case 270:
  1448. if ((0x3ff000000000000L & l) != 0L)
  1449. jjCheckNAddTwoStates(270, 273);
  1450. break;
  1451. case 274:
  1452. if ((0x3ff000000000000L & l) != 0L)
  1453. jjCheckNAddStates(0, 2);
  1454. break;
  1455. case 275:
  1456. if (curChar != 45)
  1457. break;
  1458. if (kind > 53)
  1459. kind = 53;
  1460. jjCheckNAddTwoStates(276, 277);
  1461. break;
  1462. case 276:
  1463. if ((0x3ff200000000000L & l) == 0L)
  1464. break;
  1465. if (kind > 53)
  1466. kind = 53;
  1467. jjCheckNAddTwoStates(276, 277);
  1468. break;
  1469. case 278:
  1470. if ((0xffffffff00000000L & l) == 0L)
  1471. break;
  1472. if (kind > 53)
  1473. kind = 53;
  1474. jjCheckNAddTwoStates(276, 277);
  1475. break;
  1476. case 279:
  1477. if ((0x3ff000000000000L & l) == 0L)
  1478. break;
  1479. if (kind > 53)
  1480. kind = 53;
  1481. jjCheckNAddStates(270, 277);
  1482. break;
  1483. case 280:
  1484. if ((0x3ff000000000000L & l) == 0L)
  1485. break;
  1486. if (kind > 53)
  1487. kind = 53;
  1488. jjCheckNAddStates(278, 280);
  1489. break;
  1490. case 281:
  1491. if ((0x100003600L & l) == 0L)
  1492. break;
  1493. if (kind > 53)
  1494. kin

Large files files are truncated, but you can click here to view the full file