Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $
You can buy this project and download/modify it how often you want.
org.apache.activemq.protobuf.compiler.parser.ProtoParserTokenManager Maven / Gradle / Ivy
/* Generated By:JavaCC: Do not edit this line. ProtoParserTokenManager.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.activemq.protobuf.compiler.parser;
import org.apache.activemq.protobuf.compiler.*;
import java.util.LinkedHashMap;
import java.util.ArrayList;
import java.util.Hashtable;
import java.util.Iterator;
import java.io.File;
import java.io.FileReader;
import java.io.FileNotFoundException;
import java.io.IOException;
public class ProtoParserTokenManager implements ProtoParserConstants
{
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 & 0xffff00L) != 0L)
{
jjmatchedKind = 41;
return 22;
}
if ((active0 & 0x100000000L) != 0L)
return 4;
return -1;
case 1:
if ((active0 & 0x400000L) != 0L)
return 22;
if ((active0 & 0xbfff00L) != 0L)
{
jjmatchedKind = 41;
jjmatchedPos = 1;
return 22;
}
return -1;
case 2:
if ((active0 & 0x800800L) != 0L)
return 22;
if ((active0 & 0x3ff700L) != 0L)
{
jjmatchedKind = 41;
jjmatchedPos = 2;
return 22;
}
return -1;
case 3:
if ((active0 & 0x10000L) != 0L)
return 22;
if ((active0 & 0x3ef700L) != 0L)
{
jjmatchedKind = 41;
jjmatchedPos = 3;
return 22;
}
return -1;
case 4:
if ((active0 & 0x20000L) != 0L)
return 22;
if ((active0 & 0x3cf700L) != 0L)
{
jjmatchedKind = 41;
jjmatchedPos = 4;
return 22;
}
return -1;
case 5:
if ((active0 & 0x89100L) != 0L)
return 22;
if ((active0 & 0x346600L) != 0L)
{
if (jjmatchedPos != 5)
{
jjmatchedKind = 41;
jjmatchedPos = 5;
}
return 22;
}
return -1;
case 6:
if ((active0 & 0x202600L) != 0L)
return 22;
if ((active0 & 0x1c4000L) != 0L)
{
jjmatchedKind = 41;
jjmatchedPos = 6;
return 22;
}
return -1;
case 7:
if ((active0 & 0x1c0000L) != 0L)
return 22;
if ((active0 & 0x4000L) != 0L)
{
jjmatchedKind = 41;
jjmatchedPos = 7;
return 22;
}
return -1;
case 8:
if ((active0 & 0x4000L) != 0L)
{
jjmatchedKind = 41;
jjmatchedPos = 8;
return 22;
}
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 40:
return jjStopAtPos(0, 30);
case 41:
return jjStopAtPos(0, 31);
case 44:
return jjStopAtPos(0, 33);
case 46:
return jjStartNfaWithStates_0(0, 32, 4);
case 47:
return jjMoveStringLiteralDfa1_0(0x20L);
case 59:
return jjStopAtPos(0, 27);
case 61:
return jjStopAtPos(0, 26);
case 91:
return jjStopAtPos(0, 28);
case 93:
return jjStopAtPos(0, 29);
case 101:
return jjMoveStringLiteralDfa1_0(0x1c000L);
case 103:
return jjMoveStringLiteralDfa1_0(0x20000L);
case 105:
return jjMoveStringLiteralDfa1_0(0x100L);
case 109:
return jjMoveStringLiteralDfa1_0(0x802000L);
case 111:
return jjMoveStringLiteralDfa1_0(0x81000L);
case 112:
return jjMoveStringLiteralDfa1_0(0x200L);
case 114:
return jjMoveStringLiteralDfa1_0(0x340800L);
case 115:
return jjMoveStringLiteralDfa1_0(0x400L);
case 116:
return jjMoveStringLiteralDfa1_0(0x400000L);
case 123:
return jjStopAtPos(0, 24);
case 125:
return jjStopAtPos(0, 25);
default :
return jjMoveNfa_0(9, 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 47:
if ((active0 & 0x20L) != 0L)
return jjStopAtPos(1, 5);
break;
case 97:
return jjMoveStringLiteralDfa2_0(active0, 0x800200L);
case 101:
return jjMoveStringLiteralDfa2_0(active0, 0x342400L);
case 109:
return jjMoveStringLiteralDfa2_0(active0, 0x100L);
case 110:
return jjMoveStringLiteralDfa2_0(active0, 0x10000L);
case 111:
if ((active0 & 0x400000L) != 0L)
return jjStartNfaWithStates_0(1, 22, 22);
break;
case 112:
return jjMoveStringLiteralDfa2_0(active0, 0x81800L);
case 114:
return jjMoveStringLiteralDfa2_0(active0, 0x20000L);
case 120:
return jjMoveStringLiteralDfa2_0(active0, 0xc000L);
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 99:
if ((active0 & 0x800L) != 0L)
return jjStartNfaWithStates_0(2, 11, 22);
return jjMoveStringLiteralDfa3_0(active0, 0x200L);
case 111:
return jjMoveStringLiteralDfa3_0(active0, 0x20000L);
case 112:
return jjMoveStringLiteralDfa3_0(active0, 0x100100L);
case 113:
return jjMoveStringLiteralDfa3_0(active0, 0x40000L);
case 114:
return jjMoveStringLiteralDfa3_0(active0, 0x400L);
case 115:
return jjMoveStringLiteralDfa3_0(active0, 0x2000L);
case 116:
return jjMoveStringLiteralDfa3_0(active0, 0x28d000L);
case 117:
return jjMoveStringLiteralDfa3_0(active0, 0x10000L);
case 120:
if ((active0 & 0x800000L) != 0L)
return jjStartNfaWithStates_0(2, 23, 22);
break;
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 101:
return jjMoveStringLiteralDfa4_0(active0, 0x10c000L);
case 105:
return jjMoveStringLiteralDfa4_0(active0, 0x81000L);
case 107:
return jjMoveStringLiteralDfa4_0(active0, 0x200L);
case 109:
if ((active0 & 0x10000L) != 0L)
return jjStartNfaWithStates_0(3, 16, 22);
break;
case 111:
return jjMoveStringLiteralDfa4_0(active0, 0x100L);
case 115:
return jjMoveStringLiteralDfa4_0(active0, 0x2000L);
case 117:
return jjMoveStringLiteralDfa4_0(active0, 0x260000L);
case 118:
return jjMoveStringLiteralDfa4_0(active0, 0x400L);
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 97:
return jjMoveStringLiteralDfa5_0(active0, 0x102200L);
case 105:
return jjMoveStringLiteralDfa5_0(active0, 0x40400L);
case 110:
return jjMoveStringLiteralDfa5_0(active0, 0xc000L);
case 111:
return jjMoveStringLiteralDfa5_0(active0, 0x81000L);
case 112:
if ((active0 & 0x20000L) != 0L)
return jjStartNfaWithStates_0(4, 17, 22);
break;
case 114:
return jjMoveStringLiteralDfa5_0(active0, 0x200100L);
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 99:
return jjMoveStringLiteralDfa6_0(active0, 0x400L);
case 100:
if ((active0 & 0x8000L) != 0L)
return jjStartNfaWithStates_0(5, 15, 22);
break;
case 103:
return jjMoveStringLiteralDfa6_0(active0, 0x2200L);
case 110:
if ((active0 & 0x1000L) != 0L)
{
jjmatchedKind = 12;
jjmatchedPos = 5;
}
return jjMoveStringLiteralDfa6_0(active0, 0x280000L);
case 114:
return jjMoveStringLiteralDfa6_0(active0, 0x40000L);
case 115:
return jjMoveStringLiteralDfa6_0(active0, 0x4000L);
case 116:
if ((active0 & 0x100L) != 0L)
return jjStartNfaWithStates_0(5, 8, 22);
return jjMoveStringLiteralDfa6_0(active0, 0x100000L);
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 97:
return jjMoveStringLiteralDfa7_0(active0, 0x80000L);
case 101:
if ((active0 & 0x200L) != 0L)
return jjStartNfaWithStates_0(6, 9, 22);
else if ((active0 & 0x400L) != 0L)
return jjStartNfaWithStates_0(6, 10, 22);
else if ((active0 & 0x2000L) != 0L)
return jjStartNfaWithStates_0(6, 13, 22);
return jjMoveStringLiteralDfa7_0(active0, 0x140000L);
case 105:
return jjMoveStringLiteralDfa7_0(active0, 0x4000L);
case 115:
if ((active0 & 0x200000L) != 0L)
return jjStartNfaWithStates_0(6, 21, 22);
break;
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 100:
if ((active0 & 0x40000L) != 0L)
return jjStartNfaWithStates_0(7, 18, 22);
else if ((active0 & 0x100000L) != 0L)
return jjStartNfaWithStates_0(7, 20, 22);
break;
case 108:
if ((active0 & 0x80000L) != 0L)
return jjStartNfaWithStates_0(7, 19, 22);
break;
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 110:
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 115:
if ((active0 & 0x4000L) != 0L)
return jjStartNfaWithStates_0(9, 14, 22);
break;
default :
break;
}
return jjStartNfa_0(8, 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]);
}
static final long[] jjbitVec0 = {
0x0L, 0x0L, 0xffffffffffffffffL, 0xffffffffffffffffL
};
private final int jjMoveNfa_0(int startState, int curPos)
{
int[] nextStates;
int startsAt = 0;
jjnewStateCnt = 43;
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 9:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddStates(0, 6);
else if (curChar == 45)
jjAddStates(7, 10);
else if (curChar == 34)
jjCheckNAddStates(11, 13);
else if (curChar == 46)
jjCheckNAdd(4);
if ((0x3fe000000000000L & l) != 0L)
{
if (kind > 34)
kind = 34;
jjCheckNAddTwoStates(1, 2);
}
else if (curChar == 48)
{
if (kind > 34)
kind = 34;
jjCheckNAddStates(14, 16);
}
break;
case 0:
if ((0x3fe000000000000L & l) == 0L)
break;
if (kind > 34)
kind = 34;
jjCheckNAddTwoStates(1, 2);
break;
case 1:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 34)
kind = 34;
jjCheckNAddTwoStates(1, 2);
break;
case 3:
if (curChar == 46)
jjCheckNAdd(4);
break;
case 4:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 38)
kind = 38;
jjCheckNAddStates(17, 19);
break;
case 6:
if ((0x280000000000L & l) != 0L)
jjCheckNAdd(7);
break;
case 7:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 38)
kind = 38;
jjCheckNAddTwoStates(7, 8);
break;
case 10:
if ((0xfffffffbffffdbffL & l) != 0L)
jjCheckNAddStates(11, 13);
break;
case 12:
if ((0x8400000000L & l) != 0L)
jjCheckNAddStates(11, 13);
break;
case 13:
if (curChar == 34 && kind > 40)
kind = 40;
break;
case 15:
if ((0x3ff000000000000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 16;
break;
case 16:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddStates(11, 13);
break;
case 17:
if ((0xff000000000000L & l) != 0L)
jjCheckNAddStates(20, 23);
break;
case 18:
if ((0xff000000000000L & l) != 0L)
jjCheckNAddStates(11, 13);
break;
case 19:
if ((0xf000000000000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 20;
break;
case 20:
if ((0xff000000000000L & l) != 0L)
jjCheckNAdd(18);
break;
case 22:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 41)
kind = 41;
jjstateSet[jjnewStateCnt++] = 22;
break;
case 23:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddStates(0, 6);
break;
case 24:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(24, 25);
break;
case 25:
if (curChar != 46)
break;
if (kind > 38)
kind = 38;
jjCheckNAddStates(24, 26);
break;
case 26:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 38)
kind = 38;
jjCheckNAddStates(24, 26);
break;
case 28:
if ((0x280000000000L & l) != 0L)
jjCheckNAdd(29);
break;
case 29:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 38)
kind = 38;
jjCheckNAddTwoStates(29, 8);
break;
case 30:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(30, 31);
break;
case 32:
if ((0x280000000000L & l) != 0L)
jjCheckNAdd(33);
break;
case 33:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 38)
kind = 38;
jjCheckNAddTwoStates(33, 8);
break;
case 34:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddStates(27, 29);
break;
case 36:
if ((0x280000000000L & l) != 0L)
jjCheckNAdd(37);
break;
case 37:
if ((0x3ff000000000000L & l) != 0L)
jjCheckNAddTwoStates(37, 8);
break;
case 38:
if (curChar != 48)
break;
if (kind > 34)
kind = 34;
jjCheckNAddStates(14, 16);
break;
case 40:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 34)
kind = 34;
jjCheckNAddTwoStates(40, 2);
break;
case 41:
if ((0xff000000000000L & l) == 0L)
break;
if (kind > 34)
kind = 34;
jjCheckNAddTwoStates(41, 2);
break;
case 42:
if (curChar == 45)
jjAddStates(7, 10);
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 9:
if ((0x7fffffe07fffffeL & l) == 0L)
break;
if (kind > 41)
kind = 41;
jjCheckNAdd(22);
break;
case 2:
if ((0x100000001000L & l) != 0L && kind > 34)
kind = 34;
break;
case 5:
if ((0x2000000020L & l) != 0L)
jjAddStates(30, 31);
break;
case 8:
if ((0x5000000050L & l) != 0L && kind > 38)
kind = 38;
break;
case 10:
if ((0xffffffffefffffffL & l) != 0L)
jjCheckNAddStates(11, 13);
break;
case 11:
if (curChar == 92)
jjAddStates(32, 35);
break;
case 12:
if ((0x54404610000000L & l) != 0L)
jjCheckNAddStates(11, 13);
break;
case 14:
if ((0x100000001000000L & l) != 0L)
jjstateSet[jjnewStateCnt++] = 15;
break;
case 15:
if ((0x7e0000007eL & l) != 0L)
jjstateSet[jjnewStateCnt++] = 16;
break;
case 16:
if ((0x7e0000007eL & l) != 0L)
jjCheckNAddStates(11, 13);
break;
case 22:
if ((0x7fffffe87fffffeL & l) == 0L)
break;
if (kind > 41)
kind = 41;
jjCheckNAdd(22);
break;
case 27:
if ((0x2000000020L & l) != 0L)
jjAddStates(36, 37);
break;
case 31:
if ((0x2000000020L & l) != 0L)
jjAddStates(38, 39);
break;
case 35:
if ((0x2000000020L & l) != 0L)
jjAddStates(40, 41);
break;
case 39:
if ((0x100000001000000L & l) != 0L)
jjCheckNAdd(40);
break;
case 40:
if ((0x7e0000007eL & l) == 0L)
break;
if (kind > 34)
kind = 34;
jjCheckNAddTwoStates(40, 2);
break;
default : break;
}
} while(i != startsAt);
}
else
{
int i2 = (curChar & 0xff) >> 6;
long l2 = 1L << (curChar & 077);
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 10:
if ((jjbitVec0[i2] & l2) != 0L)
jjAddStates(11, 13);
break;
default : break;
}
} while(i != startsAt);
}
if (kind != 0x7fffffff)
{
jjmatchedKind = kind;
jjmatchedPos = curPos;
kind = 0x7fffffff;
}
++curPos;
if ((i = jjnewStateCnt) == (startsAt = 43 - (jjnewStateCnt = startsAt)))
return curPos;
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) { return curPos; }
}
}
private final int jjMoveStringLiteralDfa0_1()
{
return jjMoveNfa_1(0, 0);
}
private final int jjMoveNfa_1(int startState, int curPos)
{
int[] nextStates;
int startsAt = 0;
jjnewStateCnt = 3;
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 ((0x2400L & l) != 0L)
{
if (kind > 6)
kind = 6;
}
if (curChar == 13)
jjstateSet[jjnewStateCnt++] = 1;
break;
case 1:
if (curChar == 10 && kind > 6)
kind = 6;
break;
case 2:
if (curChar == 13)
jjstateSet[jjnewStateCnt++] = 1;
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
MatchLoop: do
{
switch(jjstateSet[--i])
{
case 0:
if (curChar == 124)
kind = 6;
break;
default : break;
}
} while(i != startsAt);
}
else
{
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 = 3 - (jjnewStateCnt = startsAt)))
return curPos;
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) { return curPos; }
}
}
static final int[] jjnextStates = {
24, 25, 30, 31, 34, 35, 8, 0, 3, 23, 38, 10, 11, 13, 39, 41,
2, 4, 5, 8, 10, 11, 18, 13, 26, 27, 8, 34, 35, 8, 6, 7,
12, 14, 17, 19, 28, 29, 32, 33, 36, 37,
};
public static final String[] jjstrLiteralImages = {
"", null, null, null, null, null, null, null, "\151\155\160\157\162\164",
"\160\141\143\153\141\147\145", "\163\145\162\166\151\143\145", "\162\160\143", "\157\160\164\151\157\156",
"\155\145\163\163\141\147\145", "\145\170\164\145\156\163\151\157\156\163", "\145\170\164\145\156\144",
"\145\156\165\155", "\147\162\157\165\160", "\162\145\161\165\151\162\145\144",
"\157\160\164\151\157\156\141\154", "\162\145\160\145\141\164\145\144", "\162\145\164\165\162\156\163",
"\164\157", "\155\141\170", "\173", "\175", "\75", "\73", "\133", "\135", "\50", "\51",
"\56", "\54", null, null, null, null, null, null, null, null, };
public static final String[] lexStateNames = {
"DEFAULT",
"COMMENT",
};
public static final int[] jjnewLexState = {
-1, -1, -1, -1, -1, 1, 0, -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 = {
0x347ffffff01L,
};
static final long[] jjtoSkip = {
0x7eL,
};
static final long[] jjtoSpecial = {
0x60L,
};
static final long[] jjtoMore = {
0x80L,
};
protected SimpleCharStream input_stream;
private final int[] jjrounds = new int[43];
private final int[] jjstateSet = new int[86];
StringBuffer image;
int jjimageLen;
int lengthOfMatch;
protected char curChar;
public ProtoParserTokenManager(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 ProtoParserTokenManager(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 = 43; i-- > 0;)
jjrounds[i] = 0x80000000;
}
public void ReInit(SimpleCharStream stream, int lexState)
{
ReInit(stream);
SwitchTo(lexState);
}
public void SwitchTo(int lexState)
{
if (lexState >= 2 || 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();
matchedToken.specialToken = specialToken;
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();
if (jjmatchedPos == 0 && jjmatchedKind > 7)
{
jjmatchedKind = 7;
}
break;
}
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;
if (jjnewLexState[jjmatchedKind] != -1)
curLexState = jjnewLexState[jjmatchedKind];
return matchedToken;
}
else if ((jjtoSkip[jjmatchedKind >> 6] & (1L << (jjmatchedKind & 077))) != 0L)
{
if ((jjtoSpecial[jjmatchedKind >> 6] & (1L << (jjmatchedKind & 077))) != 0L)
{
matchedToken = jjFillToken();
if (specialToken == null)
specialToken = matchedToken;
else
{
matchedToken.specialToken = specialToken;
specialToken = (specialToken.next = matchedToken);
}
SkipLexicalActions(matchedToken);
}
else
SkipLexicalActions(null);
if (jjnewLexState[jjmatchedKind] != -1)
curLexState = jjnewLexState[jjmatchedKind];
continue EOFLoop;
}
jjimageLen += jjmatchedPos + 1;
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 SkipLexicalActions(Token matchedToken)
{
switch(jjmatchedKind)
{
default :
break;
}
}
}
