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

📄 parsertokenmanager.java

📁 java1.6众多例子参考
💻 JAVA
📖 第 1 页 / 共 3 页
字号:
   switch(curChar)   {      case 99:         return jjMoveStringLiteralDfa8_0(active0, 0x400000L);      case 105:         return jjMoveStringLiteralDfa8_0(active0, 0x40800L);      case 108:         return jjMoveStringLiteralDfa8_0(active0, 0x20000L);      case 109:         if ((active0 & 0x800000L) != 0L)            return jjStartNfaWithStates_0(7, 23, 51);         return jjMoveStringLiteralDfa8_0(active0, 0x200000L);      case 115:         if ((active0 & 0x4000L) != 0L)            return jjStartNfaWithStates_0(7, 14, 49);         break;      case 116:         return jjMoveStringLiteralDfa8_0(active0, 0x400L);      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 105:         return jjMoveStringLiteralDfa9_0(active0, 0x400L);      case 109:         return jjMoveStringLiteralDfa9_0(active0, 0x200000L);      case 111:         return jjMoveStringLiteralDfa9_0(active0, 0x400000L);      case 115:         return jjMoveStringLiteralDfa9_0(active0, 0x800L);      case 116:         return jjMoveStringLiteralDfa9_0(active0, 0x40000L);      case 121:         if ((active0 & 0x20000L) != 0L)            return jjStartNfaWithStates_0(8, 17, 51);         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 101:         if ((active0 & 0x800L) != 0L)            return jjStartNfaWithStates_0(9, 11, 49);         else if ((active0 & 0x40000L) != 0L)            return jjStartNfaWithStates_0(9, 18, 51);         return jjMoveStringLiteralDfa10_0(active0, 0x400L);      case 109:         return jjMoveStringLiteralDfa10_0(active0, 0x400000L);      case 117:         return jjMoveStringLiteralDfa10_0(active0, 0x200000L);      default :         break;   }   return jjStartNfa_0(8, active0);}private final int jjMoveStringLiteralDfa10_0(long old0, long active0){   if (((active0 &= old0)) == 0L)      return jjStartNfa_0(8, old0);    try { curChar = input_stream.readChar(); }   catch(java.io.IOException e) {      jjStopStringLiteralDfa_0(9, active0);      return 10;   }   switch(curChar)   {      case 109:         return jjMoveStringLiteralDfa11_0(active0, 0x400000L);      case 110:         return jjMoveStringLiteralDfa11_0(active0, 0x200000L);      case 115:         if ((active0 & 0x400L) != 0L)            return jjStartNfaWithStates_0(10, 10, 49);         break;      default :         break;   }   return jjStartNfa_0(9, active0);}private final int jjMoveStringLiteralDfa11_0(long old0, long active0){   if (((active0 &= old0)) == 0L)      return jjStartNfa_0(9, old0);    try { curChar = input_stream.readChar(); }   catch(java.io.IOException e) {      jjStopStringLiteralDfa_0(10, active0);      return 11;   }   switch(curChar)   {      case 105:         return jjMoveStringLiteralDfa12_0(active0, 0x200000L);      case 117:         return jjMoveStringLiteralDfa12_0(active0, 0x400000L);      default :         break;   }   return jjStartNfa_0(10, active0);}private final int jjMoveStringLiteralDfa12_0(long old0, long active0){   if (((active0 &= old0)) == 0L)      return jjStartNfa_0(10, old0);    try { curChar = input_stream.readChar(); }   catch(java.io.IOException e) {      jjStopStringLiteralDfa_0(11, active0);      return 12;   }   switch(curChar)   {      case 110:         return jjMoveStringLiteralDfa13_0(active0, 0x400000L);      case 116:         return jjMoveStringLiteralDfa13_0(active0, 0x200000L);      default :         break;   }   return jjStartNfa_0(11, active0);}private final int jjMoveStringLiteralDfa13_0(long old0, long active0){   if (((active0 &= old0)) == 0L)      return jjStartNfa_0(11, old0);    try { curChar = input_stream.readChar(); }   catch(java.io.IOException e) {      jjStopStringLiteralDfa_0(12, active0);      return 13;   }   switch(curChar)   {      case 105:         return jjMoveStringLiteralDfa14_0(active0, 0x400000L);      case 121:         if ((active0 & 0x200000L) != 0L)            return jjStartNfaWithStates_0(13, 21, 51);         break;      default :         break;   }   return jjStartNfa_0(12, active0);}private final int jjMoveStringLiteralDfa14_0(long old0, long active0){   if (((active0 &= old0)) == 0L)      return jjStartNfa_0(12, old0);    try { curChar = input_stream.readChar(); }   catch(java.io.IOException e) {      jjStopStringLiteralDfa_0(13, active0);      return 14;   }   switch(curChar)   {      case 116:         return jjMoveStringLiteralDfa15_0(active0, 0x400000L);      default :         break;   }   return jjStartNfa_0(13, active0);}private final int jjMoveStringLiteralDfa15_0(long old0, long active0){   if (((active0 &= old0)) == 0L)      return jjStartNfa_0(13, old0);    try { curChar = input_stream.readChar(); }   catch(java.io.IOException e) {      jjStopStringLiteralDfa_0(14, active0);      return 15;   }   switch(curChar)   {      case 121:         if ((active0 & 0x400000L) != 0L)            return jjStartNfaWithStates_0(15, 22, 51);         break;      default :         break;   }   return jjStartNfa_0(14, 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 = {   0x0L, 0x0L, 0xffffffffffffffffL, 0xffffffffffffffffL};private final int jjMoveNfa_0(int startState, int curPos){   int[] nextStates;   int startsAt = 0;   jjnewStateCnt = 47;   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 ((0x3ff200000000000L & l) != 0L)                     jjCheckNAddTwoStates(18, 19);                  if ((0x3ff000000000000L & l) != 0L)                  {                     if (kind > 31)                        kind = 31;                     jjCheckNAddStates(0, 2);                  }                  if ((0x3ff000000000000L & l) != 0L)                  {                     if (kind > 31)                        kind = 31;                     jjCheckNAdd(20);                  }                  if ((0x3ff000000000000L & l) != 0L)                  {                     if (kind > 31)                        kind = 31;                     jjCheckNAdd(19);                  }                  break;               case 48:                  if ((0x3ff200000000000L & l) != 0L)                     jjCheckNAddTwoStates(18, 19);                  else if (curChar == 58)                     jjCheckNAddStates(3, 5);                  if ((0x3ff000000000000L & l) != 0L)                  {                     if (kind > 31)                        kind = 31;                     jjCheckNAddStates(0, 2);                  }                  else if (curChar == 58)                     jjCheckNAddTwoStates(23, 25);                  if ((0x3ff000000000000L & l) != 0L)                  {                     if (kind > 31)                        kind = 31;                     jjCheckNAdd(20);                  }                  if ((0x3ff000000000000L & l) != 0L)                     jjCheckNAddTwoStates(26, 27);                  if ((0x3ff000000000000L & l) != 0L)                     jjCheckNAddTwoStates(23, 24);                  break;               case 47:                  if ((0x3ff200000000000L & l) != 0L)                     jjCheckNAddTwoStates(18, 19);                  if ((0x3ff000000000000L & l) != 0L)                  {                     if (kind > 31)                        kind = 31;                     jjCheckNAddStates(0, 2);                  }                  if ((0x3ff000000000000L & l) != 0L)                  {                     if (kind > 31)                        kind = 31;                     jjCheckNAdd(20);                  }                  break;               case 50:                  if ((0x3ff200000000000L & l) != 0L)                     jjCheckNAddTwoStates(18, 19);                  else if (curChar == 58)                     jjCheckNAddStates(3, 5);                  if ((0x3ff000000000000L & l) != 0L)                  {                     if (kind > 31)                        kind = 31;                     jjCheckNAddStates(0, 2);                  }                  else if (curChar == 58)                     jjCheckNAddTwoStates(23, 25);                  if ((0x3ff000000000000L & l) != 0L)                  {                     if (kind > 31)                        kind = 31;                     jjCheckNAdd(20);                  }                  if ((0x3ff000000000000L & l) != 0L)                  {                     if (kind > 31)                        kind = 31;                     jjCheckNAdd(19);                  }                  if ((0x3ff000000000000L & l) != 0L)                     jjCheckNAddTwoStates(26, 27);                  if ((0x3ff000000000000L & l) != 0L)                     jjCheckNAddTwoStates(23, 24);                  break;               case 5:                  if ((0x3ff000000000000L & l) != 0L)                     jjCheckNAddStates(6, 9);                  else if (curChar == 58)                     jjAddStates(10, 11);                  else if (curChar == 34)                     jjCheckNAddTwoStates(15, 16);                  else if (curChar == 35)                     jjCheckNAddStates(12, 14);                  else if (curChar == 45)                     jjstateSet[jjnewStateCnt++] = 0;                  if ((0x3ff000000000000L & l) != 0L)                  {                     if (kind > 31)                        kind = 31;                     jjCheckNAddStates(15, 17);                  }                  if ((0x3fe000000000000L & l) != 0L)                  {                     if (kind > 24)                        kind = 24;                     jjCheckNAddTwoStates(12, 13);                  }                  else if (curChar == 48)                  {                     if (kind > 24)                        kind = 24;                     jjCheckNAddStates(18, 20);                  }                  break;               case 51:                  if ((0x3ff200000000000L & l) != 0L)                     jjCheckNAddTwoStates(18, 19);                  if ((0x3ff000000000000L & l) != 0L)                  {                     if (kind > 31)                        kind = 31;                     jjCheckNAdd(19);                  }                  break;               case 0:                  if (curChar == 45)                     jjCheckNAddStates(21, 23);                  break;               case 1:                  if ((0xffffffffffffdbffL & l) != 0L)                     jjCheckNAddStates(21, 23);                  break;               case 2:                  if ((0x2400L & l) != 0L && kind > 5)                     kind = 5;                  break;               case 3:                  if (curChar == 10 && kind > 5)                     kind = 5;                  break;               case 4:                  if (curChar == 13)                     jjstateSet[jjnewStateCnt++] = 3;                  break;               case 6:                  if (curChar == 35)                     jjCheckNAddStates(12, 14);                  break;               case 7:                  if ((0xffffffffffffdbffL & l) != 0L)                     jjCheckNAddStates(12, 14);                  break;               case 8:                  if ((0x2400L & l) != 0L && kind > 6)                     kind = 6;                  break;               case 9:                  if (curChar == 10 && kind > 6)                     kind = 6;                  break;               case 10:                  if (curChar == 13)                     jjstateSet[jjnewStateCnt++] = 9;                  break;               case 11:                  if ((0x3fe000000000000L & l) == 0L)                     break;                  if (kind > 24)                     kind = 24;                  jjCheckNAddTwoStates(12, 13);                  break;               case 12:                  if ((0x3ff000000000000L & l) == 0L)                     break;                  if (kind > 24)                     kind = 24;                  jjCheckNAddTwoStates(12, 13);                  break;               case 14:                  if (curChar == 34)                     jjCheckNAddTwoStates(15, 16);                  break;               case 15:                  if ((0xfffffffbffffffffL & l) != 0L)                     jjCheckNAddTwoStates(15, 16);                  break;               case 16:                  if (curChar == 34 && kind > 35)                     kind = 35;                  break;               case 17:                  if ((0x3ff000000000000L & l) == 0L)                     break;                  if (kind > 31)                     kind = 31;                  jjCheckNAddStates(15, 17);                  break;               case 18:                  if ((0x3ff200000000000L & l) != 0L)                     jjCheckNAddTwoStates(18, 19);                  break;               case 19:                  if ((0x3ff000000000000L & l) == 0L)                     break;                  if (kind > 31)                     kind = 31;                  jjCheckNAdd(19);                  break;               case 20:                  if ((0x3ff000000000000L & l) == 0L)                     break;                  if (kind > 31)                     kind = 31;                  jjCheckNAdd(20);                  break;               case 21:                  if ((0x3ff000000000000L & l) == 0L)                     break;                  if (kind > 31)                     kind = 31;                  jjCheckNAddStates(0, 2);                  break;               case 22:                  if ((0x3ff000000000000L & l) != 0L)                     jjCheckNAddStates(6, 9);                  break;               case 23:                  if ((0x3ff000000000000L & l) != 0L)                     jjCheckNAddTwoStates(23, 24);                  break;               case 24:                  if (curChar == 58)                     jjCheckNAddTwoStates(23, 25);                  break;               case 25:               case 41:

⌨️ 快捷键说明

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