📄 pythongrammartokenmanager.java
字号:
break; case 8: if ((0xffffffffffffdbffL & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(8); break; case 10: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 91) kind = 91; jjCheckNAdd(10); break; case 11: if (curChar == 39 && kind > 100) kind = 100; break; case 12: if (curChar == 34 && kind > 101) kind = 101; break; case 13: if (curChar == 39 && kind > 102) kind = 102; break; case 14: if (curChar == 39) jjstateSet[jjnewStateCnt++] = 13; break; case 15: if (curChar == 39) jjstateSet[jjnewStateCnt++] = 14; break; case 16: if (curChar == 34 && kind > 103) kind = 103; break; case 17: if (curChar == 34) jjstateSet[jjnewStateCnt++] = 16; break; case 18: if (curChar == 34) jjstateSet[jjnewStateCnt++] = 17; break; case 19: if ((0x3fe000000000000L & l) == 0L) break; if (kind > 93) kind = 93; jjCheckNAddStates(16, 20); break; case 20: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 93) kind = 93; jjCheckNAddTwoStates(20, 21); break; case 22: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(27, 29); break; case 25: if (curChar != 48) break; if (kind > 93) kind = 93; jjCheckNAddStates(21, 26); break; case 27: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 94) kind = 94; jjAddStates(30, 31); break; case 29: if ((0xff000000000000L & l) == 0L) break; if (kind > 95) kind = 95; jjCheckNAddTwoStates(29, 30); break; case 31: if ((0x3fe000000000000L & l) != 0L) jjCheckNAddStates(32, 34); break; case 32: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(32, 34); break; case 33: if (curChar == 48) jjCheckNAdd(24); break; case 34: if (curChar == 46) jjCheckNAddTwoStates(35, 39); break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 96) kind = 96; jjCheckNAddTwoStates(35, 36); break; case 37: if ((0x280000000000L & l) != 0L) jjCheckNAdd(38); break; case 38: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 96) kind = 96; jjCheckNAdd(38); break; case 39: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(5, 7); break; case 41: if ((0x280000000000L & l) != 0L) jjCheckNAdd(42); break; case 42: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(42, 24); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(8, 15); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(50, 51); break; case 51: if (curChar != 46) break; if (kind > 96) kind = 96; jjCheckNAddTwoStates(52, 53); break; case 52: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 96) kind = 96; jjCheckNAddTwoStates(52, 53); break; case 54: if ((0x280000000000L & l) != 0L) jjCheckNAdd(55); break; case 55: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 96) kind = 96; jjCheckNAdd(55); break; case 56: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(56, 57); break; case 58: if ((0x280000000000L & l) != 0L) jjCheckNAdd(59); break; case 59: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 96) kind = 96; jjCheckNAdd(59); break; case 60: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(60, 61); break; case 62: if ((0x280000000000L & l) != 0L) jjCheckNAdd(63); break; case 63: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(63, 24); break; case 64: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(64, 65); break; case 65: if (curChar == 46) jjCheckNAddStates(35, 37); break; case 66: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(35, 37); break; case 68: if ((0x280000000000L & l) != 0L) jjCheckNAdd(69); break; case 69: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(69, 24); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 71: case 10: if ((0x7fffffe87fffffeL & l) == 0L) break; if (kind > 91) kind = 91; jjCheckNAdd(10); break; case 0: if ((0x7fffffe87fffffeL & l) != 0L) { if (kind > 91) kind = 91; jjCheckNAdd(10); } else if (curChar == 92) jjAddStates(0, 1); if ((0x4000000040000L & l) != 0L) jjCheckNAddStates(38, 41); else if ((0x20000000200000L & l) != 0L) jjCheckNAddStates(42, 49); break; case 8: if (kind > 16) kind = 16; jjstateSet[jjnewStateCnt++] = 8; break; case 9: if ((0x7fffffe87fffffeL & l) == 0L) break; if (kind > 91) kind = 91; jjCheckNAdd(10); break; case 21: if ((0x100000001000L & l) != 0L && kind > 93) kind = 93; break; case 23: if ((0x100000001000L & l) != 0L) jjstateSet[jjnewStateCnt++] = 24; break; case 24: if ((0x40000000400L & l) != 0L && kind > 97) kind = 97; break; case 26: if ((0x100000001000000L & l) != 0L) jjCheckNAdd(27); break; case 27: if ((0x7e0000007eL & l) == 0L) break; if (kind > 94) kind = 94; jjCheckNAddTwoStates(27, 28); break; case 28: if ((0x100000001000L & l) != 0L && kind > 94) kind = 94; break; case 30: if ((0x100000001000L & l) != 0L && kind > 95) kind = 95; break; case 36: if ((0x2000000020L & l) != 0L) jjAddStates(50, 51); break; case 40: if ((0x2000000020L & l) != 0L) jjAddStates(52, 53); break; case 43: if ((0x20000000200000L & l) != 0L) jjCheckNAddStates(42, 49); break; case 44: if ((0x4000000040000L & l) != 0L) jjCheckNAdd(11); break; case 45: if ((0x4000000040000L & l) != 0L) jjCheckNAdd(12); break; case 46: if ((0x4000000040000L & l) != 0L) jjCheckNAdd(15); break; case 47: if ((0x4000000040000L & l) != 0L) jjCheckNAdd(18); break; case 48: if ((0x4000000040000L & l) != 0L) jjCheckNAddStates(38, 41); break; case 53: if ((0x2000000020L & l) != 0L) jjAddStates(54, 55); break; case 57: if ((0x2000000020L & l) != 0L) jjAddStates(56, 57); break; case 61: if ((0x2000000020L & l) != 0L) jjAddStates(58, 59); break; case 67: if ((0x2000000020L & l) != 0L) jjAddStates(60, 61); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 8: if (!jjCanMove_0(hiByte, i1, i2, l1, l2)) break; if (kind > 16) kind = 16; jjstateSet[jjnewStateCnt++] = 8; break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 70 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}private final int jjStopStringLiteralDfa_7(int pos, long active0, long active1){ switch (pos) { case 0: if ((active1 & 0x100000000000L) != 0L) { jjmatchedKind = 114; return 2; } return -1; case 1: if ((active1 & 0x100000000000L) != 0L) { jjmatchedKind = 109; jjmatchedPos = 1; return -1; } return -1; default : return -1; }}private final int jjStartNfa_7(int pos, long active0, long active1){ return jjMoveNfa_7(jjStopStringLiteralDfa_7(pos, active0, active1), pos + 1);}private final int jjStartNfaWithStates_7(int pos, int kind, int state){ jjmatchedKind = kind; jjmatchedPos = pos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return pos + 1; } return jjMoveNfa_7(state, pos + 1);}private final int jjMoveStringLiteralDfa0_7(){ switch(curChar) { case 39: return jjStopAtPos(0, 104); case 92: return jjMoveStringLiteralDfa1_7(0x100000000000L); default : return jjMoveNfa_7(0, 0); }}private final int jjMoveStringLiteralDfa1_7(long active1){ try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { jjStopStringLiteralDfa_7(0, 0L, active1); return 1; } switch(curChar) { case 13: return jjMoveStringLiteralDfa2_7(active1, 0x100000000000L); default : break; } return jjStartNfa_7(0, 0L, active1);}private final int jjMoveStringLiteralDfa2_7(⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -