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