org.apache.cayenne.exp.parser.ExpressionParserTokenManager Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of cayenne-client-nodeps
Show all versions of cayenne-client-nodeps
Cayenne Object Persistence Framework
/* Generated By:JJTree&JavaCC: Do not edit this line. ExpressionParserTokenManager.java */
/*****************************************************************
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you may not use this file except in compliance
* with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* KIND, either express or implied. See the License for the
* specific language governing permissions and limitations
* under the License.
****************************************************************/
package org.apache.cayenne.exp.parser;
import java.io.*;
import java.util.*;
import java.math.*;
import org.apache.cayenne.exp.*;
public class ExpressionParserTokenManager implements ExpressionParserConstants
{
/** Holds the last value computed by a constant token. */
Object literalValue;
/** Holds the last string literal parsed. */
private StringBuffer stringBuffer;
/** Converts an escape sequence into a character value. */
private char escapeChar()
{
int ofs = image.length() - 1;
switch ( image.charAt(ofs) ) {
case 'n': return '\n';
case 'r': return '\r';
case 't': return '\t';
case 'b': return '\b';
case 'f': return '\f';
case '\\': return '\\';
case '\'': return '\'';
case '\"': return '\"';
}
// Otherwise, it's an octal number. Find the backslash and convert.
while ( image.charAt(--ofs) != '\\' )
{}
int value = 0;
while ( ++ofs < image.length() )
value = (value << 3) | (image.charAt(ofs) - '0');
return (char) value;
}
private Object makeInt()
{
Object result;
String s = image.toString();
int base = 10;
if ( s.charAt(0) == '0' )
base = (s.length() > 1 && (s.charAt(1) == 'x' || s.charAt(1) == 'X'))? 16 : 8;
if ( base == 16 )
s = s.substring(2); // Trim the 0x off the front
switch ( s.charAt(s.length()-1) ) {
case 'l': case 'L':
result = Long.valueOf( s.substring(0,s.length()-1), base );
break;
case 'h': case 'H':
result = new BigInteger( s.substring(0,s.length()-1), base );
break;
default:
result = Integer.valueOf( s, base );
break;
}
return result;
}
private Object makeFloat()
{
String s = image.toString();
switch ( s.charAt(s.length()-1) ) {
case 'f': case 'F':
return Float.valueOf( s );
case 'b': case 'B':
return new BigDecimal( s.substring(0,s.length()-1) );
case 'd': case 'D':
default:
return Double.valueOf( s );
}
}
public java.io.PrintStream debugStream = System.out;
public void setDebugStream(java.io.PrintStream ds) { debugStream = ds; }
private final int jjStopStringLiteralDfa_0(int pos, long active0)
{
switch (pos)
{
case 0:
if ((active0 & 0x604e006L) != 0L)
{
jjmatchedKind = 32;
return 36;
}
if ((active0 & 0x8L) != 0L)
{
jjmatchedKind = 32;
return 2;
}
return -1;
case 1:
if ((active0 & 0x8002L) != 0L)
return 36;
if ((active0 & 0x604600cL) != 0L)
{
jjmatchedKind = 32;
jjmatchedPos = 1;
return 36;
}
return -1;
case 2:
if ((active0 & 0xcL) != 0L)
return 36;
if ((active0 & 0x2046000L) != 0L)
{
jjmatchedKind = 32;
jjmatchedPos = 2;
return 36;
}
return -1;
case 3:
if ((active0 & 0x6000L) != 0L)
return 36;
if ((active0 & 0x40000L) != 0L)
{
if (jjmatchedPos != 3)
{
jjmatchedKind = 32;
jjmatchedPos = 3;
}
return 36;
}
return -1;
case 4:
if ((active0 & 0x44000L) != 0L)
{
jjmatchedKind = 32;
jjmatchedPos = 4;
return 36;
}
return -1;
case 5:
if ((active0 & 0x44000L) != 0L)
{
jjmatchedKind = 32;
jjmatchedPos = 5;
return 36;
}
return -1;
case 6:
if ((active0 & 0x40000L) != 0L)
return 36;
if ((active0 & 0x4000L) != 0L)
{
jjmatchedKind = 32;
jjmatchedPos = 6;
return 36;
}
return -1;
case 7:
if ((active0 & 0x4000L) != 0L)
{
jjmatchedKind = 32;
jjmatchedPos = 7;
return 36;
}
return -1;
case 8:
if ((active0 & 0x4000L) != 0L)
{
jjmatchedKind = 32;
jjmatchedPos = 8;
return 36;
}
return -1;
case 9:
if ((active0 & 0x4000L) != 0L)
{
jjmatchedKind = 32;
jjmatchedPos = 9;
return 36;
}
return -1;
case 10:
if ((active0 & 0x4000L) != 0L)
{
jjmatchedKind = 32;
jjmatchedPos = 10;
return 36;
}
return -1;
case 11:
if ((active0 & 0x4000L) != 0L)
{
jjmatchedKind = 32;
jjmatchedPos = 11;
return 36;
}
return -1;
case 12:
if ((active0 & 0x4000L) != 0L)
{
jjmatchedKind = 32;
jjmatchedPos = 12;
return 36;
}
return -1;
default :
return -1;
}
}
private final int jjStartNfa_0(int pos, long active0)
{
return jjMoveNfa_0(jjStopStringLiteralDfa_0(pos, active0), pos + 1);
}
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 33:
jjmatchedKind = 4;
return jjMoveStringLiteralDfa1_0(0x80L);
case 34:
return jjStopAtPos(0, 37);
case 36:
return jjStopAtPos(0, 24);
case 39:
return jjStopAtPos(0, 36);
case 40:
return jjStopAtPos(0, 16);
case 41:
return jjStopAtPos(0, 17);
case 42:
return jjStopAtPos(0, 22);
case 43:
return jjStopAtPos(0, 20);
case 44:
return jjStopAtPos(0, 19);
case 45:
return jjStopAtPos(0, 21);
case 47:
return jjStopAtPos(0, 23);
case 60:
jjmatchedKind = 10;
return jjMoveStringLiteralDfa1_0(0x300L);
case 61:
jjmatchedKind = 5;
return jjMoveStringLiteralDfa1_0(0x40L);
case 62:
jjmatchedKind = 11;
return jjMoveStringLiteralDfa1_0(0x1000L);
case 97:
return jjMoveStringLiteralDfa1_0(0x4L);
case 98:
return jjMoveStringLiteralDfa1_0(0x40000L);
case 100:
return jjMoveStringLiteralDfa1_0(0x4000000L);
case 105:
return jjMoveStringLiteralDfa1_0(0x8000L);
case 108:
return jjMoveStringLiteralDfa1_0(0x6000L);
case 110:
return jjMoveStringLiteralDfa1_0(0x8L);
case 111:
return jjMoveStringLiteralDfa1_0(0x2000002L);
default :
return jjMoveNfa_0(3, 0);
}
}
private final int jjMoveStringLiteralDfa1_0(long active0)
{
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_0(0, active0);
return 1;
}
switch(curChar)
{
case 61:
if ((active0 & 0x40L) != 0L)
return jjStopAtPos(1, 6);
else if ((active0 & 0x80L) != 0L)
return jjStopAtPos(1, 7);
else if ((active0 & 0x200L) != 0L)
return jjStopAtPos(1, 9);
else if ((active0 & 0x1000L) != 0L)
return jjStopAtPos(1, 12);
break;
case 62:
if ((active0 & 0x100L) != 0L)
return jjStopAtPos(1, 8);
break;
case 98:
return jjMoveStringLiteralDfa2_0(active0, 0x6000000L);
case 101:
return jjMoveStringLiteralDfa2_0(active0, 0x40000L);
case 105:
return jjMoveStringLiteralDfa2_0(active0, 0x6000L);
case 110:
if ((active0 & 0x8000L) != 0L)
return jjStartNfaWithStates_0(1, 15, 36);
return jjMoveStringLiteralDfa2_0(active0, 0x4L);
case 111:
return jjMoveStringLiteralDfa2_0(active0, 0x8L);
case 114:
if ((active0 & 0x2L) != 0L)
return jjStartNfaWithStates_0(1, 1, 36);
break;
default :
break;
}
return jjStartNfa_0(0, active0);
}
private final 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 58:
if ((active0 & 0x4000000L) != 0L)
return jjStopAtPos(2, 26);
break;
case 100:
if ((active0 & 0x4L) != 0L)
return jjStartNfaWithStates_0(2, 2, 36);
break;
case 106:
return jjMoveStringLiteralDfa3_0(active0, 0x2000000L);
case 107:
return jjMoveStringLiteralDfa3_0(active0, 0x6000L);
case 116:
if ((active0 & 0x8L) != 0L)
return jjStartNfaWithStates_0(2, 3, 36);
return jjMoveStringLiteralDfa3_0(active0, 0x40000L);
default :
break;
}
return jjStartNfa_0(1, active0);
}
private final 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 58:
if ((active0 & 0x2000000L) != 0L)
return jjStopAtPos(3, 25);
break;
case 101:
if ((active0 & 0x2000L) != 0L)
{
jjmatchedKind = 13;
jjmatchedPos = 3;
}
return jjMoveStringLiteralDfa4_0(active0, 0x4000L);
case 119:
return jjMoveStringLiteralDfa4_0(active0, 0x40000L);
default :
break;
}
return jjStartNfa_0(2, active0);
}
private final 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 73:
return jjMoveStringLiteralDfa5_0(active0, 0x4000L);
case 101:
return jjMoveStringLiteralDfa5_0(active0, 0x40000L);
default :
break;
}
return jjStartNfa_0(3, active0);
}
private final 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 101:
return jjMoveStringLiteralDfa6_0(active0, 0x40000L);
case 103:
return jjMoveStringLiteralDfa6_0(active0, 0x4000L);
default :
break;
}
return jjStartNfa_0(4, active0);
}
private final 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 110:
if ((active0 & 0x40000L) != 0L)
return jjStartNfaWithStates_0(6, 18, 36);
return jjMoveStringLiteralDfa7_0(active0, 0x4000L);
default :
break;
}
return jjStartNfa_0(5, active0);
}
private final 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 111:
return jjMoveStringLiteralDfa8_0(active0, 0x4000L);
default :
break;
}
return jjStartNfa_0(6, active0);
}
private final 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 114:
return jjMoveStringLiteralDfa9_0(active0, 0x4000L);
default :
break;
}
return jjStartNfa_0(7, active0);
}
private final 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 101:
return jjMoveStringLiteralDfa10_0(active0, 0x4000L);
default :
break;
}
return jjStartNfa_0(8, active0);
}
private final int jjMoveStringLiteralDfa10_0(long old0, long active0)
{
if (((active0 &= old0)) == 0L)
return jjStartNfa_0(8, old0);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_0(9, active0);
return 10;
}
switch(curChar)
{
case 67:
return jjMoveStringLiteralDfa11_0(active0, 0x4000L);
default :
break;
}
return jjStartNfa_0(9, active0);
}
private final int jjMoveStringLiteralDfa11_0(long old0, long active0)
{
if (((active0 &= old0)) == 0L)
return jjStartNfa_0(9, old0);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_0(10, active0);
return 11;
}
switch(curChar)
{
case 97:
return jjMoveStringLiteralDfa12_0(active0, 0x4000L);
default :
break;
}
return jjStartNfa_0(10, active0);
}
private final int jjMoveStringLiteralDfa12_0(long old0, long active0)
{
if (((active0 &= old0)) == 0L)
return jjStartNfa_0(10, old0);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_0(11, active0);
return 12;
}
switch(curChar)
{
case 115:
return jjMoveStringLiteralDfa13_0(active0, 0x4000L);
default :
break;
}
return jjStartNfa_0(11, active0);
}
private final int jjMoveStringLiteralDfa13_0(long old0, long active0)
{
if (((active0 &= old0)) == 0L)
return jjStartNfa_0(11, old0);
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) {
jjStopStringLiteralDfa_0(12, active0);
return 13;
}
switch(curChar)
{
case 101:
if ((active0 & 0x4000L) != 0L)
return jjStartNfaWithStates_0(13, 14, 36);
break;
default :
break;
}
return jjStartNfa_0(12, active0);
}
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 void jjCheckNAddStates(int start)
{
jjCheckNAdd(jjnextStates[start]);
jjCheckNAdd(jjnextStates[start + 1]);
}
private final int jjMoveNfa_0(int startState, int curPos)
{
int[] nextStates;
int startsAt = 0;
jjnewStateCnt = 36;
int i = 1;
jjstateSet[0] = startState;
int j, kind = 0x7fffffff;
for (;;)
{
if (++jjround == 0x7fffffff)
ReInitRounds();
if (curChar < 64)
{
long l = 1L << curChar;
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 3:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddStates(0, 5);
else if (curChar == 46)
jjCheckNAdd(12);
if ((0x3fe000000000000L & l) != 0L)
{
if (kind > 44)
kind = 44;
jjCheckNAddTwoStates(9, 10);
}
else if (curChar == 48)
{
if (kind > 44)
kind = 44;
jjCheckNAddStates(6, 8);
}
break;
case 36:
if ((0x3ff000000000000L & l) != 0L)
{
if (kind > 33)
kind = 33;
jjCheckNAdd(35);
}
else if (curChar == 46)
jjstateSet[jjnewStateCnt++] = 33;
if ((0x3ff000000000000L & l) != 0L)
{
if (kind > 32)
kind = 32;
jjCheckNAddTwoStates(31, 32);
}
break;
case 2:
if ((0x3ff000000000000L & l) != 0L)
{
if (kind > 33)
kind = 33;
jjCheckNAdd(35);
}
else if (curChar == 46)
jjstateSet[jjnewStateCnt++] = 33;
if ((0x3ff000000000000L & l) != 0L)
{
if (kind > 32)
kind = 32;
jjCheckNAddTwoStates(31, 32);
}
break;
case 8:
if ((0x3fe000000000000L & l) == 0L)
break;
if (kind > 44)
kind = 44;
jjCheckNAddTwoStates(9, 10);
break;
case 9:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 44)
kind = 44;
jjCheckNAddTwoStates(9, 10);
break;
case 11:
if (curChar == 46)
jjCheckNAdd(12);
break;
case 12:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 45)
kind = 45;
jjCheckNAddStates(9, 11);
break;
case 14:
if ((0x280000000000L & l) != 0L)
jjCheckNAdd(15);
break;
case 15:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 45)
kind = 45;
jjCheckNAddTwoStates(15, 16);
break;
case 17:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddStates(0, 5);
break;
case 18:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(18, 19);
break;
case 19:
if (curChar != 46)
break;
if (kind > 45)
kind = 45;
jjCheckNAddStates(12, 14);
break;
case 20:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 45)
kind = 45;
jjCheckNAddStates(12, 14);
break;
case 21:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(21, 22);
break;
case 23:
if ((0x280000000000L & l) != 0L)
jjCheckNAdd(24);
break;
case 24:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 45)
kind = 45;
jjCheckNAddTwoStates(24, 16);
break;
case 25:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(25, 16);
break;
case 26:
if (curChar != 48)
break;
if (kind > 44)
kind = 44;
jjCheckNAddStates(6, 8);
break;
case 27:
if ((0xff000000000000L & l) == 0L)
break;
if (kind > 44)
kind = 44;
jjCheckNAddTwoStates(27, 10);
break;
case 29:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 44)
kind = 44;
jjCheckNAddTwoStates(29, 10);
break;
case 31:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 32)
kind = 32;
jjCheckNAddTwoStates(31, 32);
break;
case 32:
if (curChar == 46)
jjstateSet[jjnewStateCnt++] = 33;
break;
case 34:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 32)
kind = 32;
jjCheckNAddTwoStates(32, 34);
break;
case 35:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 33)
kind = 33;
jjCheckNAdd(35);
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 3:
if ((0x7fffffe87fffffeL & l) != 0L)
{
if (kind > 32)
kind = 32;
jjCheckNAddStates(15, 17);
}
if (curChar == 78)
jjstateSet[jjnewStateCnt++] = 6;
else if (curChar == 110)
jjstateSet[jjnewStateCnt++] = 2;
break;
case 36:
if ((0x7fffffe87fffffeL & l) != 0L)
{
if (kind > 33)
kind = 33;
jjCheckNAdd(35);
}
if ((0x7fffffe87fffffeL & l) != 0L)
{
if (kind > 32)
kind = 32;
jjCheckNAddTwoStates(31, 32);
}
break;
case 2:
if ((0x7fffffe87fffffeL & l) != 0L)
{
if (kind > 33)
kind = 33;
jjCheckNAdd(35);
}
if ((0x7fffffe87fffffeL & l) != 0L)
{
if (kind > 32)
kind = 32;
jjCheckNAddTwoStates(31, 32);
}
if (curChar == 117)
jjstateSet[jjnewStateCnt++] = 1;
break;
case 0:
if (curChar == 108 && kind > 31)
kind = 31;
break;
case 1:
if (curChar == 108)
jjstateSet[jjnewStateCnt++] = 0;
break;
case 4:
if (curChar == 76 && kind > 31)
kind = 31;
break;
case 5:
if (curChar == 76)
jjstateSet[jjnewStateCnt++] = 4;
break;
case 6:
if (curChar == 85)
jjstateSet[jjnewStateCnt++] = 5;
break;
case 7:
if (curChar == 78)
jjstateSet[jjnewStateCnt++] = 6;
break;
case 10:
if ((0x110000001100L & l) != 0L && kind > 44)
kind = 44;
break;
case 13:
if ((0x2000000020L & l) != 0L)
jjAddStates(18, 19);
break;
case 16:
if ((0x5400000054L & l) != 0L && kind > 45)
kind = 45;
break;
case 22:
if ((0x2000000020L & l) != 0L)
jjAddStates(20, 21);
break;
case 28:
if ((0x100000001000000L & l) != 0L)
jjCheckNAdd(29);
break;
case 29:
if ((0x7e0000007eL & l) == 0L)
break;
if (kind > 44)
kind = 44;
jjCheckNAddTwoStates(29, 10);
break;
case 30:
if ((0x7fffffe87fffffeL & l) == 0L)
break;
if (kind > 32)
kind = 32;
jjCheckNAddStates(15, 17);
break;
case 31:
if ((0x7fffffe87fffffeL & l) == 0L)
break;
if (kind > 32)
kind = 32;
jjCheckNAddTwoStates(31, 32);
break;
case 33:
case 34:
if ((0x7fffffe87fffffeL & l) == 0L)
break;
if (kind > 32)
kind = 32;
jjCheckNAddTwoStates(32, 34);
break;
case 35:
if ((0x7fffffe87fffffeL & l) == 0L)
break;
if (kind > 33)
kind = 33;
jjCheckNAdd(35);
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);
MatchLoop: do
{
switch(jjstateSet[--i])
{
default : break;
}
} while(i != startsAt);
}
if (kind != 0x7fffffff)
{
jjmatchedKind = kind;
jjmatchedPos = curPos;
kind = 0x7fffffff;
}
++curPos;
if ((i = jjnewStateCnt) == (startsAt = 36 - (jjnewStateCnt = startsAt)))
return curPos;
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) { return curPos; }
}
}
private final int jjStopStringLiteralDfa_1(int pos, long active0)
{
switch (pos)
{
default :
return -1;
}
}
private final int jjStartNfa_1(int pos, long active0)
{
return jjMoveNfa_1(jjStopStringLiteralDfa_1(pos, active0), pos + 1);
}
private final int jjStartNfaWithStates_1(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_1(state, pos + 1);
}
private final int jjMoveStringLiteralDfa0_1()
{
switch(curChar)
{
case 39:
return jjStopAtPos(0, 40);
default :
return jjMoveNfa_1(0, 0);
}
}
static final long[] jjbitVec0 = {
0xfffffffffffffffeL, 0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffffffffffffffL
};
static final long[] jjbitVec2 = {
0x0L, 0x0L, 0xffffffffffffffffL, 0xffffffffffffffffL
};
private final int jjMoveNfa_1(int startState, int curPos)
{
int[] nextStates;
int startsAt = 0;
jjnewStateCnt = 6;
int i = 1;
jjstateSet[0] = startState;
int j, kind = 0x7fffffff;
for (;;)
{
if (++jjround == 0x7fffffff)
ReInitRounds();
if (curChar < 64)
{
long l = 1L << curChar;
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 0:
if ((0xffffff7fffffffffL & l) != 0L && kind > 39)
kind = 39;
break;
case 1:
if ((0x8400000000L & l) != 0L && kind > 38)
kind = 38;
break;
case 2:
if ((0xf000000000000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 3;
break;
case 3:
if ((0xff000000000000L & l) == 0L)
break;
if (kind > 38)
kind = 38;
jjstateSet[jjnewStateCnt++] = 4;
break;
case 4:
if ((0xff000000000000L & l) != 0L && kind > 38)
kind = 38;
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 0:
if ((0xffffffffefffffffL & l) != 0L)
{
if (kind > 39)
kind = 39;
}
else if (curChar == 92)
jjAddStates(22, 24);
break;
case 1:
if ((0x14404510000000L & l) != 0L && kind > 38)
kind = 38;
break;
case 5:
if ((0xffffffffefffffffL & l) != 0L && kind > 39)
kind = 39;
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);
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 0:
if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 39)
kind = 39;
break;
default : break;
}
} while(i != startsAt);
}
if (kind != 0x7fffffff)
{
jjmatchedKind = kind;
jjmatchedPos = curPos;
kind = 0x7fffffff;
}
++curPos;
if ((i = jjnewStateCnt) == (startsAt = 6 - (jjnewStateCnt = startsAt)))
return curPos;
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) { return curPos; }
}
}
private final int jjStopStringLiteralDfa_2(int pos, long active0)
{
switch (pos)
{
default :
return -1;
}
}
private final int jjStartNfa_2(int pos, long active0)
{
return jjMoveNfa_2(jjStopStringLiteralDfa_2(pos, active0), pos + 1);
}
private final int jjStartNfaWithStates_2(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_2(state, pos + 1);
}
private final int jjMoveStringLiteralDfa0_2()
{
switch(curChar)
{
case 34:
return jjStopAtPos(0, 43);
default :
return jjMoveNfa_2(0, 0);
}
}
private final int jjMoveNfa_2(int startState, int curPos)
{
int[] nextStates;
int startsAt = 0;
jjnewStateCnt = 6;
int i = 1;
jjstateSet[0] = startState;
int j, kind = 0x7fffffff;
for (;;)
{
if (++jjround == 0x7fffffff)
ReInitRounds();
if (curChar < 64)
{
long l = 1L << curChar;
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 0:
if ((0xfffffffbffffffffL & l) != 0L && kind > 42)
kind = 42;
break;
case 1:
if ((0x8400000000L & l) != 0L && kind > 41)
kind = 41;
break;
case 2:
if ((0xf000000000000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 3;
break;
case 3:
if ((0xff000000000000L & l) == 0L)
break;
if (kind > 41)
kind = 41;
jjstateSet[jjnewStateCnt++] = 4;
break;
case 4:
if ((0xff000000000000L & l) != 0L && kind > 41)
kind = 41;
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 0:
if ((0xffffffffefffffffL & l) != 0L)
{
if (kind > 42)
kind = 42;
}
else if (curChar == 92)
jjAddStates(22, 24);
break;
case 1:
if ((0x14404510000000L & l) != 0L && kind > 41)
kind = 41;
break;
case 5:
if ((0xffffffffefffffffL & l) != 0L && kind > 42)
kind = 42;
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);
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 0:
if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 42)
kind = 42;
break;
default : break;
}
} while(i != startsAt);
}
if (kind != 0x7fffffff)
{
jjmatchedKind = kind;
jjmatchedPos = curPos;
kind = 0x7fffffff;
}
++curPos;
if ((i = jjnewStateCnt) == (startsAt = 6 - (jjnewStateCnt = startsAt)))
return curPos;
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) { return curPos; }
}
}
static final int[] jjnextStates = {
18, 19, 21, 22, 25, 16, 27, 28, 10, 12, 13, 16, 20, 13, 16, 31,
32, 35, 14, 15, 23, 24, 1, 2, 3,
};
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;
}
}
public static final String[] jjstrLiteralImages = {
"", "\157\162", "\141\156\144", "\156\157\164", "\41", "\75", "\75\75",
"\41\75", "\74\76", "\74\75", "\74", "\76", "\76\75", "\154\151\153\145",
"\154\151\153\145\111\147\156\157\162\145\103\141\163\145", "\151\156", "\50", "\51", "\142\145\164\167\145\145\156", "\54", "\53", "\55",
"\52", "\57", "\44", "\157\142\152\72", "\144\142\72", null, null, null, null, null,
null, null, null, null, null, null, null, null, null, null, null, null, null, null,
null, null, null, null, };
public static final String[] lexStateNames = {
"DEFAULT",
"WithinSingleQuoteLiteral",
"WithinDoubleQuoteLiteral",
};
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, 1, 2, -1, -1, 0, -1, -1, 0, -1, -1, -1, -1, -1, -1,
};
static final long[] jjtoToken = {
0x390387ffffffL,
};
static final long[] jjtoSkip = {
0x78000000L,
};
static final long[] jjtoMore = {
0x6f000000000L,
};
protected JavaCharStream input_stream;
private final int[] jjrounds = new int[36];
private final int[] jjstateSet = new int[72];
StringBuffer image;
int jjimageLen;
int lengthOfMatch;
protected char curChar;
public ExpressionParserTokenManager(JavaCharStream stream)
{
if (JavaCharStream.staticFlag)
throw new Error("ERROR: Cannot use a static CharStream class with a non-static lexical analyzer.");
input_stream = stream;
}
public ExpressionParserTokenManager(JavaCharStream stream, int lexState)
{
this(stream);
SwitchTo(lexState);
}
public void ReInit(JavaCharStream stream)
{
jjmatchedPos = jjnewStateCnt = 0;
curLexState = defaultLexState;
input_stream = stream;
ReInitRounds();
}
private final void ReInitRounds()
{
int i;
jjround = 0x80000001;
for (i = 36; i-- > 0;)
jjrounds[i] = 0x80000000;
}
public void ReInit(JavaCharStream stream, int lexState)
{
ReInit(stream);
SwitchTo(lexState);
}
public void SwitchTo(int lexState)
{
if (lexState >= 3 || lexState < 0)
throw new TokenMgrError("Error: Ignoring invalid lexical state : " + lexState + ". State unchanged.", TokenMgrError.INVALID_LEXICAL_STATE);
else
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()
{
int kind;
Token specialToken = null;
Token matchedToken;
int curPos = 0;
EOFLoop :
for (;;)
{
try
{
curChar = input_stream.BeginToken();
}
catch(java.io.IOException e)
{
jjmatchedKind = 0;
matchedToken = jjFillToken();
return matchedToken;
}
image = null;
jjimageLen = 0;
for (;;)
{
switch(curLexState)
{
case 0:
try { input_stream.backup(0);
while (curChar <= 32 && (0x100002600L & (1L << curChar)) != 0L)
curChar = input_stream.BeginToken();
}
catch (java.io.IOException e1) { continue EOFLoop; }
jjmatchedKind = 0x7fffffff;
jjmatchedPos = 0;
curPos = jjMoveStringLiteralDfa0_0();
break;
case 1:
jjmatchedKind = 0x7fffffff;
jjmatchedPos = 0;
curPos = jjMoveStringLiteralDfa0_1();
break;
case 2:
jjmatchedKind = 0x7fffffff;
jjmatchedPos = 0;
curPos = jjMoveStringLiteralDfa0_2();
break;
}
if (jjmatchedKind != 0x7fffffff)
{
if (jjmatchedPos + 1 < curPos)
input_stream.backup(curPos - jjmatchedPos - 1);
if ((jjtoToken[jjmatchedKind >> 6] & (1L << (jjmatchedKind & 077))) != 0L)
{
matchedToken = jjFillToken();
TokenLexicalActions(matchedToken);
if (jjnewLexState[jjmatchedKind] != -1)
curLexState = jjnewLexState[jjmatchedKind];
return matchedToken;
}
else if ((jjtoSkip[jjmatchedKind >> 6] & (1L << (jjmatchedKind & 077))) != 0L)
{
if (jjnewLexState[jjmatchedKind] != -1)
curLexState = jjnewLexState[jjmatchedKind];
continue EOFLoop;
}
MoreLexicalActions();
if (jjnewLexState[jjmatchedKind] != -1)
curLexState = jjnewLexState[jjmatchedKind];
curPos = 0;
jjmatchedKind = 0x7fffffff;
try {
curChar = input_stream.readChar();
continue;
}
catch (java.io.IOException e1) { }
}
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 MoreLexicalActions()
{
jjimageLen += (lengthOfMatch = jjmatchedPos + 1);
switch(jjmatchedKind)
{
case 36 :
if (image == null)
image = new StringBuffer(new String(input_stream.GetSuffix(jjimageLen)));
else
image.append(input_stream.GetSuffix(jjimageLen));
jjimageLen = 0;
stringBuffer = new StringBuffer();
break;
case 37 :
if (image == null)
image = new StringBuffer(new String(input_stream.GetSuffix(jjimageLen)));
else
image.append(input_stream.GetSuffix(jjimageLen));
jjimageLen = 0;
stringBuffer = new StringBuffer();
break;
case 38 :
if (image == null)
image = new StringBuffer(new String(input_stream.GetSuffix(jjimageLen)));
else
image.append(input_stream.GetSuffix(jjimageLen));
jjimageLen = 0;
stringBuffer.append( escapeChar() );
break;
case 39 :
if (image == null)
image = new StringBuffer(new String(input_stream.GetSuffix(jjimageLen)));
else
image.append(input_stream.GetSuffix(jjimageLen));
jjimageLen = 0;
stringBuffer.append( image.charAt(image.length()-1) );
break;
case 41 :
if (image == null)
image = new StringBuffer(new String(input_stream.GetSuffix(jjimageLen)));
else
image.append(input_stream.GetSuffix(jjimageLen));
jjimageLen = 0;
stringBuffer.append( escapeChar() );
break;
case 42 :
if (image == null)
image = new StringBuffer(new String(input_stream.GetSuffix(jjimageLen)));
else
image.append(input_stream.GetSuffix(jjimageLen));
jjimageLen = 0;
stringBuffer.append( image.charAt(image.length()-1) );
break;
default :
break;
}
}
void TokenLexicalActions(Token matchedToken)
{
switch(jjmatchedKind)
{
case 40 :
if (image == null)
image = new StringBuffer(new String(input_stream.GetSuffix(jjimageLen + (lengthOfMatch = jjmatchedPos + 1))));
else
image.append(input_stream.GetSuffix(jjimageLen + (lengthOfMatch = jjmatchedPos + 1)));
literalValue = stringBuffer.toString();
break;
case 43 :
if (image == null)
image = new StringBuffer(new String(input_stream.GetSuffix(jjimageLen + (lengthOfMatch = jjmatchedPos + 1))));
else
image.append(input_stream.GetSuffix(jjimageLen + (lengthOfMatch = jjmatchedPos + 1)));
literalValue = stringBuffer.toString();
break;
case 44 :
if (image == null)
image = new StringBuffer(new String(input_stream.GetSuffix(jjimageLen + (lengthOfMatch = jjmatchedPos + 1))));
else
image.append(input_stream.GetSuffix(jjimageLen + (lengthOfMatch = jjmatchedPos + 1)));
literalValue = makeInt();
break;
case 45 :
if (image == null)
image = new StringBuffer(new String(input_stream.GetSuffix(jjimageLen + (lengthOfMatch = jjmatchedPos + 1))));
else
image.append(input_stream.GetSuffix(jjimageLen + (lengthOfMatch = jjmatchedPos + 1)));
literalValue = makeFloat();
break;
default :
break;
}
}
}
© 2015 - 2024 Weber Informatics LLC | Privacy Policy