⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 serqlparsertokenmanager.java

📁 这是外国一个开源推理机
💻 JAVA
📖 第 1 页 / 共 4 页
字号:
      case 115:         if ((active0 & 0x4000000000000L) != 0L)            return jjStartNfaWithStates_0(4, 50, 72);         return jjMoveStringLiteralDfa5_0(active0, 0x100000800000L);      case 84:      case 116:         if ((active0 & 0x20000000L) != 0L)            return jjStartNfaWithStates_0(4, 29, 72);         return jjMoveStringLiteralDfa5_0(active0, 0x80820002000000L);      default :         break;   }   return jjStartNfa_0(3, active0);}private final int jjMoveStringLiteralDfa5_0(long old0, long active0){   if (((active0 &= old0)) == 0L)      return jjStartNfa_0(3, old0);    try { curChar = input_stream.readChar(); }   catch(java.io.IOException e) {      jjStopStringLiteralDfa_0(4, active0);      return 5;   }   switch(curChar)   {      case 68:      case 100:         return jjMoveStringLiteralDfa6_0(active0, 0x200000000000L);      case 69:      case 101:         if ((active0 & 0x2000000000L) != 0L)            return jjStartNfaWithStates_0(5, 37, 72);         return jjMoveStringLiteralDfa6_0(active0, 0x800000000000L);      case 78:      case 110:         return jjMoveStringLiteralDfa6_0(active0, 0x40004000000L);      case 79:      case 111:         return jjMoveStringLiteralDfa6_0(active0, 0x100000000000L);      case 80:      case 112:         return jjMoveStringLiteralDfa6_0(active0, 0x800000L);      case 82:      case 114:         return jjMoveStringLiteralDfa6_0(active0, 0x2000000L);      case 83:      case 115:         if ((active0 & 0x80000000000000L) != 0L)            return jjStartNfaWithStates_0(5, 55, 72);         return jjMoveStringLiteralDfa6_0(active0, 0x8000000000000L);      case 84:      case 116:         if ((active0 & 0x1000000L) != 0L)            return jjStartNfaWithStates_0(5, 24, 72);         else if ((active0 & 0x40000000L) != 0L)            return jjStartNfaWithStates_0(5, 30, 72);         break;      case 89:      case 121:         return jjMoveStringLiteralDfa6_0(active0, 0x20000000000L);      default :         break;   }   return jjStartNfa_0(4, active0);}private final int jjMoveStringLiteralDfa6_0(long old0, long active0){   if (((active0 &= old0)) == 0L)      return jjStartNfa_0(4, old0);    try { curChar = input_stream.readChar(); }   catch(java.io.IOException e) {      jjStopStringLiteralDfa_0(5, active0);      return 6;   }   switch(curChar)   {      case 65:      case 97:         return jjMoveStringLiteralDfa7_0(active0, 0x40000800000L);      case 67:      case 99:         return jjMoveStringLiteralDfa7_0(active0, 0x4000000L);      case 69:      case 101:         if ((active0 & 0x200000000000L) != 0L)            return jjStartNfaWithStates_0(6, 45, 72);         return jjMoveStringLiteralDfa7_0(active0, 0x8000000000000L);      case 80:      case 112:         return jjMoveStringLiteralDfa7_0(active0, 0x20000000000L);      case 82:      case 114:         return jjMoveStringLiteralDfa7_0(active0, 0x800000000000L);      case 85:      case 117:         return jjMoveStringLiteralDfa7_0(active0, 0x100002000000L);      default :         break;   }   return jjStartNfa_0(5, active0);}private final int jjMoveStringLiteralDfa7_0(long old0, long active0){   if (((active0 &= old0)) == 0L)      return jjStartNfa_0(5, old0);    try { curChar = input_stream.readChar(); }   catch(java.io.IOException e) {      jjStopStringLiteralDfa_0(6, active0);      return 7;   }   switch(curChar)   {      case 65:      case 97:         return jjMoveStringLiteralDfa8_0(active0, 0x800000000000L);      case 67:      case 99:         return jjMoveStringLiteralDfa8_0(active0, 0x8000002800000L);      case 69:      case 101:         if ((active0 & 0x20000000000L) != 0L)            return jjStartNfaWithStates_0(7, 41, 72);         break;      case 77:      case 109:         return jjMoveStringLiteralDfa8_0(active0, 0x40000000000L);      case 82:      case 114:         return jjMoveStringLiteralDfa8_0(active0, 0x100000000000L);      case 84:      case 116:         if ((active0 & 0x4000000L) != 0L)            return jjStartNfaWithStates_0(7, 26, 72);         break;      default :         break;   }   return jjStartNfa_0(6, active0);}private final int jjMoveStringLiteralDfa8_0(long old0, long active0){   if (((active0 &= old0)) == 0L)      return jjStartNfa_0(6, old0);    try { curChar = input_stream.readChar(); }   catch(java.io.IOException e) {      jjStopStringLiteralDfa_0(7, active0);      return 8;   }   switch(curChar)   {      case 67:      case 99:         return jjMoveStringLiteralDfa9_0(active0, 0x100000000000L);      case 69:      case 101:         if ((active0 & 0x800000L) != 0L)            return jjStartNfaWithStates_0(8, 23, 72);         else if ((active0 & 0x40000000000L) != 0L)            return jjStartNfaWithStates_0(8, 42, 72);         break;      case 76:      case 108:         if ((active0 & 0x800000000000L) != 0L)            return jjStartNfaWithStates_0(8, 47, 72);         break;      case 84:      case 116:         if ((active0 & 0x2000000L) != 0L)            return jjStartNfaWithStates_0(8, 25, 72);         else if ((active0 & 0x8000000000000L) != 0L)            return jjStartNfaWithStates_0(8, 51, 72);         break;      default :         break;   }   return jjStartNfa_0(7, active0);}private final int jjMoveStringLiteralDfa9_0(long old0, long active0){   if (((active0 &= old0)) == 0L)      return jjStartNfa_0(7, old0);    try { curChar = input_stream.readChar(); }   catch(java.io.IOException e) {      jjStopStringLiteralDfa_0(8, active0);      return 9;   }   switch(curChar)   {      case 69:      case 101:         if ((active0 & 0x100000000000L) != 0L)            return jjStartNfaWithStates_0(9, 44, 72);         break;      default :         break;   }   return jjStartNfa_0(8, active0);}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 = {   0x1600L, 0x0L, 0x0L, 0x0L};static final long[] jjbitVec4 = {   0x0L, 0xffc000000000L, 0x0L, 0xffc000000000L};static final long[] jjbitVec5 = {   0x0L, 0x3ff00000000L, 0x0L, 0x3ff000000000000L};static final long[] jjbitVec6 = {   0x0L, 0xffc000000000L, 0x0L, 0xff8000000000L};static final long[] jjbitVec7 = {   0x0L, 0xffc000000000L, 0x0L, 0x0L};static final long[] jjbitVec8 = {   0x0L, 0x3ff0000L, 0x0L, 0x3ff0000L};static final long[] jjbitVec9 = {   0x3ff00000000L, 0x0L, 0x0L, 0x0L};static final long[] jjbitVec10 = {   0x0L, 0xffffffffffffc000L, 0xfffff0007fffffffL, 0x7fffffL};static final long[] jjbitVec11 = {   0x0L, 0x0L, 0x0L, 0xff7fffffff7fffffL};static final long[] jjbitVec12 = {   0x7ff3ffffffffffffL, 0x7ffffffffffffdfeL, 0xffffffffffffffffL, 0xfc31ffffffffe00fL};static final long[] jjbitVec13 = {   0xffffffL, 0xffffffffffff0000L, 0xf80001ffffffffffL, 0x3L};static final long[] jjbitVec14 = {   0x0L, 0x0L, 0xfffffffbffffd740L, 0xffffffc7f7fffL};static final long[] jjbitVec15 = {   0xffffffffffffdffeL, 0xffffffffdffeffffL, 0xffffffffffff0003L, 0x33fcfffffff199fL};static final long[] jjbitVec16 = {   0xfffe000000000000L, 0xfffffffe027fffffL, 0x7fL, 0x707ffffff0000L};static final long[] jjbitVec17 = {   0x7fffffe00000000L, 0xfffe0000000007feL, 0x7cffffffffffffffL, 0x60002f7fffL};static final long[] jjbitVec18 = {   0x23ffffffffffffe0L, 0x3ff000000L, 0x3c5fdfffff99fe0L, 0x30003b0000000L};static final long[] jjbitVec19 = {   0x36dfdfffff987e0L, 0x1c00005e000000L, 0x23edfdfffffbafe0L, 0x100000000L};static final long[] jjbitVec20 = {   0x23cdfdfffff99fe0L, 0x3b0000000L, 0x3bfc718d63dc7e0L, 0x0L};static final long[] jjbitVec21 = {   0x3effdfffffddfe0L, 0x300000000L, 0x3effdfffffddfe0L, 0x340000000L};static final long[] jjbitVec22 = {   0x3fffdfffffddfe0L, 0x300000000L, 0x0L, 0x0L};static final long[] jjbitVec23 = {   0xd7ffffffffffeL, 0x3fL, 0x200d6caefef02596L, 0x1fL};static final long[] jjbitVec24 = {   0x0L, 0x3fffffffeffL, 0x0L, 0x0L};static final long[] jjbitVec25 = {   0x0L, 0x0L, 0xffffffff00000000L, 0x7fffffffff003fL};static final long[] jjbitVec26 = {   0x500000000007daedL, 0x2c62ab82315001L, 0xf580c90040000000L, 0x201080000000007L};static final long[] jjbitVec27 = {   0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffffff0fffffffL, 0x3ffffffffffffffL};static final long[] jjbitVec28 = {   0xffffffff3f3fffffL, 0x3fffffffaaff3f3fL, 0x5fdfffffffffffffL, 0x1fdc1fff0fcf1fdcL};static final long[] jjbitVec29 = {   0x4c4000000000L, 0x0L, 0x7L, 0x0L};static final long[] jjbitVec30 = {   0x3fe00000080L, 0xfffffffffffffffeL, 0xfffffffe001fffffL, 0x7ffffffffffffffL};static final long[] jjbitVec31 = {   0x1fffffffffe0L, 0x0L, 0x0L, 0x0L};static final long[] jjbitVec32 = {   0xffffffffffffffffL, 0xffffffffffffffffL, 0x3fffffffffL, 0x0L};static final long[] jjbitVec33 = {   0xffffffffffffffffL, 0xffffffffffffffffL, 0xfffffffffL, 0x0L};static final long[] jjbitVec34 = {   0x0L, 0x0L, 0x80000000000000L, 0xff7fffffff7fffffL};static final long[] jjbitVec35 = {   0xffffffL, 0xffffffffffff0000L, 0xf80001ffffffffffL, 0x30003L};static final long[] jjbitVec36 = {   0xffffffffffffffffL, 0x30000003fL, 0xfffffffbffffd7c0L, 0xffffffc7f7fffL};static final long[] jjbitVec37 = {   0xffffffffffffdffeL, 0xffffffffdffeffffL, 0xffffffffffff007bL, 0x33fcfffffff199fL};static final long[] jjbitVec38 = {   0xfffe000000000000L, 0xfffffffe027fffffL, 0xbbfffffbfffe007fL, 0x707ffffff0016L};static final long[] jjbitVec39 = {   0x7fffffe00000000L, 0xffff03ff0007ffffL, 0x7cffffffffffffffL, 0x3ff3dffffef7fffL};static final long[] jjbitVec40 = {   0xf3ffffffffffffeeL, 0xffcfff1e3fffL, 0xd3c5fdfffff99feeL, 0x3ffcfb080399fL};static final long[] jjbitVec41 = {   0xd36dfdfffff987e4L, 0x1fffc05e003987L, 0xf3edfdfffffbafeeL, 0xffc100003bbfL};static final long[] jjbitVec42 = {   0xf3cdfdfffff99feeL, 0xffc3b0c0398fL, 0xc3bfc718d63dc7ecL, 0xff8000803dc7L};static final long[] jjbitVec43 = {   0xc3effdfffffddfeeL, 0xffc300603ddfL, 0xc3effdfffffddfecL, 0xffc340603ddfL};static final long[] jjbitVec44 = {   0xc3fffdfffffddfecL, 0xffc300803dcfL, 0x0L, 0x0L};static final long[] jjbitVec45 = {   0x7ff7ffffffffffeL, 0x3ff7fffL, 0x3bff6caefef02596L, 0x3ff3f5fL};static final long[] jjbitVec46 = {   0xc2a003ff03000000L, 0xfffe03fffffffeffL, 0x2fe3ffffebf0fdfL, 0x0L};static final long[] jjbitVec47 = {   0x0L, 0x0L, 0x0L, 0x21fff0000L};static final long[] jjbitVec48 = {   0x3efffe000000a0L, 0xfffffffffffffffeL, 0xfffffffe661fffffL, 0x77ffffffffffffffL};private final int jjMoveNfa_0(int startState, int curPos){   int[] nextStates;   int startsAt = 0;   jjnewStateCnt = 72;   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)                  {                     if (kind > 81)                        kind = 81;                     jjCheckNAddStates(0, 2);                  }                  else if ((0x280000000000L & l) != 0L)                     jjCheckNAddTwoStates(60, 61);                  else if (curChar == 46)                     jjCheckNAdd(62);                  else if (curChar == 60)                     jjstateSet[jjnewStateCnt++] = 46;                  else if (curChar == 34)                     jjCheckNAddStates(3, 5);                  else if (curChar == 35)                  {                     if (kind > 5)                        kind = 5;                     jjCheckNAddStates(6, 8);                  }                  if (curChar == 45)                     jjCheckNAdd(58);                  else if (curChar == 43)                     jjCheckNAdd(56);                  break;               case 72:                  if ((0x3ff600000000000L & l) != 0L)                  {                     if (kind > 72)                        kind = 72;                     jjCheckNAdd(67);                  }                  else if (curChar == 58)                  {                     if (kind > 71)                        kind = 71;                     jjCheckNAdd(66);                  }                  if ((0x3ff600000000000L & l) != 0L)                     jjCheckNAddTwoStates(64, 65);                  break;               case 51:                  if ((0x3ff600000000000L & l) != 0L)                  {                     if (kind > 72)                        kind = 72;                     jjCheckNAdd(70);                  }                  else if (curChar == 58)                     jjstateSet[jjnewStateCnt++] = 52;                  if ((0x3ff600000000000L & l) != 0L)                     jjCheckNAddTwoStates(69, 65);                  break;               case 1:                  if ((0xffffffffffffdbffL & l) == 0L)                     break;                  if (kind > 5)                     kind = 5;                  jjCheckNAddStates(6, 8);                  break;               case 2:                  if ((0x2400L & l) != 0L && kind > 5)                     kind = 5;                  break;               case 3:                  if (curChar == 10 && kind > 5)                     kind = 5;                  break;               case 4:

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -