/* Generated By:JavaCC: Do not edit this line. TheParserTokenManager.java */ package gen; import edu.neu.ccs.demeterf.lib.*; import edu.neu.ccs.demeterf.*; import edu.neu.ccs.demeterf.Fields; import edu.neu.ccs.demeterf.lib.ident; import edu.neu.ccs.demeterf.lib.verbatim; /** Token Manager. */ public class TheParserTokenManager implements TheParserConstants { /** 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) { case 0: if ((active0 & 0xc00680L) != 0L) { jjmatchedKind = 27; return 43; } return -1; case 1: if ((active0 & 0xc00400L) != 0L) { if (jjmatchedPos != 1) { jjmatchedKind = 27; jjmatchedPos = 1; } return 43; } if ((active0 & 0x280L) != 0L) return 43; return -1; case 2: if ((active0 & 0xc00600L) != 0L) { jjmatchedKind = 27; jjmatchedPos = 2; return 43; } return -1; case 3: if ((active0 & 0x400000L) != 0L) return 43; if ((active0 & 0x800600L) != 0L) { jjmatchedKind = 27; jjmatchedPos = 3; return 43; } return -1; case 4: if ((active0 & 0x600L) != 0L) { jjmatchedKind = 27; jjmatchedPos = 4; return 43; } if ((active0 & 0x800000L) != 0L) return 43; return -1; case 5: if ((active0 & 0x600L) != 0L) { jjmatchedKind = 27; jjmatchedPos = 5; return 43; } return -1; case 6: if ((active0 & 0x600L) != 0L) { jjmatchedKind = 27; jjmatchedPos = 6; return 43; } 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 13: jjmatchedKind = 18; return jjMoveStringLiteralDfa1_0(0x80000L); case 40: jjmatchedKind = 11; return jjMoveStringLiteralDfa1_0(0x17aL); case 41: return jjStopAtPos(0, 2); case 102: return jjMoveStringLiteralDfa1_0(0x800000L); case 105: return jjMoveStringLiteralDfa1_0(0x280L); case 115: return jjMoveStringLiteralDfa1_0(0x400L); case 116: return jjMoveStringLiteralDfa1_0(0x400000L); 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 10: if ((active0 & 0x80000L) != 0L) return jjStopAtPos(1, 19); break; case 45: return jjMoveStringLiteralDfa2_0(active0, 0x10L); case 69: return jjMoveStringLiteralDfa2_0(active0, 0x100L); case 70: return jjMoveStringLiteralDfa2_0(active0, 0x40L); case 97: return jjMoveStringLiteralDfa2_0(active0, 0x800002L); case 110: if ((active0 & 0x80L) != 0L) { jjmatchedKind = 7; jjmatchedPos = 1; } return jjMoveStringLiteralDfa2_0(active0, 0x220L); case 111: return jjMoveStringLiteralDfa2_0(active0, 0x408L); case 114: return jjMoveStringLiteralDfa2_0(active0, 0x400000L); 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 62: if ((active0 & 0x10L) != 0L) return jjStopAtPos(2, 4); break; case 108: return jjMoveStringLiteralDfa3_0(active0, 0x800400L); case 110: return jjMoveStringLiteralDfa3_0(active0, 0x2L); case 111: return jjMoveStringLiteralDfa3_0(active0, 0x60L); case 114: if ((active0 & 0x8L) != 0L) return jjStopAtPos(2, 3); break; case 115: return jjMoveStringLiteralDfa3_0(active0, 0x200L); case 117: return jjMoveStringLiteralDfa3_0(active0, 0x400000L); case 120: return jjMoveStringLiteralDfa3_0(active0, 0x100L); 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 100: if ((active0 & 0x2L) != 0L) return jjStopAtPos(3, 1); break; case 101: if ((active0 & 0x400000L) != 0L) return jjStartNfaWithStates_0(3, 22, 43); break; case 105: return jjMoveStringLiteralDfa4_0(active0, 0x100L); case 114: return jjMoveStringLiteralDfa4_0(active0, 0x40L); case 115: return jjMoveStringLiteralDfa4_0(active0, 0x800000L); case 116: if ((active0 & 0x20L) != 0L) return jjStopAtPos(3, 5); return jjMoveStringLiteralDfa4_0(active0, 0x200L); case 117: return jjMoveStringLiteralDfa4_0(active0, 0x400L); 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 65: return jjMoveStringLiteralDfa5_0(active0, 0x40L); case 97: return jjMoveStringLiteralDfa5_0(active0, 0x200L); case 101: if ((active0 & 0x800000L) != 0L) return jjStartNfaWithStates_0(4, 23, 43); break; case 115: return jjMoveStringLiteralDfa5_0(active0, 0x100L); case 116: return jjMoveStringLiteralDfa5_0(active0, 0x400L); 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 105: return jjMoveStringLiteralDfa6_0(active0, 0x400L); case 108: return jjMoveStringLiteralDfa6_0(active0, 0x40L); case 110: return jjMoveStringLiteralDfa6_0(active0, 0x200L); case 116: return jjMoveStringLiteralDfa6_0(active0, 0x100L); 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 99: return jjMoveStringLiteralDfa7_0(active0, 0x200L); case 108: if ((active0 & 0x40L) != 0L) return jjStopAtPos(6, 6); break; case 111: return jjMoveStringLiteralDfa7_0(active0, 0x400L); case 115: if ((active0 & 0x100L) != 0L) return jjStopAtPos(6, 8); break; 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 101: if ((active0 & 0x200L) != 0L) return jjStartNfaWithStates_0(7, 9, 43); break; case 110: if ((active0 & 0x400L) != 0L) return jjStartNfaWithStates_0(7, 10, 43); break; default : break; } return jjStartNfa_0(6, 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 = 57; 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 > 12) kind = 12; jjCheckNAddStates(0, 2); } else if ((0x280000000000L & l) != 0L) jjCheckNAddTwoStates(1, 2); else if (curChar == 47) jjAddStates(3, 4); else if (curChar == 36) { if (kind > 27) kind = 27; jjCheckNAdd(43); } else if (curChar == 34) jjCheckNAddStates(5, 7); else if (curChar == 39) jjAddStates(8, 9); else if (curChar == 46) jjCheckNAdd(13); if (curChar == 45) jjCheckNAdd(6); else if (curChar == 48) jjstateSet[jjnewStateCnt++] = 3; break; case 1: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 12) kind = 12; jjCheckNAdd(1); break; case 2: if (curChar == 48) jjstateSet[jjnewStateCnt++] = 3; break; case 4: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 12) kind = 12; jjstateSet[jjnewStateCnt++] = 4; break; case 5: if (curChar == 45) jjCheckNAdd(6); break; case 6: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(6, 7); break; case 7: if (curChar == 46) jjCheckNAdd(8); break; case 8: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 13) kind = 13; jjCheckNAddTwoStates(8, 9); break; case 10: if ((0x280000000000L & l) != 0L) jjCheckNAdd(11); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 13) kind = 13; jjCheckNAdd(11); break; case 12: if (curChar == 46) jjCheckNAdd(13); break; case 13: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 13) kind = 13; jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x280000000000L & l) != 0L) jjCheckNAdd(16); break; case 16: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 13) kind = 13; jjCheckNAdd(16); break; case 17: if (curChar == 39) jjAddStates(8, 9); break; case 18: if ((0xffffff7fffffdbffL & l) != 0L) jjCheckNAdd(19); break; case 19: if (curChar == 39 && kind > 24) kind = 24; break; case 21: if ((0x8400000000L & l) != 0L) jjCheckNAdd(19); break; case 22: if ((0xff000000000000L & l) != 0L) jjCheckNAddTwoStates(23, 19); break; case 23: if ((0xff000000000000L & l) != 0L) jjCheckNAdd(19); break; case 24: if ((0xf000000000000L & l) != 0L) jjstateSet[jjnewStateCnt++] = 25; break; case 25: if ((0xff000000000000L & l) != 0L) jjCheckNAdd(23); break; case 26: if (curChar == 34) jjCheckNAddStates(5, 7); break; case 27: if ((0xfffffffbffffdbffL & l) != 0L) jjCheckNAddStates(5, 7); break; case 29: if ((0x8400000000L & l) != 0L) jjCheckNAddStates(5, 7); break; case 30: if (curChar == 34 && kind > 25) kind = 25; break; case 31: if ((0xff000000000000L & l) != 0L) jjCheckNAddStates(10, 13); break; case 32: if ((0xff000000000000L & l) != 0L) jjCheckNAddStates(5, 7); break; case 33: if ((0xf000000000000L & l) != 0L) jjstateSet[jjnewStateCnt++] = 34; break; case 34: if ((0xff000000000000L & l) != 0L) jjCheckNAdd(32); break; case 36: jjCheckNAddStates(14, 16); break; case 38: jjCheckNAddStates(17, 19); break; case 42: if (curChar != 36) break; if (kind > 27) kind = 27; jjCheckNAdd(43); break; case 43: if ((0x3ff001000000000L & l) == 0L) break; if (kind > 27) kind = 27; jjCheckNAdd(43); break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 12) kind = 12; jjCheckNAddStates(0, 2); break; case 45: if (curChar == 47) jjAddStates(3, 4); break; case 46: if (curChar == 47) jjCheckNAddStates(20, 22); break; case 47: if ((0xffffffffffffdbffL & l) != 0L) jjCheckNAddStates(20, 22); break; case 48: case 49: if (curChar == 10 && kind > 20) kind = 20; break; case 50: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 49; break; case 51: if (curChar == 42) jjCheckNAddTwoStates(52, 53); break; case 52: if ((0xfffffbffffffffffL & l) != 0L) jjCheckNAddTwoStates(52, 53); break; case 53: if (curChar == 42) jjAddStates(23, 24); break; case 54: if ((0xffff7fffffffffffL & l) != 0L) jjCheckNAddTwoStates(55, 53); break; case 55: if ((0xfffffbffffffffffL & l) != 0L) jjCheckNAddTwoStates(55, 53); break; case 56: if (curChar == 47 && kind > 21) kind = 21; 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 > 27) kind = 27; jjCheckNAdd(43); } else if (curChar == 123) jjstateSet[jjnewStateCnt++] = 35; break; case 3: if ((0x100000001000000L & l) != 0L) jjCheckNAdd(4); break; case 4: if ((0x7e0000007eL & l) == 0L) break; if (kind > 12) kind = 12; jjCheckNAdd(4); break; case 9: if ((0x2000000020L & l) != 0L) jjAddStates(25, 26); break; case 14: if ((0x2000000020L & l) != 0L) jjAddStates(27, 28); break; case 18: if ((0xffffffffefffffffL & l) != 0L) jjCheckNAdd(19); break; case 20: if (curChar == 92) jjAddStates(29, 31); break; case 21: if ((0x14404410000000L & l) != 0L) jjCheckNAdd(19); break; case 27: if ((0xffffffffefffffffL & l) != 0L) jjCheckNAddStates(5, 7); break; case 28: if (curChar == 92) jjAddStates(32, 34); break; case 29: if ((0x14404410000000L & l) != 0L) jjCheckNAddStates(5, 7); break; case 35: if (curChar == 123) jjCheckNAddStates(14, 16); break; case 36: if ((0xdfffffffffffffffL & l) != 0L) jjCheckNAddStates(14, 16); break; case 37: if (curChar == 125) jjCheckNAdd(38); break; case 38: if ((0xdfffffffffffffffL & l) != 0L) jjCheckNAddStates(17, 19); break; case 39: if (curChar == 125 && kind > 26) kind = 26; break; case 40: if (curChar == 125) jjstateSet[jjnewStateCnt++] = 39; break; case 41: if (curChar == 123) jjstateSet[jjnewStateCnt++] = 35; break; case 42: case 43: if ((0x7fffffe87fffffeL & l) == 0L) break; if (kind > 27) kind = 27; jjCheckNAdd(43); break; case 47: jjAddStates(20, 22); break; case 52: jjCheckNAddTwoStates(52, 53); break; case 54: case 55: jjCheckNAddTwoStates(55, 53); break; default : break; } } while(i != startsAt); } else { int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); do { switch(jjstateSet[--i]) { case 18: if ((jjbitVec0[i2] & l2) != 0L) jjstateSet[jjnewStateCnt++] = 19; break; case 27: if ((jjbitVec0[i2] & l2) != 0L) jjAddStates(5, 7); break; case 36: if ((jjbitVec0[i2] & l2) != 0L) jjCheckNAddStates(14, 16); break; case 38: if ((jjbitVec0[i2] & l2) != 0L) jjCheckNAddStates(17, 19); break; case 47: if ((jjbitVec0[i2] & l2) != 0L) jjAddStates(20, 22); break; case 52: if ((jjbitVec0[i2] & l2) != 0L) jjCheckNAddTwoStates(52, 53); break; case 54: case 55: if ((jjbitVec0[i2] & l2) != 0L) jjCheckNAddTwoStates(55, 53); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 57 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } } } static final int[] jjnextStates = { 1, 6, 7, 46, 51, 27, 28, 30, 18, 20, 27, 28, 32, 30, 36, 37, 40, 37, 38, 40, 47, 48, 50, 54, 56, 10, 11, 15, 16, 21, 22, 24, 29, 31, 33, }; /** Token literal values. */ public static final String[] jjstrLiteralImages = { "", "\50\141\156\144", "\51", "\50\157\162", "\50\55\76", "\50\156\157\164", "\50\106\157\162\101\154\154", "\151\156", "\50\105\170\151\163\164\163", "\151\156\163\164\141\156\143\145", "\163\157\154\165\164\151\157\156", "\50", null, null, null, null, null, null, null, null, null, null, "\164\162\165\145", "\146\141\154\163\145", null, null, null, null, }; /** Lexer state names. */ public static final String[] lexStateNames = { "DEFAULT", }; static final long[] jjtoToken = { 0xfc03fffL, }; static final long[] jjtoSkip = { 0x3f8000L, }; protected SimpleCharStream input_stream; private final int[] jjrounds = new int[57]; private final int[] jjstateSet = new int[114]; protected char curChar; /** Constructor. */ public TheParserTokenManager(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 TheParserTokenManager(SimpleCharStream stream, int lexState){ this(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 = 57; 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; } 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; } 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(java.io.IOException e) { jjmatchedKind = 0; matchedToken = jjFillToken(); return matchedToken; } try { input_stream.backup(0); while (curChar <= 32 && (0x100000600L & (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; } 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); } } 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); } }