sacparsertokenmanager.java

cssparser -- CSS 的语法解析器。采用java语言编写。可用在服务端生成页面。

         return jjMoveStringLiteralDfa5_0(active0, 0x900000000L);
      case 84:
      case 116:
         return jjMoveStringLiteralDfa5_0(active0, 0x80000000L);
      default :
         break;
   }
   return jjStartNfa_0(3, active0);
}
private final int jjMoveStringLiteralDfa5_0(long old0, long active0)
{
   if (((active0 &= old0)) == 0L)
      return jjStartNfa_0(3, old0); 
   try { curChar = input_stream.readChar(); }
   catch(java.io.IOException e) {
      jjStopStringLiteralDfa_0(4, active0);
      return 5;
   }
   switch(curChar)
   {
      case 45:
         return jjMoveStringLiteralDfa6_0(active0, 0x80000000L);
      case 65:
      case 97:
         if ((active0 & 0x40000000L) != 0L)
            return jjStartNfaWithStates_0(5, 30, 428);
         break;
      case 73:
      case 105:
         return jjMoveStringLiteralDfa6_0(active0, 0x800000000L);
      case 82:
      case 114:
         return jjMoveStringLiteralDfa6_0(active0, 0x10000000L);
      case 83:
      case 115:
         return jjMoveStringLiteralDfa6_0(active0, 0x100000000L);
      default :
         break;
   }
   return jjStartNfa_0(4, active0);
}
private final int jjMoveStringLiteralDfa6_0(long old0, long active0)
{
   if (((active0 &= old0)) == 0L)
      return jjStartNfa_0(4, old0); 
   try { curChar = input_stream.readChar(); }
   catch(java.io.IOException e) {
      jjStopStringLiteralDfa_0(5, active0);
      return 6;
   }
   switch(curChar)
   {
      case 69:
      case 101:
         return jjMoveStringLiteralDfa7_0(active0, 0x100000000L);
      case 70:
      case 102:
         return jjMoveStringLiteralDfa7_0(active0, 0x80000000L);
      case 84:
      case 116:
         if ((active0 & 0x10000000L) != 0L)
            return jjStartNfaWithStates_0(6, 28, 428);
         else if ((active0 & 0x800000000L) != 0L)
            return jjStartNfaWithStates_0(6, 35, 426);
         break;
      default :
         break;
   }
   return jjStartNfa_0(5, active0);
}
private final int jjMoveStringLiteralDfa7_0(long old0, long active0)
{
   if (((active0 &= old0)) == 0L)
      return jjStartNfa_0(5, old0); 
   try { curChar = input_stream.readChar(); }
   catch(java.io.IOException e) {
      jjStopStringLiteralDfa_0(6, active0);
      return 7;
   }
   switch(curChar)
   {
      case 65:
      case 97:
         return jjMoveStringLiteralDfa8_0(active0, 0x80000000L);
      case 84:
      case 116:
         if ((active0 & 0x100000000L) != 0L)
            return jjStartNfaWithStates_0(7, 32, 428);
         break;
      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 67:
      case 99:
         return jjMoveStringLiteralDfa9_0(active0, 0x80000000L);
      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 69:
      case 101:
         if ((active0 & 0x80000000L) != 0L)
            return jjStartNfaWithStates_0(9, 31, 428);
         break;
      default :
         break;
   }
   return jjStartNfa_0(8, 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 = {
   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 = 426;
   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 428:
               case 62:
                  if ((0x3ff200000000000L & l) == 0L)
                     break;
                  if (kind > 33)
                     kind = 33;
                  jjCheckNAddTwoStates(62, 63);
                  break;
               case 427:
                  if ((0x3ff000000000000L & l) != 0L)
                  {
                     if (kind > 58)
                        kind = 58;
                     jjCheckNAdd(308);
                  }
                  if ((0x3ff000000000000L & l) != 0L)
                  {
                     if (kind > 53)
                        kind = 53;
                     jjCheckNAdd(307);
                  }
                  if ((0x3ff000000000000L & l) != 0L)
                     jjCheckNAddTwoStates(305, 306);
                  if ((0x3ff000000000000L & l) != 0L)
                     jjCheckNAddStates(0, 2);
                  if ((0x3ff000000000000L & l) != 0L)
                     jjCheckNAddTwoStates(270, 273);
                  if ((0x3ff000000000000L & l) != 0L)
                     jjCheckNAddTwoStates(267, 269);
                  if ((0x3ff000000000000L & l) != 0L)
                     jjCheckNAddTwoStates(265, 266);
                  if ((0x3ff000000000000L & l) != 0L)
                     jjCheckNAddTwoStates(262, 264);
                  if ((0x3ff000000000000L & l) != 0L)
                     jjCheckNAddTwoStates(257, 261);
                  if ((0x3ff000000000000L & l) != 0L)
                     jjCheckNAddTwoStates(253, 256);
                  if ((0x3ff000000000000L & l) != 0L)
                     jjCheckNAddTwoStates(249, 252);
                  if ((0x3ff000000000000L & l) != 0L)
                     jjCheckNAddTwoStates(246, 248);
                  if ((0x3ff000000000000L & l) != 0L)
                     jjCheckNAddTwoStates(243, 245);
                  if ((0x3ff000000000000L & l) != 0L)
                     jjCheckNAddTwoStates(240, 242);
                  if ((0x3ff000000000000L & l) != 0L)
                     jjCheckNAddTwoStates(237, 239);
                  if ((0x3ff000000000000L & l) != 0L)
                     jjCheckNAddTwoStates(234, 236);
                  if ((0x3ff000000000000L & l) != 0L)
                     jjCheckNAddTwoStates(231, 233);
                  if ((0x3ff000000000000L & l) != 0L)
                     jjCheckNAddTwoStates(228, 230);
                  if ((0x3ff000000000000L & l) != 0L)
                     jjCheckNAddTwoStates(225, 227);
                  break;
               case 1:
                  if ((0x3ff000000000000L & l) != 0L)
                  {
                     if (kind > 53)
                        kind = 53;
                     jjCheckNAddStates(3, 77);
                  }
                  else if ((0x100003600L & l) != 0L)
                  {
                     if (kind > 1)
                        kind = 1;
                     jjCheckNAdd(0);
                  }
                  else if (curChar == 46)
                     jjCheckNAddStates(78, 96);
                  else if (curChar == 33)
                     jjCheckNAddTwoStates(92, 101);
                  else if (curChar == 39)
                     jjCheckNAddStates(97, 99);
                  else if (curChar == 34)
                     jjCheckNAddStates(100, 102);
                  else if (curChar == 35)
                     jjCheckNAddTwoStates(2, 3);
                  break;
               case 426:
                  if ((0x3ff200000000000L & l) != 0L)
                  {
                     if (kind > 56)
                        kind = 56;
                     jjCheckNAddTwoStates(327, 328);
                  }
                  else if (curChar == 40)
                  {
                     if (kind > 55)
                        kind = 55;
                  }
                  if ((0x3ff200000000000L & l) != 0L)
                     jjCheckNAddStates(103, 105);
                  break;
               case 0:
                  if ((0x100003600L & l) == 0L)
                     break;
                  if (kind > 1)
                     kind = 1;
                  jjCheckNAdd(0);
                  break;
               case 2:
                  if ((0x3ff200000000000L & l) == 0L)
                     break;
                  if (kind > 19)
                     kind = 19;
                  jjCheckNAddTwoStates(2, 3);
                  break;
               case 4:
                  if ((0xffffffff00000000L & l) == 0L)
                     break;
                  if (kind > 19)
                     kind = 19;
                  jjCheckNAddTwoStates(2, 3);
                  break;
               case 5:
                  if ((0x3ff000000000000L & l) == 0L)
                     break;
                  if (kind > 19)
                     kind = 19;
                  jjCheckNAddStates(106, 113);
                  break;
               case 6:
                  if ((0x3ff000000000000L & l) == 0L)
                     break;
                  if (kind > 19)
                     kind = 19;
                  jjCheckNAddStates(114, 116);
                  break;
               case 7:
                  if ((0x100003600L & l) == 0L)
                     break;
                  if (kind > 19)
                     kind = 19;
                  jjCheckNAddTwoStates(2, 3);
                  break;
               case 8:
               case 10:
               case 13:
               case 17:
                  if ((0x3ff000000000000L & l) != 0L)
                     jjCheckNAdd(6);
                  break;
               case 9:
                  if ((0x3ff000000000000L & l) != 0L)
                     jjstateSet[jjnewStateCnt++] = 10;
                  break;
               case 11:
                  if ((0x3ff000000000000L & l) != 0L)
                     jjstateSet[jjnewStateCnt++] = 12;
                  break;
               case 12:
                  if ((0x3ff000000000000L & l) != 0L)
                     jjstateSet[jjnewStateCnt++] = 13;
                  break;
               case 14:
                  if ((0x3ff000000000000L & l) != 0L)
                     jjstateSet[jjnewStateCnt++] = 15;
                  break;
               case 15:
                  if ((0x3ff000000000000L & l) != 0L)
                     jjstateSet[jjnewStateCnt++] = 16;
                  break;
               case 16:
                  if ((0x3ff000000000000L & l) != 0L)
                     jjstateSet[jjnewStateCnt++] = 17;
                  break;
               case 18:
                  if (curChar == 34)
                     jjCheckNAddStates(100, 102);
                  break;
               case 19:
                  if ((0xfffffffb00000200L & l) != 0L)
                     jjCheckNAddStates(100, 102);
                  break;
               case 20:
                  if (curChar == 34 && kind > 20)
                     kind = 20;
                  break;
               case 22:
                  if ((0x3400L & l) != 0L)
                     jjCheckNAddStates(100, 102);
                  break;
               case 23:
                  if (curChar == 10)
                     jjCheckNAddStates(100, 102);
                  break;
               case 24:
                  if (curChar == 13)
                     jjstateSet[jjnewStateCnt++] = 23;
                  break;
               case 25:
                  if ((0xffffffff00000000L & l) != 0L)
                     jjCheckNAddStates(100, 102);
                  break;
               case 26: