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

📄 sacparsertokenmanager.java

📁 cssparser -- CSS 的语法解析器。采用java语言编写。可用在服务端生成页面。
💻 JAVA
📖 第 1 页 / 共 5 页
字号:
                  break;               case 151:                  if ((0x3ff000000000000L & l) != 0L)                     jjCheckNAddStates(207, 215);                  break;               case 152:                  if ((0x3ff000000000000L & l) != 0L)                     jjCheckNAddStates(216, 219);                  break;               case 153:                  if ((0x100003600L & l) != 0L)                     jjCheckNAddStates(204, 206);                  break;               case 154:               case 156:               case 159:               case 163:                  if ((0x3ff000000000000L & l) != 0L)                     jjCheckNAdd(152);                  break;               case 155:                  if ((0x3ff000000000000L & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 156;                  break;               case 157:                  if ((0x3ff000000000000L & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 158;                  break;               case 158:                  if ((0x3ff000000000000L & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 159;                  break;               case 160:                  if ((0x3ff000000000000L & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 161;                  break;               case 161:                  if ((0x3ff000000000000L & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 162;                  break;               case 162:                  if ((0x3ff000000000000L & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 163;                  break;               case 164:                  if ((0x100003600L & l) != 0L)                     jjCheckNAddStates(220, 226);                  break;               case 167:                  if (curChar == 43)                     jjCheckNAddStates(227, 229);                  break;               case 168:               case 197:                  if (curChar == 63 && kind > 59)                     kind = 59;                  break;               case 169:                  if ((0x3ff000000000000L & l) == 0L)                     break;                  if (kind > 59)                     kind = 59;                  jjCheckNAddStates(230, 238);                  break;               case 170:                  if ((0x3ff000000000000L & l) != 0L)                     jjCheckNAdd(171);                  break;               case 171:                  if (curChar == 45)                     jjstateSet[jjnewStateCnt++] = 172;                  break;               case 172:                  if ((0x3ff000000000000L & l) == 0L)                     break;                  if (kind > 59)                     kind = 59;                  jjCheckNAddStates(239, 243);                  break;               case 173:                  if ((0x3ff000000000000L & l) != 0L && kind > 59)                     kind = 59;                  break;               case 174:               case 176:               case 179:               case 183:                  if ((0x3ff000000000000L & l) != 0L)                     jjCheckNAdd(173);                  break;               case 175:                  if ((0x3ff000000000000L & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 176;                  break;               case 177:                  if ((0x3ff000000000000L & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 178;                  break;               case 178:                  if ((0x3ff000000000000L & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 179;                  break;               case 180:                  if ((0x3ff000000000000L & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 181;                  break;               case 181:                  if ((0x3ff000000000000L & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 182;                  break;               case 182:                  if ((0x3ff000000000000L & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 183;                  break;               case 184:               case 186:               case 189:               case 193:                  if ((0x3ff000000000000L & l) != 0L)                     jjCheckNAdd(170);                  break;               case 185:                  if ((0x3ff000000000000L & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 186;                  break;               case 187:                  if ((0x3ff000000000000L & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 188;                  break;               case 188:                  if ((0x3ff000000000000L & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 189;                  break;               case 190:                  if ((0x3ff000000000000L & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 191;                  break;               case 191:                  if ((0x3ff000000000000L & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 192;                  break;               case 192:                  if ((0x3ff000000000000L & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 193;                  break;               case 194:                  if ((0x3ff000000000000L & l) == 0L)                     break;                  if (kind > 59)                     kind = 59;                  jjCheckNAddStates(244, 246);                  break;               case 195:                  if ((0x3ff000000000000L & l) == 0L)                     break;                  if (kind > 59)                     kind = 59;                  jjCheckNAddStates(247, 249);                  break;               case 196:                  if ((0x3ff000000000000L & l) == 0L)                     break;                  if (kind > 59)                     kind = 59;                  jjCheckNAddStates(250, 252);                  break;               case 198:               case 201:               case 203:               case 204:               case 207:               case 208:               case 210:               case 214:               case 218:               case 221:               case 223:                  if (curChar == 63)                     jjCheckNAdd(197);                  break;               case 199:                  if ((0x3ff000000000000L & l) == 0L)                     break;                  if (kind > 59)                     kind = 59;                  jjCheckNAddTwoStates(168, 173);                  break;               case 200:                  if (curChar == 63)                     jjCheckNAddTwoStates(197, 201);                  break;               case 202:                  if (curChar == 63)                     jjCheckNAddStates(253, 255);                  break;               case 205:                  if (curChar == 63)                     jjstateSet[jjnewStateCnt++] = 204;                  break;               case 206:                  if (curChar == 63)                     jjCheckNAddStates(256, 259);                  break;               case 209:                  if (curChar == 63)                     jjstateSet[jjnewStateCnt++] = 208;                  break;               case 211:                  if (curChar == 63)                     jjstateSet[jjnewStateCnt++] = 210;                  break;               case 212:                  if (curChar == 63)                     jjstateSet[jjnewStateCnt++] = 211;                  break;               case 213:                  if (curChar == 63)                     jjCheckNAddStates(260, 264);                  break;               case 215:                  if (curChar == 63)                     jjstateSet[jjnewStateCnt++] = 214;                  break;               case 216:                  if (curChar == 63)                     jjstateSet[jjnewStateCnt++] = 215;                  break;               case 217:                  if (curChar == 63)                     jjstateSet[jjnewStateCnt++] = 216;                  break;               case 219:                  if (curChar == 63)                     jjstateSet[jjnewStateCnt++] = 218;                  break;               case 220:                  if (curChar == 63)                     jjstateSet[jjnewStateCnt++] = 219;                  break;               case 222:                  if (curChar == 63)                     jjstateSet[jjnewStateCnt++] = 221;                  break;               case 224:                  if (curChar == 46)                     jjCheckNAddStates(78, 96);                  break;               case 225:                  if ((0x3ff000000000000L & l) != 0L)                     jjCheckNAddTwoStates(225, 227);                  break;               case 228:                  if ((0x3ff000000000000L & l) != 0L)                     jjCheckNAddTwoStates(228, 230);                  break;               case 231:                  if ((0x3ff000000000000L & l) != 0L)                     jjCheckNAddTwoStates(231, 233);                  break;               case 234:                  if ((0x3ff000000000000L & l) != 0L)                     jjCheckNAddTwoStates(234, 236);                  break;               case 237:                  if ((0x3ff000000000000L & l) != 0L)                     jjCheckNAddTwoStates(237, 239);                  break;               case 240:                  if ((0x3ff000000000000L & l) != 0L)                     jjCheckNAddTwoStates(240, 242);                  break;               case 243:                  if ((0x3ff000000000000L & l) != 0L)                     jjCheckNAddTwoStates(243, 245);                  break;               case 246:                  if ((0x3ff000000000000L & l) != 0L)                     jjCheckNAddTwoStates(246, 248);                  break;               case 249:                  if ((0x3ff000000000000L & l) != 0L)                     jjCheckNAddTwoStates(249, 252);                  break;               case 253:                  if ((0x3ff000000000000L & l) != 0L)                     jjCheckNAddTwoStates(253, 256);                  break;               case 257:                  if ((0x3ff000000000000L & l) != 0L)                     jjCheckNAddTwoStates(257, 261);                  break;               case 262:                  if ((0x3ff000000000000L & l) != 0L)                     jjCheckNAddTwoStates(262, 264);                  break;               case 265:                  if ((0x3ff000000000000L & l) != 0L)                     jjCheckNAddTwoStates(265, 266);                  break;               case 267:                  if ((0x3ff000000000000L & l) != 0L)                     jjCheckNAddTwoStates(267, 269);                  break;               case 270:                  if ((0x3ff000000000000L & l) != 0L)                     jjCheckNAddTwoStates(270, 273);                  break;               case 274:                  if ((0x3ff000000000000L & l) != 0L)                     jjCheckNAddStates(0, 2);                  break;               case 276:                  if ((0x3ff200000000000L & l) == 0L)                     break;                  if (kind > 51)                     kind = 51;                  jjCheckNAddTwoStates(276, 277);                  break;               case 278:                  if ((0xffffffff00000000L & l) == 0L)                     break;                  if (kind > 51)                     kind = 51;                  jjCheckNAddTwoStates(276, 277);                  break;               case 279:                  if ((0x3ff000000000000L & l) == 0L)                     break;                  if (kind > 51)                     kind = 51;                  jjCheckNAddStates(265, 272);                  break;               case 280:                  if ((0x3ff000000000000L & l) == 0L)                     break;                  if (kind > 51)                     kind = 51;                  jjCheckNAddStates(273, 275);                  break;               case 281:                  if ((0x100003600L & l) == 0L)                     break;                  if (kind > 51)                     kind = 51;                  jjCheckNAddTwoStates(276, 277);                  break;               case 282:               case 284:               case 287:               case 291:                  if ((0x3ff000000000000L & l) != 0L)                     jjCheckNAdd(280);                  break;               case 283:                  if ((0x3ff000000000000L & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 284;                  break;               case 285:                  if ((0x3ff000000000000L & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 286;                  break;               case 286:                  if ((0x3ff000000000000L & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 287;                  break;               case 288:                  if ((0x3ff000000000000L & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 289;                  break;               case 289:                  if ((0x3ff000000000000L & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 290;                  break;               case 290:                  if ((0x3ff000000000000L & l) != 0L)                     jjstateSet[jjnewStateCnt++] = 291;                  break;               case 293:                  if ((0x3ff000000000000L & l) == 0L)                     break;                  if (kind > 51)                     kind = 51;                  jjCheckNAddStates(276, 283);                  break;               case 294:                  if ((0x3ff000000000000L & l) == 0L)

⌨️ 快捷键说明

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