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

📄 axionsqlparsertokenmanager.java

📁 开源的axion的数据库代码
💻 JAVA
📖 第 1 页 / 共 3 页
字号:
                  jjCheckNAdd(25);                  break;               case 1:                  if ((0xffffffffffffdbffL & l) != 0L)                     jjCheckNAddStates(0, 2);                  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 == 42)                     jjCheckNAddTwoStates(7, 8);                  break;               case 7:                  if ((0xfffffbffffffffffL & l) != 0L)                     jjCheckNAddTwoStates(7, 8);                  break;               case 8:                  if (curChar == 42)                     jjCheckNAddStates(18, 20);                  break;               case 9:                  if ((0xffff7bffffffffffL & l) != 0L)                     jjCheckNAddTwoStates(10, 8);                  break;               case 10:                  if ((0xfffffbffffffffffL & l) != 0L)                     jjCheckNAddTwoStates(10, 8);                  break;               case 11:                  if (curChar == 47 && kind > 6)                     kind = 6;                  break;               case 12:                  if (curChar == 47)                     jjstateSet[jjnewStateCnt++] = 6;                  break;               case 13:                  if (curChar == 46)                     jjCheckNAdd(14);                  break;               case 14:                  if ((0x3ff000000000000L & l) == 0L)                     break;                  if (kind > 71)                     kind = 71;                  jjCheckNAddTwoStates(14, 15);                  break;               case 16:                  if ((0x280000000000L & l) != 0L)                     jjCheckNAdd(17);                  break;               case 17:                  if ((0x3ff000000000000L & l) == 0L)                     break;                  if (kind > 71)                     kind = 71;                  jjCheckNAdd(17);                  break;               case 18:                  if (curChar == 39)                     jjCheckNAddStates(15, 17);                  break;               case 19:                  if ((0xffffff7fffffffffL & l) != 0L)                     jjCheckNAddStates(15, 17);                  break;               case 20:                  if (curChar == 39)                     jjCheckNAddStates(21, 23);                  break;               case 21:                  if (curChar == 39)                     jjstateSet[jjnewStateCnt++] = 20;                  break;               case 22:                  if ((0xffffff7fffffffffL & l) != 0L)                     jjCheckNAddStates(21, 23);                  break;               case 23:                  if (curChar == 39 && kind > 73)                     kind = 73;                  break;               case 26:                  if (curChar == 45)                     jjCheckNAddStates(10, 14);                  break;               case 27:                  if ((0x3ff000000000000L & l) == 0L)                     break;                  if (kind > 70)                     kind = 70;                  jjCheckNAdd(27);                  break;               case 28:                  if ((0x3ff000000000000L & l) != 0L)                     jjCheckNAddTwoStates(28, 29);                  break;               case 29:                  if (curChar == 46)                     jjCheckNAdd(30);                  break;               case 30:                  if ((0x3ff000000000000L & l) == 0L)                     break;                  if (kind > 71)                     kind = 71;                  jjCheckNAddTwoStates(30, 31);                  break;               case 32:                  if ((0x280000000000L & l) != 0L)                     jjCheckNAdd(33);                  break;               case 33:                  if ((0x3ff000000000000L & l) == 0L)                     break;                  if (kind > 71)                     kind = 71;                  jjCheckNAdd(33);                  break;               case 34:                  if ((0x3ff000000000000L & l) != 0L)                     jjCheckNAddTwoStates(34, 35);                  break;               case 36:                  if ((0x280000000000L & l) != 0L)                     jjCheckNAdd(37);                  break;               case 37:                  if ((0x3ff000000000000L & l) == 0L)                     break;                  if (kind > 71)                     kind = 71;                  jjCheckNAdd(37);                  break;               case 38:                  if ((0x3ff000000000000L & l) == 0L)                     break;                  if (kind > 71)                     kind = 71;                  jjCheckNAddTwoStates(38, 39);                  break;               case 40:                  if ((0x280000000000L & l) != 0L)                     jjCheckNAdd(41);                  break;               case 41:                  if ((0x3ff000000000000L & l) == 0L)                     break;                  if (kind > 71)                     kind = 71;                  jjCheckNAdd(41);                  break;               case 42:                  if ((0x3ff000000000000L & l) == 0L)                     break;                  if (kind > 70)                     kind = 70;                  jjCheckNAddStates(3, 9);                  break;               default : break;            }         } while(i != startsAt);      }      else if (curChar < 128)      {         long l = 1L << (curChar & 077);         MatchLoop: do         {            switch(jjstateSet[--i])            {               case 5:               case 24:                  if ((0x7fffffe07fffffeL & l) == 0L)                     break;                  if (kind > 74)                     kind = 74;                  jjCheckNAddTwoStates(24, 25);                  break;               case 43:                  if ((0x7fffffe87fffffeL & l) != 0L)                  {                     if (kind > 74)                        kind = 74;                     jjCheckNAdd(25);                  }                  if ((0x7fffffe07fffffeL & l) != 0L)                  {                     if (kind > 74)                        kind = 74;                     jjCheckNAddTwoStates(24, 25);                  }                  break;               case 1:                  jjAddStates(0, 2);                  break;               case 7:                  jjCheckNAddTwoStates(7, 8);                  break;               case 9:               case 10:                  jjCheckNAddTwoStates(10, 8);                  break;               case 15:                  if ((0x2000000020L & l) != 0L)                     jjAddStates(24, 25);                  break;               case 19:                  jjCheckNAddStates(15, 17);                  break;               case 22:                  jjCheckNAddStates(21, 23);                  break;               case 25:                  if ((0x7fffffe87fffffeL & l) == 0L)                     break;                  if (kind > 74)                     kind = 74;                  jjCheckNAdd(25);                  break;               case 31:                  if ((0x2000000020L & l) != 0L)                     jjAddStates(26, 27);                  break;               case 35:                  if ((0x2000000020L & l) != 0L)                     jjAddStates(28, 29);                  break;               case 39:                  if ((0x2000000020L & l) != 0L)                     jjAddStates(30, 31);                  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])            {               case 1:                  if (jjCanMove_0(hiByte, i1, i2, l1, l2))                     jjAddStates(0, 2);                  break;               case 7:                  if (jjCanMove_0(hiByte, i1, i2, l1, l2))                     jjCheckNAddTwoStates(7, 8);                  break;               case 9:               case 10:                  if (jjCanMove_0(hiByte, i1, i2, l1, l2))                     jjCheckNAddTwoStates(10, 8);                  break;               case 19:                  if (jjCanMove_0(hiByte, i1, i2, l1, l2))                     jjCheckNAddStates(15, 17);                  break;               case 22:                  if (jjCanMove_0(hiByte, i1, i2, l1, l2))                     jjCheckNAddStates(21, 23);                  break;               default : break;            }         } while(i != startsAt);      }      if (kind != 0x7fffffff)      {         jjmatchedKind = kind;         jjmatchedPos = curPos;         kind = 0x7fffffff;      }      ++curPos;      if ((i = jjnewStateCnt) == (startsAt = 43 - (jjnewStateCnt = startsAt)))         return curPos;      try { curChar = input_stream.readChar(); }      catch(java.io.IOException e) { return curPos; }   }}static final int[] jjnextStates = {   1, 2, 4, 27, 28, 29, 34, 35, 38, 39, 27, 28, 13, 34, 38, 19,    21, 23, 8, 9, 11, 21, 22, 23, 16, 17, 32, 33, 36, 37, 40, 41, };private static final boolean jjCanMove_0(int hiByte, int i1, int i2, long l1, long l2){   switch(hiByte)   {      case 0:         return ((jjbitVec2[i2] & l2) != 0L);      default :          if ((jjbitVec0[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, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, "\72\75", "\54", "\174\174", "\73", "\56", "\74", "\74\75", "\76", "\76\75", "\75", "\41\75", "\74\76", "\50\53\51", "\50", "\51", "\52", "\57", "\53", "\55", "\77", };public static final String[] lexStateNames = {   "DEFAULT", };static final long[] jjtoToken = {   0xffffffffffffff81L, 0x1ffffe6ffL, };static final long[] jjtoSkip = {   0x7eL, 0x0L, };private SimpleCharStream input_stream;private final int[] jjrounds = new int[43];private final int[] jjstateSet = new int[86];protected char curChar;public AxionSqlParserTokenManager(SimpleCharStream stream){   if (SimpleCharStream.staticFlag)      throw new Error("ERROR: Cannot use a static CharStream class with a non-static lexical analyzer.");   input_stream = stream;}public AxionSqlParserTokenManager(SimpleCharStream stream, int lexState){   this(stream);   SwitchTo(lexState);}public void ReInit(SimpleCharStream stream){   jjmatchedPos = jjnewStateCnt = 0;   curLexState = defaultLexState;   input_stream = stream;   ReInitRounds();}private final void ReInitRounds(){   int i;   jjround = 0x80000001;   for (i = 43; i-- > 0;)      jjrounds[i] = 0x80000000;}public void ReInit(SimpleCharStream 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;}private final 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 final 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;   }   try { input_stream.backup(0);      while (curChar <= 32 && (0x100002600L & (1L << curChar)) != 0L)         curChar = input_stream.BeginToken();   }   catch (java.io.IOException e1) { continue EOFLoop; }   jjmatchedKind = 0x7fffffff;   jjmatchedPos = 0;   curPos = jjMoveStringLiteralDfa0_0();   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 + -