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

📄 htmlparsertokenmanager.java

📁 天乙代码src_531.rar 天乙代码src_531.rar 天乙代码src_531.rar 天乙代码src_531.rar
💻 JAVA
📖 第 1 页 / 共 3 页
字号:
      if (curChar < 64) {        long l = 1L << curChar;        MatchLoop:do {          switch (jjstateSet[--i]) {            case 1:              if ( (0xfffffffbffffffffL & l) != 0L) {                if (kind > 21) {                  kind = 21;                }                jjCheckNAdd(0);              }              else if (curChar == 34) {                if (kind > 22) {                  kind = 22;                }              }              break;            case 0:              if ( (0xfffffffbffffffffL & l) == 0L) {                break;              }              kind = 21;              jjCheckNAdd(0);              break;            default:              break;          }        }        while (i != startsAt);      }      else if (curChar < 128) {        long l = 1L << (curChar & 077);        MatchLoop:do {          switch (jjstateSet[--i]) {            case 1:            case 0:              kind = 21;              jjCheckNAdd(0);              break;            default:              break;          }        }        while (i != startsAt);      }      else {        int i2 = (curChar & 0xff) >> 6;        long l2 = 1L << (curChar & 077);        MatchLoop:do {          switch (jjstateSet[--i]) {            case 1:            case 0:              if ( (jjbitVec0[i2] & l2) == 0L) {                break;              }              if (kind > 21) {                kind = 21;              }              jjCheckNAdd(0);              break;            default:              break;          }        }        while (i != startsAt);      }      if (kind != 0x7fffffff) {        jjmatchedKind = kind;        jjmatchedPos = curPos;        kind = 0x7fffffff;      }      ++curPos;      if ( (i = jjnewStateCnt) == (startsAt = 2 - (jjnewStateCnt = startsAt))) {        return curPos;      }      try {        curChar = input_stream.readChar();      }      catch (java.io.IOException e) {        return curPos;      }    }  }  private final int jjStopStringLiteralDfa_6(int pos, long active0) {    switch (pos) {      default:        return -1;    }  }  private final int jjStartNfa_6(int pos, long active0) {    return jjMoveNfa_6(jjStopStringLiteralDfa_6(pos, active0), pos + 1);  }  private final int jjStartNfaWithStates_6(int pos, int kind, int state) {    jjmatchedKind = kind;    jjmatchedPos = pos;    try {      curChar = input_stream.readChar();    }    catch (java.io.IOException e) {      return pos + 1;    }    return jjMoveNfa_6(state, pos + 1);  }  private final int jjMoveStringLiteralDfa0_6() {    switch (curChar) {      case 62:        return jjStopAtPos(0, 26);      default:        return jjMoveNfa_6(0, 0);    }  }  private final int jjMoveNfa_6(int startState, int curPos) {    int[] nextStates;    int startsAt = 0;    jjnewStateCnt = 1;    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 0:              if ( (0xbfffffffffffffffL & l) == 0L) {                break;              }              kind = 25;              jjstateSet[jjnewStateCnt++] = 0;              break;            default:              break;          }        }        while (i != startsAt);      }      else if (curChar < 128) {        long l = 1L << (curChar & 077);        MatchLoop:do {          switch (jjstateSet[--i]) {            case 0:              kind = 25;              jjstateSet[jjnewStateCnt++] = 0;              break;            default:              break;          }        }        while (i != startsAt);      }      else {        int i2 = (curChar & 0xff) >> 6;        long l2 = 1L << (curChar & 077);        MatchLoop:do {          switch (jjstateSet[--i]) {            case 0:              if ( (jjbitVec0[i2] & l2) == 0L) {                break;              }              if (kind > 25) {                kind = 25;              }              jjstateSet[jjnewStateCnt++] = 0;              break;            default:              break;          }        }        while (i != startsAt);      }      if (kind != 0x7fffffff) {        jjmatchedKind = kind;        jjmatchedPos = curPos;        kind = 0x7fffffff;      }      ++curPos;      if ( (i = jjnewStateCnt) == (startsAt = 1 - (jjnewStateCnt = startsAt))) {        return curPos;      }      try {        curChar = input_stream.readChar();      }      catch (java.io.IOException e) {        return curPos;      }    }  }  private final int jjMoveStringLiteralDfa0_3() {    return jjMoveNfa_3(1, 0);  }  private final int jjMoveNfa_3(int startState, int curPos) {    int[] nextStates;    int startsAt = 0;    jjnewStateCnt = 2;    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 1:              if ( (0xffffff7fffffffffL & l) != 0L) {                if (kind > 19) {                  kind = 19;                }                jjCheckNAdd(0);              }              else if (curChar == 39) {                if (kind > 20) {                  kind = 20;                }              }              break;            case 0:              if ( (0xffffff7fffffffffL & l) == 0L) {                break;              }              kind = 19;              jjCheckNAdd(0);              break;            default:              break;          }        }        while (i != startsAt);      }      else if (curChar < 128) {        long l = 1L << (curChar & 077);        MatchLoop:do {          switch (jjstateSet[--i]) {            case 1:            case 0:              kind = 19;              jjCheckNAdd(0);              break;            default:              break;          }        }        while (i != startsAt);      }      else {        int i2 = (curChar & 0xff) >> 6;        long l2 = 1L << (curChar & 077);        MatchLoop:do {          switch (jjstateSet[--i]) {            case 1:            case 0:              if ( (jjbitVec0[i2] & l2) == 0L) {                break;              }              if (kind > 19) {                kind = 19;              }              jjCheckNAdd(0);              break;            default:              break;          }        }        while (i != startsAt);      }      if (kind != 0x7fffffff) {        jjmatchedKind = kind;        jjmatchedPos = curPos;        kind = 0x7fffffff;      }      ++curPos;      if ( (i = jjnewStateCnt) == (startsAt = 2 - (jjnewStateCnt = startsAt))) {        return curPos;      }      try {        curChar = input_stream.readChar();      }      catch (java.io.IOException e) {        return curPos;      }    }  }  private final int jjStopStringLiteralDfa_2(int pos, long active0) {    switch (pos) {      default:        return -1;    }  }  private final int jjStartNfa_2(int pos, long active0) {    return jjMoveNfa_2(jjStopStringLiteralDfa_2(pos, active0), pos + 1);  }  private final int jjStartNfaWithStates_2(int pos, int kind, int state) {    jjmatchedKind = kind;    jjmatchedPos = pos;    try {      curChar = input_stream.readChar();    }    catch (java.io.IOException e) {      return pos + 1;    }    return jjMoveNfa_2(state, pos + 1);  }  private final int jjMoveStringLiteralDfa0_2() {    switch (curChar) {      case 34:        return jjStopAtPos(0, 17);      case 39:        return jjStopAtPos(0, 16);      default:        return jjMoveNfa_2(0, 0);    }  }  private final int jjMoveNfa_2(int startState, int curPos) {    int[] nextStates;    int startsAt = 0;    jjnewStateCnt = 3;    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 0:              if ( (0x9fffff7affffd9ffL & l) != 0L) {                if (kind > 15) {                  kind = 15;                }                jjCheckNAdd(1);              }              else if ( (0x100002600L & l) != 0L) {                if (kind > 18) {                  kind = 18;                }                jjCheckNAdd(2);              }              break;            case 1:              if ( (0xbffffffeffffd9ffL & l) == 0L) {                break;              }              if (kind > 15) {                kind = 15;              }              jjCheckNAdd(1);              break;            case 2:              if ( (0x100002600L & l) == 0L) {                break;              }              kind = 18;              jjCheckNAdd(2);              break;            default:              break;          }        }        while (i != startsAt);      }      else if (curChar < 128) {        long l = 1L << (curChar & 077);        MatchLoop:do {          switch (jjstateSet[--i]) {            case 0:            case 1:              if (kind > 15) {                kind = 15;              }              jjCheckNAdd(1);              break;            default:              break;          }        }        while (i != startsAt);      }      else {        int i2 = (curChar & 0xff) >> 6;        long l2 = 1L << (curChar & 077);        MatchLoop:do {          switch (jjstateSet[--i]) {            case 0:            case 1:              if ( (jjbitVec0[i2] & l2) == 0L) {                break;              }              if (kind > 15) {                kind = 15;              }              jjCheckNAdd(1);              break;            default:              break;          }        }        while (i != startsAt);      }      if (kind != 0x7fffffff) {        jjmatchedKind = kind;        jjmatchedPos = curPos;        kind = 0x7fffffff;      }      ++curPos;      if ( (i = jjnewStateCnt) == (startsAt = 3 - (jjnewStateCnt = startsAt))) {        return curPos;      }      try {        curChar = input_stream.readChar();      }      catch (java.io.IOException e) {        return curPos;      }    }  }  private final int jjStopStringLiteralDfa_5(int pos, long active0) {    switch (pos) {      case 0:        if ( (active0 & 0x1000000L) != 0L) {          jjmatchedKind = 23;          return -1;        }        return -1;      case 1:        if ( (active0 & 0x1000000L) != 0L) {          if (jjmatchedPos == 0) {            jjmatchedKind = 23;            jjmatchedPos = 0;          }          return -1;        }        return -1;      default:        return -1;    }  }  private final int jjStartNfa_5(int pos, long active0) {    return jjMoveNfa_5(jjStopStringLiteralDfa_5(pos, active0), pos + 1);  }  private final int jjStartNfaWithStates_5(int pos, int kind, int state) {    jjmatchedKind = kind;    jjmatchedPos = pos;    try {      curChar = input_stream.readChar();    }    catch (java.io.IOException e) {      return pos + 1;    }    return jjMoveNfa_5(state, pos + 1);  }  private final int jjMoveStringLiteralDfa0_5() {    switch (curChar) {      case 45:        return jjMoveStringLiteralDfa1_5(0x1000000L);      default:        return jjMoveNfa_5(1, 0);    }  }  private final int jjMoveStringLiteralDfa1_5(long active0) {    try {      curChar = input_stream.readChar();    }    catch (java.io.IOException e) {      jjStopStringLiteralDfa_5(0, active0);      return 1;

⌨️ 快捷键说明

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