/* Generated By:JavaCC: Do not edit this line. MaturityParserTokenManager.java */
/*
This file is part of the software framework JStatCom,
a library for building applications for data based analysis.
Copyright (C) 2000-2005 Markus Kraetzig
This library is free software; you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as
published by the Free Software Foundation; either version 2.1 of the
License, or (at your option) any later version.
This library is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
USA
*/
package com.jstatcom.parser;
public class MaturityParserTokenManager implements MaturityParserConstants {
public java.io.PrintStream debugStream = System.out;
public void setDebugStream(java.io.PrintStream ds) {
debugStream = ds;
}
private final int jjStopAtPos(int pos, int kind) {
jjmatchedKind = kind;
jjmatchedPos = pos;
return pos + 1;
}
private final 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);
}
private final int jjMoveStringLiteralDfa0_0() {
switch (curChar) {
case 10:
return jjStopAtPos(0, 4);
case 32:
return jjStartNfaWithStates_0(0, 1, 32);
default:
return jjMoveNfa_0(27, 0);
}
}
private final void jjCheckNAdd(int state) {
if (jjrounds[state] != jjround) {
jjstateSet[jjnewStateCnt++] = state;
jjrounds[state] = jjround;
}
}
private final void jjAddStates(int start, int end) {
do {
jjstateSet[jjnewStateCnt++] = jjnextStates[start];
} while (start++ != end);
}
private final void jjCheckNAddTwoStates(int state1, int state2) {
jjCheckNAdd(state1);
jjCheckNAdd(state2);
}
private final void jjCheckNAddStates(int start, int end) {
do {
jjCheckNAdd(jjnextStates[start]);
} while (start++ != end);
}
private final int jjMoveNfa_0(int startState, int curPos) {
int startsAt = 0;
jjnewStateCnt = 32;
int i = 1;
jjstateSet[0] = startState;
int kind = 0x7fffffff;
for (;;) {
if (++jjround == 0x7fffffff)
ReInitRounds();
if (curChar < 64) {
long l = 1L << curChar;
MatchLoop: do {
switch (jjstateSet[--i]) {
case 32:
if (curChar == 32)
jjCheckNAddTwoStates(30, 1);
if (curChar == 32)
jjCheckNAddTwoStates(29, 9);
if (curChar == 32)
jjCheckNAddTwoStates(28, 21);
break;
case 27:
if ((0x3ff000000000000L & l) != 0L) {
if (kind > 8)
kind = 8;
jjCheckNAdd(0);
} else if (curChar == 32)
jjCheckNAddStates(0, 5);
else if (curChar == 45)
jjCheckNAddStates(0, 5);
break;
case 0:
if ((0x3ff000000000000L & l) == 0L)
break;
kind = 8;
jjCheckNAdd(0);
break;
case 28:
if (curChar == 32)
jjCheckNAddTwoStates(28, 21);
break;
case 29:
if (curChar == 32)
jjCheckNAddTwoStates(29, 9);
break;
case 30:
if (curChar == 32)
jjCheckNAddTwoStates(30, 1);
break;
case 31:
if (curChar == 32)
jjCheckNAddStates(0, 5);
break;
default:
break;
}
} while (i != startsAt);
} else if (curChar < 128) {
long l = 1L << (curChar & 077);
MatchLoop: do {
switch (jjstateSet[--i]) {
case 32:
if ((0x1000000010L & l) != 0L) {
if (kind > 5)
kind = 5;
jjAddStates(6, 7);
} else if ((0x200000002000L & l) != 0L) {
if (kind > 6)
kind = 6;
jjAddStates(8, 11);
} else if ((0x200000002000000L & l) != 0L) {
if (kind > 7)
kind = 7;
jjCheckNAddStates(12, 14);
}
break;
case 27:
if ((0x1000000010L & l) != 0L) {
if (kind > 5)
kind = 5;
jjAddStates(6, 7);
} else if ((0x200000002000L & l) != 0L) {
if (kind > 6)
kind = 6;
jjAddStates(8, 11);
} else if ((0x200000002000000L & l) != 0L) {
if (kind > 7)
kind = 7;
jjCheckNAddStates(12, 14);
}
break;
case 1:
if ((0x200000002000000L & l) == 0L)
break;
if (kind > 7)
kind = 7;
jjCheckNAddStates(12, 14);
break;
case 2:
if ((0x4000000040000L & l) != 0L && kind > 7)
kind = 7;
break;
case 3:
if ((0x2000000020L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 4;
break;
case 4:
if ((0x200000002L & l) != 0L)
jjCheckNAdd(2);
break;
case 5:
if ((0x2000000020L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 6;
break;
case 6:
if ((0x200000002L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 7;
break;
case 7:
if ((0x4000000040000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 8;
break;
case 8:
if ((0x8000000080000L & l) != 0L && kind > 7)
kind = 7;
break;
case 9:
if ((0x200000002000L & l) == 0L)
break;
kind = 6;
jjAddStates(8, 11);
break;
case 10:
if ((0x10000000100000L & l) != 0L && kind > 6)
kind = 6;
break;
case 11:
case 15:
if ((0x10000000100000L & l) != 0L)
jjCheckNAdd(12);
break;
case 12:
if ((0x10000000100L & l) != 0L && kind > 6)
kind = 6;
break;
case 13:
if ((0x800000008000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 14;
break;
case 14:
if ((0x400000004000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 15;
break;
case 16:
if ((0x800000008000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 17;
break;
case 17:
if ((0x400000004000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 18;
break;
case 18:
if ((0x10000000100000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 19;
break;
case 19:
if ((0x10000000100L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 20;
break;
case 20:
if ((0x8000000080000L & l) != 0L && kind > 6)
kind = 6;
break;
case 21:
if ((0x1000000010L & l) == 0L)
break;
kind = 5;
jjAddStates(6, 7);
break;
case 22:
if ((0x200000002L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 23;
break;
case 23:
if ((0x200000002000000L & l) != 0L && kind > 5)
kind = 5;
break;
case 24:
if ((0x200000002L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 25;
break;
case 25:
if ((0x200000002000000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 26;
break;
case 26:
if ((0x8000000080000L & l) != 0L && kind > 5)
kind = 5;
break;
default:
break;
}
} while (i != startsAt);
} else {
MatchLoop: do {
switch (jjstateSet[--i]) {
default:
break;
}
} while (i != startsAt);
}
if (kind != 0x7fffffff) {
jjmatchedKind = kind;
jjmatchedPos = curPos;
kind = 0x7fffffff;
}
++curPos;
if ((i = jjnewStateCnt) == (startsAt = 32 - (jjnewStateCnt = startsAt)))
return curPos;
try {
curChar = input_stream.readChar();
} catch (java.io.IOException e) {
return curPos;
}
}
}
static final int[] jjnextStates = { 28, 29, 30, 1, 9, 21, 22, 24, 10, 11,
13, 16, 2, 3, 5, };
public static final String[] jjstrLiteralImages = { "", null, null, null,
"\12", null, null, null, null, null, };
public static final String[] lexStateNames = { "DEFAULT", };
static final long[] jjtoToken = { 0x1f1L, };
static final long[] jjtoSkip = { 0xeL, };
protected SimpleCharStream input_stream;
private final int[] jjrounds = new int[32];
private final int[] jjstateSet = new int[64];
protected char curChar;
public MaturityParserTokenManager(SimpleCharStream stream) {
if (SimpleCharStream.staticFlag)
throw new Error(
"ERROR: Cannot use a static CharStream class with a non-static lexical analyzer.");
input_stream = stream;
}
public MaturityParserTokenManager(SimpleCharStream stream, int lexState) {
this(stream);
SwitchTo(lexState);
}
public void ReInit(SimpleCharStream stream) {
jjmatchedPos = jjnewStateCnt = 0;
curLexState = defaultLexState;
input_stream = stream;
ReInitRounds();
}
private final void ReInitRounds() {
int i;
jjround = 0x80000001;
for (i = 32; i-- > 0;)
jjrounds[i] = 0x80000000;
}
public void ReInit(SimpleCharStream stream, int lexState) {
ReInit(stream);
SwitchTo(lexState);
}
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);
curLexState = lexState;
}
protected Token jjFillToken() {
Token t = Token.newToken(jjmatchedKind);
t.kind = jjmatchedKind;
String im = jjstrLiteralImages[jjmatchedKind];
t.image = (im == null) ? input_stream.GetImage() : im;
t.beginLine = input_stream.getBeginLine();
t.beginColumn = input_stream.getBeginColumn();
t.endLine = input_stream.getEndLine();
t.endColumn = input_stream.getEndColumn();
return t;
}
int curLexState = 0;
int defaultLexState = 0;
int jjnewStateCnt;
int jjround;
int jjmatchedPos;
int jjmatchedKind;
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;
}
try {
input_stream.backup(0);
while (curChar <= 13 && (0x2200L & (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();
return 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);
}
}
}
Ads help maintain this website.