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

📄 rdqlparsertokenmanager.java

📁 这是外国一个开源推理机
💻 JAVA
📖 第 1 页 / 共 4 页
字号:
               case 62:                  if ((0x3ff000000000000L & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 63;                  break;               case 64:                  if (curChar == 60)                     jjCheckNAddTwoStates(65, 66);                  break;               case 65:                  if ((0xbffffffeffffd9ffL & l) != 0L)                     jjCheckNAddTwoStates(65, 66);                  break;               case 66:                  if (curChar == 62 && kind > 56)                     kind = 56;                  break;               case 67:                  if (curChar == 63)                     jjstateSet[jjnewStateCnt++] = 68;                  break;               case 69:                  if ((0x3ff600000000000L & l) == 0L)                     break;                  if (kind > 58)                     kind = 58;                  jjstateSet[jjnewStateCnt++] = 69;                  break;               case 70:                  if (curChar == 46)                     jjCheckNAdd(71);                  break;               case 71:                  if ((0x3ff000000000000L & l) == 0L)                     break;                  if (kind > 68)                     kind = 68;                  jjCheckNAddTwoStates(71, 72);                  break;               case 73:                  if ((0x280000000000L & l) != 0L)                     jjCheckNAdd(74);                  break;               case 74:                  if ((0x3ff000000000000L & l) == 0L)                     break;                  if (kind > 68)                     kind = 68;                  jjCheckNAdd(74);                  break;               case 75:                  if (curChar == 47)                     jjAddStates(3, 4);                  break;               case 76:                  if (curChar != 47)                     break;                  if (kind > 6)                     kind = 6;                  jjCheckNAddStates(13, 15);                  break;               case 77:                  if ((0xffffffffffffdbffL & l) == 0L)                     break;                  if (kind > 6)                     kind = 6;                  jjCheckNAddStates(13, 15);                  break;               case 78:                  if ((0x2400L & l) != 0L && kind > 6)                     kind = 6;                  break;               case 79:                  if (curChar == 10 && kind > 6)                     kind = 6;                  break;               case 80:                  if (curChar == 13)                     jjstateSet[jjnewStateCnt++] = 79;                  break;               case 81:                  if (curChar == 42)                     jjCheckNAddTwoStates(82, 83);                  break;               case 82:                  if ((0xfffffbffffffffffL & l) != 0L)                     jjCheckNAddTwoStates(82, 83);                  break;               case 83:                  if (curChar == 42)                     jjCheckNAddStates(16, 18);                  break;               case 84:                  if ((0xffff7bffffffffffL & l) != 0L)                     jjCheckNAddTwoStates(85, 83);                  break;               case 85:                  if ((0xfffffbffffffffffL & l) != 0L)                     jjCheckNAddTwoStates(85, 83);                  break;               case 86:                  if (curChar == 47 && kind > 7)                     kind = 7;                  break;               case 88:                  if ((0x3ff600000000000L & l) != 0L)                     jjAddStates(19, 20);                  break;               case 89:                  if (curChar != 58)                     break;                  if (kind > 57)                     kind = 57;                  jjstateSet[jjnewStateCnt++] = 90;                  break;               case 91:                  if ((0x3ff600000000000L & l) == 0L)                     break;                  if (kind > 57)                     kind = 57;                  jjstateSet[jjnewStateCnt++] = 91;                  break;               case 92:                  if ((0x3ff600000000000L & l) == 0L)                     break;                  if (kind > 59)                     kind = 59;                  jjstateSet[jjnewStateCnt++] = 92;                  break;               case 93:                  if ((0x3ff000000000000L & l) == 0L)                     break;                  if (kind > 67)                     kind = 67;                  jjCheckNAddStates(0, 2);                  break;               case 94:                  if ((0x3ff000000000000L & l) == 0L)                     break;                  if (kind > 67)                     kind = 67;                  jjCheckNAdd(94);                  break;               case 95:                  if ((0x3ff000000000000L & l) != 0L)                     jjCheckNAddTwoStates(95, 70);                  break;               default : break;            }         } while(i != startsAt);      }      else if (curChar < 128)      {         long l = 1L << (curChar & 077);         MatchLoop: do         {            switch(jjstateSet[--i])            {               case 0:                  if ((0x7fffffe87fffffeL & l) != 0L)                  {                     if (kind > 59)                        kind = 59;                     jjCheckNAddStates(21, 23);                  }                  else if (curChar == 126)                     jjstateSet[jjnewStateCnt++] = 1;                  if (curChar == 126)                  {                     if (kind > 14)                        kind = 14;                  }                  break;               case 1:                  if (curChar == 126 && kind > 23)                     kind = 23;                  break;               case 3:                  if (curChar == 126)                     jjstateSet[jjnewStateCnt++] = 1;                  break;               case 5:                  if ((0xffffffffefffffffL & l) != 0L)                     jjCheckNAddStates(8, 10);                  break;               case 7:                  if (curChar == 64)                     jjCheckNAdd(8);                  break;               case 8:                  if ((0x7fffffe07fffffeL & l) == 0L)                     break;                  if (kind > 44)                     kind = 44;                  jjCheckNAddTwoStates(8, 9);                  break;               case 10:                  if ((0x7fffffe07fffffeL & l) == 0L)                     break;                  if (kind > 44)                     kind = 44;                  jjCheckNAddTwoStates(9, 10);                  break;               case 11:                  if (curChar == 94)                     jjAddStates(24, 25);                  break;               case 13:                  jjAddStates(26, 27);                  break;               case 15:               case 16:                  if ((0x7fffffe87fffffeL & l) != 0L)                     jjCheckNAddTwoStates(16, 17);                  break;               case 18:               case 19:                  if ((0x7fffffe87fffffeL & l) == 0L)                     break;                  if (kind > 44)                     kind = 44;                  jjCheckNAdd(19);                  break;               case 20:                  if (curChar == 94)                     jjstateSet[jjnewStateCnt++] = 11;                  break;               case 21:                  if (curChar == 92)                     jjAddStates(28, 35);                  break;               case 27:                  if (curChar == 92)                     jjCheckNAddStates(8, 10);                  break;               case 28:                  if (curChar == 85)                     jjstateSet[jjnewStateCnt++] = 29;                  break;               case 29:                  if ((0x7e0000007eL & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 30;                  break;               case 30:                  if ((0x7e0000007eL & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 31;                  break;               case 31:                  if ((0x7e0000007eL & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 32;                  break;               case 32:                  if ((0x7e0000007eL & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 33;                  break;               case 33:                  if ((0x7e0000007eL & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 34;                  break;               case 34:                  if ((0x7e0000007eL & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 35;                  break;               case 35:               case 40:                  if ((0x7e0000007eL & l) != 0L)                     jjCheckNAdd(36);                  break;               case 36:                  if ((0x7e0000007eL & l) != 0L)                     jjCheckNAddStates(8, 10);                  break;               case 37:                  if (curChar == 117)                     jjstateSet[jjnewStateCnt++] = 38;                  break;               case 38:                  if ((0x7e0000007eL & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 39;                  break;               case 39:                  if ((0x7e0000007eL & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 40;                  break;               case 42:                  if ((0xffffffffefffffffL & l) != 0L)                     jjCheckNAddStates(5, 7);                  break;               case 44:                  if (curChar == 92)                     jjAddStates(36, 43);                  break;               case 50:                  if (curChar == 92)                     jjCheckNAddStates(5, 7);                  break;               case 51:                  if (curChar == 85)                     jjstateSet[jjnewStateCnt++] = 52;                  break;               case 52:                  if ((0x7e0000007eL & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 53;                  break;               case 53:                  if ((0x7e0000007eL & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 54;                  break;               case 54:                  if ((0x7e0000007eL & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 55;                  break;               case 55:                  if ((0x7e0000007eL & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 56;                  break;               case 56:                  if ((0x7e0000007eL & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 57;                  break;               case 57:                  if ((0x7e0000007eL & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 58;                  break;               case 58:               case 63:                  if ((0x7e0000007eL & l) != 0L)                     jjCheckNAdd(59);                  break;               case 59:                  if ((0x7e0000007eL & l) != 0L)                     jjCheckNAddStates(5, 7);                  break;               case 60:                  if (curChar == 117)                     jjstateSet[jjnewStateCnt++] = 61;                  break;               case 61:                  if ((0x7e0000007eL & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 62;                  break;               case 62:                  if ((0x7e0000007eL & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 63;                  break;               case 65:                  jjAddStates(44, 45);                  break;               case 68:               case 69:                  if ((0x7fffffe87fffffeL & l) == 0L)                     break;                  if (kind > 58)                     kind = 58;                  jjCheckNAdd(69);                  break;               case 72:                  if (curChar == 101)                     jjAddStates(46, 47);                  break;               case 77:                  if (kind > 6)                     kind = 6;                  jjAddStates(13, 15);                  break;               case 82:                  jjCheckNAddTwoStates(82, 83);                  break;               case 84:               case 85:                  jjCheckNAddTwoStates(85, 83);                  break;               case 87:                  if ((0x7fffffe87fffffeL & l) == 0L)                     break;                  if (kind > 59)                     kind = 59;                  jjCheckNAddStates(21, 23);                  break;               case 88:                  if ((0x7fffffe87fffffeL & l) != 0L)                     jjCheckNAddTwoStates(88, 89);                  break;               case 90:               case 91:                  if ((0x7fffffe87fffffeL & l) == 0L)                     break;                  if (kind > 57)                     kind = 57;                  jjCheckNAdd(91);                  break;               case 92:                  if ((0x7fffffe87fffffeL & l) == 0L)                     break;                  if (kind > 59)                     kind = 59;                  jjCheckNAdd(92);                  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])

⌨️ 快捷键说明

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