⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 simpleparsertokenmanager.java

📁 MG4J (Managing Gigabytes for Java) is a free full-text search engine for large document collections
💻 JAVA
字号:
/* Generated By:JavaCC: Do not edit this line. SimpleParserTokenManager.java */package it.unimi.dsi.mg4j.query.parser;import it.unimi.dsi.lang.*;import it.unimi.dsi.mg4j.index.*;import it.unimi.dsi.mg4j.query.nodes.*;import it.unimi.dsi.fastutil.objects.*;import it.unimi.dsi.fastutil.ints.*;import java.util.*;public class SimpleParserTokenManager implements SimpleParserConstants{  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 & 0x1000000L) != 0L)         {            jjmatchedKind = 25;            return 14;         }         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 34:         return jjStopAtPos(0, 16);      case 35:         return jjStopAtPos(0, 21);      case 36:         return jjStopAtPos(0, 23);      case 40:         return jjStopAtPos(0, 10);      case 41:         return jjStopAtPos(0, 11);      case 42:         return jjStopAtPos(0, 22);      case 43:         return jjStopAtPos(0, 19);      case 45:         return jjStopAtPos(0, 20);      case 46:         return jjMoveStringLiteralDfa1_0(0x1000000L);      case 58:         return jjStopAtPos(0, 17);      case 60:         return jjStopAtPos(0, 6);      case 91:         jjmatchedKind = 12;         return jjMoveStringLiteralDfa1_0(0x4000L);      case 93:         jjmatchedKind = 13;         return jjMoveStringLiteralDfa1_0(0x8000L);      case 94:         return jjStopAtPos(0, 9);      case 126:         return jjStopAtPos(0, 18);      default :         return jjMoveNfa_0(2, 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 46:         if ((active0 & 0x1000000L) != 0L)            return jjStartNfaWithStates_0(1, 24, 14);         break;      case 91:         if ((active0 & 0x4000L) != 0L)            return jjStopAtPos(1, 14);         break;      case 93:         if ((active0 & 0x8000L) != 0L)            return jjStopAtPos(1, 15);         break;      default :         break;   }   return jjStartNfa_0(0, 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 = {   0xfffffffffffffffeL, 0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffffffffffffffL};static final long[] jjbitVec2 = {   0x0L, 0x0L, 0xffffffffffffffffL, 0xffffffffffffffffL};private final int jjMoveNfa_0(int startState, int curPos){   int[] nextStates;   int startsAt = 0;   jjnewStateCnt = 14;   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 2:                  if ((0xebffc0a000000000L & l) != 0L)                  {                     if (kind > 25)                        kind = 25;                     jjCheckNAddTwoStates(11, 12);                  }                  else if (curChar == 33)                  {                     if (kind > 8)                        kind = 8;                  }                  else if (curChar == 38)                  {                     if (kind > 5)                        kind = 5;                  }                  break;               case 14:               case 11:                  if ((0xebffc0a000000000L & l) == 0L)                     break;                  if (kind > 25)                     kind = 25;                  jjCheckNAddTwoStates(11, 12);                  break;               case 3:                  if (curChar == 38 && kind > 5)                     kind = 5;                  break;               case 10:                  if (curChar == 33 && kind > 8)                     kind = 8;                  break;               case 13:                  if ((0xfffffffe00000000L & l) == 0L)                     break;                  if (kind > 25)                     kind = 25;                  jjCheckNAddTwoStates(11, 12);                  break;               default : break;            }         } while(i != startsAt);      }      else if (curChar < 128)      {         long l = 1L << (curChar & 077);         MatchLoop: do         {            switch(jjstateSet[--i])            {               case 2:                  if ((0xafffffff87ffffffL & l) != 0L)                  {                     if (kind > 25)                        kind = 25;                     jjCheckNAddTwoStates(11, 12);                  }                  else if (curChar == 92)                     jjstateSet[jjnewStateCnt++] = 13;                  else if (curChar == 124)                  {                     if (kind > 7)                        kind = 7;                  }                  if (curChar == 78)                     jjstateSet[jjnewStateCnt++] = 8;                  else if (curChar == 79)                     jjstateSet[jjnewStateCnt++] = 4;                  else if (curChar == 65)                     jjstateSet[jjnewStateCnt++] = 1;                  break;               case 14:                  if ((0xafffffff87ffffffL & l) != 0L)                  {                     if (kind > 25)                        kind = 25;                     jjCheckNAddTwoStates(11, 12);                  }                  else if (curChar == 92)                     jjstateSet[jjnewStateCnt++] = 13;                  break;               case 0:                  if (curChar == 68 && kind > 5)                     kind = 5;                  break;               case 1:                  if (curChar == 78)                     jjstateSet[jjnewStateCnt++] = 0;                  break;               case 4:                  if (curChar == 82 && kind > 7)                     kind = 7;                  break;               case 5:                  if (curChar == 79)                     jjstateSet[jjnewStateCnt++] = 4;                  break;               case 6:                  if (curChar == 124 && kind > 7)                     kind = 7;                  break;               case 7:                  if (curChar == 84 && kind > 8)                     kind = 8;                  break;               case 8:                  if (curChar == 79)                     jjstateSet[jjnewStateCnt++] = 7;                  break;               case 9:                  if (curChar == 78)                     jjstateSet[jjnewStateCnt++] = 8;                  break;               case 11:                  if ((0xafffffff87ffffffL & l) == 0L)                     break;                  if (kind > 25)                     kind = 25;                  jjCheckNAddTwoStates(11, 12);                  break;               case 12:                  if (curChar == 92)                     jjstateSet[jjnewStateCnt++] = 13;                  break;               case 13:                  if (kind > 25)                     kind = 25;                  jjCheckNAddTwoStates(11, 12);                  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 2:               case 11:               case 13:                  if (!jjCanMove_0(hiByte, i1, i2, l1, l2))                     break;                  if (kind > 25)                     kind = 25;                  jjCheckNAddTwoStates(11, 12);                  break;               case 14:                  if (!jjCanMove_0(hiByte, i1, i2, l1, l2))                     break;                  if (kind > 25)                     kind = 25;                  jjCheckNAddTwoStates(11, 12);                  break;               default : break;            }         } while(i != startsAt);      }      if (kind != 0x7fffffff)      {         jjmatchedKind = kind;         jjmatchedPos = curPos;         kind = 0x7fffffff;      }      ++curPos;      if ((i = jjnewStateCnt) == (startsAt = 14 - (jjnewStateCnt = startsAt)))         return curPos;      try { curChar = input_stream.readChar(); }      catch(java.io.IOException e) { return curPos; }   }}static final int[] jjnextStates = {};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 = {"", null, null, null, null, null, "\74", null, null, "\136", "\50", "\51", "\133", "\135", "\133\133", "\135\135", "\42", "\72", "\176", "\53", "\55", "\43", "\52", "\44", "\56\56", null, };public static final String[] lexStateNames = {   "DEFAULT", };static final long[] jjtoToken = {   0x3ffffe1L, };static final long[] jjtoSkip = {   0x1eL, };protected SimpleCharStream input_stream;private final int[] jjrounds = new int[14];private final int[] jjstateSet = new int[28];protected char curChar;public SimpleParserTokenManager(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 SimpleParserTokenManager(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 = 14; 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);   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;   }   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();   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);  }}}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -