📄 htmlparsertokenmanager.java
字号:
/* Generated By:JavaCC: Do not edit this line. HtmlParserTokenManager.java */package com.quiotix.html.parser;public class HtmlParserTokenManager implements HtmlParserConstants{private final int jjStopStringLiteralDfa_7(int pos, long active0){ switch (pos) { default : return -1; }}private final int jjStartNfa_7(int pos, long active0){ return jjMoveNfa_7(jjStopStringLiteralDfa_7(pos, active0), pos + 1);}private final int jjStopAtPos(int pos, int kind){ jjmatchedKind = kind; jjmatchedPos = pos; return pos + 1;}private final int jjStartNfaWithStates_7(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_7(state, pos + 1);}private final int jjMoveStringLiteralDfa0_7(){ switch(curChar) { case 60: jjmatchedKind = 12; return jjMoveStringLiteralDfa1_7(0xe000L); default : return jjMoveNfa_7(5, 0); }}private final int jjMoveStringLiteralDfa1_7(long active0){ try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { jjStopStringLiteralDfa_7(0, active0); return 1; } switch(curChar) { case 33: if ((active0 & 0x8000L) != 0L) { jjmatchedKind = 15; jjmatchedPos = 1; } return jjMoveStringLiteralDfa2_7(active0, 0x4000L); case 47: if ((active0 & 0x2000L) != 0L) return jjStopAtPos(1, 13); break; default : break; } return jjStartNfa_7(0, active0);}private final int jjMoveStringLiteralDfa2_7(long old0, long active0){ if (((active0 &= old0)) == 0L) return jjStartNfa_7(0, old0); try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { jjStopStringLiteralDfa_7(1, active0); return 2; } switch(curChar) { case 45: return jjMoveStringLiteralDfa3_7(active0, 0x4000L); default : break; } return jjStartNfa_7(1, active0);}private final int jjMoveStringLiteralDfa3_7(long old0, long active0){ if (((active0 &= old0)) == 0L) return jjStartNfa_7(1, old0); try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { jjStopStringLiteralDfa_7(2, active0); return 3; } switch(curChar) { case 45: if ((active0 & 0x4000L) != 0L) return jjStopAtPos(3, 14); break; default : break; } return jjStartNfa_7(2, 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 = { 0x0L, 0x0L, 0xffffffffffffffffL, 0xffffffffffffffffL};private final int jjMoveNfa_7(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 12; 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 5: if ((0xefffff7bffffdbffL & l) != 0L) { if (kind > 16) kind = 16; jjCheckNAdd(4); } else if ((0x8400000000L & l) != 0L) { if (kind > 18) kind = 18; } else if ((0x2400L & l) != 0L) { if (kind > 11) kind = 11; } if ((0x100000200L & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 34) jjCheckNAddTwoStates(9, 10); else if (curChar == 39) jjCheckNAddTwoStates(6, 7); else if (curChar == 13) jjstateSet[jjnewStateCnt++] = 1; break; case 0: if ((0x100000200L & l) != 0L) jjCheckNAddStates(0, 2); break; case 1: if (curChar == 10 && kind > 11) kind = 11; break; case 2: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 1; break; case 3: if ((0x2400L & l) != 0L && kind > 11) kind = 11; break; case 4: if ((0xefffff7bffffdbffL & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(4); break; case 6: if ((0xffffff7fffffdbffL & l) != 0L) jjCheckNAddTwoStates(6, 7); break; case 7: if (curChar == 39 && kind > 17) kind = 17; break; case 8: if (curChar == 34) jjCheckNAddTwoStates(9, 10); break; case 9: if ((0xfffffffbffffdbffL & l) != 0L) jjCheckNAddTwoStates(9, 10); break; case 10: if (curChar == 34 && kind > 17) kind = 17; break; case 11: if ((0x8400000000L & l) != 0L && kind > 18) kind = 18; break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 5: case 4: if (kind > 16) kind = 16; jjCheckNAdd(4); break; case 6: jjAddStates(3, 4); break; case 9: jjAddStates(5, 6); break; default : break; } } while(i != startsAt); } else { int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 5: case 4: if ((jjbitVec0[i2] & l2) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(4); break; case 6: if ((jjbitVec0[i2] & l2) != 0L) jjAddStates(3, 4); break; case 9: if ((jjbitVec0[i2] & l2) != 0L) jjAddStates(5, 6); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 12 - (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) { 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 47: return jjMoveStringLiteralDfa1_5(0x4000000L); case 60: return jjStopAtPos(0, 28); case 61: return jjStopAtPos(0, 27); case 62: return jjStopAtPos(0, 25); 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; } switch(curChar) { case 62: if ((active0 & 0x4000000L) != 0L) return jjStopAtPos(1, 26); break; default : break; } return jjStartNfa_5(0, active0);}private final int jjMoveNfa_5(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 1: case 0: if ((0x100002600L & l) == 0L) break; kind = 23; jjCheckNAdd(0); break; case 2: if ((0x3ff600000000000L & l) == 0L) break; kind = 24; jjstateSet[jjnewStateCnt++] = 2; break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 1: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 24) kind = 24; jjCheckNAdd(2); break; case 2: if ((0x7fffffe87fffffeL & l) == 0L) break; if (kind > 24) kind = 24; jjCheckNAdd(2); break; default : break; } } while(i != startsAt); } else { int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { 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 jjMoveStringLiteralDfa0_4(){ return jjMoveNfa_4(0, 0);}private final int jjMoveNfa_4(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 8; 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 ((0xbfffff7affffd9ffL & l) != 0L) { if (kind > 31) kind = 31; jjCheckNAdd(1); } else if ((0x100002600L & l) != 0L) { if (kind > 30) kind = 30; } else if (curChar == 39) jjCheckNAddTwoStates(6, 7); else if (curChar == 34) jjCheckNAddTwoStates(3, 4); break; case 1: if ((0xbfffff7affffd9ffL & l) == 0L) break; if (kind > 31) kind = 31; jjCheckNAdd(1); break; case 2: if (curChar == 34) jjCheckNAddTwoStates(3, 4); break; case 3: if ((0xfffffffbffffffffL & l) != 0L) jjCheckNAddTwoStates(3, 4); break; case 4: if (curChar == 34 && kind > 31) kind = 31; break; case 5: if (curChar == 39) jjCheckNAddTwoStates(6, 7); break; case 6: if ((0xffffff7fffffffffL & l) != 0L) jjCheckNAddTwoStates(6, 7); break; case 7: if (curChar == 39 && kind > 31) kind = 31; 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 > 31) kind = 31; jjCheckNAdd(1); break; case 3: jjAddStates(7, 8); break; case 6: jjAddStates(3, 4);
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -