Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $
You can buy this project and download/modify it how often you want.
com.rbmhtechnology.vind.parser.queryparser.QueryParserTokenManager Maven / Gradle / Ivy
/* QueryParserTokenManager.java */
/* Generated by: ParserGeneratorCC: Do not edit this line. QueryParserTokenManager.java */
package com.rbmhtechnology.vind.parser.queryparser;
import org.apache.commons.lang3.StringUtils;
import java.util.ArrayList;
/** Token Manager. */
@SuppressWarnings ("unused")
public class QueryParserTokenManager implements QueryParserConstants {
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 int jjStopAtPos(int pos, int kind)
{
jjmatchedKind = kind;
jjmatchedPos = pos;
return pos + 1;
}
private int jjMoveStringLiteralDfa0_0(){
switch(curChar)
{
case '"':
return jjStartNfaWithStates_0(0, 16, 21);
case '\'':
return jjStopAtPos(0, 17);
case '(':
return jjStopAtPos(0, 7);
case ')':
return jjStopAtPos(0, 8);
case '*':
return jjStopAtPos(0, 19);
case '+':
return jjStartNfaWithStates_0(0, 5, 13);
case '-':
return jjStartNfaWithStates_0(0, 6, 19);
case '[':
return jjStopAtPos(0, 9);
case ']':
return jjStopAtPos(0, 10);
case '{':
return jjStopAtPos(0, 11);
case '}':
return jjStopAtPos(0, 12);
default :
return jjMoveNfa_0(0, 0);
}
}
private 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);
}
static final long[] jjbitVec0 = {
0x0L, 0x0L, 0xffffffffffffffffL, 0xffffffffffffffffL
};
static final long[] jjbitVec1 = {
0xfffffffffffffffeL, 0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffffffffffffffL
};
private int jjMoveNfa_0(int startState, int curPos)
{
int startsAt = 0;
jjnewStateCnt = 38;
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 19:
if ((0x3ff600000000000L & l) != 0x0L)
{ jjCheckNAddTwoStates(18, 19); }
else if (curChar == 58)
{
if (kind > 15)
kind = 15;
}
if ((0x3ff200000000000L & l) != 0x0L)
{
if (kind > 21)
kind = 21;
{ jjCheckNAdd(25); }
}
if ((0x3ff000000000000L & l) != 0x0L)
{
if (kind > 14)
kind = 14;
{ jjCheckNAddStates(0, 2); }
}
break;
case 0:
if ((0x3ff600000000000L & l) != 0x0L)
{ jjCheckNAddTwoStates(18, 19); }
else if ((0x100002600L & l) != 0x0L)
{
if (kind > 1)
kind = 1;
}
else if (curChar == 34)
{ jjCheckNAdd(21); }
else if (curChar == 33)
{
if (kind > 4)
kind = 4;
}
else if (curChar == 38)
{
if (kind > 2)
kind = 2;
}
if ((0x3ff200000000000L & l) != 0x0L)
{
if (kind > 21)
kind = 21;
{ jjCheckNAdd(25); }
}
if ((0x3ff000000000000L & l) != 0x0L)
{
if (kind > 14)
kind = 14;
{ jjCheckNAddStates(3, 6); }
}
else if ((0x280000000000L & l) != 0x0L)
{ jjCheckNAdd(13); }
break;
case 4:
if (curChar == 38 && kind > 2)
kind = 2;
break;
case 11:
if (curChar == 33 && kind > 4)
kind = 4;
break;
case 12:
if ((0x280000000000L & l) != 0x0L)
{ jjCheckNAdd(13); }
break;
case 13:
if ((0x3ff000000000000L & l) == 0x0L)
break;
if (kind > 14)
kind = 14;
{ jjCheckNAddStates(0, 2); }
break;
case 14:
if (curChar != 46)
break;
if (kind > 14)
kind = 14;
{ jjCheckNAddTwoStates(15, 16); }
break;
case 15:
if ((0x3ff000000000000L & l) == 0x0L)
break;
if (kind > 14)
kind = 14;
{ jjCheckNAddTwoStates(15, 16); }
break;
case 17:
if ((0x3ff000000000000L & l) == 0x0L)
break;
if (kind > 14)
kind = 14;
jjstateSet[jjnewStateCnt++] = 17;
break;
case 18:
if ((0x3ff600000000000L & l) != 0x0L)
{ jjCheckNAddTwoStates(18, 19); }
break;
case 20:
if (curChar == 34)
{ jjCheckNAdd(21); }
break;
case 21:
if ((0xfffffffbffffffffL & l) != 0x0L)
{ jjCheckNAddTwoStates(21, 22); }
break;
case 22:
if (curChar == 34 && kind > 18)
kind = 18;
break;
case 25:
if ((0x3ff200000000000L & l) == 0x0L)
break;
if (kind > 21)
kind = 21;
{ jjCheckNAdd(25); }
break;
case 26:
if ((0x3ff000000000000L & l) == 0x0L)
break;
if (kind > 14)
kind = 14;
{ jjCheckNAddStates(3, 6); }
break;
case 27:
if ((0x3ff000000000000L & l) != 0x0L)
{ jjCheckNAddTwoStates(28, 30); }
break;
case 28:
if ((0x3ff000000000000L & l) != 0x0L)
jjstateSet[jjnewStateCnt++] = 29;
break;
case 29:
if ((0x3ff000000000000L & l) != 0x0L)
{ jjCheckNAdd(30); }
break;
case 30:
if ((0xe00000000000L & l) != 0x0L)
jjstateSet[jjnewStateCnt++] = 31;
break;
case 31:
if ((0x3ff000000000000L & l) != 0x0L)
jjstateSet[jjnewStateCnt++] = 32;
break;
case 32:
if ((0x3ff000000000000L & l) != 0x0L)
jjstateSet[jjnewStateCnt++] = 33;
break;
case 33:
if ((0xe00000000000L & l) != 0x0L)
jjstateSet[jjnewStateCnt++] = 34;
break;
case 34:
if ((0x3ff000000000000L & l) != 0x0L)
jjstateSet[jjnewStateCnt++] = 35;
break;
case 35:
if ((0x3ff000000000000L & l) == 0x0L)
break;
if (kind > 13)
kind = 13;
jjstateSet[jjnewStateCnt++] = 36;
break;
case 36:
if ((0x3ff000000000000L & l) != 0x0L)
jjstateSet[jjnewStateCnt++] = 37;
break;
case 37:
if ((0x3ff000000000000L & l) != 0x0L && kind > 13)
kind = 13;
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
do
{
switch(jjstateSet[--i])
{
case 19:
if ((0x7fffffe87fffffeL & l) != 0x0L)
{
if (kind > 21)
kind = 21;
{ jjCheckNAdd(25); }
}
if ((0x7fffffe87fffffeL & l) != 0x0L)
{ jjCheckNAddTwoStates(18, 19); }
break;
case 0:
if ((0x7fffffe87fffffeL & l) != 0x0L)
{
if (kind > 21)
kind = 21;
{ jjCheckNAdd(25); }
}
else if (curChar == 124)
{
if (kind > 3)
kind = 3;
}
if ((0x7fffffe87fffffeL & l) != 0x0L)
{ jjCheckNAddTwoStates(18, 19); }
if ((0x10000000100000L & l) != 0x0L)
jjstateSet[jjnewStateCnt++] = 24;
else if ((0x400000004000L & l) != 0x0L)
jjstateSet[jjnewStateCnt++] = 9;
else if ((0x800000008000L & l) != 0x0L)
jjstateSet[jjnewStateCnt++] = 6;
else if ((0x200000002L & l) != 0x0L)
jjstateSet[jjnewStateCnt++] = 2;
break;
case 1:
if ((0x200000002L & l) != 0x0L)
jjstateSet[jjnewStateCnt++] = 2;
break;
case 2:
if ((0x400000004000L & l) != 0x0L)
jjstateSet[jjnewStateCnt++] = 3;
break;
case 3:
if ((0x1000000010L & l) != 0x0L && kind > 2)
kind = 2;
break;
case 5:
if ((0x800000008000L & l) != 0x0L)
jjstateSet[jjnewStateCnt++] = 6;
break;
case 6:
if ((0x4000000040000L & l) != 0x0L && kind > 3)
kind = 3;
break;
case 7:
if (curChar == 124 && kind > 3)
kind = 3;
break;
case 8:
if ((0x400000004000L & l) != 0x0L)
jjstateSet[jjnewStateCnt++] = 9;
break;
case 9:
if ((0x800000008000L & l) != 0x0L)
jjstateSet[jjnewStateCnt++] = 10;
break;
case 10:
if ((0x10000000100000L & l) != 0x0L && kind > 4)
kind = 4;
break;
case 16:
if ((0x2000000020L & l) != 0x0L)
jjstateSet[jjnewStateCnt++] = 17;
break;
case 18:
if ((0x7fffffe87fffffeL & l) != 0x0L)
{ jjCheckNAddTwoStates(18, 19); }
break;
case 21:
{ jjAddStates(7, 8); }
break;
case 23:
if ((0x10000000100000L & l) != 0x0L)
jjstateSet[jjnewStateCnt++] = 24;
break;
case 24:
if ((0x800000008000L & l) != 0x0L && kind > 20)
kind = 20;
break;
case 25:
if ((0x7fffffe87fffffeL & l) == 0x0L)
break;
if (kind > 21)
kind = 21;
{ jjCheckNAdd(25); }
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 19:
case 25:
if (!jjCanMove_1(hiByte, i1, i2, l1, l2))
break;
if (kind > 21)
kind = 21;
{ jjCheckNAdd(25); }
break;
case 0:
if (!jjCanMove_1(hiByte, i1, i2, l1, l2))
break;
if (kind > 21)
kind = 21;
{ jjCheckNAdd(25); }
break;
case 21:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
{ jjAddStates(7, 8); }
break;
default : if (i1 == 0 || l1 == 0 || i2 == 0 || l2 == 0) break; else break;
}
} while(i != startsAt);
}
if (kind != 0x7fffffff)
{
jjmatchedKind = kind;
jjmatchedPos = curPos;
kind = 0x7fffffff;
}
++curPos;
i = jjnewStateCnt;
jjnewStateCnt = startsAt;
startsAt = 38 - jjnewStateCnt;
if (i == startsAt)
return curPos;
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) { return curPos; }
}
}
/** Token literal values. */
public static final String[] jjstrLiteralImages = {
"", null, null, null, null, "\53", "\55", "\50", "\51", "\133", "\135", "\173",
"\175", null, null, null, "\42", "\47", null, "\52", null, null, null, };
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);
t.kind = jjmatchedKind;
t.image = curTokenImage;
t.beginLine = beginLine;
t.endLine = endLine;
t.beginColumn = beginColumn;
t.endColumn = endColumn;
return t;
}
static final int[] jjnextStates = {
13, 14, 16, 27, 13, 14, 16, 21, 22,
};
private static final boolean jjCanMove_0(int hiByte, int i1, int i2, long l1, long l2)
{
switch(hiByte)
{
case 0:
return ((jjbitVec0[i2] & l2) != 0L);
default :
return false;
}
}
private static final boolean jjCanMove_1(int hiByte, int i1, int i2, long l1, long l2)
{
switch(hiByte)
{
case 0:
return ((jjbitVec0[i2] & l2) != 0L);
default :
if ((jjbitVec1[i1] & l1) != 0L)
return true;
return false;
}
}
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(final Exception e)
{
jjmatchedKind = 0;
jjmatchedPos = -1;
matchedToken = jjFillToken();
return matchedToken;
}
jjmatchedKind = 0x7fffffff;
jjmatchedPos = 0;
curPos = jjMoveStringLiteralDfa0_0();
if (jjmatchedKind != 0x7fffffff)
{
if (jjmatchedPos + 1 < curPos)
input_stream.backup(curPos - jjmatchedPos - 1);
if ((jjtoToken[jjmatchedKind >> 6] & (1L << (jjmatchedKind & 077))) != 0L)
{
matchedToken = jjFillToken();
return matchedToken;
}
else
{
continue EOFLoop;
}
}
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 (final 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 TokenMgrException(EOFSeen, curLexState, error_line, error_column, error_after, curChar, TokenMgrException.LEXICAL_ERROR);
}
}
void SkipLexicalActions(Token matchedToken)
{
switch(jjmatchedKind)
{
default :
break;
}
}
void MoreLexicalActions()
{
jjimageLen += (lengthOfMatch = jjmatchedPos + 1);
switch(jjmatchedKind)
{
default :
break;
}
}
void TokenLexicalActions(Token matchedToken)
{
switch(jjmatchedKind)
{
default :
break;
}
}
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);
}
/** Constructor. */
public QueryParserTokenManager(SimpleCharStream stream){
input_stream = stream;
}
/** Constructor. */
public QueryParserTokenManager (SimpleCharStream stream, int lexState){
ReInit(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 = 38; 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 TokenMgrException("Error: Ignoring invalid lexical state : " + lexState + ". State unchanged.", TokenMgrException.INVALID_LEXICAL_STATE);
else
curLexState = lexState;
}
/** Lexer state names. */
public static final String[] lexStateNames = {
"DEFAULT",
};
/** Lex State array. */
public static final int[] jjnewLexState = {
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
};
static final long[] jjtoToken = {
0x7ffffdL,
};
static final long[] jjtoSkip = {
0x2L,
};
static final long[] jjtoSpecial = {
0x0L,
};
static final long[] jjtoMore = {
0x0L,
};
protected SimpleCharStream input_stream;
private final int[] jjrounds = new int[38];
private final int[] jjstateSet = new int[2 * 38];
private final StringBuilder jjimage = new StringBuilder();
private StringBuilder image = jjimage;
private int jjimageLen;
private int lengthOfMatch;
protected int curChar;
}
