org.apache.jsieve.parser.generated.SieveParserTokenManager Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of apache-jsieve Show documentation
Show all versions of apache-jsieve Show documentation
Apache jSieve is a server side mail filtering system
implementing RFC3028. Apache jSieve is developed by the
JAMES project.
/* Generated By:JJTree&JavaCC: Do not edit this line. SieveParserTokenManager.java */
package org.apache.jsieve.parser.generated;
import org.apache.jsieve.*;
import org.apache.jsieve.parser.*;
/** Token Manager. */
public class SieveParserTokenManager implements SieveParserConstants
{
/** Debug output. */
public java.io.PrintStream debugStream = System.out;
/** Set debug output. */
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 int jjStopAtPos(int pos, int kind)
{
jjmatchedKind = kind;
jjmatchedPos = pos;
return pos + 1;
}
private int jjMoveStringLiteralDfa0_0()
{
switch(curChar)
{
case 40:
return jjStopAtPos(0, 28);
case 41:
return jjStopAtPos(0, 30);
case 44:
return jjStopAtPos(0, 29);
case 59:
return jjStopAtPos(0, 25);
case 91:
return jjStopAtPos(0, 31);
case 93:
return jjStopAtPos(0, 32);
case 123:
return jjStopAtPos(0, 26);
case 125:
return jjStopAtPos(0, 27);
default :
return jjMoveNfa_0(6, 0);
}
}
static final long[] jjbitVec0 = {
0xfffffffffffffffeL, 0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffffffffffffffL
};
static final long[] jjbitVec2 = {
0x0L, 0x0L, 0xffffffffffffffffL, 0xffffffffffffffffL
};
private int jjMoveNfa_0(int startState, int curPos)
{
int startsAt = 0;
jjnewStateCnt = 48;
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 6:
if ((0x3ff000000000000L & l) != 0L)
{
if (kind > 13)
kind = 13;
jjCheckNAddTwoStates(12, 13);
}
else if (curChar == 35)
{
if (kind > 8)
kind = 8;
jjCheckNAddStates(0, 3);
}
else if (curChar == 34)
jjCheckNAddStates(4, 6);
else if (curChar == 58)
jjstateSet[jjnewStateCnt++] = 10;
else if (curChar == 47)
jjstateSet[jjnewStateCnt++] = 0;
break;
case 0:
if (curChar == 42)
jjCheckNAddTwoStates(1, 2);
break;
case 1:
if ((0xfffffbffffffffffL & l) != 0L)
jjCheckNAddTwoStates(1, 2);
break;
case 2:
if (curChar == 42)
jjCheckNAddStates(7, 9);
break;
case 3:
if ((0xffff7bffffffffffL & l) != 0L)
jjCheckNAddTwoStates(4, 2);
break;
case 4:
if ((0xfffffbffffffffffL & l) != 0L)
jjCheckNAddTwoStates(4, 2);
break;
case 5:
if (curChar == 47 && kind > 7)
kind = 7;
break;
case 8:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 9)
kind = 9;
jjstateSet[jjnewStateCnt++] = 8;
break;
case 9:
if (curChar == 58)
jjstateSet[jjnewStateCnt++] = 10;
break;
case 11:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 12)
kind = 12;
jjstateSet[jjnewStateCnt++] = 11;
break;
case 12:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 13)
kind = 13;
jjCheckNAddTwoStates(12, 13);
break;
case 14:
case 16:
if (curChar == 34)
jjCheckNAddStates(4, 6);
break;
case 15:
if ((0xfffffffbffffffffL & l) != 0L)
jjCheckNAddStates(4, 6);
break;
case 18:
if (curChar == 34 && kind > 16)
kind = 16;
break;
case 19:
if (curChar == 58)
jjCheckNAddStates(10, 13);
break;
case 20:
if ((0x100000200L & l) != 0L)
jjCheckNAddStates(10, 13);
break;
case 21:
if (curChar == 35)
jjCheckNAddStates(14, 16);
break;
case 22:
if ((0xffffffffffffdbffL & l) != 0L)
jjCheckNAddStates(14, 16);
break;
case 23:
if ((0x2400L & l) != 0L)
jjCheckNAddStates(17, 20);
break;
case 24:
if ((0xffffbfffffffffffL & l) != 0L)
jjCheckNAddStates(21, 24);
break;
case 25:
if ((0xfffffffffffffbffL & l) != 0L)
jjCheckNAddStates(21, 24);
break;
case 26:
if (curChar == 13)
jjCheckNAdd(25);
break;
case 27:
if (curChar == 10)
jjCheckNAddStates(17, 20);
break;
case 28:
case 32:
case 36:
case 37:
if (curChar == 13)
jjCheckNAdd(27);
break;
case 29:
if (curChar == 46)
jjCheckNAddStates(25, 28);
break;
case 30:
if ((0xfffffffffffffbffL & l) != 0L)
jjCheckNAddStates(29, 32);
break;
case 31:
if (curChar == 13)
jjCheckNAdd(30);
break;
case 33:
if ((0x2400L & l) != 0L && kind > 17)
kind = 17;
break;
case 34:
if (curChar == 10 && kind > 17)
kind = 17;
break;
case 35:
if (curChar == 13)
jjstateSet[jjnewStateCnt++] = 34;
break;
case 42:
if (curChar != 35)
break;
if (kind > 8)
kind = 8;
jjCheckNAddStates(0, 3);
break;
case 43:
if ((0xffffffffffffdbffL & l) != 0L)
jjCheckNAddStates(33, 35);
break;
case 44:
if ((0x2400L & l) != 0L && kind > 6)
kind = 6;
break;
case 45:
if (curChar == 10 && kind > 6)
kind = 6;
break;
case 46:
if (curChar == 13)
jjstateSet[jjnewStateCnt++] = 45;
break;
case 47:
if ((0xffffffffffffdbffL & l) == 0L)
break;
if (kind > 8)
kind = 8;
jjCheckNAdd(47);
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
do
{
switch(jjstateSet[--i])
{
case 6:
if ((0x7fffffe87fffffeL & l) != 0L)
{
if (kind > 9)
kind = 9;
jjCheckNAdd(8);
}
if (curChar == 116)
jjstateSet[jjnewStateCnt++] = 40;
break;
case 1:
jjCheckNAddTwoStates(1, 2);
break;
case 3:
case 4:
jjCheckNAddTwoStates(4, 2);
break;
case 7:
case 8:
if ((0x7fffffe87fffffeL & l) == 0L)
break;
if (kind > 9)
kind = 9;
jjCheckNAdd(8);
break;
case 10:
case 11:
if ((0x7fffffe87fffffeL & l) == 0L)
break;
if (kind > 12)
kind = 12;
jjCheckNAdd(11);
break;
case 13:
if ((0x2880L & l) != 0L && kind > 13)
kind = 13;
break;
case 15:
jjAddStates(4, 6);
break;
case 17:
if (curChar == 92)
jjstateSet[jjnewStateCnt++] = 16;
break;
case 22:
jjCheckNAddStates(14, 16);
break;
case 24:
case 25:
jjCheckNAddStates(21, 24);
break;
case 30:
jjCheckNAddStates(29, 32);
break;
case 38:
if (curChar == 116)
jjstateSet[jjnewStateCnt++] = 19;
break;
case 39:
if (curChar == 120)
jjstateSet[jjnewStateCnt++] = 38;
break;
case 40:
if (curChar == 101)
jjstateSet[jjnewStateCnt++] = 39;
break;
case 41:
if (curChar == 116)
jjstateSet[jjnewStateCnt++] = 40;
break;
case 43:
jjAddStates(33, 35);
break;
case 47:
if (kind > 8)
kind = 8;
jjstateSet[jjnewStateCnt++] = 47;
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 1:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjCheckNAddTwoStates(1, 2);
break;
case 3:
case 4:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjCheckNAddTwoStates(4, 2);
break;
case 15:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjAddStates(4, 6);
break;
case 22:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjCheckNAddStates(14, 16);
break;
case 24:
case 25:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjCheckNAddStates(21, 24);
break;
case 30:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjCheckNAddStates(29, 32);
break;
case 43:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjAddStates(33, 35);
break;
case 47:
if (!jjCanMove_0(hiByte, i1, i2, l1, l2))
break;
if (kind > 8)
kind = 8;
jjstateSet[jjnewStateCnt++] = 47;
break;
default : break;
}
} while(i != startsAt);
}
if (kind != 0x7fffffff)
{
jjmatchedKind = kind;
jjmatchedPos = curPos;
kind = 0x7fffffff;
}
++curPos;
if ((i = jjnewStateCnt) == (startsAt = 48 - (jjnewStateCnt = startsAt)))
return curPos;
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) { return curPos; }
}
}
static final int[] jjnextStates = {
43, 44, 46, 47, 15, 17, 18, 2, 3, 5, 20, 21, 37, 23, 22, 23,
36, 24, 23, 28, 29, 25, 26, 23, 28, 30, 31, 33, 35, 30, 31, 23,
32, 43, 44, 46,
};
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;
}
}
/** Token literal values. */
public static final String[] jjstrLiteralImages = {
"", null, null, null, null, null, null, null, null, null, null, null, null,
null, null, null, null, null, null, null, null, null, null, null, null, "\73",
"\173", "\175", "\50", "\54", "\51", "\133", "\135", };
/** Lexer state names. */
public static final String[] lexStateNames = {
"DEFAULT",
};
static final long[] jjtoToken = {
0x1fe033301L,
};
static final long[] jjtoSkip = {
0xfeL,
};
static final long[] jjtoSpecial = {
0xc0L,
};
protected JavaCharStream input_stream;
private final int[] jjrounds = new int[48];
private final int[] jjstateSet = new int[96];
protected char curChar;
/** Constructor. */
public SieveParserTokenManager(JavaCharStream stream){
if (JavaCharStream.staticFlag)
throw new Error("ERROR: Cannot use a static CharStream class with a non-static lexical analyzer.");
input_stream = stream;
}
/** Constructor. */
public SieveParserTokenManager(JavaCharStream stream, int lexState){
this(stream);
SwitchTo(lexState);
}
/** Reinitialise parser. */
public void ReInit(JavaCharStream stream)
{
jjmatchedPos = jjnewStateCnt = 0;
curLexState = defaultLexState;
input_stream = stream;
ReInitRounds();
}
private void ReInitRounds()
{
int i;
jjround = 0x80000001;
for (i = 48; i-- > 0;)
jjrounds[i] = 0x80000000;
}
/** Reinitialise parser. */
public void ReInit(JavaCharStream 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 specialToken = null;
Token matchedToken;
int curPos = 0;
EOFLoop :
for (;;)
{
try
{
curChar = input_stream.BeginToken();
}
catch(java.io.IOException e)
{
jjmatchedKind = 0;
matchedToken = jjFillToken();
matchedToken.specialToken = specialToken;
return matchedToken;
}
try { input_stream.backup(0);
while (curChar <= 32 && (0x100003600L & (1L << curChar)) != 0L)
curChar = input_stream.BeginToken();
}
catch (java.io.IOException e1) { continue EOFLoop; }
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();
matchedToken.specialToken = specialToken;
return matchedToken;
}
else
{
if ((jjtoSpecial[jjmatchedKind >> 6] & (1L << (jjmatchedKind & 077))) != 0L)
{
matchedToken = jjFillToken();
if (specialToken == null)
specialToken = matchedToken;
else
{
matchedToken.specialToken = specialToken;
specialToken = (specialToken.next = matchedToken);
}
}
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 (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);
}
}