📄 javaparsertokenmanager.java
字号:
default : break; } return jjStartNfa_0(10, active0, 0L);}private final void jjCheckNAdd(int state){ if (jjrounds[state] != jjround) { jjstateSet[jjnewStateCnt++] = state; jjrounds[state] = jjround; }}private final void jjAddStates(int start, int end){ do { jjstateSet[jjnewStateCnt++] = jjnextStates[start]; } while (start++ != end);}private final void jjCheckNAddTwoStates(int state1, int state2){ jjCheckNAdd(state1); jjCheckNAdd(state2);}private final void jjCheckNAddStates(int start, int end){ do { jjCheckNAdd(jjnextStates[start]); } while (start++ != end);}private final void jjCheckNAddStates(int start){ jjCheckNAdd(jjnextStates[start]); jjCheckNAdd(jjnextStates[start + 1]);}static final long[] jjbitVec0 = { 0xfffffffffffffffeL, 0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffffffffffffffL};static final long[] jjbitVec2 = { 0x0L, 0x0L, 0xffffffffffffffffL, 0xffffffffffffffffL};static final long[] jjbitVec3 = { 0x1ff00000fffffffeL, 0xffffffffffffc000L, 0xffffffffL, 0x600000000000000L};static final long[] jjbitVec4 = { 0x0L, 0x0L, 0x0L, 0xff7fffffff7fffffL};static final long[] jjbitVec5 = { 0x0L, 0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffffffffffffffL};static final long[] jjbitVec6 = { 0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffL, 0x0L};static final long[] jjbitVec7 = { 0xffffffffffffffffL, 0xffffffffffffffffL, 0x0L, 0x0L};static final long[] jjbitVec8 = { 0x3fffffffffffL, 0x0L, 0x0L, 0x0L};private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 57; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 49: if (curChar == 42) jjstateSet[jjnewStateCnt++] = 54; else if (curChar == 47) { if (kind > 6) kind = 6; jjCheckNAddStates(0, 2); } break; case 0: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 9); else if (curChar == 47) jjAddStates(10, 11); else if (curChar == 36) { if (kind > 71) kind = 71; jjCheckNAdd(28); } else if (curChar == 34) jjCheckNAddStates(12, 14); else if (curChar == 39) jjAddStates(15, 16); else if (curChar == 46) jjCheckNAdd(4); if ((0x3fe000000000000L & l) != 0L) { if (kind > 63) kind = 63; jjCheckNAddTwoStates(1, 2); } else if (curChar == 48) { if (kind > 63) kind = 63; jjCheckNAddStates(17, 19); } break; case 1: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 63) kind = 63; jjCheckNAddTwoStates(1, 2); break; case 3: if (curChar == 46) jjCheckNAdd(4); break; case 4: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 67) kind = 67; jjCheckNAddStates(20, 22); break; case 6: if ((0x280000000000L & l) != 0L) jjCheckNAdd(7); break; case 7: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 67) kind = 67; jjCheckNAddTwoStates(7, 8); break; case 9: if (curChar == 39) jjAddStates(15, 16); break; case 10: if ((0xffffff7fffffdbffL & l) != 0L) jjCheckNAdd(11); break; case 11: if (curChar == 39 && kind > 69) kind = 69; break; case 13: if ((0x8400000000L & l) != 0L) jjCheckNAdd(11); break; case 14: if ((0xff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 11); break; case 15: if ((0xff000000000000L & l) != 0L) jjCheckNAdd(11); break; case 16: if ((0xf000000000000L & l) != 0L) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0xff000000000000L & l) != 0L) jjCheckNAdd(15); break; case 18: if (curChar == 34) jjCheckNAddStates(12, 14); break; case 19: if ((0xfffffffbffffdbffL & l) != 0L) jjCheckNAddStates(12, 14); break; case 21: if ((0x8400000000L & l) != 0L) jjCheckNAddStates(12, 14); break; case 22: if (curChar == 34 && kind > 70) kind = 70; break; case 23: if ((0xff000000000000L & l) != 0L) jjCheckNAddStates(23, 26); break; case 24: if ((0xff000000000000L & l) != 0L) jjCheckNAddStates(12, 14); break; case 25: if ((0xf000000000000L & l) != 0L) jjstateSet[jjnewStateCnt++] = 26; break; case 26: if ((0xff000000000000L & l) != 0L) jjCheckNAdd(24); break; case 27: if (curChar != 36) break; if (kind > 71) kind = 71; jjCheckNAdd(28); break; case 28: if ((0x3ff001000000000L & l) == 0L) break; if (kind > 71) kind = 71; jjCheckNAdd(28); break; case 29: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 9); break; case 30: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(30, 31); break; case 31: if (curChar != 46) break; if (kind > 67) kind = 67; jjCheckNAddStates(27, 29); break; case 32: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 67) kind = 67; jjCheckNAddStates(27, 29); break; case 34: if ((0x280000000000L & l) != 0L) jjCheckNAdd(35); break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 67) kind = 67; jjCheckNAddTwoStates(35, 8); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x280000000000L & l) != 0L) jjCheckNAdd(39); break; case 39: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 67) kind = 67; jjCheckNAddTwoStates(39, 8); break; case 40: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(30, 32); break; case 42: if ((0x280000000000L & l) != 0L) jjCheckNAdd(43); break; case 43: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(43, 8); break; case 44: if (curChar != 48) break; if (kind > 63) kind = 63; jjCheckNAddStates(17, 19); break; case 46: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 63) kind = 63; jjCheckNAddTwoStates(46, 2); break; case 47: if ((0xff000000000000L & l) == 0L) break; if (kind > 63) kind = 63; jjCheckNAddTwoStates(47, 2); break; case 48: if (curChar == 47) jjAddStates(10, 11); break; case 50: if ((0xffffffffffffdbffL & l) == 0L) break; if (kind > 6) kind = 6; jjCheckNAddStates(0, 2); break; case 51: if ((0x2400L & l) != 0L && kind > 6) kind = 6; break; case 52: if (curChar == 10 && kind > 6) kind = 6; break; case 53: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 52; break; case 54: if (curChar == 42) jjstateSet[jjnewStateCnt++] = 55; break; case 55: if ((0xffff7fffffffffffL & l) != 0L && kind > 7) kind = 7; break; case 56: if (curChar == 42) jjstateSet[jjnewStateCnt++] = 54; break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 0: case 28: if ((0x7fffffe87fffffeL & l) == 0L) break; if (kind > 71) kind = 71; jjCheckNAdd(28); break; case 2: if ((0x100000001000L & l) != 0L && kind > 63) kind = 63; break; case 5: if ((0x2000000020L & l) != 0L) jjAddStates(33, 34); break; case 8: if ((0x5000000050L & l) != 0L && kind > 67) kind = 67; break; case 10: if ((0xffffffffefffffffL & l) != 0L) jjCheckNAdd(11); break; case 12: if (curChar == 92) jjAddStates(35, 37); break; case 13: if ((0x14404410000000L & l) != 0L) jjCheckNAdd(11); break; case 19: if ((0xffffffffefffffffL & l) != 0L) jjCheckNAddStates(12, 14); break; case 20: if (curChar == 92) jjAddStates(38, 40); break; case 21: if ((0x14404410000000L & l) != 0L) jjCheckNAddStates(12, 14); break; case 33: if ((0x2000000020L & l) != 0L) jjAddStates(41, 42); break; case 37: if ((0x2000000020L & l) != 0L) jjAddStates(43, 44); break; case 41: if ((0x2000000020L & l) != 0L) jjAddStates(45, 46); break; case 45: if ((0x100000001000000L & l) != 0L) jjCheckNAdd(46); break; case 46: if ((0x7e0000007eL & l) == 0L) break; if (kind > 63) kind = 63; jjCheckNAddTwoStates(46, 2);
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -