edu.stanford.nlp.semgraph.semgrex.SemgrexParserTokenManager Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of stanford-corenlp Show documentation
Show all versions of stanford-corenlp Show documentation
Stanford CoreNLP provides a set of natural language analysis tools which can take raw English language text input and give the base forms of words, their parts of speech, whether they are names of companies, people, etc., normalize dates, times, and numeric quantities, mark up the structure of sentences in terms of phrases and word dependencies, and indicate which noun phrases refer to the same entities. It provides the foundational building blocks for higher level text understanding applications.
/* Generated By:JavaCC: Do not edit this line. SemgrexParserTokenManager.java */
package edu.stanford.nlp.semgraph.semgrex;
// all generated classes are in this package
//imports
import java.util.*;
import edu.stanford.nlp.util.Generics;
/** Token Manager. */
class SemgrexParserTokenManager implements SemgrexParserConstants
{
/** 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)
{
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 9:
return jjStartNfaWithStates_0(0, 3, 7);
case 10:
return jjStopAtPos(0, 11);
case 33:
return jjStopAtPos(0, 17);
case 35:
return jjStopAtPos(0, 8);
case 36:
return jjStartNfaWithStates_0(0, 9, 17);
case 38:
return jjStopAtPos(0, 16);
case 40:
return jjStopAtPos(0, 13);
case 41:
return jjStopAtPos(0, 14);
case 44:
return jjStopAtPos(0, 21);
case 58:
return jjStopAtPos(0, 12);
case 59:
return jjStopAtPos(0, 24);
case 61:
return jjStartNfaWithStates_0(0, 22, 5);
case 63:
return jjStopAtPos(0, 18);
case 64:
return jjStopAtPos(0, 5);
case 91:
return jjStopAtPos(0, 19);
case 93:
return jjStopAtPos(0, 20);
case 123:
return jjStopAtPos(0, 23);
case 124:
return jjStopAtPos(0, 15);
case 125:
return jjStopAtPos(0, 25);
default :
return jjMoveNfa_0(0, 0);
}
}
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 = {
0xfffffffffffffffeL, 0xffffffffffffffffL, 0xffffffffffffffffL, 0xffffffffffffffffL
};
static final long[] jjbitVec2 = {
0x0L, 0x0L, 0xffffffffffffffffL, 0xffffffffffffffffL
};
private int jjMoveNfa_0(int startState, int curPos)
{
int startsAt = 0;
jjnewStateCnt = 19;
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 ((0x3ff0484ffffdbffL & l) != 0L)
{
if (kind > 6)
kind = 6;
jjCheckNAdd(7);
}
else if ((0x5000400000000000L & l) != 0L)
{
if (kind > 4)
kind = 4;
}
else if (curChar == 36)
jjCheckNAddStates(0, 3);
else if (curChar == 47)
jjCheckNAddStates(4, 6);
else if (curChar == 61)
jjstateSet[jjnewStateCnt++] = 5;
if ((0x3ff000000000000L & l) != 0L)
{
if (kind > 7)
kind = 7;
jjCheckNAdd(8);
}
else if (curChar == 60)
jjstateSet[jjnewStateCnt++] = 3;
else if (curChar == 62)
jjstateSet[jjnewStateCnt++] = 1;
break;
case 17:
if (curChar == 45)
jjCheckNAdd(16);
else if (curChar == 43)
jjCheckNAdd(15);
if (curChar == 45)
{
if (kind > 4)
kind = 4;
}
else if (curChar == 43)
{
if (kind > 4)
kind = 4;
}
break;
case 1:
if (curChar == 62 && kind > 4)
kind = 4;
break;
case 2:
if (curChar == 62)
jjstateSet[jjnewStateCnt++] = 1;
break;
case 3:
if (curChar == 60 && kind > 4)
kind = 4;
break;
case 4:
if (curChar == 60)
jjstateSet[jjnewStateCnt++] = 3;
break;
case 5:
if (curChar == 61 && kind > 4)
kind = 4;
break;
case 6:
if (curChar == 61)
jjstateSet[jjnewStateCnt++] = 5;
break;
case 7:
if ((0x3ff0484ffffdbffL & l) == 0L)
break;
if (kind > 6)
kind = 6;
jjCheckNAdd(7);
break;
case 8:
if ((0x3ff000000000000L & l) == 0L)
break;
if (kind > 7)
kind = 7;
jjCheckNAdd(8);
break;
case 9:
case 10:
if (curChar == 47)
jjCheckNAddStates(4, 6);
break;
case 12:
if ((0xffff7fffffffdbffL & l) != 0L)
jjCheckNAddStates(4, 6);
break;
case 13:
if (curChar == 47 && kind > 10)
kind = 10;
break;
case 14:
if (curChar == 36)
jjCheckNAddStates(0, 3);
break;
case 15:
if (curChar == 43 && kind > 4)
kind = 4;
break;
case 16:
if (curChar == 45 && kind > 4)
kind = 4;
break;
case 18:
if (curChar == 45)
jjCheckNAdd(16);
break;
default : break;
}
} while(i != startsAt);
}
else if (curChar < 128)
{
long l = 1L << (curChar & 077);
do
{
switch(jjstateSet[--i])
{
case 0:
case 7:
if ((0x87ffffffd7fffffeL & l) == 0L)
break;
if (kind > 6)
kind = 6;
jjCheckNAdd(7);
break;
case 11:
if (curChar == 92)
jjstateSet[jjnewStateCnt++] = 10;
break;
case 12:
jjAddStates(4, 6);
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);
do
{
switch(jjstateSet[--i])
{
case 0:
case 7:
if (!jjCanMove_0(hiByte, i1, i2, l1, l2))
break;
if (kind > 6)
kind = 6;
jjCheckNAdd(7);
break;
case 12:
if (jjCanMove_0(hiByte, i1, i2, l1, l2))
jjAddStates(4, 6);
break;
default : break;
}
} while(i != startsAt);
}
if (kind != 0x7fffffff)
{
jjmatchedKind = kind;
jjmatchedPos = curPos;
kind = 0x7fffffff;
}
++curPos;
if ((i = jjnewStateCnt) == (startsAt = 19 - (jjnewStateCnt = startsAt)))
return curPos;
try { curChar = input_stream.readChar(); }
catch(java.io.IOException e) { return curPos; }
}
}
static final int[] jjnextStates = {
15, 16, 17, 18, 11, 12, 13,
};
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;
}
}
/** Token literal values. */
public static final String[] jjstrLiteralImages = {
"", null, null, null, null, "\100", null, null, "\43", "\44", null, "\12",
"\72", "\50", "\51", "\174", "\46", "\41", "\77", "\133", "\135", "\54", "\75",
"\173", "\73", "\175", };
/** Lexer state names. */
public static final String[] lexStateNames = {
"DEFAULT",
};
static final long[] jjtoToken = {
0x3fffff1L,
};
static final long[] jjtoSkip = {
0xeL,
};
protected SimpleCharStream input_stream;
private final int[] jjrounds = new int[19];
private final int[] jjstateSet = new int[38];
protected char curChar;
/** Constructor. */
public SemgrexParserTokenManager(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 SemgrexParserTokenManager(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 = 19; 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 && (0x100002000L & (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);
}
}