weka.core.mathematicalexpression.Scanner Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of weka-dev Show documentation
Show all versions of weka-dev Show documentation
The Waikato Environment for Knowledge Analysis (WEKA), a machine
learning workbench. This version represents the developer version, the
"bleeding edge" of development, you could say. New functionality gets added
to this version.
/* The following code was generated by JFlex 1.4.2 on 4/26/10 10:55 AM */
/*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see aState
*/
private static final int[] ZZ_ATTRIBUTE = zzUnpackAttribute();
private static final String ZZ_ATTRIBUTE_PACKED_0 = "\1\0\1\11\1\1\3\11\1\1\1\11\1\1\3\11"
+ "\14\1\6\11\16\0\2\1\1\0\1\11\1\0\1\11"
+ "\2\0\2\11\1\0\2\11\2\0\3\11\2\0\1\11" + "\1\0\3\11\1\0\1\11";
private static int[] zzUnpackAttribute() {
int[] result = new int[71];
int offset = 0;
offset = zzUnpackAttribute(ZZ_ATTRIBUTE_PACKED_0, offset, result);
return result;
}
private static int zzUnpackAttribute(String packed, int offset, int[] result) {
int i = 0; /* index in packed string */
int j = offset; /* index in unpacked array */
int l = packed.length();
while (i < l) {
int count = packed.charAt(i++);
int value = packed.charAt(i++);
do {
result[j++] = value;
} while (--count > 0);
}
return j;
}
/** the input device */
private java.io.Reader zzReader;
/** the current state of the DFA */
private int zzState;
/** the current lexical state */
private int zzLexicalState = YYINITIAL;
/**
* this buffer contains the current text to be matched and is the source of
* the yytext() string
*/
private char zzBuffer[] = new char[ZZ_BUFFERSIZE];
/** the textposition at the last accepting state */
private int zzMarkedPos;
/** the current text position in the buffer */
private int zzCurrentPos;
/** startRead marks the beginning of the yytext() string in the buffer */
private int zzStartRead;
/**
* endRead marks the last character in the buffer, that has been read from
* input
*/
private int zzEndRead;
/** zzAtEOF == true <=> the scanner is at the EOF */
private boolean zzAtEOF;
/* user code: */
// Author: FracPete (fracpete at waikato dot ac dot nz)
// Version: $Revision: 10203 $
protected SymbolFactory sf;
public Scanner(InputStream r, SymbolFactory sf) {
this(r);
this.sf = sf;
}
/**
* Creates a new scanner There is also a java.io.InputStream version of this
* constructor.
*
* @param in the java.io.Reader to read input from.
*/
public Scanner(java.io.Reader in) {
this.zzReader = in;
}
/**
* Creates a new scanner. There is also java.io.Reader version of this
* constructor.
*
* @param in the java.io.Inputstream to read input from.
*/
public Scanner(java.io.InputStream in) {
this(new java.io.InputStreamReader(in));
}
/**
* Refills the input buffer.
*
* @return false, iff there was new input.
*
* @exception java.io.IOException if any I/O-Error occurs
*/
private boolean zzRefill() throws java.io.IOException {
/* first: make room (if you can) */
if (zzStartRead > 0) {
System.arraycopy(zzBuffer, zzStartRead, zzBuffer, 0, zzEndRead
- zzStartRead);
/* translate stored positions */
zzEndRead -= zzStartRead;
zzCurrentPos -= zzStartRead;
zzMarkedPos -= zzStartRead;
zzStartRead = 0;
}
/* is the buffer big enough? */
if (zzCurrentPos >= zzBuffer.length) {
/* if not: blow it up */
char newBuffer[] = new char[zzCurrentPos * 2];
System.arraycopy(zzBuffer, 0, newBuffer, 0, zzBuffer.length);
zzBuffer = newBuffer;
}
/* finally: fill the buffer with new input */
int numRead = zzReader.read(zzBuffer, zzEndRead, zzBuffer.length
- zzEndRead);
if (numRead > 0) {
zzEndRead += numRead;
return false;
}
// unlikely but not impossible: read 0 characters, but not at end of stream
if (numRead == 0) {
int c = zzReader.read();
if (c == -1) {
return true;
} else {
zzBuffer[zzEndRead++] = (char) c;
return false;
}
}
// numRead < 0
return true;
}
/**
* Closes the input stream.
*/
public final void yyclose() throws java.io.IOException {
zzAtEOF = true; /* indicate end of file */
zzEndRead = zzStartRead; /* invalidate buffer */
if (zzReader != null) {
zzReader.close();
}
}
/**
* Resets the scanner to read from a new input stream. Does not close the old
* reader.
*
* All internal variables are reset, the old input stream cannot be
* reused (internal buffer is discarded and lost). Lexical state is set to
* ZZ_INITIAL.
*
* @param reader the new input stream
*/
public final void yyreset(java.io.Reader reader) {
zzReader = reader;
zzAtEOF = false;
zzEndRead = zzStartRead = 0;
zzCurrentPos = zzMarkedPos = 0;
zzLexicalState = YYINITIAL;
}
/**
* Returns the current lexical state.
*/
public final int yystate() {
return zzLexicalState;
}
/**
* Enters a new lexical state
*
* @param newState the new lexical state
*/
public final void yybegin(int newState) {
zzLexicalState = newState;
}
/**
* Returns the text matched by the current regular expression.
*/
public final String yytext() {
return new String(zzBuffer, zzStartRead, zzMarkedPos - zzStartRead);
}
/**
* Returns the character at position pos from the matched text.
*
* It is equivalent to yytext().charAt(pos), but faster
*
* @param pos the position of the character to fetch. A value from 0 to
* yylength()-1.
*
* @return the character at position pos
*/
public final char yycharat(int pos) {
return zzBuffer[zzStartRead + pos];
}
/**
* Returns the length of the matched text region.
*/
public final int yylength() {
return zzMarkedPos - zzStartRead;
}
/**
* Reports an error that occured while scanning.
*
* In a wellformed scanner (no or only correct usage of yypushback(int) and a
* match-all fallback rule) this method will only be called with things that
* "Can't Possibly Happen". If this method is called, something is seriously
* wrong (e.g. a JFlex bug producing a faulty scanner etc.).
*
* Usual syntax/scanner level error handling should be done in error fallback
* rules.
*
* @param errorCode the code of the errormessage to display
*/
private void zzScanError(int errorCode) {
String message;
try {
message = ZZ_ERROR_MSG[errorCode];
} catch (ArrayIndexOutOfBoundsException e) {
message = ZZ_ERROR_MSG[ZZ_UNKNOWN_ERROR];
}
throw new Error(message);
}
/**
* Pushes the specified amount of characters back into the input stream.
*
* They will be read again by then next call of the scanning method
*
* @param number the number of characters to be read again. This number must
* not be greater than yylength()!
*/
public void yypushback(int number) {
if (number > yylength()) {
zzScanError(ZZ_PUSHBACK_2BIG);
}
zzMarkedPos -= number;
}
/**
* Resumes scanning until the next regular expression is matched, the end of
* input is encountered or an I/O-Error occurs.
*
* @return the next token
* @exception java.io.IOException if any I/O-Error occurs
*/
@Override
public java_cup.runtime.Symbol next_token() throws java.io.IOException {
int zzInput;
int zzAction;
// cached fields:
int zzCurrentPosL;
int zzMarkedPosL;
int zzEndReadL = zzEndRead;
char[] zzBufferL = zzBuffer;
char[] zzCMapL = ZZ_CMAP;
int[] zzTransL = ZZ_TRANS;
int[] zzRowMapL = ZZ_ROWMAP;
int[] zzAttrL = ZZ_ATTRIBUTE;
while (true) {
zzMarkedPosL = zzMarkedPos;
zzAction = -1;
zzCurrentPosL = zzCurrentPos = zzStartRead = zzMarkedPosL;
zzState = ZZ_LEXSTATE[zzLexicalState];
zzForAction: {
while (true) {
if (zzCurrentPosL < zzEndReadL) {
zzInput = zzBufferL[zzCurrentPosL++];
} else if (zzAtEOF) {
zzInput = YYEOF;
break zzForAction;
} else {
// store back cached positions
zzCurrentPos = zzCurrentPosL;
zzMarkedPos = zzMarkedPosL;
boolean eof = zzRefill();
// get translated positions and possibly new buffer
zzCurrentPosL = zzCurrentPos;
zzMarkedPosL = zzMarkedPos;
zzBufferL = zzBuffer;
zzEndReadL = zzEndRead;
if (eof) {
zzInput = YYEOF;
break zzForAction;
} else {
zzInput = zzBufferL[zzCurrentPosL++];
}
}
int zzNext = zzTransL[zzRowMapL[zzState] + zzCMapL[zzInput]];
if (zzNext == -1) {
break zzForAction;
}
zzState = zzNext;
int zzAttributes = zzAttrL[zzState];
if ((zzAttributes & 1) == 1) {
zzAction = zzState;
zzMarkedPosL = zzCurrentPosL;
if ((zzAttributes & 8) == 8) {
break zzForAction;
}
}
}
}
// store back cached position
zzMarkedPos = zzMarkedPosL;
switch (zzAction < 0 ? zzAction : ZZ_ACTION[zzAction]) {
case 11: {
return sf.newSymbol("Or", sym.OR);
}
case 34:
break;
case 24: {
return sf.newSymbol("Sin", sym.SIN);
}
case 35:
break;
case 23: {
return sf.newSymbol("Log", sym.LOG);
}
case 36:
break;
case 16: {
return sf.newSymbol("Left Bracket", sym.LPAREN);
}
case 37:
break;
case 27: {
return sf.newSymbol("True", sym.TRUE);
}
case 38:
break;
case 1: {
System.err.println("Illegal character: " + yytext());
}
case 39:
break;
case 29: {
return sf.newSymbol("Sqrt", sym.SQRT);
}
case 40:
break;
case 30: {
return sf.newSymbol("Ceil", sym.CEIL);
}
case 41:
break;
case 31: {
return sf.newSymbol("False", sym.FALSE);
}
case 42:
break;
case 18: {
return sf.newSymbol("Less or equal than", sym.LE);
}
case 43:
break;
case 17: {
return sf.newSymbol("Right Bracket", sym.RPAREN);
}
case 44:
break;
case 26: {
return sf.newSymbol("Cos", sym.COS);
}
case 45:
break;
case 21: {
return sf.newSymbol("Exp", sym.EXP);
}
case 46:
break;
case 12: {
return sf.newSymbol("Number", sym.NUMBER, new Double(yytext()));
}
case 47:
break;
case 3: {
return sf.newSymbol("Plus", sym.PLUS);
}
case 48:
break;
case 13: {
return sf.newSymbol("Variable", sym.VARIABLE, new String(yytext()));
}
case 49:
break;
case 22: {
return sf.newSymbol("Abs", sym.ABS);
}
case 50:
break;
case 20: {
return sf.newSymbol("Tan", sym.TAN);
}
case 51:
break;
case 15: {
return sf.newSymbol("Comma", sym.COMMA);
}
case 52:
break;
case 33: {
return sf.newSymbol("IfElse", sym.IFELSE);
}
case 53:
break;
case 28: {
return sf.newSymbol("Rint", sym.RINT);
}
case 54:
break;
case 8: {
return sf.newSymbol("Greater than", sym.GT);
}
case 55:
break;
case 19: {
return sf.newSymbol("Greater or equal than", sym.GE);
}
case 56:
break;
case 5: {
return sf.newSymbol("Division", sym.DIVISION);
}
case 57:
break;
case 7: {
return sf.newSymbol("Equals", sym.EQ);
}
case 58:
break;
case 10: {
return sf.newSymbol("And", sym.AND);
}
case 59:
break;
case 9: {
return sf.newSymbol("Not", sym.NOT);
}
case 60:
break;
case 4: {
return sf.newSymbol("Times", sym.TIMES);
}
case 61:
break;
case 32: {
return sf.newSymbol("Floor", sym.FLOOR);
}
case 62:
break;
case 6: {
return sf.newSymbol("Less than", sym.LT);
}
case 63:
break;
case 25: {
return sf.newSymbol("Pow", sym.POW);
}
case 64:
break;
case 14: { /* ignore white space. */
}
case 65:
break;
case 2: {
return sf.newSymbol("Minus", sym.MINUS);
}
case 66:
break;
default:
if (zzInput == YYEOF && zzStartRead == zzCurrentPos) {
zzAtEOF = true;
{
return sf.newSymbol("EOF", sym.EOF);
}
} else {
zzScanError(ZZ_NO_MATCH);
}
}
}
}
}
© 2015 - 2024 Weber Informatics LLC | Privacy Policy