org.apfloat.calc.CalculatorParserTokenManager Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of apfloat-calc Show documentation
Show all versions of apfloat-calc Show documentation
Interactive arbitrary precision calculator application
The newest version!
/* CalculatorParserTokenManager.java */
/* Generated By:JavaCC: Do not edit this line. CalculatorParserTokenManager.java */
package org.apfloat.calc;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.io.Reader;
import java.io.Writer;
import java.util.List;
import java.util.ArrayList;
/** Token Manager. */
@SuppressWarnings ("unused")
public class CalculatorParserTokenManager implements CalculatorParserConstants {
/** 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 33:
jjmatchedKind = 25;
return jjMoveStringLiteralDfa1_0(0x1000000L);
case 37:
jjmatchedKind = 22;
return jjMoveStringLiteralDfa1_0(0x10000L);
case 40:
return jjStopAtPos(0, 26);
case 41:
return jjStopAtPos(0, 27);
case 42:
jjmatchedKind = 20;
return jjMoveStringLiteralDfa1_0(0x4000L);
case 43:
jjmatchedKind = 18;
return jjMoveStringLiteralDfa1_0(0x1000L);
case 44:
return jjStopAtPos(0, 28);
case 45:
jjmatchedKind = 19;
return jjMoveStringLiteralDfa1_0(0x2000L);
case 47:
jjmatchedKind = 21;
return jjMoveStringLiteralDfa1_0(0x8000L);
case 61:
return jjStopAtPos(0, 11);
case 94:
jjmatchedKind = 23;
return jjMoveStringLiteralDfa1_0(0x20000L);
default :
return jjMoveNfa_0(0, 0);
}
}
private int jjMoveStringLiteralDfa1_0(long active0){
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_0(0, active0);
return 1;
}
switch(curChar)
{
case 33:
if ((active0 & 0x1000000L) != 0L)
return jjStopAtPos(1, 24);
break;
case 61:
if ((active0 & 0x1000L) != 0L)
return jjStopAtPos(1, 12);
else if ((active0 & 0x2000L) != 0L)
return jjStopAtPos(1, 13);
else if ((active0 & 0x4000L) != 0L)
return jjStopAtPos(1, 14);
else if ((active0 & 0x8000L) != 0L)
return jjStopAtPos(1, 15);
else if ((active0 & 0x10000L) != 0L)
return jjStopAtPos(1, 16);
else if ((active0 & 0x20000L) != 0L)
return jjStopAtPos(1, 17);
break;
default :
break;
}
return jjStartNfa_0(0, active0);
}
static final long[] jjbitVec0 = {
0x1ff00000fffffffeL, 0xffffffffffffc000L, 0xffffffffL, 0x600000000000000L
};
static final long[] jjbitVec2 = {
0x0L, 0x0L, 0x0L, 0xff7fffffff7fffffL
};
static final long[] jjbitVec3 = {
0x0L, 0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffffffffffffffL
};
static final long[] jjbitVec4 = {
0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffL, 0x0L
};
static final long[] jjbitVec5 = {
0xffffffffffffffffL, 0xffffffffffffffffL, 0x0L, 0x0L
};
static final long[] jjbitVec6 = {
0x3fffffffffffL, 0x0L, 0x0L, 0x0L
};
private int jjMoveNfa_0(int startState, int curPos)
{
int startsAt = 0;
jjnewStateCnt = 18;
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 0:
if ((0x3ff000000000000L & l) != 0L)
{
if (kind > 3)
kind = 3;
{ jjCheckNAddStates(0, 5); }
}
else if ((0x2400L & l) != 0L)
{
if (kind > 10)
kind = 10;
}
else if (curChar == 36)
{
if (kind > 7)
kind = 7;
{ jjCheckNAdd(17); }
}
else if (curChar == 59)
{
if (kind > 9)
kind = 9;
{ jjCheckNAdd(6); }
}
else if (curChar == 46)
{ jjCheckNAdd(1); }
if (curChar == 13)
jjstateSet[jjnewStateCnt++] = 8;
break;
case 1:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 4)
kind = 4;
{ jjCheckNAddStates(6, 8); }
break;
case 3:
if ((0x280000000000L & l) != 0L)
{ jjCheckNAdd(4); }
break;
case 4:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 4)
kind = 4;
{ jjCheckNAddTwoStates(4, 5); }
break;
case 6:
if (curChar != 59)
break;
kind = 9;
{ jjCheckNAdd(6); }
break;
case 7:
if ((0x2400L & l) != 0L && kind > 10)
kind = 10;
break;
case 8:
if (curChar == 10 && kind > 10)
kind = 10;
break;
case 9:
if (curChar == 13)
jjstateSet[jjnewStateCnt++] = 8;
break;
case 10:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 3)
kind = 3;
{ jjCheckNAddStates(0, 5); }
break;
case 11:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 3)
kind = 3;
{ jjCheckNAddTwoStates(11, 12); }
break;
case 13:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 4)
kind = 4;
{ jjCheckNAddStates(9, 12); }
break;
case 14:
if (curChar != 46)
break;
if (kind > 4)
kind = 4;
{ jjCheckNAddStates(13, 15); }
break;
case 15:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 4)
kind = 4;
{ jjCheckNAddStates(13, 15); }
break;
case 16:
if (curChar != 36)
break;
if (kind > 7)
kind = 7;
{ jjCheckNAdd(17); }
break;
case 17:
if ((0x3ff001000000000L & l) == 0L)
break;
if (kind > 7)
kind = 7;
{ jjCheckNAdd(17); }
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
do
{
switch(jjstateSet[--i])
{
case 0:
if ((0x7fffffe87fffffeL & l) != 0L)
{
if (kind > 7)
kind = 7;
{ jjCheckNAdd(17); }
}
if ((0x20000000200L & l) != 0L)
{
if (kind > 3)
kind = 3;
}
break;
case 2:
if ((0x2000000020L & l) != 0L)
{ jjAddStates(16, 17); }
break;
case 5:
if ((0x20000000200L & l) != 0L && kind > 4)
kind = 4;
break;
case 12:
if ((0x20000000200L & l) != 0L && kind > 3)
kind = 3;
break;
case 16:
case 17:
if ((0x7fffffe87fffffeL & l) == 0L)
break;
if (kind > 7)
kind = 7;
{ jjCheckNAdd(17); }
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 0:
case 17:
if (!jjCanMove_0(hiByte, i1, i2, l1, l2))
break;
if (kind > 7)
kind = 7;
{ jjCheckNAdd(17); }
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;
if ((i = jjnewStateCnt) == (startsAt = 18 - (jjnewStateCnt = 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, null, null, null, null, null, null, "\75",
"\53\75", "\55\75", "\52\75", "\57\75", "\45\75", "\136\75", "\53", "\55", "\52", "\57",
"\45", "\136", "\41\41", "\41", "\50", "\51", "\54", 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, curTokenImage);
t.beginLine = beginLine;
t.endLine = endLine;
t.beginColumn = beginColumn;
t.endColumn = endColumn;
return t;
}
static final int[] jjnextStates = {
11, 12, 13, 14, 2, 5, 1, 2, 5, 13, 14, 2, 5, 15, 2, 5,
3, 4,
};
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);
case 48:
return ((jjbitVec3[i2] & l2) != 0L);
case 49:
return ((jjbitVec4[i2] & l2) != 0L);
case 51:
return ((jjbitVec5[i2] & l2) != 0L);
case 61:
return ((jjbitVec6[i2] & l2) != 0L);
default :
if ((jjbitVec0[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(Exception e)
{
jjmatchedKind = 0;
jjmatchedPos = -1;
matchedToken = jjFillToken();
return matchedToken;
}
try { input_stream.backup(0);
while (curChar <= 32 && (0x100000200L & (1L << curChar)) != 0L)
curChar = input_stream.BeginToken();
}
catch (java.io.IOException e1) { continue EOFLoop; }
jjmatchedKind = 0x7fffffff;
jjmatchedPos = 0;
curPos = jjMoveStringLiteralDfa0_0();
if (jjmatchedPos == 0 && jjmatchedKind > 29)
{
jjmatchedKind = 29;
}
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 (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 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 CalculatorParserTokenManager(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 CalculatorParserTokenManager (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 = 18; 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;
}
/** 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, -1, -1,
-1, -1, -1, -1, -1,
};
static final long[] jjtoToken = {
0x3ffffff9L,
};
static final long[] jjtoSkip = {
0x6L,
};
static final long[] jjtoSpecial = {
0x0L,
};
static final long[] jjtoMore = {
0x0L,
};
protected SimpleCharStream input_stream;
private final int[] jjrounds = new int[18];
private final int[] jjstateSet = new int[2 * 18];
private final StringBuilder jjimage = new StringBuilder();
private StringBuilder image = jjimage;
private int jjimageLen;
private int lengthOfMatch;
protected int curChar;
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy