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

📄 standardtokenizertokenmanager.java

📁 天乙代码src_531.rar 天乙代码src_531.rar 天乙代码src_531.rar 天乙代码src_531.rar
💻 JAVA
📖 第 1 页 / 共 3 页
字号:
                  break;
               case 13:
                  if ((jjbitVec2[i2] & l2) == 0L)
                     break;
                  if (kind > 7)
                     kind = 7;
                  jjCheckNAdd(13);
                  break;
               case 15:
                  if ((jjbitVec2[i2] & l2) != 0L)
                     jjCheckNAddTwoStates(15, 16);
                  break;
               case 16:
                  if ((jjbitVec7[i2] & l2) != 0L)
                     jjCheckNAddTwoStates(17, 18);
                  break;
               case 17:
                  if ((jjbitVec2[i2] & l2) != 0L)
                     jjCheckNAddTwoStates(17, 18);
                  break;
               case 19:
                  if ((jjbitVec2[i2] & l2) == 0L)
                     break;
                  if (kind > 7)
                     kind = 7;
                  jjstateSet[jjnewStateCnt++] = 19;
                  break;
               case 20:
                  if ((jjbitVec2[i2] & l2) != 0L)
                     jjCheckNAddTwoStates(20, 21);
                  break;
               case 22:
                  if ((jjbitVec2[i2] & l2) != 0L)
                     jjAddStates(34, 35);
                  break;
               case 23:
                  if ((jjbitVec7[i2] & l2) != 0L)
                     jjCheckNAddTwoStates(24, 25);
                  break;
               case 24:
                  if ((jjbitVec2[i2] & l2) != 0L)
                     jjCheckNAddTwoStates(24, 25);
                  break;
               case 26:
                  if ((jjbitVec2[i2] & l2) == 0L)
                     break;
                  if (kind > 7)
                     kind = 7;
                  jjCheckNAddTwoStates(21, 26);
                  break;
               case 27:
                  if ((jjbitVec2[i2] & l2) != 0L)
                     jjCheckNAddTwoStates(27, 28);
                  break;
               case 28:
                  if ((jjbitVec7[i2] & l2) != 0L)
                     jjCheckNAddTwoStates(29, 30);
                  break;
               case 29:
                  if ((jjbitVec2[i2] & l2) != 0L)
                     jjCheckNAddTwoStates(29, 30);
                  break;
               case 31:
                  if ((jjbitVec2[i2] & l2) != 0L)
                     jjAddStates(36, 37);
                  break;
               case 33:
                  if ((jjbitVec2[i2] & l2) != 0L)
                     jjAddStates(38, 39);
                  break;
               case 34:
                  if ((jjbitVec7[i2] & l2) == 0L)
                     break;
                  if (kind > 7)
                     kind = 7;
                  jjCheckNAddTwoStates(30, 35);
                  break;
               case 35:
                  if ((jjbitVec2[i2] & l2) == 0L)
                     break;
                  if (kind > 7)
                     kind = 7;
                  jjCheckNAddTwoStates(30, 35);
                  break;
               case 36:
                  if ((jjbitVec2[i2] & l2) != 0L)
                     jjCheckNAddTwoStates(36, 37);
                  break;
               case 38:
                  if ((jjbitVec2[i2] & l2) != 0L)
                     jjAddStates(40, 41);
                  break;
               case 39:
                  if ((jjbitVec7[i2] & l2) != 0L)
                     jjCheckNAddTwoStates(40, 41);
                  break;
               case 40:
                  if ((jjbitVec2[i2] & l2) != 0L)
                     jjCheckNAddTwoStates(40, 41);
                  break;
               case 42:
                  if ((jjbitVec2[i2] & l2) != 0L)
                     jjAddStates(42, 43);
                  break;
               case 44:
                  if ((jjbitVec2[i2] & l2) != 0L)
                     jjAddStates(44, 45);
                  break;
               case 45:
                  if ((jjbitVec7[i2] & l2) == 0L)
                     break;
                  if (kind > 7)
                     kind = 7;
                  jjCheckNAddTwoStates(41, 46);
                  break;
               case 46:
                  if ((jjbitVec2[i2] & l2) == 0L)
                     break;
                  if (kind > 7)
                     kind = 7;
                  jjCheckNAddTwoStates(41, 46);
                  break;
               case 47:
                  if ((jjbitVec2[i2] & l2) != 0L)
                     jjCheckNAddTwoStates(47, 48);
                  break;
               case 48:
                  if ((jjbitVec7[i2] & l2) != 0L)
                     jjCheckNAddTwoStates(49, 50);
                  break;
               case 49:
                  if ((jjbitVec2[i2] & l2) != 0L)
                     jjCheckNAddTwoStates(49, 50);
                  break;
               case 51:
                  if ((jjbitVec2[i2] & l2) != 0L)
                     jjCheckNAddTwoStates(51, 52);
                  break;
               case 53:
                  if ((jjbitVec2[i2] & l2) != 0L)
                     jjAddStates(46, 47);
                  break;
               case 54:
                  if ((jjbitVec7[i2] & l2) != 0L)
                     jjCheckNAddTwoStates(55, 56);
                  break;
               case 55:
                  if ((jjbitVec2[i2] & l2) != 0L)
                     jjCheckNAddTwoStates(55, 56);
                  break;
               case 57:
                  if ((jjbitVec2[i2] & l2) == 0L)
                     break;
                  if (kind > 7)
                     kind = 7;
                  jjCheckNAddTwoStates(52, 57);
                  break;
               case 58:
                  if ((jjbitVec7[i2] & l2) != 0L)
                     jjCheckNAddStates(0, 5);
                  break;
               case 59:
                  if ((jjbitVec2[i2] & l2) != 0L)
                     jjCheckNAddStates(16, 21);
                  break;
               case 60:
                  if ((jjbitVec2[i2] & l2) != 0L)
                     jjCheckNAddTwoStates(60, 61);
                  break;
               case 62:
                  if ((jjbitVec2[i2] & l2) == 0L)
                     break;
                  if (kind > 2)
                     kind = 2;
                  jjCheckNAddTwoStates(61, 62);
                  break;
               case 63:
                  if ((jjbitVec2[i2] & l2) != 0L)
                     jjCheckNAddTwoStates(63, 64);
                  break;
               case 65:
                  if ((jjbitVec2[i2] & l2) != 0L)
                     jjAddStates(30, 31);
                  break;
               case 67:
                  if ((jjbitVec2[i2] & l2) != 0L)
                     jjCheckNAddTwoStates(67, 68);
                  break;
               case 69:
                  if ((jjbitVec2[i2] & l2) == 0L)
                     break;
                  if (kind > 4)
                     kind = 4;
                  jjstateSet[jjnewStateCnt++] = 69;
                  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; }
   }
}
static final int[] jjnextStates = {   17, 18, 29, 30, 49, 50, 15, 16, 20, 21, 27, 28, 36, 37, 47, 48,    60, 61, 63, 64, 67, 68, 17, 18, 24, 25, 49, 50, 55, 56, 65, 66,    11, 12, 22, 23, 31, 32, 33, 34, 38, 39, 42, 43, 44, 45, 53, 54, };
public static final String[] jjstrLiteralImages = {
"", null, null, null, null, null, null, null, null, null, null, null, null, 
null, };
public static final String[] lexStateNames = {
   "DEFAULT", 
};
static final long[] jjtoToken = {   0xffL, };
static final long[] jjtoSkip = {   0x2000L, };
protected CharStream input_stream;
private final int[] jjrounds = new int[70];
private final int[] jjstateSet = new int[140];
protected char curChar;
public StandardTokenizerTokenManager(CharStream stream)
{
   input_stream = stream;
}
public StandardTokenizerTokenManager(CharStream stream, int lexState)
{
   this(stream);
   SwitchTo(lexState);
}
public void ReInit(CharStream stream)
{
   jjmatchedPos = jjnewStateCnt = 0;
   curLexState = defaultLexState;
   input_stream = stream;
   ReInitRounds();
}
private final void ReInitRounds()
{
   int i;
   jjround = 0x80000001;
   for (i = 70; i-- > 0;)
      jjrounds[i] = 0x80000000;
}
public void ReInit(CharStream stream, int lexState)
{
   ReInit(stream);
   SwitchTo(lexState);
}
public void SwitchTo(int lexState)
{
   if (lexState >= 1 || lexState < 0)
      throw new TokenMgrError("Error: Ignoring invalid lexical state : " + lexState + ". State unchanged.", TokenMgrError.INVALID_LEXICAL_STATE);
   else
      curLexState = lexState;
}

