| /******************************************************************************* |
| * Copyright (c) 2015 IBM Corporation and others. |
| * |
| * This program and the accompanying materials |
| * are made available under the terms of the Eclipse Public License 2.0 |
| * which accompanies this distribution, and is available at |
| * https://www.eclipse.org/legal/epl-2.0/ |
| * |
| * SPDX-License-Identifier: EPL-2.0 |
| * |
| * Contributors: |
| * IBM Corporation - initial API and implementation |
| *******************************************************************************/ |
| /* Generated By:JavaCC: Do not edit this line. HTMLParserTokenManager.java */ |
| package org.apache.lucene.demo.html; |
| |
| public class HTMLParserTokenManager implements HTMLParserConstants |
| { |
| public java.io.PrintStream debugStream = System.out; |
| public void setDebugStream(java.io.PrintStream ds) { debugStream = ds; } |
| private final int jjStopStringLiteralDfa_0(int pos, long active0) |
| { |
| switch (pos) |
| { |
| case 0: |
| if ((active0 & 0x32L) != 0L) |
| return 26; |
| return -1; |
| case 1: |
| if ((active0 & 0x30L) != 0L) |
| return 31; |
| if ((active0 & 0x2L) != 0L) |
| { |
| if (jjmatchedPos != 1) |
| { |
| jjmatchedKind = 2; |
| jjmatchedPos = 1; |
| } |
| return 28; |
| } |
| return -1; |
| case 2: |
| if ((active0 & 0x2L) != 0L) |
| { |
| jjmatchedKind = 2; |
| jjmatchedPos = 2; |
| return 29; |
| } |
| return -1; |
| case 3: |
| if ((active0 & 0x2L) != 0L) |
| { |
| jjmatchedKind = 2; |
| jjmatchedPos = 3; |
| return 29; |
| } |
| return -1; |
| case 4: |
| if ((active0 & 0x2L) != 0L) |
| { |
| jjmatchedKind = 2; |
| jjmatchedPos = 4; |
| return 29; |
| } |
| return -1; |
| case 5: |
| if ((active0 & 0x2L) != 0L) |
| { |
| jjmatchedKind = 2; |
| jjmatchedPos = 5; |
| return 29; |
| } |
| return -1; |
| default : |
| return -1; |
| } |
| } |
| private final int jjStartNfa_0(int pos, long active0) |
| { |
| return jjMoveNfa_0(jjStopStringLiteralDfa_0(pos, active0), pos + 1); |
| } |
| private final int jjStopAtPos(int pos, int kind) |
| { |
| jjmatchedKind = kind; |
| jjmatchedPos = pos; |
| return pos + 1; |
| } |
| private final int jjStartNfaWithStates_0(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_0(state, pos + 1); |
| } |
| private final int jjMoveStringLiteralDfa0_0() |
| { |
| switch(curChar) |
| { |
| case 60: |
| return jjMoveStringLiteralDfa1_0(0x32L); |
| default : |
| return jjMoveNfa_0(17, 0); |
| } |
| } |
| private final int jjMoveStringLiteralDfa1_0(long active0) |
| { |
| try { curChar = input_stream.readChar(); } |
| catch(java.io.IOException e) { |
| jjStopStringLiteralDfa_0(0, active0); |
| return 1; |
| } |
| switch(curChar) |
| { |
| case 33: |
| if ((active0 & 0x20L) != 0L) |
| { |
| jjmatchedKind = 5; |
| jjmatchedPos = 1; |
| } |
| return jjMoveStringLiteralDfa2_0(active0, 0x10L); |
| case 115: |
| return jjMoveStringLiteralDfa2_0(active0, 0x2L); |
| default : |
| break; |
| } |
| return jjStartNfa_0(0, active0); |
| } |
| private final int jjMoveStringLiteralDfa2_0(long old0, long active0) |
| { |
| if (((active0 &= old0)) == 0L) |
| return jjStartNfa_0(0, old0); |
| try { curChar = input_stream.readChar(); } |
| catch(java.io.IOException e) { |
| jjStopStringLiteralDfa_0(1, active0); |
| return 2; |
| } |
| switch(curChar) |
| { |
| case 45: |
| return jjMoveStringLiteralDfa3_0(active0, 0x10L); |
| case 99: |
| return jjMoveStringLiteralDfa3_0(active0, 0x2L); |
| default : |
| break; |
| } |
| return jjStartNfa_0(1, active0); |
| } |
| private final int jjMoveStringLiteralDfa3_0(long old0, long active0) |
| { |
| if (((active0 &= old0)) == 0L) |
| return jjStartNfa_0(1, old0); |
| try { curChar = input_stream.readChar(); } |
| catch(java.io.IOException e) { |
| jjStopStringLiteralDfa_0(2, active0); |
| return 3; |
| } |
| switch(curChar) |
| { |
| case 45: |
| if ((active0 & 0x10L) != 0L) |
| return jjStopAtPos(3, 4); |
| break; |
| case 114: |
| return jjMoveStringLiteralDfa4_0(active0, 0x2L); |
| default : |
| break; |
| } |
| return jjStartNfa_0(2, active0); |
| } |
| private final int jjMoveStringLiteralDfa4_0(long old0, long active0) |
| { |
| if (((active0 &= old0)) == 0L) |
| return jjStartNfa_0(2, old0); |
| try { curChar = input_stream.readChar(); } |
| catch(java.io.IOException e) { |
| jjStopStringLiteralDfa_0(3, active0); |
| return 4; |
| } |
| switch(curChar) |
| { |
| case 105: |
| return jjMoveStringLiteralDfa5_0(active0, 0x2L); |
| 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 112: |
| return jjMoveStringLiteralDfa6_0(active0, 0x2L); |
| 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 116: |
| if ((active0 & 0x2L) != 0L) |
| return jjStartNfaWithStates_0(6, 1, 29); |
| break; |
| default : |
| break; |
| } |
| return jjStartNfa_0(5, 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); |
| } |
| 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 startsAt = 0; |
| jjnewStateCnt = 34; |
| int i = 1; |
| jjstateSet[0] = startState; |
| int kind = 0x7fffffff; |
| for (;;) |
| { |
| if (++jjround == 0x7fffffff) |
| ReInitRounds(); |
| if (curChar < 64) |
| { |
| long l = 1L << curChar; |
| do |
| { |
| switch(jjstateSet[--i]) |
| { |
| case 26: |
| if (curChar == 33) |
| jjstateSet[jjnewStateCnt++] = 31; |
| else if (curChar == 47) |
| jjCheckNAdd(27); |
| break; |
| case 17: |
| if ((0x3ff000000000000L & l) != 0L) |
| jjCheckNAddTwoStates(7, 2); |
| else if ((0x100002600L & l) != 0L) |
| { |
| if (kind > 10) |
| kind = 10; |
| jjCheckNAddTwoStates(10, 16); |
| } |
| else if (curChar == 60) |
| jjCheckNAddStates(0, 2); |
| else if (curChar == 38) |
| jjAddStates(3, 5); |
| else if (curChar == 36) |
| jjstateSet[jjnewStateCnt++] = 1; |
| if ((0x3ff000000000000L & l) != 0L) |
| { |
| if (kind > 6) |
| kind = 6; |
| jjCheckNAddStates(6, 10); |
| } |
| else if (curChar == 38) |
| jjstateSet[jjnewStateCnt++] = 15; |
| break; |
| case 0: |
| if (curChar == 36) |
| jjstateSet[jjnewStateCnt++] = 1; |
| break; |
| case 1: |
| if ((0x3ff000000000000L & l) != 0L) |
| jjCheckNAdd(2); |
| break; |
| case 2: |
| if ((0x500000000000L & l) != 0L) |
| jjstateSet[jjnewStateCnt++] = 3; |
| break; |
| case 3: |
| case 9: |
| if ((0x3ff000000000000L & l) == 0L) |
| break; |
| if (kind > 6) |
| kind = 6; |
| jjCheckNAddStates(11, 13); |
| break; |
| case 4: |
| if ((0x3ff000000000000L & l) == 0L) |
| break; |
| if (kind > 6) |
| kind = 6; |
| jjCheckNAddStates(6, 10); |
| break; |
| case 5: |
| if ((0x880000000000L & l) == 0L) |
| break; |
| if (kind > 6) |
| kind = 6; |
| jjCheckNAddStates(14, 17); |
| break; |
| case 6: |
| if ((0x3ff000000000000L & l) != 0L) |
| jjCheckNAddTwoStates(7, 2); |
| break; |
| case 7: |
| if (curChar != 34) |
| break; |
| if (kind > 6) |
| kind = 6; |
| jjCheckNAddStates(11, 13); |
| break; |
| case 8: |
| if ((0x208000000000L & l) != 0L) |
| jjstateSet[jjnewStateCnt++] = 9; |
| break; |
| case 10: |
| if ((0x100002600L & l) == 0L) |
| break; |
| kind = 10; |
| jjCheckNAddTwoStates(10, 16); |
| break; |
| case 11: |
| if (curChar != 59) |
| break; |
| if (kind > 10) |
| kind = 10; |
| jjCheckNAddTwoStates(10, 16); |
| break; |
| case 16: |
| if (curChar == 38) |
| jjstateSet[jjnewStateCnt++] = 15; |
| break; |
| case 19: |
| if (curChar == 59 && kind > 12) |
| kind = 12; |
| break; |
| case 20: |
| if (curChar == 35) |
| jjCheckNAdd(21); |
| break; |
| case 21: |
| if ((0x3ff000000000000L & l) == 0L) |
| break; |
| if (kind > 12) |
| kind = 12; |
| jjCheckNAddTwoStates(21, 19); |
| break; |
| case 22: |
| if (curChar == 35) |
| jjstateSet[jjnewStateCnt++] = 23; |
| break; |
| case 24: |
| if ((0x3ff000000000000L & l) == 0L) |
| break; |
| if (kind > 12) |
| kind = 12; |
| jjCheckNAddTwoStates(24, 19); |
| break; |
| case 25: |
| if (curChar == 60) |
| jjCheckNAddStates(0, 2); |
| break; |
| case 28: |
| if ((0x9fffff7affffd9ffL & l) == 0L) |
| break; |
| if (kind > 2) |
| kind = 2; |
| jjCheckNAdd(29); |
| break; |
| case 29: |
| if ((0x9ffffffeffffd9ffL & l) == 0L) |
| break; |
| if (kind > 2) |
| kind = 2; |
| jjCheckNAdd(29); |
| break; |
| case 30: |
| if (curChar == 33) |
| jjstateSet[jjnewStateCnt++] = 31; |
| break; |
| case 32: |
| if ((0x9fffff7affffd9ffL & l) == 0L) |
| break; |
| if (kind > 3) |
| kind = 3; |
| jjCheckNAdd(33); |
| break; |
| case 33: |
| if ((0x9ffffffeffffd9ffL & l) == 0L) |
| break; |
| if (kind > 3) |
| kind = 3; |
| jjCheckNAdd(33); |
| break; |
| default : break; |
| } |
| } while(i != startsAt); |
| } |
| else if (curChar < 128) |
| { |
| long l = 1L << (curChar & 077); |
| do |
| { |
| switch(jjstateSet[--i]) |
| { |
| case 26: |
| case 27: |
| if ((0x7fffffe07fffffeL & l) == 0L) |
| break; |
| if (kind > 2) |
| kind = 2; |
| jjstateSet[jjnewStateCnt++] = 28; |
| break; |
| case 17: |
| case 4: |
| if ((0x7fffffe07fffffeL & l) == 0L) |
| break; |
| if (kind > 6) |
| kind = 6; |
| jjCheckNAddStates(6, 10); |
| break; |
| case 9: |
| if ((0x7fffffe07fffffeL & l) == 0L) |
| break; |
| if (kind > 6) |
| kind = 6; |
| jjCheckNAddStates(11, 13); |
| break; |
| case 12: |
| if (curChar == 112) |
| jjstateSet[jjnewStateCnt++] = 11; |
| break; |
| case 13: |
| if (curChar == 115) |
| jjstateSet[jjnewStateCnt++] = 12; |
| break; |
| case 14: |
| if (curChar == 98) |
| jjstateSet[jjnewStateCnt++] = 13; |
| break; |
| case 15: |
| if (curChar == 110) |
| jjstateSet[jjnewStateCnt++] = 14; |
| break; |
| case 18: |
| if ((0x7fffffe07fffffeL & l) == 0L) |
| break; |
| if (kind > 12) |
| kind = 12; |
| jjCheckNAddTwoStates(18, 19); |
| break; |
| case 23: |
| if ((0x100000001000000L & l) != 0L) |
| jjCheckNAdd(24); |
| break; |
| case 24: |
| if ((0x7e0000007eL & l) == 0L) |
| break; |
| if (kind > 12) |
| kind = 12; |
| jjCheckNAddTwoStates(24, 19); |
| break; |
| case 28: |
| case 29: |
| if (kind > 2) |
| kind = 2; |
| jjCheckNAdd(29); |
| break; |
| case 31: |
| if ((0x7fffffe07fffffeL & l) == 0L) |
| break; |
| if (kind > 3) |
| kind = 3; |
| jjstateSet[jjnewStateCnt++] = 32; |
| break; |
| case 32: |
| case 33: |
| if (kind > 3) |
| kind = 3; |
| jjCheckNAdd(33); |
| break; |
| default : break; |
| } |
| } while(i != startsAt); |
| } |
| else |
| { |
| int hiByte = curChar >> 8; |
| int i1 = hiByte >> 6; |
| long l1 = 1L << (hiByte & 077); |
| int i2 = (curChar & 0xff) >> 6; |
| long l2 = 1L << (curChar & 077); |
| do |
| { |
| switch(jjstateSet[--i]) |
| { |
| case 28: |
| case 29: |
| if (!jjCanMove_0(hiByte, i1, i2, l1, l2)) |
| break; |
| if (kind > 2) |
| kind = 2; |
| jjCheckNAdd(29); |
| break; |
| case 32: |
| case 33: |
| if (!jjCanMove_0(hiByte, i1, i2, l1, l2)) |
| break; |
| if (kind > 3) |
| kind = 3; |
| jjCheckNAdd(33); |
| break; |
| default : break; |
| } |
| } while(i != startsAt); |
| } |
| if (kind != 0x7fffffff) |
| { |
| jjmatchedKind = kind; |
| jjmatchedPos = curPos; |
| kind = 0x7fffffff; |
| } |
| ++curPos; |
| if ((i = jjnewStateCnt) == (startsAt = 34 - (jjnewStateCnt = startsAt))) |
| return curPos; |
| try { curChar = input_stream.readChar(); } |
| catch(java.io.IOException e) { return curPos; } |
| } |
| } |
| private final int jjMoveStringLiteralDfa0_5() |
| { |
| return jjMoveNfa_5(1, 0); |
| } |
| private final int jjMoveNfa_5(int startState, int curPos) |
| { |
| int startsAt = 0; |
| jjnewStateCnt = 2; |
| int i = 1; |
| jjstateSet[0] = startState; |
| int kind = 0x7fffffff; |
| for (;;) |
| { |
| if (++jjround == 0x7fffffff) |
| ReInitRounds(); |
| if (curChar < 64) |
| { |
| long l = 1L << curChar; |
| do |
| { |
| switch(jjstateSet[--i]) |
| { |
| case 1: |
| if ((0xfffffffbffffffffL & l) != 0L) |
| { |
| if (kind > 25) |
| kind = 25; |
| jjCheckNAdd(0); |
| } |
| else if (curChar == 34) |
| { |
| if (kind > 26) |
| kind = 26; |
| } |
| break; |
| case 0: |
| if ((0xfffffffbffffffffL & l) == 0L) |
| break; |
| kind = 25; |
| jjCheckNAdd(0); |
| break; |
| default : break; |
| } |
| } while(i != startsAt); |
| } |
| else if (curChar < 128) |
| { |
| do |
| { |
| switch(jjstateSet[--i]) |
| { |
| case 1: |
| case 0: |
| kind = 25; |
| jjCheckNAdd(0); |
| break; |
| default : break; |
| } |
| } while(i != startsAt); |
| } |
| else |
| { |
| int hiByte = curChar >> 8; |
| int i1 = hiByte >> 6; |
| long l1 = 1L << (hiByte & 077); |
| int i2 = (curChar & 0xff) >> 6; |
| long l2 = 1L << (curChar & 077); |
| do |
| { |
| switch(jjstateSet[--i]) |
| { |
| case 1: |
| case 0: |
| if (!jjCanMove_0(hiByte, i1, i2, l1, l2)) |
| break; |
| if (kind > 25) |
| kind = 25; |
| 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 jjMoveStringLiteralDfa0_7() |
| { |
| switch(curChar) |
| { |
| case 62: |
| return jjStopAtPos(0, 30); |
| default : |
| return jjMoveNfa_7(0, 0); |
| } |
| } |
| private final int jjMoveNfa_7(int startState, int curPos) |
| { |
| int startsAt = 0; |
| jjnewStateCnt = 1; |
| int i = 1; |
| jjstateSet[0] = startState; |
| int kind = 0x7fffffff; |
| for (;;) |
| { |
| if (++jjround == 0x7fffffff) |
| ReInitRounds(); |
| if (curChar < 64) |
| { |
| long l = 1L << curChar; |
| do |
| { |
| switch(jjstateSet[--i]) |
| { |
| case 0: |
| if ((0xbfffffffffffffffL & l) == 0L) |
| break; |
| kind = 29; |
| jjstateSet[jjnewStateCnt++] = 0; |
| break; |
| default : break; |
| } |
| } while(i != startsAt); |
| } |
| else if (curChar < 128) |
| { |
| do |
| { |
| switch(jjstateSet[--i]) |
| { |
| case 0: |
| kind = 29; |
| jjstateSet[jjnewStateCnt++] = 0; |
| break; |
| default : break; |
| } |
| } while(i != startsAt); |
| } |
| else |
| { |
| int hiByte = curChar >> 8; |
| int i1 = hiByte >> 6; |
| long l1 = 1L << (hiByte & 077); |
| int i2 = (curChar & 0xff) >> 6; |
| long l2 = 1L << (curChar & 077); |
| do |
| { |
| switch(jjstateSet[--i]) |
| { |
| case 0: |
| if (!jjCanMove_0(hiByte, i1, i2, l1, l2)) |
| break; |
| if (kind > 29) |
| kind = 29; |
| 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_4() |
| { |
| return jjMoveNfa_4(1, 0); |
| } |
| private final int jjMoveNfa_4(int startState, int curPos) |
| { |
| int startsAt = 0; |
| jjnewStateCnt = 2; |
| int i = 1; |
| jjstateSet[0] = startState; |
| int kind = 0x7fffffff; |
| for (;;) |
| { |
| if (++jjround == 0x7fffffff) |
| ReInitRounds(); |
| if (curChar < 64) |
| { |
| long l = 1L << curChar; |
| do |
| { |
| switch(jjstateSet[--i]) |
| { |
| case 1: |
| if ((0xffffff7fffffffffL & l) != 0L) |
| { |
| if (kind > 23) |
| kind = 23; |
| jjCheckNAdd(0); |
| } |
| else if (curChar == 39) |
| { |
| if (kind > 24) |
| kind = 24; |
| } |
| break; |
| case 0: |
| if ((0xffffff7fffffffffL & l) == 0L) |
| break; |
| kind = 23; |
| jjCheckNAdd(0); |
| break; |
| default : break; |
| } |
| } while(i != startsAt); |
| } |
| else if (curChar < 128) |
| { |
| do |
| { |
| switch(jjstateSet[--i]) |
| { |
| case 1: |
| case 0: |
| kind = 23; |
| jjCheckNAdd(0); |
| break; |
| default : break; |
| } |
| } while(i != startsAt); |
| } |
| else |
| { |
| int hiByte = curChar >> 8; |
| int i1 = hiByte >> 6; |
| long l1 = 1L << (hiByte & 077); |
| int i2 = (curChar & 0xff) >> 6; |
| long l2 = 1L << (curChar & 077); |
| do |
| { |
| switch(jjstateSet[--i]) |
| { |
| case 1: |
| case 0: |
| if (!jjCanMove_0(hiByte, i1, i2, l1, l2)) |
| break; |
| if (kind > 23) |
| kind = 23; |
| 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 jjMoveStringLiteralDfa0_3() |
| { |
| switch(curChar) |
| { |
| case 34: |
| return jjStopAtPos(0, 21); |
| case 39: |
| return jjStopAtPos(0, 20); |
| default : |
| return jjMoveNfa_3(0, 0); |
| } |
| } |
| private final int jjMoveNfa_3(int startState, int curPos) |
| { |
| int startsAt = 0; |
| jjnewStateCnt = 9; |
| int i = 1; |
| jjstateSet[0] = startState; |
| int kind = 0x7fffffff; |
| for (;;) |
| { |
| if (++jjround == 0x7fffffff) |
| ReInitRounds(); |
| if (curChar < 64) |
| { |
| long l = 1L << curChar; |
| do |
| { |
| switch(jjstateSet[--i]) |
| { |
| case 0: |
| if ((0x9fffff7affffd9ffL & l) != 0L) |
| { |
| if (kind > 19) |
| kind = 19; |
| jjCheckNAdd(1); |
| } |
| else if ((0x100002600L & l) != 0L) |
| { |
| if (kind > 22) |
| kind = 22; |
| jjCheckNAddTwoStates(2, 8); |
| } |
| if (curChar == 38) |
| jjstateSet[jjnewStateCnt++] = 7; |
| break; |
| case 1: |
| if ((0xbffffffeffffd9ffL & l) == 0L) |
| break; |
| if (kind > 19) |
| kind = 19; |
| jjCheckNAdd(1); |
| break; |
| case 2: |
| if ((0x100002600L & l) == 0L) |
| break; |
| kind = 22; |
| jjCheckNAddTwoStates(2, 8); |
| break; |
| case 3: |
| if (curChar != 59) |
| break; |
| if (kind > 22) |
| kind = 22; |
| jjCheckNAddTwoStates(2, 8); |
| break; |
| case 8: |
| if (curChar == 38) |
| jjstateSet[jjnewStateCnt++] = 7; |
| break; |
| default : break; |
| } |
| } while(i != startsAt); |
| } |
| else if (curChar < 128) |
| { |
| do |
| { |
| switch(jjstateSet[--i]) |
| { |
| case 0: |
| case 1: |
| if (kind > 19) |
| kind = 19; |
| jjCheckNAdd(1); |
| break; |
| case 4: |
| if (curChar == 112) |
| jjstateSet[jjnewStateCnt++] = 3; |
| break; |
| case 5: |
| if (curChar == 115) |
| jjstateSet[jjnewStateCnt++] = 4; |
| break; |
| case 6: |
| if (curChar == 98) |
| jjstateSet[jjnewStateCnt++] = 5; |
| break; |
| case 7: |
| if (curChar == 110) |
| jjstateSet[jjnewStateCnt++] = 6; |
| break; |
| default : break; |
| } |
| } while(i != startsAt); |
| } |
| else |
| { |
| int hiByte = curChar >> 8; |
| int i1 = hiByte >> 6; |
| long l1 = 1L << (hiByte & 077); |
| int i2 = (curChar & 0xff) >> 6; |
| long l2 = 1L << (curChar & 077); |
| do |
| { |
| switch(jjstateSet[--i]) |
| { |
| case 0: |
| case 1: |
| if (!jjCanMove_0(hiByte, i1, i2, l1, l2)) |
| break; |
| if (kind > 19) |
| kind = 19; |
| jjCheckNAdd(1); |
| break; |
| default : break; |
| } |
| } while(i != startsAt); |
| } |
| if (kind != 0x7fffffff) |
| { |
| jjmatchedKind = kind; |
| jjmatchedPos = curPos; |
| kind = 0x7fffffff; |
| } |
| ++curPos; |
| if ((i = jjnewStateCnt) == (startsAt = 9 - (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) |
| { |
| case 0: |
| if ((active0 & 0x10000000L) != 0L) |
| { |
| jjmatchedKind = 27; |
| return -1; |
| } |
| return -1; |
| case 1: |
| if ((active0 & 0x10000000L) != 0L) |
| { |
| if (jjmatchedPos == 0) |
| { |
| jjmatchedKind = 27; |
| jjmatchedPos = 0; |
| } |
| return -1; |
| } |
| return -1; |
| default : |
| return -1; |
| } |
| } |
| private final int jjStartNfa_6(int pos, long active0) |
| { |
| return jjMoveNfa_6(jjStopStringLiteralDfa_6(pos, active0), pos + 1); |
| } |
| private final int jjMoveStringLiteralDfa0_6() |
| { |
| switch(curChar) |
| { |
| case 45: |
| return jjMoveStringLiteralDfa1_6(0x10000000L); |
| default : |
| return jjMoveNfa_6(1, 0); |
| } |
| } |
| private final int jjMoveStringLiteralDfa1_6(long active0) |
| { |
| try { curChar = input_stream.readChar(); } |
| catch(java.io.IOException e) { |
| jjStopStringLiteralDfa_6(0, active0); |
| return 1; |
| } |
| switch(curChar) |
| { |
| case 45: |
| return jjMoveStringLiteralDfa2_6(active0, 0x10000000L); |
| default : |
| break; |
| } |
| return jjStartNfa_6(0, active0); |
| } |
| private final int jjMoveStringLiteralDfa2_6(long old0, long active0) |
| { |
| if (((active0 &= old0)) == 0L) |
| return jjStartNfa_6(0, old0); |
| try { curChar = input_stream.readChar(); } |
| catch(java.io.IOException e) { |
| jjStopStringLiteralDfa_6(1, active0); |
| return 2; |
| } |
| switch(curChar) |
| { |
| case 62: |
| if ((active0 & 0x10000000L) != 0L) |
| return jjStopAtPos(2, 28); |
| break; |
| default : |
| break; |
| } |
| return jjStartNfa_6(1, active0); |
| } |
| private final int jjMoveNfa_6(int startState, int curPos) |
| { |
| int startsAt = 0; |
| jjnewStateCnt = 2; |
| int i = 1; |
| jjstateSet[0] = startState; |
| int kind = 0x7fffffff; |
| for (;;) |
| { |
| if (++jjround == 0x7fffffff) |
| ReInitRounds(); |
| if (curChar < 64) |
| { |
| long l = 1L << curChar; |
| do |
| { |
| switch(jjstateSet[--i]) |
| { |
| case 1: |
| if ((0xffffdfffffffffffL & l) != 0L) |
| { |
| if (kind > 27) |
| kind = 27; |
| jjCheckNAdd(0); |
| } |
| else if (curChar == 45) |
| { |
| if (kind > 27) |
| kind = 27; |
| } |
| break; |
| case 0: |
| if ((0xffffdfffffffffffL & l) == 0L) |
| break; |
| kind = 27; |
| jjCheckNAdd(0); |
| break; |
| default : break; |
| } |
| } while(i != startsAt); |
| } |
| else if (curChar < 128) |
| { |
| do |
| { |
| switch(jjstateSet[--i]) |
| { |
| case 1: |
| case 0: |
| kind = 27; |
| jjCheckNAdd(0); |
| break; |
| default : break; |
| } |
| } while(i != startsAt); |
| } |
| else |
| { |
| int hiByte = curChar >> 8; |
| int i1 = hiByte >> 6; |
| long l1 = 1L << (hiByte & 077); |
| int i2 = (curChar & 0xff) >> 6; |
| long l2 = 1L << (curChar & 077); |
| do |
| { |
| switch(jjstateSet[--i]) |
| { |
| case 1: |
| case 0: |
| if (!jjCanMove_0(hiByte, i1, i2, l1, l2)) |
| break; |
| if (kind > 27) |
| kind = 27; |
| 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 jjMoveStringLiteralDfa0_1() |
| { |
| return jjMoveNfa_1(1, 0); |
| } |
| private final int jjMoveNfa_1(int startState, int curPos) |
| { |
| int startsAt = 0; |
| jjnewStateCnt = 12; |
| int i = 1; |
| jjstateSet[0] = startState; |
| int kind = 0x7fffffff; |
| for (;;) |
| { |
| if (++jjround == 0x7fffffff) |
| ReInitRounds(); |
| if (curChar < 64) |
| { |
| long l = 1L << curChar; |
| do |
| { |
| switch(jjstateSet[--i]) |
| { |
| case 1: |
| if ((0xafffffffffffffffL & l) != 0L) |
| { |
| if (kind > 14) |
| kind = 14; |
| jjCheckNAdd(0); |
| } |
| else if ((0x5000000000000000L & l) != 0L) |
| { |
| if (kind > 14) |
| kind = 14; |
| } |
| if (curChar == 60) |
| jjstateSet[jjnewStateCnt++] = 10; |
| break; |
| case 0: |
| if ((0xafffffffffffffffL & l) == 0L) |
| break; |
| if (kind > 14) |
| kind = 14; |
| jjCheckNAdd(0); |
| break; |
| case 3: |
| if ((0xafffffffffffffffL & l) != 0L) |
| jjAddStates(18, 19); |
| break; |
| case 4: |
| if (curChar == 62 && kind > 15) |
| kind = 15; |
| break; |
| case 10: |
| if (curChar == 47) |
| jjstateSet[jjnewStateCnt++] = 9; |
| break; |
| case 11: |
| if (curChar == 60) |
| jjstateSet[jjnewStateCnt++] = 10; |
| break; |
| default : break; |
| } |
| } while(i != startsAt); |
| } |
| else if (curChar < 128) |
| { |
| do |
| { |
| switch(jjstateSet[--i]) |
| { |
| case 1: |
| case 0: |
| if (kind > 14) |
| kind = 14; |
| jjCheckNAdd(0); |
| break; |
| case 2: |
| if (curChar == 116) |
| jjCheckNAddTwoStates(3, 4); |
| break; |
| case 3: |
| jjCheckNAddTwoStates(3, 4); |
| break; |
| case 5: |
| if (curChar == 112) |
| jjstateSet[jjnewStateCnt++] = 2; |
| break; |
| case 6: |
| if (curChar == 105) |
| jjstateSet[jjnewStateCnt++] = 5; |
| break; |
| case 7: |
| if (curChar == 114) |
| jjstateSet[jjnewStateCnt++] = 6; |
| break; |
| case 8: |
| if (curChar == 99) |
| jjstateSet[jjnewStateCnt++] = 7; |
| break; |
| case 9: |
| if (curChar == 115) |
| jjstateSet[jjnewStateCnt++] = 8; |
| break; |
| default : break; |
| } |
| } while(i != startsAt); |
| } |
| else |
| { |
| int hiByte = curChar >> 8; |
| int i1 = hiByte >> 6; |
| long l1 = 1L << (hiByte & 077); |
| int i2 = (curChar & 0xff) >> 6; |
| long l2 = 1L << (curChar & 077); |
| do |
| { |
| switch(jjstateSet[--i]) |
| { |
| case 1: |
| case 0: |
| if (!jjCanMove_0(hiByte, i1, i2, l1, l2)) |
| break; |
| if (kind > 14) |
| kind = 14; |
| jjCheckNAdd(0); |
| break; |
| case 3: |
| if (jjCanMove_0(hiByte, i1, i2, l1, l2)) |
| jjAddStates(18, 19); |
| 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 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, 21); |
| case 39: |
| return jjStopAtPos(0, 20); |
| case 61: |
| return jjStartNfaWithStates_2(0, 17, 3); |
| default : |
| return jjMoveNfa_2(0, 0); |
| } |
| } |
| private final int jjMoveNfa_2(int startState, int curPos) |
| { |
| int startsAt = 0; |
| jjnewStateCnt = 12; |
| int i = 1; |
| jjstateSet[0] = startState; |
| int kind = 0x7fffffff; |
| for (;;) |
| { |
| if (++jjround == 0x7fffffff) |
| ReInitRounds(); |
| if (curChar < 64) |
| { |
| long l = 1L << curChar; |
| do |
| { |
| switch(jjstateSet[--i]) |
| { |
| case 0: |
| if ((0x9fffff7affffd9ffL & l) != 0L) |
| { |
| if (kind > 16) |
| kind = 16; |
| jjCheckNAdd(1); |
| } |
| else if ((0x100002600L & l) != 0L) |
| { |
| if (kind > 22) |
| kind = 22; |
| jjCheckNAddTwoStates(5, 11); |
| } |
| else if (curChar == 61) |
| jjstateSet[jjnewStateCnt++] = 3; |
| else if (curChar == 62) |
| { |
| if (kind > 18) |
| kind = 18; |
| } |
| if (curChar == 38) |
| jjstateSet[jjnewStateCnt++] = 10; |
| break; |
| case 1: |
| if ((0x9ffffffeffffd9ffL & l) == 0L) |
| break; |
| if (kind > 16) |
| kind = 16; |
| jjCheckNAdd(1); |
| break; |
| case 2: |
| case 3: |
| if (curChar == 62 && kind > 18) |
| kind = 18; |
| break; |
| case 4: |
| if (curChar == 61) |
| jjstateSet[jjnewStateCnt++] = 3; |
| break; |
| case 5: |
| if ((0x100002600L & l) == 0L) |
| break; |
| kind = 22; |
| jjCheckNAddTwoStates(5, 11); |
| break; |
| case 6: |
| if (curChar != 59) |
| break; |
| if (kind > 22) |
| kind = 22; |
| jjCheckNAddTwoStates(5, 11); |
| break; |
| case 11: |
| if (curChar == 38) |
| jjstateSet[jjnewStateCnt++] = 10; |
| break; |
| default : break; |
| } |
| } while(i != startsAt); |
| } |
| else if (curChar < 128) |
| { |
| do |
| { |
| switch(jjstateSet[--i]) |
| { |
| case 0: |
| case 1: |
| if (kind > 16) |
| kind = 16; |
| jjCheckNAdd(1); |
| break; |
| case 7: |
| if (curChar == 112) |
| jjstateSet[jjnewStateCnt++] = 6; |
| break; |
| case 8: |
| if (curChar == 115) |
| jjstateSet[jjnewStateCnt++] = 7; |
| break; |
| case 9: |
| if (curChar == 98) |
| jjstateSet[jjnewStateCnt++] = 8; |
| break; |
| case 10: |
| if (curChar == 110) |
| jjstateSet[jjnewStateCnt++] = 9; |
| break; |
| default : break; |
| } |
| } while(i != startsAt); |
| } |
| else |
| { |
| int hiByte = curChar >> 8; |
| int i1 = hiByte >> 6; |
| long l1 = 1L << (hiByte & 077); |
| int i2 = (curChar & 0xff) >> 6; |
| long l2 = 1L << (curChar & 077); |
| do |
| { |
| switch(jjstateSet[--i]) |
| { |
| case 0: |
| case 1: |
| if (!jjCanMove_0(hiByte, i1, i2, l1, l2)) |
| break; |
| if (kind > 16) |
| kind = 16; |
| jjCheckNAdd(1); |
| 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; } |
| } |
| } |
| static final int[] jjnextStates = { |
| 26, 27, 30, 18, 20, 22, 5, 8, 0, 4, 6, 0, 4, 6, 5, 0, |
| 4, 6, 3, 4, |
| }; |
| private static final boolean jjCanMove_0(int hiByte, int i1, int i2, long l1, long l2) |
| { |
| switch(hiByte) |
| { |
| case 0: |
| return ((jjbitVec2[i2] & l2) != 0L); |
| default : |
| if ((jjbitVec0[i1] & l1) != 0L) |
| return true; |
| return false; |
| } |
| } |
| public static final String[] jjstrLiteralImages = { |
| "", "\74\163\143\162\151\160\164", null, null, "\74\41\55\55", "\74\41", null, //$NON-NLS-1$ //$NON-NLS-2$ //$NON-NLS-3$ //$NON-NLS-4$ |
| null, null, null, null, null, null, null, null, null, null, "\75", null, null, //$NON-NLS-1$ |
| "\47", "\42", null, null, null, null, null, null, "\55\55\76", null, "\76", }; //$NON-NLS-1$ //$NON-NLS-2$ //$NON-NLS-3$ //$NON-NLS-4$ |
| public static final String[] lexStateNames = { |
| "DEFAULT", //$NON-NLS-1$ |
| "WithinScript", //$NON-NLS-1$ |
| "WithinTag", //$NON-NLS-1$ |
| "AfterEquals", //$NON-NLS-1$ |
| "WithinQuote1", //$NON-NLS-1$ |
| "WithinQuote2", //$NON-NLS-1$ |
| "WithinComment1", //$NON-NLS-1$ |
| "WithinComment2", //$NON-NLS-1$ |
| }; |
| public static final int[] jjnewLexState = { |
| -1, 1, 2, 2, 6, 7, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, 3, 0, 2, 4, 5, -1, -1, 2, |
| -1, 2, -1, 0, -1, 0, |
| }; |
| static final long[] jjtoToken = { |
| 0x7fbff47fL, |
| }; |
| static final long[] jjtoSkip = { |
| 0x400000L, |
| }; |
| protected SimpleCharStream input_stream; |
| private final int[] jjrounds = new int[34]; |
| private final int[] jjstateSet = new int[68]; |
| protected char curChar; |
| public HTMLParserTokenManager(SimpleCharStream stream){ |
| if (SimpleCharStream.staticFlag) |
| throw new Error("ERROR: Cannot use a static CharStream class with a non-static lexical analyzer."); //$NON-NLS-1$ |
| input_stream = stream; |
| } |
| public HTMLParserTokenManager(SimpleCharStream stream, int lexState){ |
| this(stream); |
| SwitchTo(lexState); |
| } |
| public void ReInit(SimpleCharStream stream) |
| { |
| jjmatchedPos = jjnewStateCnt = 0; |
| curLexState = defaultLexState; |
| input_stream = stream; |
| ReInitRounds(); |
| } |
| private final void ReInitRounds() |
| { |
| int i; |
| jjround = 0x80000001; |
| for (i = 34; i-- > 0;) |
| jjrounds[i] = 0x80000000; |
| } |
| public void ReInit(SimpleCharStream stream, int lexState) |
| { |
| ReInit(stream); |
| SwitchTo(lexState); |
| } |
| public void SwitchTo(int lexState) |
| { |
| if (lexState >= 8 || lexState < 0) |
| throw new TokenMgrError("Error: Ignoring invalid lexical state : " + lexState + ". State unchanged.", TokenMgrError.INVALID_LEXICAL_STATE); //$NON-NLS-1$ //$NON-NLS-2$ |
| else |
| curLexState = lexState; |
| } |
| |
| protected Token jjFillToken() |
| { |
| Token t = Token.newToken(jjmatchedKind); |
| t.kind = jjmatchedKind; |
| String im = jjstrLiteralImages[jjmatchedKind]; |
| t.image = (im == null) ? input_stream.GetImage() : im; |
| t.beginLine = input_stream.getBeginLine(); |
| t.beginColumn = input_stream.getBeginColumn(); |
| t.endLine = input_stream.getEndLine(); |
| t.endColumn = input_stream.getEndColumn(); |
| return t; |
| } |
| |
| int curLexState = 0; |
| int defaultLexState = 0; |
| int jjnewStateCnt; |
| int jjround; |
| int jjmatchedPos; |
| int jjmatchedKind; |
| |
| public Token getNextToken() |
| { |
| Token matchedToken; |
| int curPos = 0; |
| |
| EOFLoop : |
| for (;;) |
| { |
| try |
| { |
| curChar = input_stream.BeginToken(); |
| } |
| catch(java.io.IOException e) |
| { |
| jjmatchedKind = 0; |
| matchedToken = jjFillToken(); |
| return matchedToken; |
| } |
| |
| switch(curLexState) |
| { |
| case 0: |
| jjmatchedKind = 0x7fffffff; |
| jjmatchedPos = 0; |
| curPos = jjMoveStringLiteralDfa0_0(); |
| if (jjmatchedPos == 0 && jjmatchedKind > 13) |
| { |
| jjmatchedKind = 13; |
| } |
| break; |
| case 1: |
| jjmatchedKind = 0x7fffffff; |
| jjmatchedPos = 0; |
| curPos = jjMoveStringLiteralDfa0_1(); |
| break; |
| case 2: |
| jjmatchedKind = 0x7fffffff; |
| jjmatchedPos = 0; |
| curPos = jjMoveStringLiteralDfa0_2(); |
| break; |
| case 3: |
| jjmatchedKind = 0x7fffffff; |
| jjmatchedPos = 0; |
| curPos = jjMoveStringLiteralDfa0_3(); |
| break; |
| case 4: |
| jjmatchedKind = 0x7fffffff; |
| jjmatchedPos = 0; |
| curPos = jjMoveStringLiteralDfa0_4(); |
| break; |
| case 5: |
| jjmatchedKind = 0x7fffffff; |
| jjmatchedPos = 0; |
| curPos = jjMoveStringLiteralDfa0_5(); |
| break; |
| case 6: |
| jjmatchedKind = 0x7fffffff; |
| jjmatchedPos = 0; |
| curPos = jjMoveStringLiteralDfa0_6(); |
| break; |
| case 7: |
| jjmatchedKind = 0x7fffffff; |
| jjmatchedPos = 0; |
| curPos = jjMoveStringLiteralDfa0_7(); |
| break; |
| } |
| if (jjmatchedKind != 0x7fffffff) |
| { |
| if (jjmatchedPos + 1 < curPos) |
| input_stream.backup(curPos - jjmatchedPos - 1); |
| if ((jjtoToken[jjmatchedKind >> 6] & (1L << (jjmatchedKind & 077))) != 0L) |
| { |
| matchedToken = jjFillToken(); |
| if (jjnewLexState[jjmatchedKind] != -1) |
| curLexState = jjnewLexState[jjmatchedKind]; |
| return matchedToken; |
| } |
| else |
| { |
| if (jjnewLexState[jjmatchedKind] != -1) |
| curLexState = jjnewLexState[jjmatchedKind]; |
| continue EOFLoop; |
| } |
| } |
| int error_line = input_stream.getEndLine(); |
| int error_column = input_stream.getEndColumn(); |
| String error_after = null; |
| boolean EOFSeen = false; |
| try { input_stream.readChar(); input_stream.backup(1); } |
| catch (java.io.IOException e1) { |
| EOFSeen = true; |
| error_after = curPos <= 1 ? "" : input_stream.GetImage(); //$NON-NLS-1$ |
| if (curChar == '\n' || curChar == '\r') { |
| error_line++; |
| error_column = 0; |
| } |
| else |
| error_column++; |
| } |
| if (!EOFSeen) { |
| input_stream.backup(1); |
| error_after = curPos <= 1 ? "" : input_stream.GetImage(); //$NON-NLS-1$ |
| } |
| throw new TokenMgrError(EOFSeen, curLexState, error_line, error_column, error_after, curChar, TokenMgrError.LEXICAL_ERROR); |
| } |
| } |
| |
| } |
