in cayenne/src/main/java/org/apache/cayenne/template/parser/SQLTemplateParserTokenManager.java [912:1220]
private int jjMoveNfa_1(int startState, int curPos)
{
int startsAt = 0;
jjnewStateCnt = 43;
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 3:
if ((0x3ff000000000000L & l) != 0L)
{ jjCheckNAddStates(3, 8); }
else if (curChar == 46)
{ jjCheckNAdd(29); }
else if (curChar == 45)
{ jjAddStates(9, 10); }
if ((0x3fe000000000000L & l) != 0L)
{
if (kind > 32)
kind = 32;
{ jjCheckNAddTwoStates(22, 23); }
}
else if (curChar == 48)
{
if (kind > 32)
kind = 32;
{ jjCheckNAddStates(11, 13); }
}
break;
case 19:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 18)
kind = 18;
jjstateSet[jjnewStateCnt++] = 19;
break;
case 20:
if (curChar == 45)
{ jjAddStates(9, 10); }
break;
case 21:
if ((0x3fe000000000000L & l) == 0L)
break;
if (kind > 32)
kind = 32;
{ jjCheckNAddTwoStates(22, 23); }
break;
case 22:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 32)
kind = 32;
{ jjCheckNAddTwoStates(22, 23); }
break;
case 24:
if (curChar != 48)
break;
if (kind > 32)
kind = 32;
{ jjCheckNAddStates(11, 13); }
break;
case 25:
if ((0xff000000000000L & l) == 0L)
break;
if (kind > 32)
kind = 32;
{ jjCheckNAddTwoStates(25, 23); }
break;
case 27:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 32)
kind = 32;
{ jjCheckNAddTwoStates(27, 23); }
break;
case 28:
if (curChar == 46)
{ jjCheckNAdd(29); }
break;
case 29:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 33)
kind = 33;
{ jjCheckNAddStates(14, 16); }
break;
case 31:
if ((0x280000000000L & l) != 0L)
{ jjCheckNAdd(32); }
break;
case 32:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 33)
kind = 33;
{ jjCheckNAddTwoStates(32, 33); }
break;
case 34:
if ((0x3ff000000000000L & l) != 0L)
{ jjCheckNAddStates(3, 8); }
break;
case 35:
if ((0x3ff000000000000L & l) != 0L)
{ jjCheckNAddTwoStates(35, 36); }
break;
case 36:
if (curChar != 46)
break;
if (kind > 33)
kind = 33;
{ jjCheckNAddStates(17, 19); }
break;
case 37:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 33)
kind = 33;
{ jjCheckNAddStates(17, 19); }
break;
case 38:
if ((0x3ff000000000000L & l) != 0L)
{ jjCheckNAddTwoStates(38, 39); }
break;
case 40:
if ((0x280000000000L & l) != 0L)
{ jjCheckNAdd(41); }
break;
case 41:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 33)
kind = 33;
{ jjCheckNAddTwoStates(41, 33); }
break;
case 42:
if ((0x3ff000000000000L & l) != 0L)
{ jjCheckNAddTwoStates(42, 33); }
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
do
{
switch(jjstateSet[--i])
{
case 3:
if ((0x7fffffe87fffffeL & l) != 0L)
{
if (kind > 18)
kind = 18;
{ jjCheckNAdd(19); }
}
if (curChar == 70)
jjstateSet[jjnewStateCnt++] = 16;
else if (curChar == 102)
jjstateSet[jjnewStateCnt++] = 11;
else if (curChar == 84)
jjstateSet[jjnewStateCnt++] = 6;
else if (curChar == 116)
jjstateSet[jjnewStateCnt++] = 2;
break;
case 0:
if (curChar == 101 && kind > 10)
kind = 10;
break;
case 1:
if (curChar == 117)
jjstateSet[jjnewStateCnt++] = 0;
break;
case 2:
if (curChar == 114)
jjstateSet[jjnewStateCnt++] = 1;
break;
case 4:
if (curChar == 69 && kind > 10)
kind = 10;
break;
case 5:
if (curChar == 85)
jjstateSet[jjnewStateCnt++] = 4;
break;
case 6:
if (curChar == 82)
jjstateSet[jjnewStateCnt++] = 5;
break;
case 7:
if (curChar == 84)
jjstateSet[jjnewStateCnt++] = 6;
break;
case 8:
if (curChar == 101 && kind > 11)
kind = 11;
break;
case 9:
if (curChar == 115)
jjstateSet[jjnewStateCnt++] = 8;
break;
case 10:
if (curChar == 108)
jjstateSet[jjnewStateCnt++] = 9;
break;
case 11:
if (curChar == 97)
jjstateSet[jjnewStateCnt++] = 10;
break;
case 12:
if (curChar == 102)
jjstateSet[jjnewStateCnt++] = 11;
break;
case 13:
if (curChar == 69 && kind > 11)
kind = 11;
break;
case 14:
if (curChar == 83)
jjstateSet[jjnewStateCnt++] = 13;
break;
case 15:
if (curChar == 76)
jjstateSet[jjnewStateCnt++] = 14;
break;
case 16:
if (curChar == 65)
jjstateSet[jjnewStateCnt++] = 15;
break;
case 17:
if (curChar == 70)
jjstateSet[jjnewStateCnt++] = 16;
break;
case 18:
case 19:
if ((0x7fffffe87fffffeL & l) == 0L)
break;
if (kind > 18)
kind = 18;
{ jjCheckNAdd(19); }
break;
case 23:
if ((0x110000001100L & l) != 0L && kind > 32)
kind = 32;
break;
case 26:
if ((0x100000001000000L & l) != 0L)
{ jjCheckNAdd(27); }
break;
case 27:
if ((0x7e0000007eL & l) == 0L)
break;
if (kind > 32)
kind = 32;
{ jjCheckNAddTwoStates(27, 23); }
break;
case 30:
if ((0x2000000020L & l) != 0L)
{ jjAddStates(20, 21); }
break;
case 33:
if ((0x5400000054L & l) != 0L && kind > 33)
kind = 33;
break;
case 39:
if ((0x2000000020L & l) != 0L)
{ jjAddStates(22, 23); }
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])
{
default : break;
}
} while(i != startsAt);
}
if (kind != 0x7fffffff)
{
jjmatchedKind = kind;
jjmatchedPos = curPos;
kind = 0x7fffffff;
}
++curPos;
if ((i = jjnewStateCnt) == (startsAt = 43 - (jjnewStateCnt = startsAt)))
return curPos;
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) { return curPos; }
}
}