com.yahoo.searchlib.treenet.parser.TreeNetParserTokenManager Maven / Gradle / Ivy
/* TreeNetParserTokenManager.java */
/* Generated by: ParserGeneratorCC: Do not edit this line. TreeNetParserTokenManager.java */
package com.yahoo.searchlib.treenet.parser;
import com.yahoo.searchlib.rankingexpression.parser.RankingExpressionParser;
import com.yahoo.searchlib.treenet.rule.*;
import java.io.StringReader;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
/** Token Manager. */
@SuppressWarnings ("unused")
public class TreeNetParserTokenManager implements TreeNetParserConstants {
private final int jjStopStringLiteralDfa_0(int pos, long active0){
switch (pos)
{
case 0:
if ((active0 & 0x20000L) != 0x0L)
return 10;
if ((active0 & 0x1000L) != 0x0L)
return 59;
if ((active0 & 0x784f0a000L) != 0x0L)
{
jjmatchedKind = 35;
return 26;
}
return -1;
case 1:
if ((active0 & 0x600000L) != 0x0L)
return 26;
if ((active0 & 0x78490a000L) != 0x0L)
{
jjmatchedKind = 35;
jjmatchedPos = 1;
return 26;
}
return -1;
case 2:
if ((active0 & 0x78490a000L) != 0x0L)
{
jjmatchedKind = 35;
jjmatchedPos = 2;
return 26;
}
return -1;
case 3:
if ((active0 & 0x580002000L) != 0x0L)
{
jjmatchedKind = 35;
jjmatchedPos = 3;
return 26;
}
if ((active0 & 0x204908000L) != 0x0L)
return 26;
return -1;
case 4:
if ((active0 & 0x580002000L) != 0x0L)
{
jjmatchedKind = 35;
jjmatchedPos = 4;
return 26;
}
return -1;
case 5:
if ((active0 & 0x100000000L) != 0x0L)
return 26;
if ((active0 & 0x480002000L) != 0x0L)
{
jjmatchedKind = 35;
jjmatchedPos = 5;
return 26;
}
return -1;
case 6:
if ((active0 & 0x80002000L) != 0x0L)
{
jjmatchedKind = 35;
jjmatchedPos = 6;
return 26;
}
if ((active0 & 0x400000000L) != 0x0L)
return 26;
return -1;
case 7:
if ((active0 & 0x2000L) != 0x0L)
{
jjmatchedKind = 35;
jjmatchedPos = 7;
return 26;
}
if ((active0 & 0x80000000L) != 0x0L)
return 26;
return -1;
case 8:
if ((active0 & 0x2000L) != 0x0L)
{
jjmatchedKind = 35;
jjmatchedPos = 8;
return 26;
}
return -1;
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 10:
return jjStopAtPos(0, 25);
case '(':
return jjStopAtPos(0, 27);
case ')':
return jjStopAtPos(0, 28);
case '+':
return jjStartNfaWithStates_0(0, 12, 59);
case ',':
return jjStopAtPos(0, 16);
case '.':
return jjStartNfaWithStates_0(0, 17, 10);
case ':':
return jjStopAtPos(0, 14);
case ';':
return jjStopAtPos(0, 18);
case '<':
return jjStopAtPos(0, 24);
case '=':
return jjStopAtPos(0, 19);
case 'E':
case 'e':
return jjMoveStringLiteralDfa1_0(0x8000L);
case 'G':
case 'g':
return jjMoveStringLiteralDfa1_0(0x100000L);
case 'I':
case 'i':
return jjMoveStringLiteralDfa1_0(0x600000L);
case 'L':
case 'l':
return jjMoveStringLiteralDfa1_0(0x800000L);
case 'M':
case 'm':
return jjMoveStringLiteralDfa1_0(0x2000L);
case 'P':
case 'p':
return jjMoveStringLiteralDfa1_0(0x4000000L);
case 'R':
case 'r':
return jjMoveStringLiteralDfa1_0(0x180000000L);
case 'T':
case 't':
return jjMoveStringLiteralDfa1_0(0x600000000L);
case '{':
return jjStopAtPos(0, 29);
case '}':
return jjStopAtPos(0, 30);
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 'E':
case 'e':
return jjMoveStringLiteralDfa2_0(active0, 0x180000000L);
case 'F':
case 'f':
if ((active0 & 0x200000L) != 0x0L)
return jjStartNfaWithStates_0(1, 21, 26);
break;
case 'H':
case 'h':
return jjMoveStringLiteralDfa2_0(active0, 0x200000000L);
case 'I':
case 'i':
return jjMoveStringLiteralDfa2_0(active0, 0x800000L);
case 'L':
case 'l':
return jjMoveStringLiteralDfa2_0(active0, 0x8000L);
case 'N':
case 'n':
if ((active0 & 0x400000L) != 0x0L)
return jjStartNfaWithStates_0(1, 22, 26);
return jjMoveStringLiteralDfa2_0(active0, 0x400000000L);
case 'O':
case 'o':
return jjMoveStringLiteralDfa2_0(active0, 0x102000L);
case 'R':
case 'r':
return jjMoveStringLiteralDfa2_0(active0, 0x4000000L);
default :
break;
}
return jjStartNfa_0(0, active0);
}
private int jjMoveStringLiteralDfa2_0(long old0, long active0){
if (((active0 &= old0)) == 0L)
return jjStartNfa_0(0, old0);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_0(1, active0);
return 2;
}
switch(curChar)
{
case 'D':
case 'd':
return jjMoveStringLiteralDfa3_0(active0, 0x2000L);
case 'E':
case 'e':
return jjMoveStringLiteralDfa3_0(active0, 0x204000000L);
case 'N':
case 'n':
return jjMoveStringLiteralDfa3_0(active0, 0x800000L);
case 'S':
case 's':
return jjMoveStringLiteralDfa3_0(active0, 0x480008000L);
case 'T':
case 't':
return jjMoveStringLiteralDfa3_0(active0, 0x100100000L);
default :
break;
}
return jjStartNfa_0(1, active0);
}
private int jjMoveStringLiteralDfa3_0(long old0, long active0){
if (((active0 &= old0)) == 0L)
return jjStartNfa_0(1, old0);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_0(2, active0);
return 3;
}
switch(curChar)
{
case 'C':
case 'c':
return jjMoveStringLiteralDfa4_0(active0, 0x400000000L);
case 'D':
case 'd':
if ((active0 & 0x4000000L) != 0x0L)
return jjStartNfaWithStates_0(3, 26, 26);
break;
case 'E':
case 'e':
if ((active0 & 0x8000L) != 0x0L)
return jjStartNfaWithStates_0(3, 15, 26);
return jjMoveStringLiteralDfa4_0(active0, 0x2000L);
case 'K':
case 'k':
if ((active0 & 0x800000L) != 0x0L)
return jjStartNfaWithStates_0(3, 23, 26);
break;
case 'N':
case 'n':
if ((active0 & 0x200000000L) != 0x0L)
return jjStartNfaWithStates_0(3, 33, 26);
break;
case 'O':
case 'o':
if ((active0 & 0x100000L) != 0x0L)
return jjStartNfaWithStates_0(3, 20, 26);
break;
case 'P':
case 'p':
return jjMoveStringLiteralDfa4_0(active0, 0x80000000L);
case 'U':
case 'u':
return jjMoveStringLiteralDfa4_0(active0, 0x100000000L);
default :
break;
}
return jjStartNfa_0(2, active0);
}
private int jjMoveStringLiteralDfa4_0(long old0, long active0){
if (((active0 &= old0)) == 0L)
return jjStartNfa_0(2, old0);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_0(3, active0);
return 4;
}
switch(curChar)
{
case 'L':
case 'l':
return jjMoveStringLiteralDfa5_0(active0, 0x2000L);
case 'O':
case 'o':
return jjMoveStringLiteralDfa5_0(active0, 0x480000000L);
case 'R':
case 'r':
return jjMoveStringLiteralDfa5_0(active0, 0x100000000L);
default :
break;
}
return jjStartNfa_0(3, active0);
}
private int jjMoveStringLiteralDfa5_0(long old0, long active0){
if (((active0 &= old0)) == 0L)
return jjStartNfa_0(3, old0);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_0(4, active0);
return 5;
}
switch(curChar)
{
case 'B':
case 'b':
return jjMoveStringLiteralDfa6_0(active0, 0x2000L);
case 'N':
case 'n':
if ((active0 & 0x100000000L) != 0x0L)
return jjStartNfaWithStates_0(5, 32, 26);
return jjMoveStringLiteralDfa6_0(active0, 0x80000000L);
case 'R':
case 'r':
return jjMoveStringLiteralDfa6_0(active0, 0x400000000L);
default :
break;
}
return jjStartNfa_0(4, active0);
}
private int jjMoveStringLiteralDfa6_0(long old0, long active0){
if (((active0 &= old0)) == 0L)
return jjStartNfa_0(4, old0);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_0(5, active0);
return 6;
}
switch(curChar)
{
case 'E':
case 'e':
if ((active0 & 0x400000000L) != 0x0L)
return jjStartNfaWithStates_0(6, 34, 26);
return jjMoveStringLiteralDfa7_0(active0, 0x2000L);
case 'S':
case 's':
return jjMoveStringLiteralDfa7_0(active0, 0x80000000L);
default :
break;
}
return jjStartNfa_0(5, active0);
}
private int jjMoveStringLiteralDfa7_0(long old0, long active0){
if (((active0 &= old0)) == 0L)
return jjStartNfa_0(5, old0);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_0(6, active0);
return 7;
}
switch(curChar)
{
case 'E':
case 'e':
if ((active0 & 0x80000000L) != 0x0L)
return jjStartNfaWithStates_0(7, 31, 26);
break;
case 'G':
case 'g':
return jjMoveStringLiteralDfa8_0(active0, 0x2000L);
default :
break;
}
return jjStartNfa_0(6, active0);
}
private int jjMoveStringLiteralDfa8_0(long old0, long active0){
if (((active0 &= old0)) == 0L)
return jjStartNfa_0(6, old0);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_0(7, active0);
return 8;
}
switch(curChar)
{
case 'I':
case 'i':
return jjMoveStringLiteralDfa9_0(active0, 0x2000L);
default :
break;
}
return jjStartNfa_0(7, active0);
}
private int jjMoveStringLiteralDfa9_0(long old0, long active0){
if (((active0 &= old0)) == 0L)
return jjStartNfa_0(7, old0);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_0(8, active0);
return 9;
}
switch(curChar)
{
case 'N':
case 'n':
if ((active0 & 0x2000L) != 0x0L)
return jjStartNfaWithStates_0(9, 13, 26);
break;
default :
break;
}
return jjStartNfa_0(8, active0);
}
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
};
private int jjMoveNfa_0(int startState, int curPos)
{
int startsAt = 0;
jjnewStateCnt = 59;
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) != 0x0L)
{ jjCheckNAddStates(0, 6); }
else if ((0x100002200L & l) != 0x0L)
{
if (kind > 1)
kind = 1;
}
else if ((0x280000000000L & l) != 0x0L)
{ jjCheckNAddTwoStates(6, 28); }
else if (curChar == 47)
{ jjAddStates(7, 8); }
else if (curChar == 39)
{ jjCheckNAddStates(9, 11); }
else if (curChar == 34)
{ jjCheckNAddStates(12, 14); }
else if (curChar == 46)
{ jjCheckNAdd(10); }
else if (curChar == 35)
{ jjCheckNAddStates(15, 17); }
if ((0x3fe000000000000L & l) != 0x0L)
{
if (kind > 5)
kind = 5;
{ jjCheckNAddTwoStates(7, 8); }
}
else if (curChar == 48)
{
if (kind > 5)
kind = 5;
{ jjCheckNAddStates(18, 20); }
}
break;
case 59:
if ((0x3ff000000000000L & l) != 0x0L)
{ jjCheckNAddTwoStates(28, 29); }
if ((0x3fe000000000000L & l) != 0x0L)
{
if (kind > 5)
kind = 5;
{ jjCheckNAddTwoStates(7, 8); }
}
break;
case 1:
if (curChar == 35)
{ jjCheckNAddStates(15, 17); }
break;
case 2:
if ((0xffffffffffffdbffL & l) != 0x0L)
{ jjCheckNAddStates(15, 17); }
break;
case 3:
if ((0x2400L & l) != 0x0L && kind > 3)
kind = 3;
break;
case 4:
if (curChar == 10 && kind > 3)
kind = 3;
break;
case 5:
if (curChar == 13)
jjstateSet[jjnewStateCnt++] = 4;
break;
case 6:
if ((0x3fe000000000000L & l) == 0x0L)
break;
if (kind > 5)
kind = 5;
{ jjCheckNAddTwoStates(7, 8); }
break;
case 7:
if ((0x3ff000000000000L & l) == 0x0L)
break;
if (kind > 5)
kind = 5;
{ jjCheckNAddTwoStates(7, 8); }
break;
case 9:
if (curChar == 46)
{ jjCheckNAdd(10); }
break;
case 10:
if ((0x3ff000000000000L & l) == 0x0L)
break;
if (kind > 9)
kind = 9;
{ jjCheckNAddStates(21, 23); }
break;
case 12:
if ((0x280000000000L & l) != 0x0L)
{ jjCheckNAdd(13); }
break;
case 13:
if ((0x3ff000000000000L & l) == 0x0L)
break;
if (kind > 9)
kind = 9;
{ jjCheckNAddTwoStates(13, 14); }
break;
case 15:
case 17:
if (curChar == 34)
{ jjCheckNAddStates(12, 14); }
break;
case 16:
if ((0xfffffffbffffffffL & l) != 0x0L)
{ jjCheckNAddStates(12, 14); }
break;
case 19:
if (curChar == 34 && kind > 11)
kind = 11;
break;
case 20:
case 22:
if (curChar == 39)
{ jjCheckNAddStates(9, 11); }
break;
case 21:
if ((0xffffff7fffffffffL & l) != 0x0L)
{ jjCheckNAddStates(9, 11); }
break;
case 24:
if (curChar == 39 && kind > 11)
kind = 11;
break;
case 26:
if ((0x3ff001000000000L & l) == 0x0L)
break;
if (kind > 35)
kind = 35;
jjstateSet[jjnewStateCnt++] = 26;
break;
case 27:
if ((0x3ff000000000000L & l) != 0x0L)
{ jjCheckNAddStates(0, 6); }
break;
case 28:
if ((0x3ff000000000000L & l) != 0x0L)
{ jjCheckNAddTwoStates(28, 29); }
break;
case 29:
if (curChar != 46)
break;
if (kind > 9)
kind = 9;
{ jjCheckNAddStates(24, 26); }
break;
case 30:
if ((0x3ff000000000000L & l) == 0x0L)
break;
if (kind > 9)
kind = 9;
{ jjCheckNAddStates(24, 26); }
break;
case 32:
if ((0x280000000000L & l) != 0x0L)
{ jjCheckNAdd(33); }
break;
case 33:
if ((0x3ff000000000000L & l) == 0x0L)
break;
if (kind > 9)
kind = 9;
{ jjCheckNAddTwoStates(33, 14); }
break;
case 34:
if ((0x3ff000000000000L & l) != 0x0L)
{ jjCheckNAddTwoStates(34, 35); }
break;
case 36:
if ((0x280000000000L & l) != 0x0L)
{ jjCheckNAdd(37); }
break;
case 37:
if ((0x3ff000000000000L & l) == 0x0L)
break;
if (kind > 9)
kind = 9;
{ jjCheckNAddTwoStates(37, 14); }
break;
case 38:
if ((0x3ff000000000000L & l) != 0x0L)
{ jjCheckNAddStates(27, 29); }
break;
case 40:
if ((0x280000000000L & l) != 0x0L)
{ jjCheckNAdd(41); }
break;
case 41:
if ((0x3ff000000000000L & l) != 0x0L)
{ jjCheckNAddTwoStates(41, 14); }
break;
case 42:
if (curChar != 48)
break;
if (kind > 5)
kind = 5;
{ jjCheckNAddStates(18, 20); }
break;
case 44:
if ((0x3ff000000000000L & l) == 0x0L)
break;
if (kind > 5)
kind = 5;
{ jjCheckNAddTwoStates(44, 8); }
break;
case 45:
if ((0xff000000000000L & l) == 0x0L)
break;
if (kind > 5)
kind = 5;
{ jjCheckNAddTwoStates(45, 8); }
break;
case 46:
if (curChar == 47)
{ jjAddStates(7, 8); }
break;
case 47:
if (curChar == 47)
{ jjCheckNAddStates(30, 32); }
break;
case 48:
if ((0xffffffffffffdbffL & l) != 0x0L)
{ jjCheckNAddStates(30, 32); }
break;
case 49:
if ((0x2400L & l) != 0x0L && kind > 2)
kind = 2;
break;
case 50:
if (curChar == 10 && kind > 2)
kind = 2;
break;
case 51:
if (curChar == 13)
jjstateSet[jjnewStateCnt++] = 50;
break;
case 52:
if (curChar == 42)
{ jjCheckNAddTwoStates(53, 54); }
break;
case 53:
if ((0xfffffbffffffffffL & l) != 0x0L)
{ jjCheckNAddTwoStates(53, 54); }
break;
case 54:
if (curChar == 42)
{ jjCheckNAddStates(33, 35); }
break;
case 55:
if ((0xffff7bffffffffffL & l) != 0x0L)
{ jjCheckNAddTwoStates(56, 54); }
break;
case 56:
if ((0xfffffbffffffffffL & l) != 0x0L)
{ jjCheckNAddTwoStates(56, 54); }
break;
case 57:
if (curChar == 47 && kind > 4)
kind = 4;
break;
case 58:
if ((0x280000000000L & l) != 0x0L)
{ jjCheckNAddTwoStates(6, 28); }
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
do
{
switch(jjstateSet[--i])
{
case 0:
case 26:
if ((0x7fffffe87fffffeL & l) == 0x0L)
break;
if (kind > 35)
kind = 35;
{ jjCheckNAdd(26); }
break;
case 2:
{ jjAddStates(15, 17); }
break;
case 8:
if ((0x100000001000L & l) != 0x0L && kind > 5)
kind = 5;
break;
case 11:
if ((0x2000000020L & l) != 0x0L)
{ jjAddStates(36, 37); }
break;
case 14:
if ((0x5000000050L & l) != 0x0L && kind > 9)
kind = 9;
break;
case 16:
{ jjAddStates(12, 14); }
break;
case 18:
if (curChar == 92)
jjstateSet[jjnewStateCnt++] = 17;
break;
case 21:
{ jjAddStates(9, 11); }
break;
case 23:
if (curChar == 92)
jjstateSet[jjnewStateCnt++] = 22;
break;
case 31:
if ((0x2000000020L & l) != 0x0L)
{ jjAddStates(38, 39); }
break;
case 35:
if ((0x2000000020L & l) != 0x0L)
{ jjAddStates(40, 41); }
break;
case 39:
if ((0x2000000020L & l) != 0x0L)
{ jjAddStates(42, 43); }
break;
case 43:
if ((0x100000001000000L & l) != 0x0L)
{ jjCheckNAdd(44); }
break;
case 44:
if ((0x7e0000007eL & l) == 0x0L)
break;
if (kind > 5)
kind = 5;
{ jjCheckNAddTwoStates(44, 8); }
break;
case 48:
{ jjAddStates(30, 32); }
break;
case 53:
{ jjCheckNAddTwoStates(53, 54); }
break;
case 55:
case 56:
{ jjCheckNAddTwoStates(56, 54); }
break;
default : break;
}
} while(i != startsAt);
}
else
{
int i2 = (curChar & 0xff) >> 6;
long l2 = 1L << (curChar & 077);
do
{
switch(jjstateSet[--i])
{
case 2:
if ((jjbitVec0[i2] & l2) != 0L)
{ jjAddStates(15, 17); }
break;
case 16:
if ((jjbitVec0[i2] & l2) != 0L)
{ jjAddStates(12, 14); }
break;
case 21:
if ((jjbitVec0[i2] & l2) != 0L)
{ jjAddStates(9, 11); }
break;
case 48:
if ((jjbitVec0[i2] & l2) != 0L)
{ jjAddStates(30, 32); }
break;
case 53:
if ((jjbitVec0[i2] & l2) != 0L)
{ jjCheckNAddTwoStates(53, 54); }
break;
case 55:
case 56:
if ((jjbitVec0[i2] & l2) != 0L)
{ jjCheckNAddTwoStates(56, 54); }
break;
default : break;
}
} while(i != startsAt);
}
if (kind != 0x7fffffff)
{
jjmatchedKind = kind;
jjmatchedPos = curPos;
kind = 0x7fffffff;
}
++curPos;
i = jjnewStateCnt;
jjnewStateCnt = startsAt;
startsAt = 59 - jjnewStateCnt;
if (i == startsAt)
return curPos;
try { curChar = input_stream.readChar(); }
catch(final java.io.IOException e) { return curPos; }
}
}
/** Token literal values. */
public static final String[] jjstrLiteralImages = {
"", null, null, null, null, null, null, null, null, null, null, null, "\53",
null, "\72", null, "\54", "\56", "\73", "\75", null, null, null, null, "\74", "\12",
null, "\50", "\51", "\173", "\175", null, null, 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 = {
28, 29, 34, 35, 38, 39, 14, 47, 52, 21, 23, 24, 16, 18, 19, 2,
3, 5, 43, 45, 8, 10, 11, 14, 30, 31, 14, 38, 39, 14, 48, 49,
51, 54, 55, 57, 12, 13, 32, 33, 36, 37, 40, 41,
};
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 TreeNetParserTokenManager(SimpleCharStream stream){
input_stream = stream;
}
/** Constructor. */
public TreeNetParserTokenManager (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 = 59; 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, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
};
static final long[] jjtoToken = {
0xffffffa21L,
};
static final long[] jjtoSkip = {
0x1eL,
};
static final long[] jjtoSpecial = {
0x0L,
};
static final long[] jjtoMore = {
0x0L,
};
protected SimpleCharStream input_stream;
private final int[] jjrounds = new int[59];
private final int[] jjstateSet = new int[2 * 59];
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