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

📄 elparsertokenmanager.java

📁 业界著名的tomcat服务器的最新6.0的源代码。
💻 JAVA
📖 第 1 页 / 共 3 页
字号:
			return jjMoveStringLiteralDfa2_1(active0, 0x80000000000L);
		case 110:
			return jjMoveStringLiteralDfa2_1(active0, 0x110000000000L);
		case 111:
			return jjMoveStringLiteralDfa2_1(active0, 0x10004000000000L);
		case 113:
			if ((active0 & 0x400000000L) != 0L)
				return jjStartNfaWithStates_1(1, 34, 42);
			break;
		case 114:
			if ((active0 & 0x40000000000L) != 0L)
				return jjStartNfaWithStates_1(1, 42, 42);
			return jjMoveStringLiteralDfa2_1(active0, 0x4000L);
		case 116:
			if ((active0 & 0x4000000L) != 0L)
				return jjStartNfaWithStates_1(1, 26, 42);
			else if ((active0 & 0x10000000L) != 0L)
				return jjStartNfaWithStates_1(1, 28, 42);
			break;
		case 117:
			return jjMoveStringLiteralDfa2_1(active0, 0x10000L);
		case 124:
			if ((active0 & 0x20000000000L) != 0L)
				return jjStopAtPos(1, 41);
			break;
		default:
			break;
		}
		return jjStartNfa_1(0, active0);
	}

	private final int jjMoveStringLiteralDfa2_1(long old0, long active0) {
		if (((active0 &= old0)) == 0L)
			return jjStartNfa_1(0, old0);
		try {
			curChar = input_stream.readChar();
		} catch (java.io.IOException e) {
			jjStopStringLiteralDfa_1(1, active0);
			return 2;
		}
		switch (curChar) {
		case 100:
			if ((active0 & 0x10000000000L) != 0L)
				return jjStartNfaWithStates_1(2, 40, 42);
			else if ((active0 & 0x10000000000000L) != 0L)
				return jjStartNfaWithStates_1(2, 52, 42);
			break;
		case 108:
			return jjMoveStringLiteralDfa3_1(active0, 0x18000L);
		case 112:
			return jjMoveStringLiteralDfa3_1(active0, 0x80000000000L);
		case 115:
			return jjMoveStringLiteralDfa3_1(active0, 0x100000000000L);
		case 116:
			if ((active0 & 0x4000000000L) != 0L)
				return jjStartNfaWithStates_1(2, 38, 42);
			break;
		case 117:
			return jjMoveStringLiteralDfa3_1(active0, 0x4000L);
		case 118:
			if ((active0 & 0x4000000000000L) != 0L)
				return jjStartNfaWithStates_1(2, 50, 42);
			break;
		default:
			break;
		}
		return jjStartNfa_1(1, active0);
	}

	private final int jjMoveStringLiteralDfa3_1(long old0, long active0) {
		if (((active0 &= old0)) == 0L)
			return jjStartNfa_1(1, old0);
		try {
			curChar = input_stream.readChar();
		} catch (java.io.IOException e) {
			jjStopStringLiteralDfa_1(2, active0);
			return 3;
		}
		switch (curChar) {
		case 101:
			if ((active0 & 0x4000L) != 0L)
				return jjStartNfaWithStates_1(3, 14, 42);
			break;
		case 108:
			if ((active0 & 0x10000L) != 0L)
				return jjStartNfaWithStates_1(3, 16, 42);
			break;
		case 115:
			return jjMoveStringLiteralDfa4_1(active0, 0x8000L);
		case 116:
			return jjMoveStringLiteralDfa4_1(active0, 0x180000000000L);
		default:
			break;
		}
		return jjStartNfa_1(2, active0);
	}

	private final int jjMoveStringLiteralDfa4_1(long old0, long active0) {
		if (((active0 &= old0)) == 0L)
			return jjStartNfa_1(2, old0);
		try {
			curChar = input_stream.readChar();
		} catch (java.io.IOException e) {
			jjStopStringLiteralDfa_1(3, active0);
			return 4;
		}
		switch (curChar) {
		case 97:
			return jjMoveStringLiteralDfa5_1(active0, 0x100000000000L);
		case 101:
			if ((active0 & 0x8000L) != 0L)
				return jjStartNfaWithStates_1(4, 15, 42);
			break;
		case 121:
			if ((active0 & 0x80000000000L) != 0L)
				return jjStartNfaWithStates_1(4, 43, 42);
			break;
		default:
			break;
		}
		return jjStartNfa_1(3, active0);
	}

	private final int jjMoveStringLiteralDfa5_1(long old0, long active0) {
		if (((active0 &= old0)) == 0L)
			return jjStartNfa_1(3, old0);
		try {
			curChar = input_stream.readChar();
		} catch (java.io.IOException e) {
			jjStopStringLiteralDfa_1(4, active0);
			return 5;
		}
		switch (curChar) {
		case 110:
			return jjMoveStringLiteralDfa6_1(active0, 0x100000000000L);
		default:
			break;
		}
		return jjStartNfa_1(4, active0);
	}

	private final int jjMoveStringLiteralDfa6_1(long old0, long active0) {
		if (((active0 &= old0)) == 0L)
			return jjStartNfa_1(4, old0);
		try {
			curChar = input_stream.readChar();
		} catch (java.io.IOException e) {
			jjStopStringLiteralDfa_1(5, active0);
			return 6;
		}
		switch (curChar) {
		case 99:
			return jjMoveStringLiteralDfa7_1(active0, 0x100000000000L);
		default:
			break;
		}
		return jjStartNfa_1(5, active0);
	}

	private final int jjMoveStringLiteralDfa7_1(long old0, long active0) {
		if (((active0 &= old0)) == 0L)
			return jjStartNfa_1(5, old0);
		try {
			curChar = input_stream.readChar();
		} catch (java.io.IOException e) {
			jjStopStringLiteralDfa_1(6, active0);
			return 7;
		}
		switch (curChar) {
		case 101:
			return jjMoveStringLiteralDfa8_1(active0, 0x100000000000L);
		default:
			break;
		}
		return jjStartNfa_1(6, active0);
	}

	private final int jjMoveStringLiteralDfa8_1(long old0, long active0) {
		if (((active0 &= old0)) == 0L)
			return jjStartNfa_1(6, old0);
		try {
			curChar = input_stream.readChar();
		} catch (java.io.IOException e) {
			jjStopStringLiteralDfa_1(7, active0);
			return 8;
		}
		switch (curChar) {
		case 111:
			return jjMoveStringLiteralDfa9_1(active0, 0x100000000000L);
		default:
			break;
		}
		return jjStartNfa_1(7, active0);
	}

	private final int jjMoveStringLiteralDfa9_1(long old0, long active0) {
		if (((active0 &= old0)) == 0L)
			return jjStartNfa_1(7, old0);
		try {
			curChar = input_stream.readChar();
		} catch (java.io.IOException e) {
			jjStopStringLiteralDfa_1(8, active0);
			return 9;
		}
		switch (curChar) {
		case 102:
			if ((active0 & 0x100000000000L) != 0L)
				return jjStartNfaWithStates_1(9, 44, 42);
			break;
		default:
			break;
		}
		return jjStartNfa_1(8, active0);
	}

	static final long[] jjbitVec3 = { 0x1ff00000fffffffeL, 0xffffffffffffc000L,
			0xffffffffL, 0x600000000000000L };

	static final long[] jjbitVec4 = { 0x0L, 0x0L, 0x0L, 0xff7fffffff7fffffL };

	static final long[] jjbitVec5 = { 0x0L, 0xffffffffffffffffL,
			0xffffffffffffffffL, 0xffffffffffffffffL };

	static final long[] jjbitVec6 = { 0xffffffffffffffffL, 0xffffffffffffffffL,
			0xffffL, 0x0L };

	static final long[] jjbitVec7 = { 0xffffffffffffffffL, 0xffffffffffffffffL,
			0x0L, 0x0L };

	static final long[] jjbitVec8 = { 0x3fffffffffffL, 0x0L, 0x0L, 0x0L };

	private final int jjMoveNfa_1(int startState, int curPos) {
		int[] nextStates;
		int startsAt = 0;
		jjnewStateCnt = 41;
		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 41:
						if ((0x3ff001000000000L & l) != 0L) {
							if (kind > 55)
								kind = 55;
							jjCheckNAdd(40);
						} else if ((0x600000000000L & l) != 0L)
							jjCheckNAddStates(4, 6);
						else if (curChar == 58) {
							if (kind > 54)
								kind = 54;
						}
						if ((0x3ff001000000000L & l) != 0L)
							jjCheckNAddStates(7, 10);
						if ((0x3ff001000000000L & l) != 0L) {
							if (kind > 53)
								kind = 53;
							jjCheckNAdd(34);
						}
						if ((0x1800000000L & l) != 0L)
							jjCheckNAddStates(11, 14);
						break;
					case 0:
						if ((0x3ff000000000000L & l) != 0L) {
							if (kind > 9)
								kind = 9;
							jjCheckNAddStates(15, 19);
						} else if ((0x1800000000L & l) != 0L) {
							if (kind > 53)
								kind = 53;
							jjCheckNAddStates(20, 25);
						} else if (curChar == 39)
							jjCheckNAddStates(26, 30);
						else if (curChar == 34)
							jjCheckNAddStates(31, 35);
						else if (curChar == 46)
							jjCheckNAdd(1);
						break;
					case 42:
						if ((0x3ff001000000000L & l) != 0L) {
							if (kind > 55)
								kind = 55;
							jjCheckNAdd(40);
						} else if ((0x600000000000L & l) != 0L)
							jjCheckNAddStates(4, 6);
						else if (curChar == 58) {
							if (kind > 54)
								kind = 54;
						}
						if ((0x3ff001000000000L & l) != 0L)
							jjCheckNAddStates(11, 14);
						if ((0x3ff001000000000L & l) != 0L)
							jjCheckNAddStates(7, 10);
						if ((0x3ff001000000000L & l) != 0L) {
							if (kind > 53)
								kind = 53;
							jjCheckNAdd(34);
						}
						if ((0x1800000000L & l) != 0L)
							jjCheckNAddStates(11, 14);
						break;
					case 1:
						if ((0x3ff000000000000L & l) == 0L)
							break;
						if (kind > 10)
							kind = 10;
						jjCheckNAddTwoStates(1, 2);
						break;
					case 3:
						if ((0x280000000000L & l) != 0L)
							jjCheckNAdd(4);
						break;
					case 4:
						if ((0x3ff000000000000L & l) == 0L)
							break;
						if (kind > 10)
							kind = 10;
						jjCheckNAdd(4);
						break;
					case 5:
						if ((0x3ff000000000000L & l) == 0L)
							break;
						if (kind > 9)
							kind = 9;
						jjCheckNAddStates(15, 19);
						break;
					case 6:
						if ((0x3ff000000000000L & l) == 0L)
							break;
						if (kind > 9)
							kind = 9;
						jjCheckNAdd(6);
						break;
					case 7:
						if ((0x3ff000000000000L & l) != 0L)
							jjCheckNAddTwoStates(7, 8);
						break;
					case 8:
						if (curChar != 46)
							break;
						if (kind > 10)
							kind = 10;
						jjCheckNAddTwoStates(9, 10);
						break;
					case 9:
						if ((0x3ff000000000000L & l) == 0L)
							break;
						if (kind > 10)
							kind = 10;
						jjCheckNAddTwoStates(9, 10);
						break;
					case 11:
						if ((0x280000000000L & l) != 0L)
							jjCheckNAdd(12);
						break;
					case 12:
						if ((0x3ff000000000000L & l) == 0L)
							break;
						if (kind > 10)
							kind = 10;
						jjCheckNAdd(12);
						break;
					case 13:
						if ((0x3ff000000000000L & l) != 0L)
							jjCheckNAddTwoStates(13, 14);
						break;
					case 15:
						if ((0x280000000000L & l) != 0L)
							jjCheckNAdd(16);
						break;
					case 16:
						if ((0x3ff000000000000L & l) == 0L)
							break;
						if (kind > 10)
							kind = 10;
						jjCheckNAdd(16);
						break;
					case 17:
						if (curChar == 34)
							jjCheckNAddStates(31, 35);
						break;
					case 18:
						if ((0xfffffffbffffffffL & l) != 0L)
							jjCheckNAddStates(36, 38);
						break;
					case 20:
						if (curChar == 34)
							jjCheckNAddStates(36, 38);
						break;
					case 21:
						if (curChar == 34 && kind > 12)
							kind = 12;
						break;
					case 22:
						if ((0xfffffffbffffffffL & l) != 0L)
							jjCheckNAddTwoStates(22, 23);
						break;
					case 24:
						if ((0xfffffffbffffffffL & l) != 0L && kind > 13)
							kind = 13;
						break;
					case 25:
						if (curChar == 39)
							jjCheckNAddStates(26, 30);
						break;
					case 26:
						if ((0xffffff7fffffffffL & l) != 0L)
							jjCheckNAddStates(39, 41);
						break;
					case 28:
						if (curChar == 39)
							jjCheckNAddStates(39, 41);
						break;
					case 29:
						if (curChar == 39 && kind > 12)
							kind = 12;
						break;
					case 30:
						if ((0xffffff7fffffffffL & l) != 0L)
							jjCheckNAddTwoStates(30, 31);
						break;
					case 32:
						if ((0xffffff7fffffffffL & l) != 0L && kind > 13)
							kind = 13;
						break;
					case 33:
						if ((0x1800000000L & l) == 0L)
							break;
						if (kind > 53)
							kind = 53;
						jjCheckNAddStates(20, 25);
						break;
					case 34:
						if ((0x3ff001000000000L & l) == 0L)
							break;
						if (kind > 53)
							kind = 53;
						jjCheckNAdd(34);
						break;
					case 35:
						if ((0x3ff001000000000L & l) != 0L)
							jjCheckNAddStates(7, 10);
						break;
					case 36:
						if ((0x1800000000L & l) != 0L)
							jjCheckNAddStates(11, 14);
						break;
					case 37:
						if ((0x3ff001000000000L & l) != 0L)
							jjCheckNAddStates(11, 14);
						break;
					case 38:
						if ((0x600000000000L & l) != 0L)
							jjCheckNAddStates(4, 6);
						break;
					case 39:
						if (curChar == 58 && kind > 54)
							kind = 54;
						break;
					case 40:
						if ((0x3ff001000000000L & l) == 0L)
							break;
						if (kind > 55)
							kind = 55;

⌨️ 快捷键说明

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