org.apache.beehive.controls.system.jdbc.parser.SqlGrammarTokenManager Maven / Gradle / Ivy
/* Generated By:JavaCC: Do not edit this line. SqlGrammarTokenManager.java */
package org.apache.beehive.controls.system.jdbc.parser;
import java.io.StringReader;
public class SqlGrammarTokenManager implements SqlGrammarConstants
{
public java.io.PrintStream debugStream = System.out;
public void setDebugStream(java.io.PrintStream ds) { debugStream = ds; }
private final int jjStopStringLiteralDfa_0(int pos, long active0)
{
switch (pos)
{
default :
return -1;
}
}
private final int jjStartNfa_0(int pos, long active0)
{
return jjMoveNfa_0(jjStopStringLiteralDfa_0(pos, active0), pos + 1);
}
private final int jjStopAtPos(int pos, int kind)
{
jjmatchedKind = kind;
jjmatchedPos = pos;
return pos + 1;
}
private final int jjStartNfaWithStates_0(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_0(state, pos + 1);
}
private final int jjMoveStringLiteralDfa0_0()
{
switch(curChar)
{
case 39:
return jjStopAtPos(0, 3);
case 123:
return jjStopAtPos(0, 2);
default :
return jjMoveNfa_0(0, 0);
}
}
private final void jjCheckNAdd(int state)
{
if (jjrounds[state] != jjround)
{
jjstateSet[jjnewStateCnt++] = state;
jjrounds[state] = jjround;
}
}
private final void jjAddStates(int start, int end)
{
do {
jjstateSet[jjnewStateCnt++] = jjnextStates[start];
} while (start++ != end);
}
private final void jjCheckNAddTwoStates(int state1, int state2)
{
jjCheckNAdd(state1);
jjCheckNAdd(state2);
}
private final void jjCheckNAddStates(int start, int end)
{
do {
jjCheckNAdd(jjnextStates[start]);
} while (start++ != end);
}
private final void jjCheckNAddStates(int start)
{
jjCheckNAdd(jjnextStates[start]);
jjCheckNAdd(jjnextStates[start + 1]);
}
static final long[] jjbitVec0 = {
0xfffffffffffffffeL, 0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffffffffffffffL
};
static final long[] jjbitVec2 = {
0x0L, 0x0L, 0xffffffffffffffffL, 0xffffffffffffffffL
};
private final int jjMoveNfa_0(int startState, int curPos)
{
int[] nextStates;
int startsAt = 0;
jjnewStateCnt = 1;
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 0:
if ((0xffffff7fffffffffL & l) == 0L)
break;
kind = 1;
jjstateSet[jjnewStateCnt++] = 0;
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 0:
if ((0xd7ffffffffffffffL & l) == 0L)
break;
kind = 1;
jjstateSet[jjnewStateCnt++] = 0;
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 0:
if (!jjCanMove_0(hiByte, i1, i2, l1, l2))
break;
if (kind > 1)
kind = 1;
jjstateSet[jjnewStateCnt++] = 0;
break;
default : break;
}
} while(i != startsAt);
}
if (kind != 0x7fffffff)
{
jjmatchedKind = kind;
jjmatchedPos = curPos;
kind = 0x7fffffff;
}
++curPos;
if ((i = jjnewStateCnt) == (startsAt = 1 - (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 & 0x2000000L) != 0L)
{
jjmatchedKind = 31;
return 4;
}
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 40:
return jjStopAtPos(0, 26);
case 41:
return jjStopAtPos(0, 24);
case 44:
return jjStopAtPos(0, 27);
case 73:
return jjMoveStringLiteralDfa1_3(0x2000000L);
case 105:
return jjMoveStringLiteralDfa1_3(0x2000000L);
default :
return jjMoveNfa_3(0, 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 78:
if ((active0 & 0x2000000L) != 0L)
return jjStartNfaWithStates_3(1, 25, 4);
break;
case 110:
if ((active0 & 0x2000000L) != 0L)
return jjStartNfaWithStates_3(1, 25, 4);
break;
default :
break;
}
return jjStartNfa_3(0, active0);
}
static final long[] jjbitVec3 = {
0x1ff00000fffffffeL, 0xffffffffffffc000L, 0xffffffffL, 0x600000000000000L
};
static final long[] jjbitVec4 = {
0x0L, 0x0L, 0x0L, 0xff7fffffff7fffffL
};
static final long[] jjbitVec5 = {
0x0L, 0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffffffffffffffL
};
static final long[] jjbitVec6 = {
0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffL, 0x0L
};
static final long[] jjbitVec7 = {
0xffffffffffffffffL, 0xffffffffffffffffL, 0x0L, 0x0L
};
static final long[] jjbitVec8 = {
0x3fffffffffffL, 0x0L, 0x0L, 0x0L
};
private final int jjMoveNfa_3(int startState, int curPos)
{
int[] nextStates;
int startsAt = 0;
jjnewStateCnt = 5;
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 0:
if ((0x100002600L & l) != 0L)
{
if (kind > 30)
kind = 30;
}
else if (curChar == 36)
{
if (kind > 31)
kind = 31;
jjCheckNAdd(4);
}
break;
case 2:
if ((0x100002600L & l) != 0L)
kind = 30;
break;
case 3:
if (curChar != 36)
break;
if (kind > 31)
kind = 31;
jjCheckNAdd(4);
break;
case 4:
if ((0x3ff401000000000L & l) == 0L)
break;
if (kind > 31)
kind = 31;
jjCheckNAdd(4);
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 0:
if ((0x7fffffe87fffffeL & l) != 0L)
{
if (kind > 31)
kind = 31;
jjCheckNAdd(4);
}
else if (curChar == 125)
{
if (kind > 29)
kind = 29;
}
else if (curChar == 123)
{
if (kind > 28)
kind = 28;
}
break;
case 1:
if (curChar == 125)
kind = 29;
break;
case 3:
case 4:
if ((0x7fffffe87fffffeL & l) == 0L)
break;
if (kind > 31)
kind = 31;
jjCheckNAdd(4);
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 0:
case 4:
if (!jjCanMove_1(hiByte, i1, i2, l1, l2))
break;
if (kind > 31)
kind = 31;
jjCheckNAdd(4);
break;
default : break;
}
} while(i != startsAt);
}
if (kind != 0x7fffffff)
{
jjmatchedKind = kind;
jjmatchedPos = curPos;
kind = 0x7fffffff;
}
++curPos;
if ((i = jjnewStateCnt) == (startsAt = 5 - (jjnewStateCnt = startsAt)))
return curPos;
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) { return curPos; }
}
}
private final int jjMoveStringLiteralDfa0_1()
{
return jjMoveNfa_1(14, 0);
}
private final int jjMoveNfa_1(int startState, int curPos)
{
int[] nextStates;
int startsAt = 0;
jjnewStateCnt = 14;
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 14:
if ((0xffffff7fffffdbffL & l) != 0L)
jjCheckNAddStates(0, 5);
else if (curChar == 39)
{
if (kind > 4)
kind = 4;
}
if ((0xff000000000000L & l) != 0L)
jjCheckNAddStates(6, 11);
if ((0xf000000000000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 9;
break;
case 0:
if ((0xffffff7fffffdbffL & l) != 0L)
jjCheckNAddStates(0, 5);
break;
case 2:
if ((0x3ff000000000000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 3;
break;
case 3:
if ((0x3ff000000000000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 4;
break;
case 4:
case 7:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAdd(5);
break;
case 5:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddStates(0, 5);
break;
case 8:
if ((0xf000000000000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 9;
break;
case 9:
if ((0xff000000000000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 10;
break;
case 10:
if ((0xff000000000000L & l) != 0L)
jjCheckNAddStates(0, 5);
break;
case 11:
if ((0xff000000000000L & l) != 0L)
jjCheckNAddStates(6, 11);
break;
case 12:
if (curChar == 39)
kind = 4;
break;
case 13:
if ((0xff000000000000L & l) != 0L)
jjCheckNAddStates(12, 18);
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 14:
jjCheckNAddStates(0, 5);
if ((0x100000001000000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 7;
else if ((0x20000000200000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 2;
break;
case 0:
jjCheckNAddStates(0, 5);
break;
case 1:
if ((0x20000000200000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 2;
break;
case 2:
if ((0x7e0000007eL & l) != 0L)
jjstateSet[jjnewStateCnt++] = 3;
break;
case 3:
if ((0x7e0000007eL & l) != 0L)
jjstateSet[jjnewStateCnt++] = 4;
break;
case 4:
case 7:
if ((0x7e0000007eL & l) != 0L)
jjCheckNAdd(5);
break;
case 5:
if ((0x7e0000007eL & l) != 0L)
jjCheckNAddStates(0, 5);
break;
case 6:
if ((0x100000001000000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 7;
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 14:
case 0:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjCheckNAddStates(0, 5);
break;
default : break;
}
} while(i != startsAt);
}
if (kind != 0x7fffffff)
{
jjmatchedKind = kind;
jjmatchedPos = curPos;
kind = 0x7fffffff;
}
++curPos;
if ((i = jjnewStateCnt) == (startsAt = 14 - (jjnewStateCnt = startsAt)))
return curPos;
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) { return curPos; }
}
}
private final int jjMoveStringLiteralDfa0_4()
{
return jjMoveNfa_4(0, 0);
}
private final int jjMoveNfa_4(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)
{
long l = 1L << curChar;
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 0:
case 1:
kind = 33;
jjCheckNAdd(1);
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 0:
if ((0xd7ffffffffffffffL & l) != 0L)
{
if (kind > 33)
kind = 33;
jjCheckNAdd(1);
}
else if (curChar == 123)
{
if (kind > 34)
kind = 34;
}
else if (curChar == 125)
{
if (kind > 32)
kind = 32;
}
break;
case 1:
if ((0xd7ffffffffffffffL & l) == 0L)
break;
kind = 33;
jjCheckNAdd(1);
break;
case 2:
if (curChar == 123)
kind = 34;
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 0:
case 1:
if (!jjCanMove_0(hiByte, i1, i2, l1, l2))
break;
if (kind > 33)
kind = 33;
jjCheckNAdd(1);
break;
default : break;
}
} while(i != startsAt);
}
if (kind != 0x7fffffff)
{
jjmatchedKind = kind;
jjmatchedPos = curPos;
kind = 0x7fffffff;
}
++curPos;
if ((i = jjnewStateCnt) == (startsAt = 3 - (jjnewStateCnt = startsAt)))
return curPos;
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) { return curPos; }
}
}
private final int jjStopStringLiteralDfa_2(int pos, long active0)
{
switch (pos)
{
default :
return -1;
}
}
private final int jjStartNfa_2(int pos, long active0)
{
return jjMoveNfa_2(jjStopStringLiteralDfa_2(pos, active0), pos + 1);
}
private final int jjStartNfaWithStates_2(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_2(state, pos + 1);
}
private final int jjMoveStringLiteralDfa0_2()
{
switch(curChar)
{
case 124:
return jjStopAtPos(0, 8);
case 125:
return jjStopAtPos(0, 7);
default :
return jjMoveNfa_2(4, 0);
}
}
private final int jjMoveNfa_2(int startState, int curPos)
{
int[] nextStates;
int startsAt = 0;
jjnewStateCnt = 54;
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 4:
if ((0x100002600L & l) != 0L)
{
if (kind > 20)
kind = 20;
}
else if (curChar == 36)
{
if (kind > 21)
kind = 21;
jjCheckNAdd(31);
}
else if (curChar == 63)
jjCheckNAddTwoStates(6, 7);
break;
case 1:
if ((0x100002600L & l) == 0L)
break;
if (kind > 12)
kind = 12;
jjstateSet[jjnewStateCnt++] = 1;
break;
case 5:
if (curChar == 63)
jjCheckNAddTwoStates(6, 7);
break;
case 6:
if ((0x100002600L & l) != 0L)
jjCheckNAddTwoStates(6, 7);
break;
case 7:
if (curChar != 61)
break;
kind = 13;
jjCheckNAdd(8);
break;
case 8:
if ((0x100002600L & l) == 0L)
break;
if (kind > 13)
kind = 13;
jjCheckNAdd(8);
break;
case 10:
if ((0x100002600L & l) == 0L)
break;
if (kind > 14)
kind = 14;
jjstateSet[jjnewStateCnt++] = 10;
break;
case 12:
if ((0x100002600L & l) == 0L)
break;
if (kind > 15)
kind = 15;
jjstateSet[jjnewStateCnt++] = 12;
break;
case 14:
if ((0x100002600L & l) == 0L)
break;
if (kind > 16)
kind = 16;
jjstateSet[jjnewStateCnt++] = 14;
break;
case 17:
if ((0x100002600L & l) == 0L)
break;
if (kind > 17)
kind = 17;
jjstateSet[jjnewStateCnt++] = 17;
break;
case 20:
if ((0x100002600L & l) == 0L)
break;
if (kind > 18)
kind = 18;
jjstateSet[jjnewStateCnt++] = 20;
break;
case 27:
if ((0x100002600L & l) == 0L)
break;
if (kind > 19)
kind = 19;
jjstateSet[jjnewStateCnt++] = 27;
break;
case 29:
if ((0x100002600L & l) != 0L && kind > 20)
kind = 20;
break;
case 30:
if (curChar != 36)
break;
if (kind > 21)
kind = 21;
jjCheckNAdd(31);
break;
case 31:
if ((0x3ff401000000000L & l) == 0L)
break;
if (kind > 21)
kind = 21;
jjCheckNAdd(31);
break;
case 33:
if (curChar == 58)
jjCheckNAdd(34);
break;
case 34:
if ((0x100002600L & l) == 0L)
break;
if (kind > 9)
kind = 9;
jjCheckNAdd(34);
break;
case 37:
if (curChar == 58)
jjCheckNAddTwoStates(38, 44);
break;
case 38:
if ((0x100002600L & l) != 0L)
jjCheckNAddTwoStates(38, 44);
break;
case 40:
if ((0x100002600L & l) == 0L)
break;
if (kind > 10)
kind = 10;
jjstateSet[jjnewStateCnt++] = 40;
break;
case 47:
if (curChar == 58)
jjCheckNAddTwoStates(48, 51);
break;
case 48:
if ((0x100002600L & l) != 0L)
jjCheckNAddTwoStates(48, 51);
break;
case 50:
if ((0x100002600L & l) == 0L)
break;
if (kind > 11)
kind = 11;
jjstateSet[jjnewStateCnt++] = 50;
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 4:
if ((0x7fffffe87fffffeL & l) != 0L)
{
if (kind > 21)
kind = 21;
jjCheckNAdd(31);
}
if ((0x8000000080000L & l) != 0L)
jjAddStates(19, 21);
else if ((0x800000008000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 26;
else if ((0x2000000020L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 24;
else if ((0x4000000040L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 16;
else if ((0x10000000100000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 13;
else if ((0x1000000010L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 10;
else if ((0x800000008L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 3;
if ((0x10000000100000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 12;
break;
case 0:
if ((0x100000001000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 1;
break;
case 2:
if ((0x100000001000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 0;
break;
case 3:
if ((0x200000002L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 2;
break;
case 9:
if ((0x1000000010L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 10;
break;
case 11:
if ((0x10000000100000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 12;
break;
case 13:
if ((0x8000000080000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 14;
break;
case 15:
if ((0x10000000100000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 13;
break;
case 16:
if ((0x400000004000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 17;
break;
case 18:
if ((0x4000000040L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 16;
break;
case 19:
if ((0x2000000020L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 20;
break;
case 21:
if ((0x1000000010000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 19;
break;
case 22:
if ((0x200000002L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 21;
break;
case 23:
if ((0x800000008L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 22;
break;
case 24:
if ((0x8000000080000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 23;
break;
case 25:
if ((0x2000000020L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 24;
break;
case 26:
if ((0x40000000400L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 27;
break;
case 28:
if ((0x800000008000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 26;
break;
case 30:
case 31:
if ((0x7fffffe87fffffeL & l) == 0L)
break;
if (kind > 21)
kind = 21;
jjCheckNAdd(31);
break;
case 32:
if ((0x8000000080000L & l) != 0L)
jjAddStates(19, 21);
break;
case 35:
if ((0x100000001000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 33;
break;
case 36:
if ((0x2000000020000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 35;
break;
case 39:
if ((0x10000000100000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 40;
break;
case 41:
if ((0x8000000080000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 39;
break;
case 42:
if ((0x400000004L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 41;
break;
case 43:
if ((0x20000000200000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 42;
break;
case 44:
if ((0x8000000080000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 43;
break;
case 45:
if ((0x100000001000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 37;
break;
case 46:
if ((0x2000000020000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 45;
break;
case 49:
if ((0x400000004000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 50;
break;
case 51:
if ((0x4000000040L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 49;
break;
case 52:
if ((0x100000001000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 47;
break;
case 53:
if ((0x2000000020000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 52;
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 4:
case 31:
if (!jjCanMove_1(hiByte, i1, i2, l1, l2))
break;
if (kind > 21)
kind = 21;
jjCheckNAdd(31);
break;
default : break;
}
} while(i != startsAt);
}
if (kind != 0x7fffffff)
{
jjmatchedKind = kind;
jjmatchedPos = curPos;
kind = 0x7fffffff;
}
++curPos;
if ((i = jjnewStateCnt) == (startsAt = 54 - (jjnewStateCnt = startsAt)))
return curPos;
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) { return curPos; }
}
}
private final int jjMoveStringLiteralDfa0_5()
{
return jjMoveNfa_5(0, 0);
}
private final int jjMoveNfa_5(int startState, int curPos)
{
int[] nextStates;
int startsAt = 0;
jjnewStateCnt = 19;
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 0:
if (curChar == 39)
jjCheckNAddStates(22, 27);
else if (curChar == 36)
{
if (kind > 35)
kind = 35;
jjCheckNAdd(1);
}
break;
case 1:
if ((0x3ff401000000000L & l) == 0L)
break;
if (kind > 35)
kind = 35;
jjCheckNAdd(1);
break;
case 3:
if (curChar == 39)
jjCheckNAddStates(22, 27);
break;
case 4:
if ((0xffffff7fffffdbffL & l) != 0L)
jjCheckNAddStates(22, 27);
break;
case 6:
if ((0x3ff000000000000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 7;
break;
case 7:
if ((0x3ff000000000000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 8;
break;
case 8:
case 11:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAdd(9);
break;
case 9:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddStates(22, 27);
break;
case 12:
if ((0xf000000000000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 13;
break;
case 13:
if ((0xff000000000000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 14;
break;
case 14:
if ((0xff000000000000L & l) != 0L)
jjCheckNAddStates(22, 27);
break;
case 15:
if ((0xff000000000000L & l) != 0L)
jjCheckNAddStates(28, 33);
break;
case 16:
if (curChar == 39 && kind > 37)
kind = 37;
break;
case 17:
if ((0xff000000000000L & l) != 0L)
jjCheckNAddStates(34, 40);
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 0:
if ((0x7fffffe87fffffeL & l) != 0L)
{
if (kind > 35)
kind = 35;
jjCheckNAdd(1);
}
else if (curChar == 125)
{
if (kind > 38)
kind = 38;
}
else if (curChar == 124)
{
if (kind > 36)
kind = 36;
}
break;
case 1:
if ((0x7fffffe87fffffeL & l) == 0L)
break;
if (kind > 35)
kind = 35;
jjCheckNAdd(1);
break;
case 2:
if (curChar == 124 && kind > 36)
kind = 36;
break;
case 4:
jjCheckNAddStates(22, 27);
break;
case 5:
if ((0x20000000200000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 6;
break;
case 6:
if ((0x7e0000007eL & l) != 0L)
jjstateSet[jjnewStateCnt++] = 7;
break;
case 7:
if ((0x7e0000007eL & l) != 0L)
jjstateSet[jjnewStateCnt++] = 8;
break;
case 8:
case 11:
if ((0x7e0000007eL & l) != 0L)
jjCheckNAdd(9);
break;
case 9:
if ((0x7e0000007eL & l) != 0L)
jjCheckNAddStates(22, 27);
break;
case 10:
if ((0x100000001000000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 11;
break;
case 18:
if (curChar == 125 && kind > 38)
kind = 38;
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 0:
case 1:
if (!jjCanMove_1(hiByte, i1, i2, l1, l2))
break;
if (kind > 35)
kind = 35;
jjCheckNAdd(1);
break;
case 4:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjAddStates(22, 27);
break;
default : break;
}
} while(i != startsAt);
}
if (kind != 0x7fffffff)
{
jjmatchedKind = kind;
jjmatchedPos = curPos;
kind = 0x7fffffff;
}
++curPos;
if ((i = jjnewStateCnt) == (startsAt = 19 - (jjnewStateCnt = startsAt)))
return curPos;
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) { return curPos; }
}
}
static final int[] jjnextStates = {
0, 1, 6, 8, 11, 12, 0, 1, 6, 8, 12, 13, 0, 1, 6, 8,
11, 12, 13, 36, 46, 53, 4, 5, 10, 12, 15, 16, 4, 5, 10, 12,
16, 17, 4, 5, 10, 12, 15, 16, 17,
};
private static final boolean jjCanMove_0(int hiByte, int i1, int i2, long l1, long l2)
{
switch(hiByte)
{
case 0:
return ((jjbitVec2[i2] & l2) != 0L);
default :
if ((jjbitVec0[i1] & l1) != 0L)
return true;
return false;
}
}
private static final boolean jjCanMove_1(int hiByte, int i1, int i2, long l1, long l2)
{
switch(hiByte)
{
case 0:
return ((jjbitVec4[i2] & l2) != 0L);
case 48:
return ((jjbitVec5[i2] & l2) != 0L);
case 49:
return ((jjbitVec6[i2] & l2) != 0L);
case 51:
return ((jjbitVec7[i2] & l2) != 0L);
case 61:
return ((jjbitVec8[i2] & l2) != 0L);
default :
if ((jjbitVec3[i1] & l1) != 0L)
return true;
return false;
}
}
public static final String[] jjstrLiteralImages = {
"", null, "\173", "\47", null, null, null, "\175", "\174", null, null, null,
null, null, null, null, null, null, null, null, null, null, null, null, "\51", null,
"\50", "\54", null, null, null, null, null, null, null, null, null, null, null, };
public static final String[] lexStateNames = {
"DEFAULT",
"IN_LITERAL",
"IN_EXPRESSION",
"IN_SQLFN",
"IN_JDBC",
"IN_PARAM",
};
public static final int[] jjnewLexState = {
-1, -1, 2, 1, 0, -1, -1, -1, -1, -1, -1, 3, 4, 4, 4, 4, 4, 4, 4, 4, -1, -1, -1, -1, 2,
-1, -1, -1, -1, -1, -1, -1, -1, -1, 5, -1, -1, -1, -1,
};
protected SimpleCharStream input_stream;
private final int[] jjrounds = new int[54];
private final int[] jjstateSet = new int[108];
StringBuffer image;
int jjimageLen;
int lengthOfMatch;
protected char curChar;
public SqlGrammarTokenManager(SimpleCharStream stream)
{
if (SimpleCharStream.staticFlag)
throw new Error("ERROR: Cannot use a static CharStream class with a non-static lexical analyzer.");
input_stream = stream;
}
public SqlGrammarTokenManager(SimpleCharStream stream, int lexState)
{
this(stream);
SwitchTo(lexState);
}
public void ReInit(SimpleCharStream stream)
{
jjmatchedPos = jjnewStateCnt = 0;
curLexState = defaultLexState;
input_stream = stream;
ReInitRounds();
}
private final void ReInitRounds()
{
int i;
jjround = 0x80000001;
for (i = 54; i-- > 0;)
jjrounds[i] = 0x80000000;
}
public void ReInit(SimpleCharStream stream, int lexState)
{
ReInit(stream);
SwitchTo(lexState);
}
public void SwitchTo(int lexState)
{
if (lexState >= 6 || lexState < 0)
throw new TokenMgrError("Error: Ignoring invalid lexical state : " + lexState + ". State unchanged.", TokenMgrError.INVALID_LEXICAL_STATE);
else
curLexState = lexState;
}
protected Token jjFillToken()
{
Token t = Token.newToken(jjmatchedKind);
t.kind = jjmatchedKind;
String im = jjstrLiteralImages[jjmatchedKind];
t.image = (im == null) ? input_stream.GetImage() : im;
t.beginLine = input_stream.getBeginLine();
t.beginColumn = input_stream.getBeginColumn();
t.endLine = input_stream.getEndLine();
t.endColumn = input_stream.getEndColumn();
return t;
}
int curLexState = 0;
int defaultLexState = 0;
int jjnewStateCnt;
int jjround;
int jjmatchedPos;
int jjmatchedKind;
public Token getNextToken()
{
int kind;
Token specialToken = null;
Token matchedToken;
int curPos = 0;
EOFLoop :
for (;;)
{
try
{
curChar = input_stream.BeginToken();
}
catch(java.io.IOException e)
{
jjmatchedKind = 0;
matchedToken = jjFillToken();
return matchedToken;
}
image = null;
jjimageLen = 0;
switch(curLexState)
{
case 0:
jjmatchedKind = 0x7fffffff;
jjmatchedPos = 0;
curPos = jjMoveStringLiteralDfa0_0();
break;
case 1:
jjmatchedKind = 0x7fffffff;
jjmatchedPos = 0;
curPos = jjMoveStringLiteralDfa0_1();
break;
case 2:
jjmatchedKind = 0x7fffffff;
jjmatchedPos = 0;
curPos = jjMoveStringLiteralDfa0_2();
break;
case 3:
jjmatchedKind = 0x7fffffff;
jjmatchedPos = 0;
curPos = jjMoveStringLiteralDfa0_3();
break;
case 4:
jjmatchedKind = 0x7fffffff;
jjmatchedPos = 0;
curPos = jjMoveStringLiteralDfa0_4();
break;
case 5:
jjmatchedKind = 0x7fffffff;
jjmatchedPos = 0;
curPos = jjMoveStringLiteralDfa0_5();
break;
}
if (jjmatchedKind != 0x7fffffff)
{
if (jjmatchedPos + 1 < curPos)
input_stream.backup(curPos - jjmatchedPos - 1);
matchedToken = jjFillToken();
TokenLexicalActions(matchedToken);
if (jjnewLexState[jjmatchedKind] != -1)
curLexState = jjnewLexState[jjmatchedKind];
return matchedToken;
}
int error_line = input_stream.getEndLine();
int error_column = input_stream.getEndColumn();
String error_after = null;
boolean EOFSeen = false;
try { input_stream.readChar(); input_stream.backup(1); }
catch (java.io.IOException e1) {
EOFSeen = true;
error_after = curPos <= 1 ? "" : input_stream.GetImage();
if (curChar == '\n' || curChar == '\r') {
error_line++;
error_column = 0;
}
else
error_column++;
}
if (!EOFSeen) {
input_stream.backup(1);
error_after = curPos <= 1 ? "" : input_stream.GetImage();
}
throw new TokenMgrError(EOFSeen, curLexState, error_line, error_column, error_after, curChar, TokenMgrError.LEXICAL_ERROR);
}
}
void TokenLexicalActions(Token matchedToken)
{
switch(jjmatchedKind)
{
case 7 :
if (image == null)
image = new StringBuffer(jjstrLiteralImages[7]);
else
image.append(jjstrLiteralImages[7]);
SwitchTo(DEFAULT);
break;
case 32 :
if (image == null)
image = new StringBuffer(new String(input_stream.GetSuffix(jjimageLen + (lengthOfMatch = jjmatchedPos + 1))));
else
image.append(new String(input_stream.GetSuffix(jjimageLen + (lengthOfMatch = jjmatchedPos + 1))));
SwitchTo(DEFAULT);
break;
case 38 :
if (image == null)
image = new StringBuffer(new String(input_stream.GetSuffix(jjimageLen + (lengthOfMatch = jjmatchedPos + 1))));
else
image.append(new String(input_stream.GetSuffix(jjimageLen + (lengthOfMatch = jjmatchedPos + 1))));
SwitchTo(IN_JDBC);
break;
default :
break;
}
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy