📄 parsertokenmanager.java
字号:
kind = 52;
jjCheckNAdd(7);
}
else if (curChar == 92)
jjCheckNAddStates(40, 43);
if (curChar == 101)
jjAddStates(44, 45);
break;
case 30:
case 7:
if ((0x7fffffe87fffffeL & l) == 0L)
break;
if (kind > 52)
kind = 52;
jjCheckNAdd(7);
break;
case 22:
if ((0x7fffffe87fffffeL & l) != 0L)
{
if (kind > 52)
kind = 52;
jjCheckNAdd(7);
}
if (curChar == 108)
jjstateSet[jjnewStateCnt++] = 28;
else if (curChar == 110)
jjstateSet[jjnewStateCnt++] = 17;
break;
case 28:
if ((0x7fffffe87fffffeL & l) != 0L)
{
if (kind > 52)
kind = 52;
jjCheckNAdd(7);
}
if (curChar == 115)
jjstateSet[jjnewStateCnt++] = 23;
break;
case 23:
if ((0x7fffffe87fffffeL & l) != 0L)
{
if (kind > 52)
kind = 52;
jjCheckNAdd(7);
}
if (curChar == 101)
{
if (kind > 46)
kind = 46;
jjAddStates(34, 36);
}
break;
case 1:
if (kind > 13)
kind = 13;
break;
case 6:
if ((0x7fffffe87fffffeL & l) == 0L)
break;
if (kind > 52)
kind = 52;
jjCheckNAdd(7);
break;
case 8:
if (curChar == 92)
jjCheckNAddStates(40, 43);
break;
case 9:
if (curChar == 92)
jjCheckNAddTwoStates(9, 10);
break;
case 11:
if (curChar == 92)
jjCheckNAddTwoStates(11, 12);
break;
case 13:
if (curChar == 92)
jjAddStates(46, 47);
break;
case 16:
if (curChar == 101)
jjAddStates(44, 45);
break;
case 17:
if (curChar != 100)
break;
if (kind > 43)
kind = 43;
jjAddStates(37, 39);
break;
case 29:
if (curChar == 108)
jjstateSet[jjnewStateCnt++] = 28;
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 1:
if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 13)
kind = 13;
break;
default : break;
}
} while(i != startsAt);
}
if (kind != 0x7fffffff)
{
jjmatchedKind = kind;
jjmatchedPos = curPos;
kind = 0x7fffffff;
}
++curPos;
if ((i = jjnewStateCnt) == (startsAt = 30 - (jjnewStateCnt = startsAt)))
return curPos;
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) { return curPos; }
}
}
private final int jjStopStringLiteralDfa_3(int pos, long active0)
{
switch (pos)
{
case 0:
if ((active0 & 0x30000L) != 0L)
return 9;
if ((active0 & 0xd000L) != 0L)
return 16;
return -1;
default :
return -1;
}
}
private final int jjStartNfa_3(int pos, long active0)
{
return jjMoveNfa_3(jjStopStringLiteralDfa_3(pos, active0), pos + 1);
}
private final int jjStartNfaWithStates_3(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_3(state, pos + 1);
}
private final int jjMoveStringLiteralDfa0_3()
{
switch(curChar)
{
case 35:
jjmatchedKind = 15;
return jjMoveStringLiteralDfa1_3(0x5000L);
case 92:
jjmatchedKind = 17;
return jjMoveStringLiteralDfa1_3(0x10000L);
default :
return jjMoveNfa_3(13, 0);
}
}
private final int jjMoveStringLiteralDfa1_3(long active0)
{
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_3(0, active0);
return 1;
}
switch(curChar)
{
case 35:
if ((active0 & 0x1000L) != 0L)
return jjStopAtPos(1, 12);
break;
case 42:
if ((active0 & 0x4000L) != 0L)
return jjStartNfaWithStates_3(1, 14, 14);
break;
case 92:
if ((active0 & 0x10000L) != 0L)
return jjStartNfaWithStates_3(1, 16, 25);
break;
default :
break;
}
return jjStartNfa_3(0, active0);
}
private final int jjMoveNfa_3(int startState, int curPos)
{
int[] nextStates;
int startsAt = 0;
jjnewStateCnt = 25;
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 16:
if (curChar == 42)
jjstateSet[jjnewStateCnt++] = 14;
break;
case 13:
if ((0xffffffe7ffffffffL & l) != 0L)
{
if (kind > 18)
kind = 18;
jjCheckNAdd(7);
}
else if (curChar == 36)
{
if (kind > 10)
kind = 10;
jjCheckNAddTwoStates(22, 23);
}
else if (curChar == 35)
jjCheckNAddTwoStates(5, 16);
if ((0x100000200L & l) != 0L)
jjCheckNAddTwoStates(0, 6);
break;
case 25:
if (curChar == 36)
jjCheckNAddTwoStates(22, 23);
if (curChar == 36)
{
if (kind > 10)
kind = 10;
}
break;
case 9:
if (curChar == 36)
jjCheckNAddTwoStates(22, 23);
else if (curChar == 35)
jjstateSet[jjnewStateCnt++] = 11;
if (curChar == 36)
{
if (kind > 10)
kind = 10;
}
break;
case 0:
if ((0x100000200L & l) != 0L)
jjCheckNAddTwoStates(0, 6);
break;
case 2:
if (curChar == 32)
jjAddStates(48, 49);
break;
case 3:
if (curChar == 40 && kind > 9)
kind = 9;
break;
case 6:
if (curChar == 35)
jjCheckNAdd(5);
break;
case 7:
if ((0xffffffe7ffffffffL & l) == 0L)
break;
if (kind > 18)
kind = 18;
jjCheckNAdd(7);
break;
case 10:
if (curChar == 35)
jjstateSet[jjnewStateCnt++] = 11;
break;
case 12:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 8)
kind = 8;
jjstateSet[jjnewStateCnt++] = 12;
break;
case 14:
if (curChar == 42)
jjstateSet[jjnewStateCnt++] = 15;
break;
case 15:
if ((0xfffffff7ffffffffL & l) != 0L && kind > 13)
kind = 13;
break;
case 19:
if (curChar == 36 && kind > 10)
kind = 10;
break;
case 21:
if (curChar == 36)
jjCheckNAddTwoStates(22, 23);
break;
case 23:
if (curChar == 33 && kind > 11)
kind = 11;
break;
case 24:
if (curChar != 36)
break;
if (kind > 10)
kind = 10;
jjCheckNAddTwoStates(22, 23);
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 16:
case 5:
if (curChar == 115)
jjstateSet[jjnewStateCnt++] = 4;
break;
case 13:
if ((0xffffffffefffffffL & l) != 0L)
{
if (kind > 18)
kind = 18;
jjCheckNAdd(7);
}
else if (curChar == 92)
jjCheckNAddStates(50, 53);
if (curChar == 92)
jjAddStates(32, 33);
break;
case 25:
if (curChar == 92)
jjAddStates(32, 33);
if (curChar == 92)
jjCheckNAddTwoStates(20, 21);
if (curChar == 92)
jjCheckNAddTwoStates(18, 19);
break;
case 9:
if (curChar == 92)
jjCheckNAddTwoStates(20, 21);
if (curChar == 92)
jjCheckNAddTwoStates(18, 19);
if (curChar == 92)
jjstateSet[jjnewStateCnt++] = 8;
break;
case 1:
if (curChar == 116)
jjAddStates(48, 49);
break;
case 4:
if (curChar == 101)
jjstateSet[jjnewStateCnt++] = 1;
break;
case 7:
if ((0xffffffffefffffffL & l) == 0L)
break;
if (kind > 18)
kind = 18;
jjCheckNAdd(7);
break;
case 8:
if (curChar == 92)
jjAddStates(32, 33);
break;
case 11:
case 12:
if ((0x7fffffe87fffffeL & l) == 0L)
break;
if (kind > 8)
kind = 8;
jjCheckNAdd(12);
break;
case 15:
if (kind > 13)
kind = 13;
break;
case 17:
if (curChar == 92)
jjCheckNAddStates(50, 53);
break;
case 18:
if (curChar == 92)
jjCheckNAddTwoStates(18, 19);
break;
case 20:
if (curChar == 92)
jjCheckNAddTwoStates(20, 21);
break;
case 22:
if (curChar == 92)
jjAddStates(54, 55);
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 13:
case 7:
if (!jjCanMove_0(hiByte, i1, i2, l1, l2))
break;
if (kind > 18)
kind = 18;
jjCheckNAdd(7);
break;
case 15:
if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 13)
kind = 13;
break;
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -