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

📄 elparsertokenmanager.java

📁 业界著名的tomcat服务器的最新6.0的源代码。
💻 JAVA
📖 第 1 页 / 共 3 页
字号:
						jjCheckNAdd(40);
						break;
					default:
						break;
					}
				} while (i != startsAt);
			} else if (curChar < 128) {
				long l = 1L << (curChar & 077);
				MatchLoop: do {
					switch (jjstateSet[--i]) {
					case 41:
						if ((0x7fffffe87fffffeL & l) != 0L) {
							if (kind > 55)
								kind = 55;
							jjCheckNAdd(40);
						}
						if ((0x7fffffe87fffffeL & l) != 0L)
							jjCheckNAddStates(11, 14);
						if ((0x7fffffe87fffffeL & l) != 0L)
							jjCheckNAddStates(7, 10);
						if ((0x7fffffe87fffffeL & l) != 0L) {
							if (kind > 53)
								kind = 53;
							jjCheckNAdd(34);
						}
						break;
					case 0:
						if ((0x7fffffe87fffffeL & l) == 0L)
							break;
						if (kind > 53)
							kind = 53;
						jjCheckNAddStates(20, 25);
						break;
					case 42:
						if ((0x7fffffe87fffffeL & l) != 0L) {
							if (kind > 55)
								kind = 55;
							jjCheckNAdd(40);
						}
						if ((0x7fffffe87fffffeL & l) != 0L)
							jjCheckNAddStates(11, 14);
						if ((0x7fffffe87fffffeL & l) != 0L)
							jjCheckNAddStates(11, 14);
						if ((0x7fffffe87fffffeL & l) != 0L)
							jjCheckNAddStates(7, 10);
						if ((0x7fffffe87fffffeL & l) != 0L) {
							if (kind > 53)
								kind = 53;
							jjCheckNAdd(34);
						}
						break;
					case 2:
						if ((0x2000000020L & l) != 0L)
							jjAddStates(42, 43);
						break;
					case 10:
						if ((0x2000000020L & l) != 0L)
							jjAddStates(44, 45);
						break;
					case 14:
						if ((0x2000000020L & l) != 0L)
							jjAddStates(46, 47);
						break;
					case 18:
						if ((0xffffffffefffffffL & l) != 0L)
							jjCheckNAddStates(36, 38);
						break;
					case 19:
						if (curChar == 92)
							jjstateSet[jjnewStateCnt++] = 20;
						break;
					case 20:
						if (curChar == 92)
							jjCheckNAddStates(36, 38);
						break;
					case 22:
						if ((0xffffffffefffffffL & l) != 0L)
							jjAddStates(48, 49);
						break;
					case 23:
						if (curChar == 92)
							jjstateSet[jjnewStateCnt++] = 24;
						break;
					case 24:
					case 32:
						if ((0xffffffffefffffffL & l) != 0L && kind > 13)
							kind = 13;
						break;
					case 26:
						if ((0xffffffffefffffffL & l) != 0L)
							jjCheckNAddStates(39, 41);
						break;
					case 27:
						if (curChar == 92)
							jjstateSet[jjnewStateCnt++] = 28;
						break;
					case 28:
						if (curChar == 92)
							jjCheckNAddStates(39, 41);
						break;
					case 30:
						if ((0xffffffffefffffffL & l) != 0L)
							jjAddStates(50, 51);
						break;
					case 31:
						if (curChar == 92)
							jjstateSet[jjnewStateCnt++] = 32;
						break;
					case 34:
						if ((0x7fffffe87fffffeL & l) == 0L)
							break;
						if (kind > 53)
							kind = 53;
						jjCheckNAdd(34);
						break;
					case 35:
						if ((0x7fffffe87fffffeL & l) != 0L)
							jjCheckNAddStates(7, 10);
						break;
					case 36:
						if ((0x7fffffe87fffffeL & l) != 0L)
							jjCheckNAddStates(11, 14);
						break;
					case 37:
						if ((0x7fffffe87fffffeL & l) != 0L)
							jjCheckNAddStates(11, 14);
						break;
					case 40:
						if ((0x7fffffe87fffffeL & l) == 0L)
							break;
						if (kind > 55)
							kind = 55;
						jjCheckNAdd(40);
						break;
					default:
						break;
					}
				} while (i != startsAt);
			} else {
				int hiByte = (int) (curChar >> 8);
				int i1 = hiByte >> 6;
				long l1 = 1L << (hiByte & 077);
				int i2 = (curChar & 0xff) >> 6;
				long l2 = 1L << (curChar & 077);
				MatchLoop: do {
					switch (jjstateSet[--i]) {
					case 41:
						if (jjCanMove_1(hiByte, i1, i2, l1, l2)) {
							if (kind > 53)
								kind = 53;
							jjCheckNAdd(34);
						}
						if (jjCanMove_1(hiByte, i1, i2, l1, l2))
							jjCheckNAddStates(7, 10);
						if (jjCanMove_1(hiByte, i1, i2, l1, l2))
							jjCheckNAddStates(11, 14);
						if (jjCanMove_1(hiByte, i1, i2, l1, l2)) {
							if (kind > 55)
								kind = 55;
							jjCheckNAdd(40);
						}
						break;
					case 0:
						if (!jjCanMove_1(hiByte, i1, i2, l1, l2))
							break;
						if (kind > 53)
							kind = 53;
						jjCheckNAddStates(20, 25);
						break;
					case 42:
						if (jjCanMove_1(hiByte, i1, i2, l1, l2)) {
							if (kind > 53)
								kind = 53;
							jjCheckNAdd(34);
						}
						if (jjCanMove_1(hiByte, i1, i2, l1, l2))
							jjCheckNAddStates(7, 10);
						if (jjCanMove_1(hiByte, i1, i2, l1, l2))
							jjCheckNAddStates(11, 14);
						if (jjCanMove_1(hiByte, i1, i2, l1, l2))
							jjCheckNAddStates(11, 14);
						if (jjCanMove_1(hiByte, i1, i2, l1, l2)) {
							if (kind > 55)
								kind = 55;
							jjCheckNAdd(40);
						}
						break;
					case 18:
						if (jjCanMove_0(hiByte, i1, i2, l1, l2))
							jjAddStates(36, 38);
						break;
					case 22:
						if (jjCanMove_0(hiByte, i1, i2, l1, l2))
							jjAddStates(48, 49);
						break;
					case 24:
					case 32:
						if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 13)
							kind = 13;
						break;
					case 26:
						if (jjCanMove_0(hiByte, i1, i2, l1, l2))
							jjAddStates(39, 41);
						break;
					case 30:
						if (jjCanMove_0(hiByte, i1, i2, l1, l2))
							jjAddStates(50, 51);
						break;
					case 34:
						if (!jjCanMove_1(hiByte, i1, i2, l1, l2))
							break;
						if (kind > 53)
							kind = 53;
						jjCheckNAdd(34);
						break;
					case 35:
						if (jjCanMove_1(hiByte, i1, i2, l1, l2))
							jjCheckNAddStates(7, 10);
						break;
					case 36:
						if (jjCanMove_1(hiByte, i1, i2, l1, l2))
							jjCheckNAddStates(11, 14);
						break;
					case 37:
						if (jjCanMove_1(hiByte, i1, i2, l1, l2))
							jjCheckNAddStates(11, 14);
						break;
					case 40:
						if (!jjCanMove_1(hiByte, i1, i2, l1, l2))
							break;
						if (kind > 55)
							kind = 55;
						jjCheckNAdd(40);
						break;
					default:
						break;
					}
				} while (i != startsAt);
			}
			if (kind != 0x7fffffff) {
				jjmatchedKind = kind;
				jjmatchedPos = curPos;
				kind = 0x7fffffff;
			}
			++curPos;
			if ((i = jjnewStateCnt) == (startsAt = 41 - (jjnewStateCnt = startsAt)))
				return curPos;
			try {
				curChar = input_stream.readChar();
			} catch (java.io.IOException e) {
				return curPos;
			}
		}
	}

	static final int[] jjnextStates = { 0, 1, 3, 5, 36, 38, 39, 35, 36, 38, 39,
			36, 37, 38, 39, 6, 7, 8, 13, 14, 34, 35, 36, 38, 39, 40, 26, 27,
			29, 30, 31, 18, 19, 21, 22, 23, 18, 19, 21, 26, 27, 29, 3, 4, 11,
			12, 15, 16, 22, 23, 30, 31, };

	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;
		}
	}

	private static final boolean jjCanMove_1(int hiByte, int i1, int i2,
			long l1, long l2) {
		switch (hiByte) {
		case 0:
			return ((jjbitVec4[i2] & l2) != 0L);
		case 48:
			return ((jjbitVec5[i2] & l2) != 0L);
		case 49:
			return ((jjbitVec6[i2] & l2) != 0L);
		case 51:
			return ((jjbitVec7[i2] & l2) != 0L);
		case 61:
			return ((jjbitVec8[i2] & l2) != 0L);
		default:
			if ((jjbitVec3[i1] & l1) != 0L)
				return true;
			return false;
		}
	}

	public static final String[] jjstrLiteralImages = { "", null, "\44\173",
			"\43\173", null, null, null, null, null, null, null, null, null,
			null, "\164\162\165\145", "\146\141\154\163\145",
			"\156\165\154\154", "\175", "\56", "\50", "\51", "\133", "\135",
			"\72", "\54", "\76", "\147\164", "\74", "\154\164", "\76\75",
			"\147\145", "\74\75", "\154\145", "\75\75", "\145\161", "\41\75",
			"\156\145", "\41", "\156\157\164", "\46\46", "\141\156\144",
			"\174\174", "\157\162", "\145\155\160\164\171",
			"\151\156\163\164\141\156\143\145\157\146", "\52", "\53", "\55",
			"\77", "\57", "\144\151\166", "\45", "\155\157\144", null, null,
			null, null, null, null, null, };

	public static final String[] lexStateNames = { "DEFAULT", "IN_EXPRESSION", };

	public static final int[] jjnewLexState = { -1, -1, 1, 1, -1, -1, -1, -1,
			-1, -1, -1, -1, -1, -1, -1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1,
			-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
			-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
			-1, };

	static final long[] jjtoToken = { 0x8fffffffffff60fL, };

	static final long[] jjtoSkip = { 0x1f0L, };

	protected SimpleCharStream input_stream;

	private final int[] jjrounds = new int[41];

	private final int[] jjstateSet = new int[82];

	protected char curChar;

	public ELParserTokenManager(SimpleCharStream stream) {
		if (SimpleCharStream.staticFlag)
			throw new Error(
					"ERROR: Cannot use a static CharStream class with a non-static lexical analyzer.");
		input_stream = stream;
	}

	public ELParserTokenManager(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 = 41; i-- > 0;)
			jjrounds[i] = 0x80000000;
	}

	public void ReInit(SimpleCharStream stream, int lexState) {
		ReInit(stream);
		SwitchTo(lexState);
	}

	public void SwitchTo(int lexState) {
		if (lexState >= 2 || lexState < 0)
			throw new TokenMgrError("Error: Ignoring invalid lexical state : "
					+ lexState + ". State unchanged.",
					TokenMgrError.INVALID_LEXICAL_STATE);
		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() {
		int kind;
		Token specialToken = null;
		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();
				break;
			case 1:
				try {
					input_stream.backup(0);
					while (curChar <= 32
							&& (0x100002600L & (1L << curChar)) != 0L)
						curChar = input_stream.BeginToken();
				} catch (java.io.IOException e1) {
					continue EOFLoop;
				}
				jjmatchedKind = 0x7fffffff;
				jjmatchedPos = 0;
				curPos = jjMoveStringLiteralDfa0_1();
				if (jjmatchedPos == 0 && jjmatchedKind > 59) {
					jjmatchedKind = 59;
				}
				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();
				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();
			}
			throw new TokenMgrError(EOFSeen, curLexState, error_line,
					error_column, error_after, curChar,
					TokenMgrError.LEXICAL_ERROR);
		}
	}

}

⌨️ 快捷键说明

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