javaparsertokenmanager.java

java覆盖率测试工具

		do
		{
			jjCheckNAdd(jjnextStates[start]);
		} while (start++ != end);
	}

	private static final long[] jjbitVec0 = { 0xfffffffffffffffeL, 0xffffffffffffffffL,
			0xffffffffffffffffL, 0xffffffffffffffffL };
	private static final long[] jjbitVec2 = { 0x0L, 0x0L, 0xffffffffffffffffL, 0xffffffffffffffffL };
	private static final long[] jjbitVec3 = { 0x1ff00000fffffffeL, 0xffffffffffffc000L,
			0xffffffffL, 0x600000000000000L };
	private static final long[] jjbitVec4 = { 0x0L, 0x0L, 0x0L, 0xff7fffffff7fffffL };
	private static final long[] jjbitVec5 = { 0x0L, 0xffffffffffffffffL, 0xffffffffffffffffL,
			0xffffffffffffffffL };
	private static final long[] jjbitVec6 = { 0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffL,
			0x0L };
	private static final long[] jjbitVec7 = { 0xffffffffffffffffL, 0xffffffffffffffffL, 0x0L, 0x0L };
	private static final long[] jjbitVec8 = { 0x3fffffffffffL, 0x0L, 0x0L, 0x0L };

	private final int jjMoveNfa_0(int startState, int curPos)
	{
		int startsAt = 0;
		jjnewStateCnt = 48;
		int i = 1;
		jjstateSet[0] = startState;
		int kind = 0x7fffffff;
		for (;;)
		{
			if (++jjround == 0x7fffffff)
				ReInitRounds();
			if (curChar < 64)
			{
				long l = 1L << curChar;
				MatchLoop: do
				{
					switch (jjstateSet[--i])
					{
						case 0:
							if ((0x3ff000000000000L & l) != 0L)
								jjCheckNAddStates(0, 6);
							else if (curChar == 36)
							{
								if (kind > 73)
									kind = 73;
								jjCheckNAdd(28);
							}
							else if (curChar == 34)
								jjCheckNAddStates(7, 9);
							else if (curChar == 39)
								jjAddStates(10, 11);
							else if (curChar == 46)
								jjCheckNAdd(4);
							if ((0x3fe000000000000L & l) != 0L)
							{
								if (kind > 65)
									kind = 65;
								jjCheckNAddTwoStates(1, 2);
							}
							else if (curChar == 48)
							{
								if (kind > 65)
									kind = 65;
								jjCheckNAddStates(12, 14);
							}
							break;
						case 1:
							if ((0x3ff000000000000L & l) == 0L)
								break;
							if (kind > 65)
								kind = 65;
							jjCheckNAddTwoStates(1, 2);
							break;
						case 3:
							if (curChar == 46)
								jjCheckNAdd(4);
							break;
						case 4:
							if ((0x3ff000000000000L & l) == 0L)
								break;
							if (kind > 69)
								kind = 69;
							jjCheckNAddStates(15, 17);
							break;
						case 6:
							if ((0x280000000000L & l) != 0L)
								jjCheckNAdd(7);
							break;
						case 7:
							if ((0x3ff000000000000L & l) == 0L)
								break;
							if (kind > 69)
								kind = 69;
							jjCheckNAddTwoStates(7, 8);
							break;
						case 9:
							if (curChar == 39)
								jjAddStates(10, 11);
							break;
						case 10:
							if ((0xfffffffffffffbffL & l) != 0L)
								jjCheckNAdd(11);
							break;
						case 11:
							if (curChar == 39 && kind > 71)
								kind = 71;
							break;
						case 13:
							if ((0x8400000000L & l) != 0L)
								jjCheckNAdd(11);
							break;
						case 14:
							if ((0xff000000000000L & l) != 0L)
								jjCheckNAddTwoStates(15, 11);
							break;
						case 15:
							if ((0xff000000000000L & l) != 0L)
								jjCheckNAdd(11);
							break;
						case 16:
							if ((0xf000000000000L & l) != 0L)
								jjstateSet[jjnewStateCnt++] = 17;
							break;
						case 17:
							if ((0xff000000000000L & l) != 0L)
								jjCheckNAdd(15);
							break;
						case 18:
							if (curChar == 34)
								jjCheckNAddStates(7, 9);
							break;
						case 19:
							if ((0xfffffffbffffdbffL & l) != 0L)
								jjCheckNAddStates(7, 9);
							break;
						case 21:
							if ((0x8400000000L & l) != 0L)
								jjCheckNAddStates(7, 9);
							break;
						case 22:
							if (curChar == 34 && kind > 72)
								kind = 72;
							break;
						case 23:
							if ((0xff000000000000L & l) != 0L)
								jjCheckNAddStates(18, 21);
							break;
						case 24:
							if ((0xff000000000000L & l) != 0L)
								jjCheckNAddStates(7, 9);
							break;
						case 25:
							if ((0xf000000000000L & l) != 0L)
								jjstateSet[jjnewStateCnt++] = 26;
							break;
						case 26:
							if ((0xff000000000000L & l) != 0L)
								jjCheckNAdd(24);
							break;
						case 27:
							if (curChar != 36)
								break;
							if (kind > 73)
								kind = 73;
							jjCheckNAdd(28);
							break;
						case 28:
							if ((0x3ff001000000000L & l) == 0L)
								break;
							if (kind > 73)
								kind = 73;
							jjCheckNAdd(28);
							break;
						case 29:
							if ((0x3ff000000000000L & l) != 0L)
								jjCheckNAddStates(0, 6);
							break;
						case 30:
							if ((0x3ff000000000000L & l) != 0L)
								jjCheckNAddTwoStates(30, 31);
							break;
						case 31:
							if (curChar != 46)
								break;
							if (kind > 69)
								kind = 69;
							jjCheckNAddStates(22, 24);
							break;
						case 32:
							if ((0x3ff000000000000L & l) == 0L)
								break;
							if (kind > 69)
								kind = 69;
							jjCheckNAddStates(22, 24);
							break;
						case 34:
							if ((0x280000000000L & l) != 0L)
								jjCheckNAdd(35);
							break;
						case 35:
							if ((0x3ff000000000000L & l) == 0L)
								break;
							if (kind > 69)
								kind = 69;
							jjCheckNAddTwoStates(35, 8);
							break;
						case 36:
							if ((0x3ff000000000000L & l) != 0L)
								jjCheckNAddTwoStates(36, 37);
							break;
						case 38:
							if ((0x280000000000L & l) != 0L)
								jjCheckNAdd(39);
							break;
						case 39:
							if ((0x3ff000000000000L & l) == 0L)
								break;
							if (kind > 69)
								kind = 69;
							jjCheckNAddTwoStates(39, 8);
							break;
						case 40:
							if ((0x3ff000000000000L & l) != 0L)
								jjCheckNAddStates(25, 27);
							break;
						case 42:
							if ((0x280000000000L & l) != 0L)
								jjCheckNAdd(43);
							break;
						case 43:
							if ((0x3ff000000000000L & l) != 0L)
								jjCheckNAddTwoStates(43, 8);
							break;
						case 44:
							if (curChar != 48)
								break;
							if (kind > 65)
								kind = 65;
							jjCheckNAddStates(12, 14);
							break;
						case 46:
							if ((0x3ff000000000000L & l) == 0L)
								break;
							if (kind > 65)
								kind = 65;
							jjCheckNAddTwoStates(46, 2);
							break;
						case 47:
							if ((0xff000000000000L & l) == 0L)
								break;
							if (kind > 65)
								kind = 65;
							jjCheckNAddTwoStates(47, 2);
							break;
						default:
							break;
					}
				} while (i != startsAt);
			}
			else if (curChar < 128)
			{
				long l = 1L << (curChar & 077);
				MatchLoop: do
				{
					switch (jjstateSet[--i])
					{
						case 0:
						case 28:
							if ((0x7fffffe87fffffeL & l) == 0L)
								break;
							if (kind > 73)
								kind = 73;
							jjCheckNAdd(28);
							break;
						case 2:
							if ((0x100000001000L & l) != 0L && kind > 65)
								kind = 65;
							break;
						case 5:
							if ((0x2000000020L & l) != 0L)
								jjAddStates(28, 29);
							break;
						case 8:
							if ((0x5000000050L & l) != 0L && kind > 69)
								kind = 69;
							break;
						case 10:
							if ((0xffffffffefffffffL & l) != 0L)
								jjCheckNAdd(11);
							break;
						case 12:
							if (curChar == 92)
								jjAddStates(30, 32);
							break;
						case 13:
							if ((0x14404410000000L & l) != 0L)
								jjCheckNAdd(11);
							break;
						case 19:
							if ((0xffffffffefffffffL & l) != 0L)
								jjCheckNAddStates(7, 9);
							break;
						case 20:
							if (curChar == 92)
								jjAddStates(33, 35);
							break;
						case 21:
							if ((0x14404410000000L & l) != 0L)
								jjCheckNAddStates(7, 9);
							break;
						case 33:
							if ((0x2000000020L & l) != 0L)
								jjAddStates(36, 37);
							break;
						case 37:
							if ((0x2000000020L & l) != 0L)
								jjAddStates(38, 39);
							break;
						case 41:
							if ((0x2000000020L & l) != 0L)
								jjAddStates(40, 41);
							break;
						case 45:
							if ((0x100000001000000L & l) != 0L)
								jjCheckNAdd(46);
							break;
						case 46:
							if ((0x7e0000007eL & l) == 0L)
								break;
							if (kind > 65)
								kind = 65;
							jjCheckNAddTwoStates(46, 2);
							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);
				MatchLoop: do
				{
					switch (jjstateSet[--i])
					{
						case 0:
						case 28:
							if (!jjCanMove_1(hiByte, i1, i2, l1, l2))
								break;
							if (kind > 73)
								kind = 73;
							jjCheckNAdd(28);
							break;
						case 10:
							if (jjCanMove_0(hiByte, i1, i2, l1, l2))
								jjstateSet[jjnewStateCnt++] = 11;
							break;
						case 19:
							if (jjCanMove_0(hiByte, i1, i2, l1, l2))
								jjAddStates(7, 9);
							break;
						default:
							break;
					}
				} while (i != startsAt);
			}
			if (kind != 0x7fffffff)
			{
				jjmatchedKind = kind;
				jjmatchedPos = curPos;
				kind = 0x7fffffff;
			}
			++curPos;
			if ((i = jjnewStateCnt) == (startsAt = 48 - (jjnewStateCnt = startsAt)))
				return curPos;
			try
			{
				curChar = input_stream.readChar();
			}
			catch (java.io.IOException e)
			{
				return curPos;
			}
		}
	}

	private final int jjStopStringLiteralDfa_2(int pos)
	{
		switch (pos)
		{
			default:
				return -1;
		}
	}

	private final int jjStartNfa_2(int pos)
	{
		return jjMoveNfa_2(jjStopStringLiteralDfa_2(pos), pos + 1);
	}

	private final int jjMoveStringLiteralDfa0_2()
	{
		switch (curChar)
		{
			case 42:
				return jjMoveStringLiteralDfa1_2(0x800L);
			default:
				return jjMoveNfa_2(0, 0);
		}
	}

	private final int jjMoveStringLiteralDfa1_2(long active0)
	{
		try
		{
			curChar = input_stream.readChar();
		}
		catch (java.io.IOException e)
		{
			jjStopStringLiteralDfa_2(0);
			return 1;
		}
		switch (curChar)
		{
			case 47:
				if ((active0 & 0x800L) != 0L)
					return jjStopAtPos(1, 11);
				break;
			default:
				break;
		}
		return jjStartNfa_2(0);
	}

	private final int jjMoveNfa_2(int startState, int curPos)
	{
		int startsAt = 0;
		jjnewStateCnt = 3;
		int i = 1;
		jjstateSet[0] = startState;
		int kind = 0x7fffffff;
		for (;;)
		{
			if (++jjround == 0x7fffffff)
				ReInitRounds();
			if (curChar < 64)
			{
				long l = 1L << curChar;
				MatchLoop: do
				{
					switch (jjstateSet[--i])
					{
						case 0:
							if ((0x2400L & l) != 0L)
							{
								if (kind > 10)
									kind = 10;
							}
							if (curChar == 13)
								jjstateSet[jjnewStateCnt++] = 1;
							break;
						case 1:
							if (curChar == 10 && kind > 10)
								kind = 10;
							break;
						case 2:
							if (curChar == 13)
								jjstateSet[jjnewStateCnt++] = 1;