turtleparsertokenmanager.java

来自「Jena推理机」· Java 代码 · 共 1,439 行 · 第 1/4 页

JAVA
1,439
字号
/* Generated By:JavaCC: Do not edit this line. TurtleParserTokenManager.java */
/*
 * (c) Copyright 2006, 2007 Hewlett-Packard Development Company, LP
 * All rights reserved.
 */

package com.hp.hpl.jena.n3.turtle.parser ;

public class TurtleParserTokenManager implements TurtleParserConstants
{
  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 jjMoveStringLiteralDfa0_0()
{
   switch(curChar)
   {
      case 9:
         jjmatchedKind = 7;
         return jjMoveNfa_0(0, 0);
      case 10:
         jjmatchedKind = 8;
         return jjMoveNfa_0(0, 0);
      case 12:
         jjmatchedKind = 10;
         return jjMoveNfa_0(0, 0);
      case 13:
         jjmatchedKind = 9;
         return jjMoveNfa_0(0, 0);
      case 32:
         jjmatchedKind = 6;
         return jjMoveNfa_0(0, 0);
      case 33:
         jjmatchedKind = 1;
         return jjMoveNfa_0(0, 0);
      case 36:
         jjmatchedKind = 51;
         return jjMoveNfa_0(0, 0);
      case 40:
         jjmatchedKind = 38;
         return jjMoveNfa_0(0, 0);
      case 41:
         jjmatchedKind = 39;
         return jjMoveNfa_0(0, 0);
      case 42:
         jjmatchedKind = 55;
         return jjMoveNfa_0(0, 0);
      case 44:
         jjmatchedKind = 47;
         return jjMoveNfa_0(0, 0);
      case 45:
         return jjMoveStringLiteralDfa1_0(0x10L);
      case 46:
         jjmatchedKind = 48;
         return jjMoveNfa_0(0, 0);
      case 47:
         jjmatchedKind = 56;
         return jjMoveNfa_0(0, 0);
      case 58:
         jjmatchedKind = 54;
         return jjMoveNfa_0(0, 0);
      case 59:
         jjmatchedKind = 46;
         return jjMoveNfa_0(0, 0);
      case 60:
         return jjMoveStringLiteralDfa1_0(0x20L);
      case 61:
         jjmatchedKind = 49;
         return jjMoveStringLiteralDfa1_0(0x4000000000000L);
      case 63:
         jjmatchedKind = 52;
         return jjMoveNfa_0(0, 0);
      case 64:
         jjmatchedKind = 59;
         return jjMoveStringLiteralDfa1_0(0xc000L);
      case 91:
         jjmatchedKind = 43;
         return jjMoveNfa_0(0, 0);
      case 92:
         jjmatchedKind = 57;
         return jjMoveNfa_0(0, 0);
      case 93:
         jjmatchedKind = 44;
         return jjMoveNfa_0(0, 0);
      case 94:
         jjmatchedKind = 3;
         return jjMoveStringLiteralDfa1_0(0x400000000000000L);
      case 97:
         jjmatchedKind = 13;
         return jjMoveNfa_0(0, 0);
      case 123:
         jjmatchedKind = 41;
         return jjMoveNfa_0(0, 0);
      case 124:
         jjmatchedKind = 2;
         return jjMoveNfa_0(0, 0);
      case 125:
         jjmatchedKind = 42;
         return jjMoveNfa_0(0, 0);
      case 126:
         jjmatchedKind = 53;
         return jjMoveNfa_0(0, 0);
      default :
         return jjMoveNfa_0(0, 0);
   }
}
private final int jjMoveStringLiteralDfa1_0(long active0)
{
   try { curChar = input_stream.readChar(); }
   catch(java.io.IOException e) {
   return jjMoveNfa_0(0, 0);
   }
   switch(curChar)
   {
      case 45:
         if ((active0 & 0x20L) != 0L)
         {
            jjmatchedKind = 5;
            jjmatchedPos = 1;
         }
         break;
      case 62:
         if ((active0 & 0x10L) != 0L)
         {
            jjmatchedKind = 4;
            jjmatchedPos = 1;
         }
         else if ((active0 & 0x4000000000000L) != 0L)
         {
            jjmatchedKind = 50;
            jjmatchedPos = 1;
         }
         break;
      case 66:
         return jjMoveStringLiteralDfa2_0(active0, 0x8000L);
      case 80:
         return jjMoveStringLiteralDfa2_0(active0, 0x4000L);
      case 94:
         if ((active0 & 0x400000000000000L) != 0L)
         {
            jjmatchedKind = 58;
            jjmatchedPos = 1;
         }
         break;
      case 98:
         return jjMoveStringLiteralDfa2_0(active0, 0x8000L);
      case 112:
         return jjMoveStringLiteralDfa2_0(active0, 0x4000L);
      default :
         break;
   }
   return jjMoveNfa_0(0, 1);
}
private final int jjMoveStringLiteralDfa2_0(long old0, long active0)
{
   if (((active0 &= old0)) == 0L)
      return jjMoveNfa_0(0, 1);
   try { curChar = input_stream.readChar(); }
   catch(java.io.IOException e) {
   return jjMoveNfa_0(0, 1);
   }
   switch(curChar)
   {
      case 65:
         return jjMoveStringLiteralDfa3_0(active0, 0x8000L);
      case 82:
         return jjMoveStringLiteralDfa3_0(active0, 0x4000L);
      case 97:
         return jjMoveStringLiteralDfa3_0(active0, 0x8000L);
      case 114:
         return jjMoveStringLiteralDfa3_0(active0, 0x4000L);
      default :
         break;
   }
   return jjMoveNfa_0(0, 2);
}
private final int jjMoveStringLiteralDfa3_0(long old0, long active0)
{
   if (((active0 &= old0)) == 0L)
      return jjMoveNfa_0(0, 2);
   try { curChar = input_stream.readChar(); }
   catch(java.io.IOException e) {
   return jjMoveNfa_0(0, 2);
   }
   switch(curChar)
   {
      case 69:
         return jjMoveStringLiteralDfa4_0(active0, 0x4000L);
      case 83:
         return jjMoveStringLiteralDfa4_0(active0, 0x8000L);
      case 101:
         return jjMoveStringLiteralDfa4_0(active0, 0x4000L);
      case 115:
         return jjMoveStringLiteralDfa4_0(active0, 0x8000L);
      default :
         break;
   }
   return jjMoveNfa_0(0, 3);
}
private final int jjMoveStringLiteralDfa4_0(long old0, long active0)
{
   if (((active0 &= old0)) == 0L)
      return jjMoveNfa_0(0, 3);
   try { curChar = input_stream.readChar(); }
   catch(java.io.IOException e) {
   return jjMoveNfa_0(0, 3);
   }
   switch(curChar)
   {
      case 69:
         if ((active0 & 0x8000L) != 0L)
         {
            jjmatchedKind = 15;
            jjmatchedPos = 4;
         }
         break;
      case 70:
         return jjMoveStringLiteralDfa5_0(active0, 0x4000L);
      case 101:
         if ((active0 & 0x8000L) != 0L)
         {
            jjmatchedKind = 15;
            jjmatchedPos = 4;
         }
         break;
      case 102:
         return jjMoveStringLiteralDfa5_0(active0, 0x4000L);
      default :
         break;
   }
   return jjMoveNfa_0(0, 4);
}
private final int jjMoveStringLiteralDfa5_0(long old0, long active0)
{
   if (((active0 &= old0)) == 0L)
      return jjMoveNfa_0(0, 4);
   try { curChar = input_stream.readChar(); }
   catch(java.io.IOException e) {
   return jjMoveNfa_0(0, 4);
   }
   switch(curChar)
   {
      case 73:
         return jjMoveStringLiteralDfa6_0(active0, 0x4000L);
      case 105:
         return jjMoveStringLiteralDfa6_0(active0, 0x4000L);
      default :
         break;
   }
   return jjMoveNfa_0(0, 5);
}
private final int jjMoveStringLiteralDfa6_0(long old0, long active0)
{
   if (((active0 &= old0)) == 0L)
      return jjMoveNfa_0(0, 5);
   try { curChar = input_stream.readChar(); }
   catch(java.io.IOException e) {
   return jjMoveNfa_0(0, 5);
   }
   switch(curChar)
   {
      case 88:
         if ((active0 & 0x4000L) != 0L)
         {
            jjmatchedKind = 14;
            jjmatchedPos = 6;
         }
         break;
      case 120:
         if ((active0 & 0x4000L) != 0L)
         {
            jjmatchedKind = 14;
            jjmatchedPos = 6;
         }
         break;
      default :
         break;
   }
   return jjMoveNfa_0(0, 6);
}
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};
static final long[] jjbitVec3 = {   0xfffe7000fffffff6L, 0xffffffffffffffffL, 0xffffffffffffffffL, 0x7e00000000ffffffL};
static final long[] jjbitVec4 = {   0x0L, 0x0L, 0x0L, 0xff7fffffff7fffffL};
static final long[] jjbitVec5 = {   0x0L, 0xbfff000000000000L, 0xffffffffffffffffL, 0xffffffffffffffffL};
static final long[] jjbitVec6 = {   0x3000L, 0xffff000000000000L, 0xffffffffffffffffL, 0xffffffffffffffffL};
static final long[] jjbitVec7 = {   0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffL, 0x0L};
static final long[] jjbitVec8 = {   0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffffffffffL};
static final long[] jjbitVec9 = {   0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffffffffffffffL, 0x3fffffffffffffffL};
static final long[] jjbitVec10 = {   0x0L, 0x0L, 0x80000000000000L, 0xff7fffffff7fffffL};
static final long[] jjbitVec11 = {   0xffffffffffffffffL, 0xbfffffffffffffffL, 0xffffffffffffffffL, 0xffffffffffffffffL};
static final long[] jjbitVec12 = {   0x8000000000003000L, 0xffff000000000001L, 0xffffffffffffffffL, 0xffffffffffffffffL};
private final int jjMoveNfa_0(int startState, int curPos)
{
   int strKind = jjmatchedKind;
   int strPos = jjmatchedPos;
   int seenUpto;
   input_stream.backup(seenUpto = curPos + 1);
   try { curChar = input_stream.readChar(); }

⌨️ 快捷键说明

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