in src/jdk.jdi/share/classes/com/sun/tools/example/debug/expr/ExpressionParserTokenManager.java [868:1348]
private int jjMoveNfa_0(int startState, int curPos)
{
int startsAt = 0;
jjnewStateCnt = 67;
int i = 1;
jjstateSet[0] = startState;
int kind = 0x7fffffff;
for (;;)
{
if (++jjround == 0x7fffffff)
ReInitRounds();
if (curChar < 64)
{
long l = 1L << curChar;
do
{
switch(jjstateSet[--i])
{
case 49:
if (curChar == 42)
jjCheckNAddTwoStates(62, 63);
else if (curChar == 47)
jjCheckNAddStates(0, 2);
if (curChar == 42)
jjstateSet[jjnewStateCnt++] = 54;
break;
case 0:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddStates(3, 9);
else if (curChar == 47)
jjAddStates(10, 12);
else if (curChar == 36)
{
if (kind > 67)
kind = 67;
jjCheckNAdd(28);
}
else if (curChar == 34)
jjCheckNAddStates(13, 15);
else if (curChar == 39)
jjAddStates(16, 17);
else if (curChar == 46)
jjCheckNAdd(4);
if ((0x3fe000000000000L & l) != 0L)
{
if (kind > 59)
kind = 59;
jjCheckNAddTwoStates(1, 2);
}
else if (curChar == 48)
{
if (kind > 59)
kind = 59;
jjCheckNAddStates(18, 20);
}
break;
case 1:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 59)
kind = 59;
jjCheckNAddTwoStates(1, 2);
break;
case 3:
if (curChar == 46)
jjCheckNAdd(4);
break;
case 4:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 63)
kind = 63;
jjCheckNAddStates(21, 23);
break;
case 6:
if ((0x280000000000L & l) != 0L)
jjCheckNAdd(7);
break;
case 7:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 63)
kind = 63;
jjCheckNAddTwoStates(7, 8);
break;
case 9:
if (curChar == 39)
jjAddStates(16, 17);
break;
case 10:
if ((0xffffff7fffffdbffL & l) != 0L)
jjCheckNAdd(11);
break;
case 11:
if (curChar == 39 && kind > 65)
kind = 65;
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(13, 15);
break;
case 19:
if ((0xfffffffbffffdbffL & l) != 0L)
jjCheckNAddStates(13, 15);
break;
case 21:
if ((0x8400000000L & l) != 0L)
jjCheckNAddStates(13, 15);
break;
case 22:
if (curChar == 34 && kind > 66)
kind = 66;
break;
case 23:
if ((0xff000000000000L & l) != 0L)
jjCheckNAddStates(24, 27);
break;
case 24:
if ((0xff000000000000L & l) != 0L)
jjCheckNAddStates(13, 15);
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 > 67)
kind = 67;
jjCheckNAdd(28);
break;
case 28:
if ((0x3ff001000000000L & l) == 0L)
break;
if (kind > 67)
kind = 67;
jjCheckNAdd(28);
break;
case 29:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddStates(3, 9);
break;
case 30:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(30, 31);
break;
case 31:
if (curChar != 46)
break;
if (kind > 63)
kind = 63;
jjCheckNAddStates(28, 30);
break;
case 32:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 63)
kind = 63;
jjCheckNAddStates(28, 30);
break;
case 34:
if ((0x280000000000L & l) != 0L)
jjCheckNAdd(35);
break;
case 35:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 63)
kind = 63;
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 > 63)
kind = 63;
jjCheckNAddTwoStates(39, 8);
break;
case 40:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddStates(31, 33);
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 > 59)
kind = 59;
jjCheckNAddStates(18, 20);
break;
case 46:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 59)
kind = 59;
jjCheckNAddTwoStates(46, 2);
break;
case 47:
if ((0xff000000000000L & l) == 0L)
break;
if (kind > 59)
kind = 59;
jjCheckNAddTwoStates(47, 2);
break;
case 48:
if (curChar == 47)
jjAddStates(10, 12);
break;
case 50:
if ((0xffffffffffffdbffL & l) != 0L)
jjCheckNAddStates(0, 2);
break;
case 51:
if ((0x2400L & l) != 0L && kind > 6)
kind = 6;
break;
case 52:
if (curChar == 10 && kind > 6)
kind = 6;
break;
case 53:
if (curChar == 13)
jjstateSet[jjnewStateCnt++] = 52;
break;
case 54:
if (curChar == 42)
jjCheckNAddTwoStates(55, 56);
break;
case 55:
if ((0xfffffbffffffffffL & l) != 0L)
jjCheckNAddTwoStates(55, 56);
break;
case 56:
if (curChar == 42)
jjCheckNAddStates(34, 36);
break;
case 57:
if ((0xffff7bffffffffffL & l) != 0L)
jjCheckNAddTwoStates(58, 56);
break;
case 58:
if ((0xfffffbffffffffffL & l) != 0L)
jjCheckNAddTwoStates(58, 56);
break;
case 59:
if (curChar == 47 && kind > 7)
kind = 7;
break;
case 60:
if (curChar == 42)
jjstateSet[jjnewStateCnt++] = 54;
break;
case 61:
if (curChar == 42)
jjCheckNAddTwoStates(62, 63);
break;
case 62:
if ((0xfffffbffffffffffL & l) != 0L)
jjCheckNAddTwoStates(62, 63);
break;
case 63:
if (curChar == 42)
jjCheckNAddStates(37, 39);
break;
case 64:
if ((0xffff7bffffffffffL & l) != 0L)
jjCheckNAddTwoStates(65, 63);
break;
case 65:
if ((0xfffffbffffffffffL & l) != 0L)
jjCheckNAddTwoStates(65, 63);
break;
case 66:
if (curChar == 47 && kind > 8)
kind = 8;
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
do
{
switch(jjstateSet[--i])
{
case 0:
case 28:
if ((0x7fffffe87fffffeL & l) == 0L)
break;
if (kind > 67)
kind = 67;
jjCheckNAdd(28);
break;
case 2:
if ((0x100000001000L & l) != 0L && kind > 59)
kind = 59;
break;
case 5:
if ((0x2000000020L & l) != 0L)
jjAddStates(40, 41);
break;
case 8:
if ((0x5000000050L & l) != 0L && kind > 63)
kind = 63;
break;
case 10:
if ((0xffffffffefffffffL & l) != 0L)
jjCheckNAdd(11);
break;
case 12:
if (curChar == 92)
jjAddStates(42, 44);
break;
case 13:
if ((0x14404410000000L & l) != 0L)
jjCheckNAdd(11);
break;
case 19:
if ((0xffffffffefffffffL & l) != 0L)
jjCheckNAddStates(13, 15);
break;
case 20:
if (curChar == 92)
jjAddStates(45, 47);
break;
case 21:
if ((0x14404410000000L & l) != 0L)
jjCheckNAddStates(13, 15);
break;
case 33:
if ((0x2000000020L & l) != 0L)
jjAddStates(48, 49);
break;
case 37:
if ((0x2000000020L & l) != 0L)
jjAddStates(50, 51);
break;
case 41:
if ((0x2000000020L & l) != 0L)
jjAddStates(52, 53);
break;
case 45:
if ((0x100000001000000L & l) != 0L)
jjCheckNAdd(46);
break;
case 46:
if ((0x7e0000007eL & l) == 0L)
break;
if (kind > 59)
kind = 59;
jjCheckNAddTwoStates(46, 2);
break;
case 50:
jjAddStates(0, 2);
break;
case 55:
jjCheckNAddTwoStates(55, 56);
break;
case 57:
case 58:
jjCheckNAddTwoStates(58, 56);
break;
case 62:
jjCheckNAddTwoStates(62, 63);
break;
case 64:
case 65:
jjCheckNAddTwoStates(65, 63);
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);
do
{
switch(jjstateSet[--i])
{
case 0:
case 28:
if (!jjCanMove_1(hiByte, i1, i2, l1, l2))
break;
if (kind > 67)
kind = 67;
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(13, 15);
break;
case 50:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjAddStates(0, 2);
break;
case 55:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjCheckNAddTwoStates(55, 56);
break;
case 57:
case 58:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjCheckNAddTwoStates(58, 56);
break;
case 62:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjCheckNAddTwoStates(62, 63);
break;
case 64:
case 65:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjCheckNAddTwoStates(65, 63);
break;
default : break;
}
} while(i != startsAt);
}
if (kind != 0x7fffffff)
{
jjmatchedKind = kind;
jjmatchedPos = curPos;
kind = 0x7fffffff;
}
++curPos;
if ((i = jjnewStateCnt) == (startsAt = 67 - (jjnewStateCnt = startsAt)))
return curPos;
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) { return curPos; }
}
}