queryparsertokenmanager.cs

Lucene.Net 版本源码 测试通过

									kind = 18;
								JjCheckNAddTwoStates(20, 21);
								break;
							
							case 21: 
								if (curChar == 92)
									JjCheckNAddTwoStates(22, 22);
								break;
							
							case 22: 
								if ((0x6800000078000000L & l) == (ulong) 0L)
									break;
								if (kind > 18)
									kind = 18;
								JjCheckNAddTwoStates(20, 21);
								break;
							
							case 23: 
								if (curChar != 126)
									break;
								if (kind > 19)
									kind = 19;
								jjstateSet[jjnewStateCnt++] = 24;
								break;
							
							case 27: 
								if ((0x97ffffff97ffffffL & l) != (ulong) 0L)
									JjCheckNAddStates(0, 2);
								break;
							
							case 28: 
								if ((0x97ffffff97ffffffL & l) != (ulong) 0L)
									JjCheckNAddStates(0, 2);
								break;
							
							case 30: 
								if (curChar == 92)
									JjCheckNAddTwoStates(31, 31);
								break;
							
							case 31: 
								if ((0x6800000078000000L & l) != 0L)
									JjCheckNAddStates(0, 2);
								break;
							
							case 32: 
								if ((0x97ffffff97ffffffL & l) == (ulong) 0L)
									break;
								if (kind > 21)
									kind = 21;
								JjCheckNAddTwoStates(33, 34);
								break;
							
							case 33: 
								if ((0x97ffffff97ffffffL & l) == (ulong) 0L)
									break;
								if (kind > 21)
									kind = 21;
								JjCheckNAddTwoStates(33, 34);
								break;
							
							case 34: 
								if (curChar == 92)
									JjCheckNAddTwoStates(35, 35);
								break;
							
							case 35: 
								if ((0x6800000078000000L & l) == (ulong) 0L)
									break;
								if (kind > 21)
									kind = 21;
								JjCheckNAddTwoStates(33, 34);
								break;
							
							case 36: 
								if (curChar == 92)
									JjCheckNAddStates(8, 10);
								break;
							
							default:  break;
							
						}
					}
					while (i != startsAt);
				}
				else
				{
					int hiByte = (int) (curChar >> 8);
					int i1 = hiByte >> 6;
					ulong l1 = ((ulong) 1L) << (hiByte & 63);
					int i2 = (curChar & 0xff) >> 6;
					ulong l2 = ((ulong) 1L) << (curChar & 63);
MatchLoop1: 
					do 
					{
						switch (jjstateSet[--i])
						{
							
							case 37: 
								if (JjCanMove_0(hiByte, i1, i2, (ulong) l1, (ulong) l2))
									JjCheckNAddStates(0, 2);
								if (JjCanMove_0(hiByte, i1, i2, (ulong) l1, (ulong) l2))
								{
									if (kind > 21)
										kind = 21;
									JjCheckNAddTwoStates(33, 34);
								}
								break;
							
							case 0: 
								if (JjCanMove_0(hiByte, i1, i2, (ulong) l1, (ulong) l2))
								{
									if (kind > 18)
										kind = 18;
									JjCheckNAddTwoStates(20, 21);
								}
								if (JjCanMove_0(hiByte, i1, i2, l1, l2))
									JjCheckNAddStates(0, 2);
								if (JjCanMove_0(hiByte, i1, i2, l1, l2))
								{
									if (kind > 21)
										kind = 21;
									JjCheckNAddTwoStates(33, 34);
								}
								break;
							
							case 15: 
								if (JjCanMove_0(hiByte, i1, i2, (ulong) l1, (ulong) l2))
									JjAddStates(3, 5);
								break;
							
							case 19: 
							case 20: 
								if (!JjCanMove_0(hiByte, i1, i2, (ulong) l1, (ulong) l2))
									break;
								if (kind > 18)
									kind = 18;
								JjCheckNAddTwoStates(20, 21);
								break;
							
							case 27: 
								if (JjCanMove_0(hiByte, i1, i2, (ulong) l1, (ulong) l2))
									JjCheckNAddStates(0, 2);
								break;
							
							case 28: 
								if (JjCanMove_0(hiByte, i1, i2, (ulong) l1, (ulong) l2))
									JjCheckNAddStates(0, 2);
								break;
							
							case 32: 
								if (!JjCanMove_0(hiByte, i1, i2, (ulong) l1, (ulong) l2))
									break;
								if (kind > 21)
									kind = 21;
								JjCheckNAddTwoStates(33, 34);
								break;
							
							case 33: 
								if (!JjCanMove_0(hiByte, i1, i2, (ulong) l1, (ulong) l2))
									break;
								if (kind > 21)
									kind = 21;
								JjCheckNAddTwoStates(33, 34);
								break;
							
							default:  break;
							
						}
					}
					while (i != startsAt);
				}
				if (kind != 0x7fffffff)
				{
					jjmatchedKind = kind;
					jjmatchedPos = curPos;
					kind = 0x7fffffff;
				}
				++curPos;
				if ((i = jjnewStateCnt) == (startsAt = 37 - (jjnewStateCnt = startsAt)))
					return curPos;
				try
				{
					curChar = input_stream.ReadChar();
				}
				catch (System.IO.IOException e)
				{
					return curPos;
				}
			}
		}
		private int JjStopStringLiteralDfa_1(int pos, ulong active0)
		{
			switch (pos)
			{
				
				case 0: 
					if ((active0 & 0x20000000L) != 0L)
					{
						jjmatchedKind = 32;
						return 6;
					}
					return - 1;
				
				default: 
					return - 1;
				
			}
		}
		private int JjStartNfa_1(int pos, ulong active0)
		{
			return JjMoveNfa_1(JjStopStringLiteralDfa_1(pos, (ulong) active0), pos + 1);
		}
		private int JjStartNfaWithStates_1(int pos, int kind, int state)
		{
			jjmatchedKind = kind;
			jjmatchedPos = pos;
			try
			{
				curChar = input_stream.ReadChar();
			}
			catch (System.IO.IOException)
			{
				return pos + 1;
			}
			return JjMoveNfa_1(state, pos + 1);
		}
		private int JjMoveStringLiteralDfa0_1()
		{
			switch (curChar)
			{
				
				case (char) (84): 
					return JjMoveStringLiteralDfa1_1((ulong) 0x20000000L);
				
				case (char) (125): 
					return JjStopAtPos(0, 30);
				
				default: 
					return JjMoveNfa_1(0, 0);
				
			}
		}
		private int JjMoveStringLiteralDfa1_1(ulong active0)
		{
			try
			{
				curChar = input_stream.ReadChar();
			}
			catch (System.IO.IOException)
			{
				JjStopStringLiteralDfa_1(0, (ulong) active0);
				return 1;
			}
			switch (curChar)
			{
				
				case (char) (79): 
					if ((active0 & 0x20000000L) != 0L)
						return JjStartNfaWithStates_1(1, 29, 6);
					break;
				
				default: 
					break;
				
			}
			return JjStartNfa_1(0, (ulong) active0);
		}
		private int JjMoveNfa_1(int startState, int curPos)
		{
			int[] nextStates;
			int startsAt = 0;
			jjnewStateCnt = 7;
			int i = 1;
			jjstateSet[0] = startState;
			int j, kind = 0x7fffffff;
			for (; ; )
			{
				if (++jjround == 0x7fffffff)
					ReInitRounds();
				if (curChar < 64)
				{
					ulong l = ((ulong) 1L) << curChar;
MatchLoop1: 
					do 
					{
						switch (jjstateSet[--i])
						{
							
							case 0: 
								if ((0xfffffffeffffffffL & l) != (ulong) 0L)
								{
									if (kind > 32)
										kind = 32;
									JjCheckNAdd(6);
								}
								if ((0x100002600L & l) != (ulong) 0L)
								{
									if (kind > 6)
										kind = 6;
								}
								else if (curChar == 34)
									JjCheckNAddTwoStates(2, 4);
								break;
							
							case 1: 
								if (curChar == 34)
									JjCheckNAddTwoStates(2, 4);
								break;
							
							case 2: 
								if ((0xfffffffbffffffffL & l) != (ulong) 0L)
									JjCheckNAddStates(11, 13);
								break;
							
							case 3: 
								if (curChar == 34)
									JjCheckNAddStates(11, 13);
								break;
							
							case 5: 
								if (curChar == 34 && kind > 31)
									kind = 31;
								break;
							
							case 6: 
								if ((0xfffffffeffffffffL & l) == (ulong) 0L)
									break;
								if (kind > 32)
									kind = 32;
								JjCheckNAdd(6);
								break;
							
							default:  break;
							
						}
					}
					while (i != startsAt);
				}
				else if (curChar < 128)
				{
					ulong l = ((ulong) 1L) << (curChar & 63);
MatchLoop1: 
					do 
					{
						switch (jjstateSet[--i])
						{
							
							case 0: 
							case 6: 
								if ((0xdfffffffffffffffL & l) == (ulong) 0L)
									break;
								if (kind > 32)
									kind = 32;
								JjCheckNAdd(6);
								break;
							
							case 2: 
								JjAddStates(11, 13);
								break;
							
							case 4: 
								if (curChar == 92)
									jjstateSet[jjnewStateCnt++] = 3;
								break;
							
							default:  break;
							
						}
					}
					while (i != startsAt);
				}
				else
				{
					int hiByte = (int) (curChar >> 8);
					int i1 = hiByte >> 6;
					ulong l1 = ((ulong) 1L) << (hiByte & 63);
					int i2 = (curChar & 0xff) >> 6;
					ulong l2 = ((ulong) 1L) << (curChar & 63);
MatchLoop1: 
					do 
					{
						switch (jjstateSet[--i])
						{
							
							case 0: 
							case 6: 
								if (!JjCanMove_0(hiByte, i1, i2, (ulong) l1, (ulong) l2))
									break;
								if (kind > 32)
									kind = 32;
								JjCheckNAdd(6);
								break;
							
							case 2: 
								if (JjCanMove_0(hiByte, i1, i2, (ulong) l1, (ulong) l2))
									JjAddStates(11, 13);
								break;
							
							default:  break;
							
						}
					}
					while (i != startsAt);
				}
				if (kind != 0x7fffffff)
				{
					jjmatchedKind = kind;
					jjmatchedPos = curPos;
					kind = 0x7fffffff;
				}
				++curPos;
				if ((i = jjnewStateCnt) == (startsAt = 7 - (jjnewStateCnt = startsAt)))
					return curPos;
				try
				{
					curChar = input_stream.ReadChar();
				}
				catch (System.IO.IOException)
				{
					return curPos;
				}
			}
		}
		private int JjMoveStringLiteralDfa0_0()
		{
			return JjMoveNfa_0(0, 0);
		}
		private int JjMoveNfa_0(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)
				{
					ulong l = ((ulong) 1L) << curChar;
MatchLoop1: 
					do 
					{
						switch (jjstateSet[--i])
						{
							
							case 0: 
								if ((0x3ff000000000000L & l) == (ulong) 0L)
									break;
								if (kind > 24)
									kind = 24;
								JjAddStates(14, 15);
								break;
							
							case 1: 
								if (curChar == 46)
									JjCheckNAdd(2);
								break;
							
							case 2: 
								if ((0x3ff000000000000L & l) == (ulong) 0L)
									break;
								if (kind > 24)
									kind = 24;
								JjCheckNAdd(2);
								break;
							
							default:  break;