expressionparsertokenmanager.java
来自「jpda例子文件」· Java 代码 · 共 1,570 行 · 第 1/4 页
JAVA
1,570 行
catch(java.io.IOException e) { jjStopStringLiteralDfa_0(9, active0, 0L); return 10; } switch(curChar) { case 101: return jjMoveStringLiteralDfa11_0(active0, 0x2000000000000L); default : break; } return jjStartNfa_0(9, active0, 0L);}private final int jjMoveStringLiteralDfa11_0(long old0, long active0){ if (((active0 &= old0)) == 0L) return jjStartNfa_0(9, old0, 0L); try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { jjStopStringLiteralDfa_0(10, active0, 0L); return 11; } switch(curChar) { case 100: if ((active0 & 0x2000000000000L) != 0L) return jjStartNfaWithStates_0(11, 49, 28); break; 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 = 67; 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 0: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(0, 6); else if (curChar == 47) jjAddStates(7, 9); else if (curChar == 36) { if (kind > 67) kind = 67; jjCheckNAdd(28); } else if (curChar == 34) jjCheckNAddStates(10, 12); else if (curChar == 39) jjAddStates(13, 14); else if (curChar == 46) jjCheckNAdd(4); if ((0x3fe000000000000L & l) != 0L) { if (kind > 59) kind = 59; jjCheckNAddTwoStates(1, 2); } else if (curChar == 48) { if (kind > 59) kind = 59; jjCheckNAddStates(15, 17); } break; case 49: if (curChar == 42) jjCheckNAddTwoStates(62, 63); else if (curChar == 47) jjCheckNAddStates(18, 20); if (curChar == 42) jjstateSet[jjnewStateCnt++] = 54; break; case 1: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 59) kind = 59; jjCheckNAddTwoStates(1, 2); break; case 3: if (curChar == 46) jjCheckNAdd(4); break; case 4: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 63) kind = 63; jjCheckNAddStates(21, 23); break; case 6: if ((0x280000000000L & l) != 0L) jjCheckNAdd(7); break; case 7: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 63) kind = 63; jjCheckNAddTwoStates(7, 8); break; case 9: if (curChar == 39) jjAddStates(13, 14); break; case 10: if ((0xffffff7fffffdbffL & l) != 0L) jjCheckNAdd(11); break; case 11: if (curChar == 39 && kind > 65) kind = 65; 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(10, 12); break; case 19: if ((0xfffffffbffffdbffL & l) != 0L) jjCheckNAddStates(10, 12); break; case 21: if ((0x8400000000L & l) != 0L) jjCheckNAddStates(10, 12); break; case 22: if (curChar == 34 && kind > 66) kind = 66; break; case 23: if ((0xff000000000000L & l) != 0L) jjCheckNAddStates(24, 27); break; case 24: if ((0xff000000000000L & l) != 0L) jjCheckNAddStates(10, 12); 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 > 67) kind = 67; jjCheckNAdd(28); break; case 28: if ((0x3ff001000000000L & l) == 0L) break; if (kind > 67) kind = 67; jjCheckNAdd(28); break; case 29: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(0, 6); break; case 30: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(30, 31); break; case 31: if (curChar != 46) break; if (kind > 63) kind = 63; jjCheckNAddStates(28, 30); break; case 32: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 63) kind = 63; jjCheckNAddStates(28, 30); break; case 34: if ((0x280000000000L & l) != 0L) jjCheckNAdd(35); break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 63) kind = 63; 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 > 63) kind = 63; jjCheckNAddTwoStates(39, 8); break; case 40: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(31, 33); 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 > 59) kind = 59; jjCheckNAddStates(15, 17); break; case 46: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 59) kind = 59; jjCheckNAddTwoStates(46, 2); break; case 47: if ((0xff000000000000L & l) == 0L) break; if (kind > 59) kind = 59; jjCheckNAddTwoStates(47, 2); break; case 48: if (curChar == 47) jjAddStates(7, 9); break; case 50: if ((0xffffffffffffdbffL & l) != 0L) jjCheckNAddStates(18, 20); 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) jjCheckNAddTwoStates(55, 56); break; case 55: if ((0xfffffbffffffffffL & l) != 0L) jjCheckNAddTwoStates(55, 56); break; case 56: if (curChar == 42) jjCheckNAddStates(34, 36); break; case 57: if ((0xffff7bffffffffffL & l) != 0L) jjCheckNAddTwoStates(58, 56); break; case 58: if ((0xfffffbffffffffffL & l) != 0L) jjCheckNAddTwoStates(58, 56); break; case 59: if (curChar == 47 && kind > 7) kind = 7; break; case 60: if (curChar == 42) jjstateSet[jjnewStateCnt++] = 54; break; case 61: if (curChar == 42) jjCheckNAddTwoStates(62, 63); break; case 62: if ((0xfffffbffffffffffL & l) != 0L) jjCheckNAddTwoStates(62, 63); break; case 63: if (curChar == 42) jjCheckNAddStates(37, 39); break; case 64:
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?