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

📄 standardtokenizertokenmanager.java

📁 一套java版本的搜索引擎源码
💻 JAVA
📖 第 1 页 / 共 3 页
字号:
                     jjCheckNAddStates(12, 17);                  break;               case 29:                  if (!jjCanMove_4(hiByte, i1, i2, l1, l2))                     break;                  if (kind > 1)                     kind = 1;                  jjCheckNAddStates(0, 11);                  break;               case 30:                  if (!jjCanMove_4(hiByte, i1, i2, l1, l2))                     break;                  if (kind > 1)                     kind = 1;                  jjCheckNAdd(30);                  break;               case 31:                  if (jjCanMove_4(hiByte, i1, i2, l1, l2))                     jjCheckNAddStates(24, 26);                  break;               case 33:                  if (jjCanMove_4(hiByte, i1, i2, l1, l2))                     jjCheckNAddStates(27, 29);                  break;               case 35:                  if (jjCanMove_4(hiByte, i1, i2, l1, l2))                     jjCheckNAddTwoStates(35, 36);                  break;               case 37:                  if (!jjCanMove_4(hiByte, i1, i2, l1, l2))                     break;                  if (kind > 5)                     kind = 5;                  jjCheckNAddTwoStates(36, 37);                  break;               case 38:                  if (jjCanMove_4(hiByte, i1, i2, l1, l2))                     jjCheckNAddTwoStates(38, 39);                  break;               case 40:                  if (!jjCanMove_4(hiByte, i1, i2, l1, l2))                     break;                  if (kind > 6)                     kind = 6;                  jjCheckNAddTwoStates(39, 40);                  break;               case 41:                  if (jjCanMove_4(hiByte, i1, i2, l1, l2))                     jjCheckNAddTwoStates(41, 42);                  break;               case 43:                  if (jjCanMove_2(hiByte, i1, i2, l1, l2))                     jjAddStates(52, 53);                  break;               case 44:                  if (!jjCanMove_3(hiByte, i1, i2, l1, l2))                     break;                  if (kind > 7)                     kind = 7;                  jjCheckNAdd(45);                  break;               case 45:                  if (!jjCanMove_2(hiByte, i1, i2, l1, l2))                     break;                  if (kind > 7)                     kind = 7;                  jjCheckNAdd(45);                  break;               case 46:                  if (jjCanMove_4(hiByte, i1, i2, l1, l2))                     jjCheckNAddTwoStates(46, 47);                  break;               case 48:                  if (jjCanMove_2(hiByte, i1, i2, l1, l2))                     jjAddStates(54, 55);                  break;               case 49:                  if (jjCanMove_3(hiByte, i1, i2, l1, l2))                     jjCheckNAddTwoStates(50, 51);                  break;               case 50:                  if (jjCanMove_2(hiByte, i1, i2, l1, l2))                     jjCheckNAddTwoStates(50, 51);                  break;               case 52:                  if (!jjCanMove_4(hiByte, i1, i2, l1, l2))                     break;                  if (kind > 7)                     kind = 7;                  jjCheckNAddTwoStates(47, 52);                  break;               case 53:                  if (jjCanMove_4(hiByte, i1, i2, l1, l2))                     jjCheckNAddTwoStates(53, 54);                  break;               case 55:                  if (jjCanMove_2(hiByte, i1, i2, l1, l2))                     jjAddStates(56, 57);                  break;               case 56:                  if (jjCanMove_3(hiByte, i1, i2, l1, l2))                     jjCheckNAddTwoStates(57, 58);                  break;               case 57:                  if (jjCanMove_2(hiByte, i1, i2, l1, l2))                     jjCheckNAddTwoStates(57, 58);                  break;               case 59:                  if (jjCanMove_4(hiByte, i1, i2, l1, l2))                     jjAddStates(58, 59);                  break;               case 61:                  if (jjCanMove_2(hiByte, i1, i2, l1, l2))                     jjAddStates(60, 61);                  break;               case 62:                  if (!jjCanMove_3(hiByte, i1, i2, l1, l2))                     break;                  if (kind > 7)                     kind = 7;                  jjCheckNAddTwoStates(58, 63);                  break;               case 63:                  if (!jjCanMove_2(hiByte, i1, i2, l1, l2))                     break;                  if (kind > 7)                     kind = 7;                  jjCheckNAddTwoStates(58, 63);                  break;               case 64:                  if (jjCanMove_2(hiByte, i1, i2, l1, l2))                     jjCheckNAddStates(30, 35);                  break;               case 65:                  if (jjCanMove_2(hiByte, i1, i2, l1, l2))                     jjCheckNAddTwoStates(65, 66);                  break;               case 67:                  if (!jjCanMove_2(hiByte, i1, i2, l1, l2))                     break;                  if (kind > 2)                     kind = 2;                  jjCheckNAddTwoStates(66, 67);                  break;               case 68:                  if (jjCanMove_2(hiByte, i1, i2, l1, l2))                     jjCheckNAddTwoStates(68, 69);                  break;               case 70:                  if (jjCanMove_2(hiByte, i1, i2, l1, l2))                     jjAddStates(44, 45);                  break;               case 72:                  if (jjCanMove_2(hiByte, i1, i2, l1, l2))                     jjCheckNAddTwoStates(72, 73);                  break;               case 74:                  if (!jjCanMove_2(hiByte, i1, i2, l1, l2))                     break;                  if (kind > 4)                     kind = 4;                  jjstateSet[jjnewStateCnt++] = 74;                  break;               default : break;            }         } while(i != startsAt);      }      if (kind != 0x7fffffff)      {         jjmatchedKind = kind;         jjmatchedPos = curPos;         kind = 0x7fffffff;      }      ++curPos;      if ((i = jjnewStateCnt) == (startsAt = 75 - (jjnewStateCnt = startsAt)))         return curPos;      try { curChar = input_stream.readChar(); }      catch(java.io.IOException e) { return curPos; }   }}static final int[] jjnextStates = {   30, 31, 32, 34, 38, 39, 41, 42, 46, 47, 53, 54, 5, 6, 10, 11,    19, 20, 3, 4, 8, 9, 17, 18, 31, 32, 34, 32, 33, 34, 65, 66,    68, 69, 72, 73, 5, 6, 19, 20, 25, 26, 50, 51, 70, 71, 12, 13,    14, 15, 23, 24, 43, 44, 48, 49, 55, 56, 59, 60, 61, 62, };private static final boolean jjCanMove_0(int hiByte, int i1, int i2, long l1, long l2){   switch(hiByte)   {      case 48:         return ((jjbitVec2[i2] & l2) != 0L);      case 49:         return ((jjbitVec3[i2] & l2) != 0L);      case 51:         return ((jjbitVec4[i2] & l2) != 0L);      case 77:         return ((jjbitVec5[i2] & l2) != 0L);      case 255:         return ((jjbitVec6[i2] & l2) != 0L);      default :          if ((jjbitVec0[i1] & l1) != 0L)            return true;         return false;   }}private static final boolean jjCanMove_1(int hiByte, int i1, int i2, long l1, long l2){   switch(hiByte)   {      case 215:         return ((jjbitVec8[i2] & l2) != 0L);      default :          if ((jjbitVec7[i1] & l1) != 0L)            return true;         return false;   }}private static final boolean jjCanMove_2(int hiByte, int i1, int i2, long l1, long l2){   switch(hiByte)   {      case 0:         return ((jjbitVec10[i2] & l2) != 0L);      case 255:         return ((jjbitVec11[i2] & l2) != 0L);      default :          if ((jjbitVec9[i1] & l1) != 0L)            return true;         return false;   }}private static final boolean jjCanMove_3(int hiByte, int i1, int i2, long l1, long l2){   switch(hiByte)   {      case 6:         return ((jjbitVec14[i2] & l2) != 0L);      case 11:         return ((jjbitVec15[i2] & l2) != 0L);      case 13:         return ((jjbitVec16[i2] & l2) != 0L);      case 14:         return ((jjbitVec17[i2] & l2) != 0L);      case 16:         return ((jjbitVec18[i2] & l2) != 0L);      default :          if ((jjbitVec12[i1] & l1) != 0L)            if ((jjbitVec13[i2] & l2) == 0L)               return false;            else            return true;         return false;   }}private static final boolean jjCanMove_4(int hiByte, int i1, int i2, long l1, long l2){   switch(hiByte)   {      case 0:         return ((jjbitVec10[i2] & l2) != 0L);      case 215:         return ((jjbitVec8[i2] & l2) != 0L);      case 255:         return ((jjbitVec11[i2] & l2) != 0L);      default :          if ((jjbitVec19[i1] & l1) != 0L)            return true;         return false;   }}public static final String[] jjstrLiteralImages = {"", null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, };public static final String[] lexStateNames = {   "DEFAULT", };static final long[] jjtoToken = {   0x30ffL, };static final long[] jjtoSkip = {   0x8000L, };protected CharStream input_stream;private final int[] jjrounds = new int[75];private final int[] jjstateSet = new int[150];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 = 75; 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 > 15)   {      jjmatchedKind = 15;   }   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 + -