protected Token jjFillToken()
{
   Token t = Token.newToken(jjmatchedKind);
   t.kind = jjmatchedKind;
   String im = jjstrLiteralImages[jjmatchedKind];
   t.image = (im == null) ? input_stream.GetImage() : im;
   t.beginLine = input_stream.getBeginLine();
   t.beginColumn = input_stream.getBeginColumn();
   t.endLine = input_stream.getEndLine();
   t.endColumn = input_stream.getEndColumn();
   return t;
}

int curLexState = 0;
int defaultLexState = 0;
int jjnewStateCnt;
int jjround;
int jjmatchedPos;
int jjmatchedKind;

public Token getNextToken() 
{
  int kind;
  Token specialToken = null;
  Token matchedToken;
  int curPos = 0;

  EOFLoop :  for (;;)
  {   
   try   
   {     
      curChar = input_stream.BeginToken();
   }     
   catch(java.io.IOException e)
   {        
      jjmatchedKind = 0;
      matchedToken = jjFillToken();
      return matchedToken;
   }

   jjmatchedKind = 0x7fffffff;
   jjmatchedPos = 0;
   curPos = jjMoveStringLiteralDfa0_0();
   if (jjmatchedPos == 0 && jjmatchedKind > 13)
   {
      jjmatchedKind = 13;
   }
   if (jjmatchedKind != 0x7fffffff)
   {
      if (jjmatchedPos + 1 < curPos)
         input_stream.backup(curPos - jjmatchedPos - 1);
      if ((jjtoToken[jjmatchedKind >> 6] & (1L << (jjmatchedKind & 077))) != 0L)
      {
         matchedToken = jjFillToken();
         return matchedToken;
      }
      else
      {
         continue EOFLoop;
      }
   }
   int error_line = input_stream.getEndLine();
   int error_column = input_stream.getEndColumn();
   String error_after = null;
   boolean EOFSeen = false;
   try { input_stream.readChar(); input_stream.backup(1); }
   catch (java.io.IOException e1) {
      EOFSeen = true;
      error_after = curPos <= 1 ? "" : input_stream.GetImage();
      if (curChar == '\n' || curChar == '\r') {
         error_line++;
         error_column = 0;
      }
      else
         error_column++;
   }
   if (!EOFSeen) {
      input_stream.backup(1);
      error_after = curPos <= 1 ? "" : input_stream.GetImage();
   }
   throw new TokenMgrError(EOFSeen, curLexState, error_line, error_column, error_after, curChar, TokenMgrError.LEXICAL_ERROR);
  }
}

}

⌨️ 快捷键说明

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