liquibase.util.grammar.SimpleSqlGrammarTokenManager Maven / Gradle / Ivy
/* Generated By:JavaCC: Do not edit this line. SimpleSqlGrammarTokenManager.java */
package liquibase.util.grammar;
/** Token Manager. */
public class SimpleSqlGrammarTokenManager implements SimpleSqlGrammarConstants
{
/** Debug output. */
public java.io.PrintStream debugStream = System.out;
/** Set debug output. */
public void setDebugStream(java.io.PrintStream ds) { debugStream = ds; }
private int jjMoveStringLiteralDfa0_0()
{
return jjMoveNfa_0(3, 0);
}
static final long[] jjbitVec0 = {
0xfffffffffffffffeL, 0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffffffffffffffL
};
static final long[] jjbitVec2 = {
0x0L, 0x0L, 0xffffffffffffffffL, 0xffffffffffffffffL
};
static final long[] jjbitVec3 = {
0x0L, 0x0L, 0x0L, 0x1040001090400010L
};
private int jjMoveNfa_0(int startState, int curPos)
{
int startsAt = 0;
jjnewStateCnt = 71;
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 ((0xfc00fffe00000000L & l) != 0L)
{
if (kind > 15)
kind = 15;
}
else if ((0x3ff000000000000L & l) != 0L)
{
if (kind > 5)
kind = 5;
jjCheckNAddStates(0, 6);
}
else if ((0x100002600L & l) != 0L)
{
if (kind > 1)
kind = 1;
jjCheckNAdd(0);
}
if (curChar == 34)
jjCheckNAddStates(7, 9);
else if (curChar == 36)
{
if (kind > 8)
kind = 8;
jjCheckNAddStates(10, 15);
}
else if (curChar == 39)
jjCheckNAddTwoStates(17, 18);
else if (curChar == 46)
jjCheckNAdd(12);
else if (curChar == 47)
jjstateSet[jjnewStateCnt++] = 4;
else if (curChar == 45)
jjstateSet[jjnewStateCnt++] = 1;
break;
case 0:
if ((0x100002600L & l) == 0L)
break;
if (kind > 1)
kind = 1;
jjCheckNAdd(0);
break;
case 1:
if (curChar != 45)
break;
if (kind > 2)
kind = 2;
jjCheckNAdd(2);
break;
case 2:
if ((0xffffffffffffdbffL & l) == 0L)
break;
if (kind > 2)
kind = 2;
jjCheckNAdd(2);
break;
case 4:
if (curChar == 42)
jjCheckNAddTwoStates(5, 6);
break;
case 5:
if ((0xfffffbffffffffffL & l) != 0L)
jjCheckNAddTwoStates(5, 6);
break;
case 6:
if (curChar == 42)
jjCheckNAddStates(16, 18);
break;
case 7:
if ((0xffff7bffffffffffL & l) != 0L)
jjCheckNAddTwoStates(8, 6);
break;
case 8:
if ((0xfffffbffffffffffL & l) != 0L)
jjCheckNAddTwoStates(8, 6);
break;
case 9:
if (curChar == 47 && kind > 3)
kind = 3;
break;
case 10:
if (curChar == 47)
jjstateSet[jjnewStateCnt++] = 4;
break;
case 11:
if (curChar == 46)
jjCheckNAdd(12);
break;
case 12:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 4)
kind = 4;
jjCheckNAddTwoStates(12, 13);
break;
case 14:
if ((0x280000000000L & l) != 0L)
jjCheckNAdd(15);
break;
case 15:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 4)
kind = 4;
jjCheckNAdd(15);
break;
case 16:
if (curChar == 39)
jjCheckNAddTwoStates(17, 18);
break;
case 17:
if ((0xffffff7fffffffffL & l) != 0L)
jjCheckNAddTwoStates(17, 18);
break;
case 18:
if (curChar != 39)
break;
if (kind > 11)
kind = 11;
jjstateSet[jjnewStateCnt++] = 19;
break;
case 19:
if (curChar == 39)
jjCheckNAddTwoStates(20, 18);
break;
case 20:
if ((0xffffff7fffffffffL & l) != 0L)
jjCheckNAddTwoStates(20, 18);
break;
case 21:
if ((0xfc00fffe00000000L & l) != 0L && kind > 15)
kind = 15;
break;
case 22:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 5)
kind = 5;
jjCheckNAddStates(0, 6);
break;
case 23:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(23, 11);
break;
case 24:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(24, 25);
break;
case 25:
if (curChar != 46)
break;
if (kind > 4)
kind = 4;
jjstateSet[jjnewStateCnt++] = 26;
break;
case 27:
if ((0x280000000000L & l) != 0L)
jjCheckNAdd(28);
break;
case 28:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 4)
kind = 4;
jjCheckNAdd(28);
break;
case 29:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(29, 30);
break;
case 31:
if ((0x280000000000L & l) != 0L)
jjCheckNAdd(32);
break;
case 32:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 4)
kind = 4;
jjCheckNAdd(32);
break;
case 33:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 5)
kind = 5;
jjCheckNAdd(33);
break;
case 34:
if (curChar != 36)
break;
if (kind > 8)
kind = 8;
jjCheckNAddStates(10, 15);
break;
case 35:
if (curChar == 36)
jjCheckNAddStates(19, 22);
break;
case 36:
if ((0x3ff001800000000L & l) != 0L)
jjCheckNAddStates(23, 25);
break;
case 37:
if ((0x100002400L & l) != 0L)
jjCheckNAddTwoStates(37, 38);
break;
case 38:
if (curChar == 46)
jjCheckNAddStates(26, 29);
break;
case 39:
if (curChar != 36)
break;
if (kind > 7)
kind = 7;
jjCheckNAddStates(30, 33);
break;
case 40:
if ((0x3ff001800000000L & l) == 0L)
break;
if (kind > 7)
kind = 7;
jjCheckNAddStates(34, 36);
break;
case 42:
if ((0xfc00ffffffffffffL & l) != 0L)
jjCheckNAddTwoStates(43, 44);
break;
case 43:
if ((0xffffffffffffdbffL & l) != 0L)
jjCheckNAddTwoStates(43, 44);
break;
case 46:
if ((0xffffffffffffdbffL & l) != 0L)
jjAddStates(37, 38);
break;
case 48:
if (curChar == 34)
jjCheckNAdd(49);
break;
case 49:
if ((0xfffffffbffffdbffL & l) != 0L)
jjCheckNAddTwoStates(49, 50);
break;
case 50:
if (curChar != 34)
break;
if (kind > 7)
kind = 7;
jjCheckNAddTwoStates(37, 38);
break;
case 51:
if (curChar != 36)
break;
if (kind > 8)
kind = 8;
jjCheckNAddTwoStates(51, 52);
break;
case 52:
if ((0x3ff001800000000L & l) == 0L)
break;
if (kind > 8)
kind = 8;
jjCheckNAdd(52);
break;
case 54:
if ((0xfc00ffffffffffffL & l) != 0L)
jjCheckNAddTwoStates(55, 56);
break;
case 55:
if ((0xffffffffffffdbffL & l) != 0L)
jjCheckNAddTwoStates(55, 56);
break;
case 57:
if ((0xfc00ffffffffffffL & l) != 0L)
jjCheckNAddTwoStates(58, 59);
break;
case 58:
if ((0xffffffffffffdbffL & l) != 0L)
jjCheckNAddTwoStates(58, 59);
break;
case 61:
if ((0xffffffffffffdbffL & l) != 0L)
jjAddStates(39, 40);
break;
case 63:
if ((0xffffffffffffdbffL & l) != 0L)
jjAddStates(41, 42);
break;
case 65:
if (curChar == 34)
jjCheckNAddStates(7, 9);
break;
case 66:
if ((0xfffffffbffffdbffL & l) != 0L)
jjCheckNAddTwoStates(66, 67);
break;
case 67:
if (curChar == 34)
jjCheckNAddTwoStates(37, 38);
break;
case 68:
if ((0xfffffffbffffdbffL & l) != 0L)
jjCheckNAddTwoStates(68, 69);
break;
case 69:
if (curChar == 34 && kind > 12)
kind = 12;
break;
case 70:
if (curChar == 34 && kind > 13)
kind = 13;
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 > 8)
kind = 8;
jjCheckNAddStates(10, 15);
}
else if (curChar == 96)
jjCheckNAddTwoStates(61, 63);
else if (curChar == 91)
jjAddStates(43, 44);
if ((0x78000001f8000001L & l) != 0L)
{
if (kind > 15)
kind = 15;
}
break;
case 2:
if (kind > 2)
kind = 2;
jjstateSet[jjnewStateCnt++] = 2;
break;
case 5:
jjCheckNAddTwoStates(5, 6);
break;
case 7:
case 8:
jjCheckNAddTwoStates(8, 6);
break;
case 13:
if ((0x2000000020L & l) != 0L)
jjAddStates(45, 46);
break;
case 17:
jjCheckNAddTwoStates(17, 18);
break;
case 20:
jjCheckNAddTwoStates(20, 18);
break;
case 21:
if ((0x78000001f8000001L & l) != 0L && kind > 15)
kind = 15;
break;
case 26:
if ((0x2000000020L & l) != 0L)
jjAddStates(47, 48);
break;
case 30:
if ((0x2000000020L & l) != 0L)
jjAddStates(49, 50);
break;
case 34:
if ((0x7fffffe87fffffeL & l) == 0L)
break;
if (kind > 8)
kind = 8;
jjCheckNAddStates(10, 15);
break;
case 35:
if ((0x7fffffe87fffffeL & l) != 0L)
jjCheckNAddStates(19, 22);
break;
case 36:
if ((0x7fffffe87ffffffL & l) != 0L)
jjCheckNAddStates(23, 25);
break;
case 39:
if ((0x7fffffe87fffffeL & l) == 0L)
break;
if (kind > 7)
kind = 7;
jjCheckNAddStates(30, 33);
break;
case 40:
if ((0x7fffffe87ffffffL & l) == 0L)
break;
if (kind > 7)
kind = 7;
jjCheckNAddStates(34, 36);
break;
case 41:
if (curChar == 91)
jjstateSet[jjnewStateCnt++] = 42;
break;
case 42:
case 43:
if ((0xffffffffdfffffffL & l) != 0L)
jjCheckNAddTwoStates(43, 44);
break;
case 44:
if (curChar != 93)
break;
if (kind > 7)
kind = 7;
jjCheckNAddTwoStates(37, 38);
break;
case 45:
if (curChar == 96)
jjCheckNAdd(46);
break;
case 46:
if ((0xfffffffeffffffffL & l) != 0L)
jjCheckNAddTwoStates(46, 47);
break;
case 47:
if (curChar != 96)
break;
if (kind > 7)
kind = 7;
jjCheckNAddTwoStates(37, 38);
break;
case 49:
jjAddStates(51, 52);
break;
case 51:
if ((0x7fffffe87fffffeL & l) == 0L)
break;
if (kind > 8)
kind = 8;
jjCheckNAddTwoStates(51, 52);
break;
case 52:
if ((0x7fffffe87ffffffL & l) == 0L)
break;
if (kind > 8)
kind = 8;
jjCheckNAdd(52);
break;
case 53:
if (curChar == 91)
jjAddStates(43, 44);
break;
case 54:
case 55:
if ((0xffffffffdfffffffL & l) != 0L)
jjCheckNAddTwoStates(55, 56);
break;
case 56:
if (curChar == 93)
jjCheckNAddTwoStates(37, 38);
break;
case 57:
case 58:
if ((0xffffffffdfffffffL & l) != 0L)
jjCheckNAddTwoStates(58, 59);
break;
case 59:
if (curChar == 93 && kind > 12)
kind = 12;
break;
case 60:
if (curChar == 96)
jjCheckNAddTwoStates(61, 63);
break;
case 61:
if ((0xfffffffeffffffffL & l) != 0L)
jjCheckNAddTwoStates(61, 62);
break;
case 62:
if (curChar == 96)
jjCheckNAddTwoStates(37, 38);
break;
case 63:
if ((0xfffffffeffffffffL & l) != 0L)
jjCheckNAddTwoStates(63, 64);
break;
case 64:
if (curChar == 96 && kind > 12)
kind = 12;
break;
case 66:
jjAddStates(53, 54);
break;
case 68:
jjAddStates(55, 56);
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);
do
{
switch(jjstateSet[--i])
{
case 3:
if (!jjCanMove_1(hiByte, i1, i2, l1, l2))
break;
if (kind > 8)
kind = 8;
jjCheckNAddStates(10, 15);
break;
case 2:
if (!jjCanMove_0(hiByte, i1, i2, l1, l2))
break;
if (kind > 2)
kind = 2;
jjstateSet[jjnewStateCnt++] = 2;
break;
case 5:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjCheckNAddTwoStates(5, 6);
break;
case 7:
case 8:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjCheckNAddTwoStates(8, 6);
break;
case 17:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjCheckNAddTwoStates(17, 18);
break;
case 20:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjCheckNAddTwoStates(20, 18);
break;
case 35:
if (jjCanMove_1(hiByte, i1, i2, l1, l2))
jjCheckNAddStates(19, 22);
break;
case 36:
if (jjCanMove_1(hiByte, i1, i2, l1, l2))
jjCheckNAddStates(23, 25);
break;
case 39:
if (!jjCanMove_1(hiByte, i1, i2, l1, l2))
break;
if (kind > 7)
kind = 7;
jjCheckNAddStates(30, 33);
break;
case 40:
if (!jjCanMove_1(hiByte, i1, i2, l1, l2))
break;
if (kind > 7)
kind = 7;
jjCheckNAddStates(34, 36);
break;
case 42:
case 43:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjCheckNAddTwoStates(43, 44);
break;
case 46:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjAddStates(37, 38);
break;
case 49:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjAddStates(51, 52);
break;
case 51:
if (!jjCanMove_1(hiByte, i1, i2, l1, l2))
break;
if (kind > 8)
kind = 8;
jjCheckNAddTwoStates(51, 52);
break;
case 52:
if (!jjCanMove_1(hiByte, i1, i2, l1, l2))
break;
if (kind > 8)
kind = 8;
jjCheckNAdd(52);
break;
case 54:
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, 59);
break;
case 61:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjAddStates(39, 40);
break;
case 63:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjAddStates(41, 42);
break;
case 66:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjAddStates(53, 54);
break;
case 68:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjAddStates(55, 56);
break;
default : break;
}
} while(i != startsAt);
}
if (kind != 0x7fffffff)
{
jjmatchedKind = kind;
jjmatchedPos = curPos;
kind = 0x7fffffff;
}
++curPos;
if ((i = jjnewStateCnt) == (startsAt = 71 - (jjnewStateCnt = startsAt)))
return curPos;
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) { return curPos; }
}
}
static final int[] jjnextStates = {
23, 11, 24, 25, 29, 30, 33, 66, 68, 70, 35, 36, 37, 38, 51, 52,
6, 7, 9, 35, 36, 37, 38, 36, 37, 38, 39, 41, 45, 48, 37, 38,
39, 40, 37, 38, 40, 46, 47, 61, 62, 63, 64, 54, 57, 14, 15, 27,
28, 31, 32, 49, 50, 66, 67, 68, 69,
};
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 ((jjbitVec3[i2] & l2) != 0L);
default :
return false;
}
}
/** Token literal values. */
public static final String[] jjstrLiteralImages = {
"", null, null, null, null, null, null, null, null, null, null, null, null,
null, null, null, };
/** Lexer state names. */
public static final String[] lexStateNames = {
"DEFAULT",
};
protected SimpleCharStream input_stream;
private final int[] jjrounds = new int[71];
private final int[] jjstateSet = new int[142];
protected char curChar;
/** Constructor. */
public SimpleSqlGrammarTokenManager(SimpleCharStream stream){
if (SimpleCharStream.staticFlag)
throw new Error("ERROR: Cannot use a static CharStream class with a non-static lexical analyzer.");
input_stream = stream;
}
/** Constructor. */
public SimpleSqlGrammarTokenManager(SimpleCharStream stream, int lexState){
this(stream);
SwitchTo(lexState);
}
/** Reinitialise parser. */
public void ReInit(SimpleCharStream stream)
{
jjmatchedPos = jjnewStateCnt = 0;
curLexState = defaultLexState;
input_stream = stream;
ReInitRounds();
}
private void ReInitRounds()
{
int i;
jjround = 0x80000001;
for (i = 71; i-- > 0;)
jjrounds[i] = 0x80000000;
}
/** Reinitialise parser. */
public void ReInit(SimpleCharStream stream, int lexState)
{
ReInit(stream);
SwitchTo(lexState);
}
/** Switch to specified lex state. */
public void SwitchTo(int lexState)
{
if (lexState >= 1 || lexState < 0)
throw new TokenMgrError("Error: Ignoring invalid lexical state : " + lexState + ". State unchanged.", TokenMgrError.INVALID_LEXICAL_STATE);
else
curLexState = lexState;
}
protected Token jjFillToken()
{
final Token t;
final String curTokenImage;
final int beginLine;
final int endLine;
final int beginColumn;
final int endColumn;
String im = jjstrLiteralImages[jjmatchedKind];
curTokenImage = (im == null) ? input_stream.GetImage() : im;
beginLine = input_stream.getBeginLine();
beginColumn = input_stream.getBeginColumn();
endLine = input_stream.getEndLine();
endColumn = input_stream.getEndColumn();
t = Token.newToken(jjmatchedKind, curTokenImage);
t.beginLine = beginLine;
t.endLine = endLine;
t.beginColumn = beginColumn;
t.endColumn = endColumn;
return t;
}
int curLexState = 0;
int defaultLexState = 0;
int jjnewStateCnt;
int jjround;
int jjmatchedPos;
int jjmatchedKind;
/** Get the next Token. */
public Token getNextToken()
{
Token matchedToken;
int curPos = 0;
EOFLoop :
for (;;)
{
try
{
curChar = input_stream.BeginToken();
}
catch(java.io.IOException e)
{
jjmatchedKind = 0;
matchedToken = jjFillToken();
return matchedToken;
}
jjmatchedKind = 0x7fffffff;
jjmatchedPos = 0;
curPos = jjMoveStringLiteralDfa0_0();
if (jjmatchedKind != 0x7fffffff)
{
if (jjmatchedPos + 1 < curPos)
input_stream.backup(curPos - jjmatchedPos - 1);
matchedToken = jjFillToken();
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);
}
}
private void jjCheckNAdd(int state)
{
if (jjrounds[state] != jjround)
{
jjstateSet[jjnewStateCnt++] = state;
jjrounds[state] = jjround;
}
}
private void jjAddStates(int start, int end)
{
do {
jjstateSet[jjnewStateCnt++] = jjnextStates[start];
} while (start++ != end);
}
private void jjCheckNAddTwoStates(int state1, int state2)
{
jjCheckNAdd(state1);
jjCheckNAdd(state2);
}
private void jjCheckNAddStates(int start, int end)
{
do {
jjCheckNAdd(jjnextStates[start]);
} while (start++ != end);
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy