skeleton.parser.tabular.tabular Maven / Gradle / Ivy
/*
*
* Begin of Skeleton
*
*/
/* ****************************************************************
Java Skeleton Parser for matrix tables
This is not a sample program, but rather the parser skeleton
to be included in the generated code.
Modify at your own risk.
Copyright (c), 1985-2016 Jaime Garza
***************************************************************** */
private static final int ERROR_FAIL = 0;
private static final int ERROR_RE_ATTEMPT = 1;
private int stateStack[] = new int[STACK_DEPTH];
int state;
StackElement lexicalValue;
int lexicalToken;
int errorCount;
int errorFlag;
boolean verbose = false;
/**
* Change the verbose flag
* @param verbose if verbose is desired
*/
public void setVerbose(boolean verbose) {
this.verbose = verbose;
}
/**
* @return the verbose flag
*
*/
public boolean isVerbose() {
return this.verbose;
}
/*
* ==========================================================
* Regular Expressions
* ==========================================================
*/
private int edgeIndex = 0;
/**
* checks one transition
*/
private boolean matchesWholeTransition() {
int transitionSize = edgeTable[edgeIndex ++];
boolean negate = false;
if (transitionSize < 0) {
negate = true;
transitionSize = -transitionSize;
}
boolean matchesTransition = false;
if (transitionSize == 0) { // ANY match
matchesTransition = currentChar != '\0';
} else {
// all elements of one transition
for (int j = 0; j < transitionSize; j++) {
int rangeStart = edgeTable[edgeIndex ++];
int rangeEnd = edgeTable[edgeIndex ++];
if (currentChar >= rangeStart && currentChar <= rangeEnd) {
matchesTransition = true;
// no break since the new vertex is at the end using edgeIndex
}
}
}
if (negate) {
matchesTransition = !matchesTransition;
}
return currentChar == '\0' ? false : matchesTransition;
}
/**
* tries to match a regular expression
*/
private boolean matchesRegex(int vertex) {
boolean accept = false;
boolean goOn = true;
recognized = "";
do {
accept = false;
edgeIndex = vertexTable[vertex];
if (edgeIndex < 0) {
accept = true;
edgeIndex = -edgeIndex;
}
int numTransitions = edgeTable[edgeIndex ++];
boolean matchedOneTransition = false;
for (int i = 0; i < numTransitions; i++) {
// each transition
int newVertex = edgeTable[edgeIndex ++];
boolean matchesTransition = matchesWholeTransition();
if (matchesTransition) {
recognized += currentChar;
currentChar = getNextChar(false);
vertex = newVertex;
matchedOneTransition = true;
break; // found a matching transition. new vertex
}
}
if (!matchedOneTransition) {
if (accept) {
return true;
} else {
// backtrack characters
for (int i = recognized.length() -1; i >= 0; i--) {
ungetChar(currentChar);
currentChar = recognized.charAt(i);
}
goOn = false;
}
}
} while (goOn);
return false;
}
/**
* This routine maps a state and a token to a new state on the action table
* @param state is the current state
* @param symbol is the given symbol to find (if not found, defa will be used
* @return the next state
*/
private int parserAction(int state, int symbol) {
int index = getTokenIndex(symbol);
return parsingTable[state][index];
}
/**
* This routine maps a origin state to a destination state
* using the symbol position
* @param state is the current state
* @param non terminal that causes the transition
* @return the next state
*/
private int parserGoto(int state, int symbol) {
int index = symbol;
return parsingTable[state][index];
}
/**
* This routine prints the contents of the parsing stack
*/
private void parserPrintStack() {
int i;
System.out.println("States: [");
for(i=stackTop; i>=0; i--) {
System.out.print(" " + stateStack[i]);
if (i == stackTop) {
System.out.println("<--Top Of Stack (" + stackTop + ")");
}
else {
System.out.println();
}
}
System.out.println("]");
System.out.println("Values: [");
for(i=stackTop;i >=0; i--) {
System.out.print(" " + (stack[i] != null ? stack[i].toString() : "(null)"));
if (i == stackTop) {
System.out.println("<--Top Of Stack (" + stackTop + ")");
}
else {
System.out.println();
}
}
System.out.println("]");
}
/**
* Does a shift operation. Puts a new state on the top of the stack
* @param sym is the symbol causing the shift
* @param state is the current state
* @return 1 if OK
*/
private int parserShift(int sym, int state) {
if(stackTop >= STACK_DEPTH-1) {
return 0;
}
stateStack[++stackTop] = state;
stack[stackTop] = lexicalValue;
this.state = state;
if (isVerbose()) {
System.out.println("Shift to " + state + " with " + sym);
parserPrintStack();
}
return 1;
}
/**
* Recognizes a rule an removes all its elements from the stack
* @param sym is the symbol causing the shift
* @param rule is the number of rule being used
* @return 1 if OK
*/
private int parserReduce(int sym, int rule) {
if (isVerbose()) {
System.out.println("Reduce on rule " + rule + " with symbol " + sym);
}
if(generateCode(rule) == false) {
return 0;
}
stackTop -= grammarTable[rule].reductions;
stateStack[stackTop+1] =
parserGoto(stateStack[stackTop], grammarTable[rule].symbol);
state = stateStack[++stackTop];
if (isVerbose()) {
parserPrintStack();
}
return 1;
}
/**
* @return the error message for a state
*/
private String getErrorMessage() {
int msgIndex = parsingError[state];
if (msgIndex >= 0) {
return errorTable[msgIndex];
} else {
return "Syntax error on state " + state + " with token " + getTokenName(lexicalToken);
}
}
/**
* Recover from a syntax error removing stack states/symbols, and removing
* input tokens. The array StxRecover contains the tokens that bound
* the error
* @return 1 if OK
*/
private int parserRecover() {
int i, acc;
switch(errorFlag) {
case 0: // 1st error
if(parserError(state, lexicalToken, stackTop, getErrorMessage()) == 0) {
return 0;
}
errorCount++;
// continues and goes into 1 and 2. No break on purpose
case 1:
case 2: // three attempts are made before dropping the current token
errorFlag = 3; // Remove token
while(stackTop > 0) {
// Look if the state on the stack's top has a transition with one of
// the recovering elements in StxRecoverTable
for (i=0; i 0) {
// valid shift
return parserShift(recoverTable[i], acc);
}
}
if (isVerbose()) {
System.out.println("Recuperate removing state " + state + " and going to state " +
stack[stackTop-1]);
}
state = stateStack[--stackTop];
}
stackTop = 0;
return 0;
case 3: // I need to drop the current token
if (isVerbose()) {
System.out.println("Recuperate removing symbol " + lexicalToken);
}
if(lexicalToken == 0) { // end of file
return 0;
}
lexicalToken = parserElement(false);
return 1;
}
// should never reach
System.err.println("ASSERTION FAILED ON PARSER");
Exception e = new Exception();
e.printStackTrace(System.err);
return 0;
}
/**
* Main parser routine, uses Shift, Reduce and Recover
* @return 1 if OK
*/
public int parse() {
int action;
stackTop = 0;
stateStack[0] = 0;
stack[0] = null;
lexicalToken = parserElement(true);
state = 0;
errorFlag = 0;
errorCount = 0;
if (isVerbose()) {
System.out.println("Starting to parse");
parserPrintStack();
}
while(2 != 1) { // forever with break and return below
action = parserAction(state, lexicalToken);
if(action == ACCEPT) {
if (isVerbose()) {
System.out.println("Program Accepted");
}
return 1;
}
if(action > 0) {
if(parserShift(lexicalToken, action) == 0) {
return 0;
}
lexicalToken = parserElement(false);
if(errorFlag > 0) {
errorFlag--; // properly recovering from error
}
} else if(action < 0) {
if(parserReduce(lexicalToken, -action) == 0) {
if(errorFlag == -1) {
if(parserRecover() == 0) {
return 0;
}
} else {
return 0;
}
}
} else if(action == 0) {
if(parserRecover() == 0) {
return 0;
}
}
}
}
/**
* @return the current lexical value
*/
public StackElement getResult() {
return stack[stackTop];
}
/**
* @param token is the number of the token
* @return the name of a token, given the token number
*/
public String getTokenName(int token) {
for (int i = 0; i < tokenDefs.length; i++) {
if (tokenDefs[i].token == token) {
return tokenDefs[i].name;
}
}
if (token < 256) {
return "\'" + (char) token + "\'";
} else {
return "UNKNOWN TOKEN";
}
}
/**
* @param token is the number of the token
* @return the name of a token, given the token number
*/
public int getTokenIndex(int token) {
for (int i = 0; i < tokenDefs.length; i++) {
if (tokenDefs[i].token == token) {
return i;
}
}
return -1;
}
/**
* Perform a round of tokenization and dump the results
*/
public void dumpTokens() {
lexicalToken = parserElement(true);
lexicalValue = null;
while (lexicalToken != 0) {
System.out.println("Token: " + getTokenName(lexicalToken) + "(" + lexicalToken + "):" + (lexicalValue == null? "null": lexicalValue.toString()));
lexicalValue = null;
lexicalToken = parserElement(false);
}
}
int findReservedWord(String word) {
for (int i = 0; i < tokenDefs.length; i++) {
if (tokenDefs[i].reserved && tokenDefs[i].name.equals(word)) {
return tokenDefs[i].token;
}
}
return -1;
}
int findReservedWordIgnoreCase(String word) {
for (int i = 0; i < tokenDefs.length; i++) {
if (tokenDefs[i].reserved && tokenDefs[i].name.equalsIgnoreCase(word)) {
return tokenDefs[i].token;
}
}
return -1;
}
/*
*
* End of packed skeleton for java
*
*/