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

📄 parsertokenmanager.java

📁 Sematic Assessment System: Java GUI application that store all data in an Ontology in protege.
💻 JAVA
📖 第 1 页 / 共 4 页
字号:
      case 99:
         return jjMoveStringLiteralDfa10_0(active0, 0x200000000L, active1, 0L);
      case 100:
         return jjMoveStringLiteralDfa10_0(active0, 0x8000000L, active1, 0L);
      case 101:
         if ((active0 & 0x1000000000000000L) != 0L)
            return jjStartNfaWithStates_0(9, 60, 28);
         return jjMoveStringLiteralDfa10_0(active0, 0x10000000000L, active1, 0L);
      case 102:
         if ((active1 & 0x10L) != 0L)
            return jjStartNfaWithStates_0(9, 68, 28);
         break;
      case 105:
         return jjMoveStringLiteralDfa10_0(active0, 0x1000000000000L, active1, 0L);
      case 108:
         return jjMoveStringLiteralDfa10_0(active0, 0x800000c0000L, active1, 0L);
      case 109:
         return jjMoveStringLiteralDfa10_0(active0, 0x8000000000000L, active1, 0L);
      case 110:
         return jjMoveStringLiteralDfa10_0(active0, 0x200000L, active1, 0L);
      case 111:
         return jjMoveStringLiteralDfa10_0(active0, 0x4040000000000000L, active1, 0L);
      case 114:
         return jjMoveStringLiteralDfa10_0(active0, 0x100000L, active1, 0L);
      case 116:
         if ((active0 & 0x800000000000L) != 0L)
            return jjStartNfaWithStates_0(9, 47, 28);
         else if ((active1 & 0x80L) != 0L)
            return jjStartNfaWithStates_0(9, 71, 28);
         return jjMoveStringLiteralDfa10_0(active0, 0x20800000L, active1, 0L);
      case 121:
         return jjMoveStringLiteralDfa10_0(active0, 0x1000000L, active1, 0L);
      default :
         break;
   }
   return jjStartNfa_0(8, active0, active1);
}
private final int jjMoveStringLiteralDfa10_0(long old0, long active0, long old1, long active1)
{
   if (((active0 &= old0) | (active1 &= old1)) == 0L)
      return jjStartNfa_0(8, old0, old1); 
   try { curChar = input_stream.readChar(); }
   catch(java.io.IOException e) {
      jjStopStringLiteralDfa_0(9, active0, 0L);
      return 10;
   }
   switch(curChar)
   {
      case 45:
         return jjMoveStringLiteralDfa11_0(active0, 0x8000000L);
      case 97:
         return jjMoveStringLiteralDfa11_0(active0, 0x140000L);
      case 101:
         return jjMoveStringLiteralDfa11_0(active0, 0x8000200000000L);
      case 108:
         return jjMoveStringLiteralDfa11_0(active0, 0x2000000L);
      case 109:
         return jjMoveStringLiteralDfa11_0(active0, 0x1000000L);
      case 110:
         if ((active0 & 0x40000000000000L) != 0L)
            return jjStartNfaWithStates_0(10, 54, 28);
         break;
      case 111:
         return jjMoveStringLiteralDfa11_0(active0, 0x80000080000L);
      case 114:
         return jjMoveStringLiteralDfa11_0(active0, 0x10000c00000L);
      case 116:
         if ((active0 & 0x4000000000000000L) != 0L)
            return jjStartNfaWithStates_0(10, 62, 28);
         return jjMoveStringLiteralDfa11_0(active0, 0x10000000200000L);
      case 118:
         return jjMoveStringLiteralDfa11_0(active0, 0x1000000000000L);
      case 121:
         if ((active0 & 0x20000000L) != 0L)
            return jjStartNfaWithStates_0(10, 29, 28);
         break;
      default :
         break;
   }
   return jjStartNfa_0(9, active0, 0L);
}
private final int jjMoveStringLiteralDfa11_0(long old0, long active0)
{
   if (((active0 &= old0)) == 0L)
      return jjStartNfa_0(9, old0, 0L);
   try { curChar = input_stream.readChar(); }
   catch(java.io.IOException e) {
      jjStopStringLiteralDfa_0(10, active0, 0L);
      return 11;
   }
   switch(curChar)
   {
      case 45:
         return jjMoveStringLiteralDfa12_0(active0, 0x10000000000L);
      case 97:
         return jjMoveStringLiteralDfa12_0(active0, 0x80000L);
      case 98:
         return jjMoveStringLiteralDfa12_0(active0, 0x1000000L);
      case 99:
         return jjMoveStringLiteralDfa12_0(active0, 0x10000000000000L);
      case 101:
         if ((active0 & 0x1000000000000L) != 0L)
            return jjStartNfaWithStates_0(11, 48, 28);
         return jjMoveStringLiteralDfa12_0(active0, 0x600000L);
      case 102:
         return jjMoveStringLiteralDfa12_0(active0, 0x8000000L);
      case 105:
         return jjMoveStringLiteralDfa12_0(active0, 0x800000L);
      case 109:
         return jjMoveStringLiteralDfa12_0(active0, 0x100000L);
      case 115:
         return jjMoveStringLiteralDfa12_0(active0, 0x8000200040000L);
      case 116:
         if ((active0 & 0x80000000000L) != 0L)
            return jjStartNfaWithStates_0(11, 43, 28);
         break;
      case 117:
         return jjMoveStringLiteralDfa12_0(active0, 0x2000000L);
      default :
         break;
   }
   return jjStartNfa_0(10, active0, 0L);
}
private final int jjMoveStringLiteralDfa12_0(long old0, long active0)
{
   if (((active0 &= old0)) == 0L)
      return jjStartNfa_0(10, old0, 0L);
   try { curChar = input_stream.readChar(); }
   catch(java.io.IOException e) {
      jjStopStringLiteralDfa_0(11, active0, 0L);
      return 12;
   }
   switch(curChar)
   {
      case 97:
         return jjMoveStringLiteralDfa13_0(active0, 0x8000000L);
      case 101:
         return jjMoveStringLiteralDfa13_0(active0, 0x2000000L);
      case 103:
         return jjMoveStringLiteralDfa13_0(active0, 0x200000L);
      case 104:
         if ((active0 & 0x10000000000000L) != 0L)
            return jjStartNfaWithStates_0(12, 52, 28);
         break;
      case 109:
         return jjMoveStringLiteralDfa13_0(active0, 0x100000L);
      case 110:
         return jjMoveStringLiteralDfa13_0(active0, 0xc00000L);
      case 111:
         return jjMoveStringLiteralDfa13_0(active0, 0x10001000000L);
      case 115:
         return jjMoveStringLiteralDfa13_0(active0, 0x8000200040000L);
      case 116:
         return jjMoveStringLiteralDfa13_0(active0, 0x80000L);
      default :
         break;
   }
   return jjStartNfa_0(11, active0, 0L);
}
private final int jjMoveStringLiteralDfa13_0(long old0, long active0)
{
   if (((active0 &= old0)) == 0L)
      return jjStartNfa_0(11, old0, 0L);
   try { curChar = input_stream.readChar(); }
   catch(java.io.IOException e) {
      jjStopStringLiteralDfa_0(12, active0, 0L);
      return 13;
   }
   switch(curChar)
   {
      case 97:
         return jjMoveStringLiteralDfa14_0(active0, 0x8000000100000L);
      case 99:
         return jjMoveStringLiteralDfa14_0(active0, 0x8000000L);
      case 101:
         return jjMoveStringLiteralDfa14_0(active0, 0x240000L);
      case 103:
         return jjMoveStringLiteralDfa14_0(active0, 0x800000L);
      case 108:
         return jjMoveStringLiteralDfa14_0(active0, 0x1000000L);
      case 110:
         return jjMoveStringLiteralDfa14_0(active0, 0x10000000000L);
      case 111:
         return jjMoveStringLiteralDfa14_0(active0, 0x200000000L);
      case 115:
         if ((active0 & 0x80000L) != 0L)
            return jjStartNfaWithStates_0(13, 19, 28);
         else if ((active0 & 0x2000000L) != 0L)
            return jjStartNfaWithStates_0(13, 25, 28);
         break;
      case 116:
         return jjMoveStringLiteralDfa14_0(active0, 0x400000L);
      default :
         break;
   }
   return jjStartNfa_0(12, active0, 0L);
}
private final int jjMoveStringLiteralDfa14_0(long old0, long active0)
{
   if (((active0 &= old0)) == 0L)
      return jjStartNfa_0(12, old0, 0L);
   try { curChar = input_stream.readChar(); }
   catch(java.io.IOException e) {
      jjStopStringLiteralDfa_0(13, active0, 0L);
      return 14;
   }
   switch(curChar)
   {
      case 101:
         return jjMoveStringLiteralDfa15_0(active0, 0x8000000L);
      case 103:
         return jjMoveStringLiteralDfa15_0(active0, 0x8000000000000L);
      case 108:
         return jjMoveStringLiteralDfa15_0(active0, 0x10000000000L);
      case 114:
         if ((active0 & 0x100000L) != 0L)
            return jjStartNfaWithStates_0(14, 20, 28);
         else if ((active0 & 0x200000000L) != 0L)
            return jjStartNfaWithStates_0(14, 33, 28);
         return jjMoveStringLiteralDfa15_0(active0, 0x200000L);
      case 115:
         if ((active0 & 0x40000L) != 0L)
            return jjStartNfaWithStates_0(14, 18, 28);
         else if ((active0 & 0x400000L) != 0L)
            return jjStartNfaWithStates_0(14, 22, 28);
         else if ((active0 & 0x800000L) != 0L)
            return jjStartNfaWithStates_0(14, 23, 28);
         else if ((active0 & 0x1000000L) != 0L)
            return jjStartNfaWithStates_0(14, 24, 28);
         break;
      default :
         break;
   }
   return jjStartNfa_0(13, active0, 0L);
}
private final int jjMoveStringLiteralDfa15_0(long old0, long active0)
{
   if (((active0 &= old0)) == 0L)
      return jjStartNfa_0(13, old0, 0L);
   try { curChar = input_stream.readChar(); }
   catch(java.io.IOException e) {
      jjStopStringLiteralDfa_0(14, active0, 0L);
      return 15;
   }
   switch(curChar)
   {
      case 101:
         if ((active0 & 0x8000000000000L) != 0L)
            return jjStartNfaWithStates_0(15, 51, 28);
         break;
      case 115:
         if ((active0 & 0x200000L) != 0L)
            return jjStartNfaWithStates_0(15, 21, 28);
         break;
      case 116:
         if ((active0 & 0x8000000L) != 0L)
            return jjStartNfaWithStates_0(15, 27, 28);
         break;
      case 121:
         if ((active0 & 0x10000000000L) != 0L)
            return jjStartNfaWithStates_0(15, 40, 28);
         break;
      default :
         break;
   }
   return jjStartNfa_0(14, active0, 0L);
}
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 = {   0xfffffffffffffffeL, 0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffffffffffffffL};
static final long[] jjbitVec2 = {   0x0L, 0x0L, 0xffffffffffffffffL, 0xffffffffffffffffL};
private final int jjMoveNfa_0(int startState, int curPos)
{
   int[] nextStates;
   int startsAt = 0;
   jjnewStateCnt = 28;
   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 28:
                  if ((0xfffffcfeffffd9ffL & l) != 0L)
                  {
                     if (kind > 78)
                        kind = 78;
                     jjCheckNAddTwoStates(17, 20);
                  }
                  else if (curChar == 40)
                     jjCheckNAddTwoStates(18, 19);
                  break;
               case 0:
                  if ((0xfffffcfaffffd9ffL & l) != 0L)
                  {
                     if (kind > 78)
                        kind = 78;
                     jjCheckNAddTwoStates(17, 20);
                  }
                  else if (curChar == 34)
                     jjCheckNAddStates(0, 2);
                  if (curChar == 59)
                     jjCheckNAddStates(3, 5);
                  break;
               case 24:
                  if ((0xfffff7ffffffffffL & l) != 0L)
                     jjCheckNAddStates(6, 8);
                  if ((0xfffffcfeffffd9ffL & l) != 0L)
                  {
                     if (kind > 78)
                        kind = 78;
                     jjCheckNAddTwoStates(17, 20);
                  }
                  else if ((0x2400L & l) != 0L)
                  {
                     if (kind > 5)
                        kind = 5;
                  }
                  else if (curChar == 40)
                     jjCheckNAddTwoStates(18, 19);
                  if (curChar == 13)
                     jjCheckNAdd(23);
                  break;
               case 1:
                  if ((0xfffffcfaffffd9ffL & l) != 0L)
                     jjCheckNAddStates(9, 11);
                  break;
               case 2:
                  if (curChar == 40)
                     jjCheckNAddTwoStates(3, 4);
                  break;
               case 3:
                  if ((0xfffffcfeffffd9ffL & l) != 0L)
                     jjCheckNAddTwoStates(3, 4);
                  break;
               case 4:
                  if (curChar == 41)
                     jjCheckNAddStates(9, 11);
                  break;
               case 5:
                  if ((0xfffffcfeffffd9ffL & l) != 0L)
                     jjCheckNAddStates(9, 11);
                  break;
               case 7:
                  if (curChar == 34)
                     jjCheckNAddStates(0, 2);
                  break;
               case 8:
                  if ((0xfffffffbffffdbffL & l) != 0L)
                     jjCheckNAddStates(0, 2);
                  break;
               case 10:
                  if ((0x8400000000L & l) != 0L)
                     jjCheckNAddStates(0, 2);
                  break;
               case 11:
                  if (curChar == 34 && kind > 77)
                     kind = 77;
                  break;
               case 12:
                  if ((0xff000000000000L & l) != 0L)
                     jjCheckNAddStates(12, 15);
                  break;
               case 13:
                  if ((0xff000000000000L & l) != 0L)
                     jjCheckNAddStates(0, 2);
                  break;
               case 14:
                  if ((0xf000000000000L & l) != 0L)

⌨️ 快捷键说明

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