/* The following code was generated by JFlex 1.4.3 on 19/03/12 19:18 */
/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
* Copyright (C) 2011-2012 Marchand Eric <ricoh51@free.fr> *
* All rights reserved. *
* *
* This program is free software; you can redistribute it and/or modify *
* it under the terms of the GNU General Public License. See the file *
* COPYRIGHT for more information. *
* *
* 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, write to the Free Software Foundation, Inc., *
* 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA *
* *
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
/* --------------------------Usercode Section------------------------ */
package freegressi.parser;
import freegressi.tableur.Noeud;
import freegressi.tableur.Sym;
import java.util.List;
/**
* This class is a scanner generated by
* <a href="http://www.jflex.de/">JFlex</a> 1.4.3
* on 19/03/12 19:18 from the specification file
* <tt>freegressi.flex</tt>
*/
public class Lexer {
/** This character denotes the end of file */
public static final int YYEOF = -1;
/** initial size of the lookahead buffer */
private static final int ZZ_BUFFERSIZE = 16384;
/** lexical states */
public static final int UNIT = 2;
public static final int YYINITIAL = 0;
public static final int COMMENT = 4;
/**
* ZZ_LEXSTATE[l] is the state in the DFA for the lexical state l
* ZZ_LEXSTATE[l+1] is the state in the DFA for the lexical state l
* at the beginning of a line
* l is of the form l = 2*k, k a non negative integer
*/
private static final int ZZ_LEXSTATE[] = {
0, 0, 1, 1, 2, 2
};
/**
* Translates characters to character classes
*/
private static final String ZZ_CMAP_PACKED =
"\11\11\1\3\1\2\1\0\1\3\1\1\16\11\4\0\1\3\2\0"+
"\1\12\1\10\3\0\1\32\1\33\1\17\1\16\1\15\1\7\1\5"+
"\1\20\12\4\3\0\1\14\2\0\1\13\4\10\1\6\25\10\3\0"+
"\1\21\1\10\1\0\1\42\1\52\1\37\1\54\1\45\1\10\1\44"+
"\1\10\1\35\2\10\1\43\1\53\1\36\1\40\1\47\1\50\1\51"+
"\1\34\1\41\1\10\1\55\1\10\1\46\2\10\4\0\41\11\2\0"+
"\4\10\4\0\1\10\2\0\1\11\4\0\1\22\1\23\1\0\1\10"+
"\4\0\1\10\5\0\27\10\1\0\37\10\1\0\u013f\10\31\0\162\10"+
"\4\0\14\10\16\0\5\10\11\0\1\10\21\0\130\11\5\0\23\11"+
"\12\0\1\10\13\0\1\10\1\0\3\10\1\0\1\10\1\0\24\10"+
"\1\0\35\10\1\56\16\10\1\0\46\10\1\0\5\10\4\0\202\10"+
"\1\0\4\11\3\0\105\10\1\0\46\10\2\0\2\10\6\0\20\10"+
"\41\0\46\10\2\0\1\10\7\0\47\10\11\0\21\11\1\0\27\11"+
"\1\0\3\11\1\0\1\11\1\0\2\11\1\0\1\11\13\0\33\10"+
"\5\0\3\10\15\0\4\11\14\0\6\11\13\0\32\10\5\0\13\10"+
"\16\11\7\0\12\11\4\0\2\10\1\11\143\10\1\0\1\10\10\11"+
"\1\0\6\11\2\10\2\11\1\0\4\11\2\10\12\11\3\10\2\0"+
"\1\10\17\0\1\11\1\10\1\11\36\10\33\11\2\0\3\10\60\0"+
"\46\10\13\11\1\10\u014f\0\3\11\66\10\2\0\1\11\1\10\20\11"+
"\2\0\1\10\4\11\3\0\12\10\2\11\2\0\12\11\21\0\3\11"+
"\1\0\10\10\2\0\2\10\2\0\26\10\1\0\7\10\1\0\1\10"+
"\3\0\4\10\2\0\1\11\1\10\7\11\2\0\2\11\2\0\3\11"+
"\11\0\1\11\4\0\2\10\1\0\3\10\2\11\2\0\12\11\4\10"+
"\15\0\3\11\1\0\6\10\4\0\2\10\2\0\26\10\1\0\7\10"+
"\1\0\2\10\1\0\2\10\1\0\2\10\2\0\1\11\1\0\5\11"+
"\4\0\2\11\2\0\3\11\13\0\4\10\1\0\1\10\7\0\14\11"+
"\3\10\14\0\3\11\1\0\11\10\1\0\3\10\1\0\26\10\1\0"+
"\7\10\1\0\2\10\1\0\5\10\2\0\1\11\1\10\10\11\1\0"+
"\3\11\1\0\3\11\2\0\1\10\17\0\2\10\2\11\2\0\12\11"+
"\1\0\1\10\17\0\3\11\1\0\10\10\2\0\2\10\2\0\26\10"+
"\1\0\7\10\1\0\2\10\1\0\5\10\2\0\1\11\1\10\6\11"+
"\3\0\2\11\2\0\3\11\10\0\2\11\4\0\2\10\1\0\3\10"+
"\4\0\12\11\1\0\1\10\20\0\1\11\1\10\1\0\6\10\3\0"+
"\3\10\1\0\4\10\3\0\2\10\1\0\1\10\1\0\2\10\3\0"+
"\2\10\3\0\3\10\3\0\10\10\1\0\3\10\4\0\5\11\3\0"+
"\3\11\1\0\4\11\11\0\1\11\17\0\11\11\11\0\1\10\7\0"+
"\3\11\1\0\10\10\1\0\3\10\1\0\27\10\1\0\12\10\1\0"+
"\5\10\4\0\7\11\1\0\3\11\1\0\4\11\7\0\2\11\11\0"+
"\2\10\4\0\12\11\22\0\2\11\1\0\10\10\1\0\3\10\1\0"+
"\27\10\1\0\12\10\1\0\5\10\2\0\1\11\1\10\7\11\1\0"+
"\3\11\1\0\4\11\7\0\2\11\7\0\1\10\1\0\2\10\4\0"+
"\12\11\22\0\2\11\1\0\10\10\1\0\3\10\1\0\27\10\1\0"+
"\20\10\4\0\6\11\2\0\3\11\1\0\4\11\11\0\1\11\10\0"+
"\2\10\4\0\12\11\22\0\2\11\1\0\22\10\3\0\30\10\1\0"+
"\11\10\1\0\1\10\2\0\7\10\3\0\1\11\4\0\6\11\1\0"+
"\1\11\1\0\10\11\22\0\2\11\15\0\60\10\1\11\2\10\7\11"+
"\4\0\10\10\10\11\1\0\12\11\47\0\2\10\1\0\1\10\2\0"+
"\2\10\1\0\1\10\2\0\1\10\6\0\4\10\1\0\7\10\1\0"+
"\3\10\1\0\1\10\1\0\1\10\2\0\2\10\1\0\4\10\1\11"+
"\2\10\6\11\1\0\2\11\1\10\2\0\5\10\1\0\1\10\1\0"+
"\6\11\2\0\12\11\2\0\2\10\42\0\1\10\27\0\2\11\6\0"+
"\12\11\13\0\1\11\1\0\1\11\1\0\1\11\4\0\2\11\10\10"+
"\1\0\42\10\6\0\24\11\1\0\2\11\4\10\4\0\10\11\1\0"+
"\44\11\11\0\1\11\71\0\42\10\1\0\5\10\1\0\2\10\1\0"+
"\7\11\3\0\4\11\6\0\12\11\6\0\6\10\4\11\106\0\46\10"+
"\12\0\51\10\7\0\132\10\5\0\104\10\5\0\122\10\6\0\7\10"+
"\1\0\77\10\1\0\1\10\1\0\4\10\2\0\7\10\1\0\1\10"+
"\1\0\4\10\2\0\47\10\1\0\1\10\1\0\4\10\2\0\37\10"+
"\1\0\1\10\1\0\4\10\2\0\7\10\1\0\1\10\1\0\4\10"+
"\2\0\7\10\1\0\7\10\1\0\27\10\1\0\37\10\1\0\1\10"+
"\1\0\4\10\2\0\7\10\1\0\47\10\1\0\23\10\16\0\11\11"+
"\56\0\125\10\14\0\u026c\10\2\0\10\10\12\0\32\10\5\0\113\10"+
"\3\0\3\10\17\0\15\10\1\0\4\10\3\11\13\0\22\10\3\11"+
"\13\0\22\10\2\11\14\0\15\10\1\0\3\10\1\0\2\11\14\0"+
"\64\10\40\11\3\0\1\10\3\0\2\10\1\11\2\0\12\11\41\0"+
"\3\11\2\0\12\11\6\0\130\10\10\0\51\10\1\11\126\0\35\10"+
"\3\0\14\11\4\0\14\11\12\0\12\11\36\10\2\0\5\10\u038b\0"+
"\154\10\224\0\234\10\4\0\132\10\6\0\26\10\2\0\6\10\2\0"+
"\46\10\2\0\6\10\2\0\10\10\1\0\1\10\1\0\1\10\1\0"+
"\1\10\1\0\37\10\2\0\65\10\1\0\7\10\1\0\1\10\3\0"+
"\3\10\1\0\7\10\3\0\4\10\2\0\6\10\4\0\15\10\5\0"+
"\3\10\1\0\7\10\17\0\4\11\32\0\5\11\20\0\2\10\23\0"+
"\1\10\13\0\4\11\6\0\6\11\1\0\1\10\2\0\1\24\1\25"+
"\1\26\1\27\1\30\1\31\5\0\1\10\40\0\22\10\36\0\15\11"+
"\4\0\1\11\3\0\6\11\27\0\1\10\4\0\1\10\2\0\12\10"+
"\1\0\1\10\3\0\5\10\6\0\1\10\1\0\1\10\1\0\1\10"+
"\1\0\4\10\1\0\3\10\1\0\7\10\3\0\3\10\5\0\5\10"+
"\26\0\44\10\u0e81\0\3\10\31\0\11\10\6\11\1\0\5\10\2\0"+
"\5\10\4\0\126\10\2\0\2\11\2\0\3\10\1\0\137\10\5\0"+
"\50\10\4\0\136\10\21\0\30\10\70\0\20\10\u0200\0\u19b6\10\112\0"+
"\u51a6\10\132\0\u048d\10\u0773\0\u2ba4\10\u215c\0\u012e\10\2\0\73\10\225\0"+
"\7\10\14\0\5\10\5\0\1\10\1\11\12\10\1\0\15\10\1\0"+
"\5\10\1\0\1\10\1\0\2\10\1\0\2\10\1\0\154\10\41\0"+
"\u016b\10\22\0\100\10\2\0\66\10\50\0\15\10\3\0\20\11\20\0"+
"\4\11\17\0\2\10\30\0\3\10\31\0\1\10\6\0\5\10\1\0"+
"\207\10\2\0\1\11\4\0\1\10\13\0\12\11\7\0\32\10\4\0"+
"\1\10\1\0\32\10\12\0\132\10\3\0\6\10\2\0\6\10\2\0"+
"\6\10\2\0\3\10\3\0\2\10\3\0\2\10\22\0\3\11\4\0";
/**
* Translates characters to character classes
*/
private static final char [] ZZ_CMAP = zzUnpackCMap(ZZ_CMAP_PACKED);
/**
* Translates DFA states to action switch labels.
*/
private static final int [] ZZ_ACTION = zzUnpackAction();
private static final String ZZ_ACTION_PACKED_0 =
"\3\0\1\1\2\2\1\3\1\1\1\4\1\5\1\6"+
"\1\7\1\10\1\11\1\12\1\13\1\14\1\15\1\16"+
"\1\17\1\20\1\21\1\22\1\23\1\24\1\25\1\26"+
"\1\27\5\4\1\30\4\4\1\31\1\32\1\33\1\34"+
"\1\32\1\35\1\3\1\0\10\4\1\36\5\4\1\3"+
"\1\0\1\37\1\40\1\41\1\42\3\4\1\43\1\44"+
"\1\45\3\4\1\46\1\47\1\50\1\51\1\52\1\53"+
"\1\4\1\54";
private static int [] zzUnpackAction() {
int [] result = new int[83];
int offset = 0;
offset = zzUnpackAction(ZZ_ACTION_PACKED_0, offset, result);
return result;
}
private static int zzUnpackAction(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;
}
/**
* Translates a state to a row index in the transition table
*/
private static final int [] ZZ_ROWMAP = zzUnpackRowMap();
private static final String ZZ_ROWMAP_PACKED_0 =
"\0\0\0\57\0\136\0\215\0\274\0\215\0\353\0\u011a"+
"\0\u0149\0\215\0\215\0\215\0\215\0\215\0\215\0\215"+
"\0\215\0\215\0\215\0\215\0\215\0\215\0\215\0\215"+
"\0\215\0\215\0\215\0\215\0\u0178\0\u01a7\0\u01d6\0\u0205"+
"\0\u0234\0\u0263\0\u0292\0\u02c1\0\u02f0\0\u031f\0\u0149\0\u034e"+
"\0\215\0\215\0\u037d\0\215\0\u03ac\0\u03db\0\u040a\0\u0439"+
"\0\u0468\0\u0497\0\u04c6\0\u04f5\0\u0524\0\u0553\0\u0149\0\u0582"+
"\0\u05b1\0\u05e0\0\u060f\0\u063e\0\u066d\0\u066d\0\u0149\0\u069c"+
"\0\u0149\0\u0149\0\u06cb\0\u06fa\0\u0729\0\u0149\0\u0149\0\u0149"+
"\0\u0758\0\u0787\0\u07b6\0\u0149\0\u0149\0\u0149\0\u0149\0\u0149"+
"\0\u0149\0\u07e5\0\u0149";
private static int [] zzUnpackRowMap() {
int [] result = new int[83];
int offset = 0;
offset = zzUnpackRowMap(ZZ_ROWMAP_PACKED_0, offset, result);
return result;
}
private static int zzUnpackRowMap(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 high = packed.charAt(i++) << 16;
result[j++] = high | packed.charAt(i++);
}
return j;
}
/**
* The transition table of the DFA
*/
private static final int [] ZZ_TRANS = zzUnpackTrans();
private static final String ZZ_TRANS_PACKED_0 =
"\1\4\1\5\2\6\1\7\1\10\1\11\1\12\1\11"+
"\1\4\1\13\1\14\1\15\1\16\1\17\1\20\1\21"+
"\1\22\1\23\1\24\1\25\1\26\1\27\1\30\1\31"+
"\1\32\1\33\1\34\1\35\2\11\1\36\1\11\1\37"+
"\1\40\1\41\1\11\1\42\1\11\1\43\1\11\1\44"+
"\1\11\1\45\1\46\1\11\1\47\2\50\1\51\7\50"+
"\1\52\44\50\2\53\1\54\54\53\61\0\1\6\60\0"+
"\1\7\1\55\1\56\36\0\1\56\15\0\1\55\56\0"+
"\1\11\1\0\1\11\1\0\2\11\22\0\23\11\4\0"+
"\1\11\1\0\1\11\1\0\2\11\22\0\1\11\1\57"+
"\12\11\1\60\6\11\4\0\1\11\1\0\1\11\1\0"+
"\2\11\22\0\4\11\1\61\16\11\4\0\1\11\1\0"+
"\1\11\1\0\2\11\22\0\6\11\1\62\14\11\4\0"+
"\1\11\1\0\1\11\1\0\2\11\22\0\1\63\2\11"+
"\1\64\1\11\1\65\10\11\1\66\4\11\4\0\1\11"+
"\1\0\1\11\1\0\2\11\22\0\2\11\1\67\1\11"+
"\1\70\16\11\4\0\1\11\1\0\1\11\1\0\2\11"+
"\22\0\12\11\1\71\10\11\4\0\1\11\1\0\1\11"+
"\1\0\2\11\22\0\1\11\1\47\21\11\4\0\1\11"+
"\1\0\1\11\1\0\2\11\22\0\6\11\1\72\14\11"+
"\4\0\1\11\1\0\1\11\1\0\2\11\22\0\11\11"+
"\1\73\11\11\4\0\1\11\1\0\1\11\1\0\2\11"+
"\22\0\11\11\1\74\11\11\2\50\1\0\7\50\1\0"+
"\44\50\2\53\1\0\54\53\4\0\1\55\1\0\1\56"+
"\36\0\1\56\15\0\1\75\2\0\1\76\6\0\1\76"+
"\44\0\1\11\1\0\1\11\1\0\2\11\22\0\2\11"+
"\1\77\20\11\4\0\1\11\1\0\1\11\1\0\2\11"+
"\22\0\15\11\1\100\5\11\4\0\1\11\1\0\1\11"+
"\1\0\2\11\22\0\1\101\22\11\4\0\1\11\1\0"+
"\1\11\1\0\2\11\22\0\2\11\1\102\20\11\4\0"+
"\1\11\1\0\1\11\1\0\2\11\22\0\1\11\1\103"+
"\21\11\4\0\1\11\1\0\1\11\1\0\2\11\22\0"+
"\4\11\1\104\16\11\4\0\1\11\1\0\1\11\1\0"+
"\2\11\22\0\6\11\1\105\14\11\4\0\1\11\1\0"+
"\1\11\1\0\2\11\22\0\1\106\22\11\4\0\1\11"+
"\1\0\1\11\1\0\2\11\22\0\10\11\1\107\12\11"+
"\4\0\1\11\1\0\1\11\1\0\2\11\22\0\13\11"+
"\1\110\7\11\4\0\1\11\1\0\1\11\1\0\2\11"+
"\22\0\2\11\1\111\20\11\4\0\1\11\1\0\1\11"+
"\1\0\2\11\22\0\6\11\1\112\14\11\4\0\1\11"+
"\1\0\1\11\1\0\2\11\22\0\15\11\1\113\5\11"+
"\4\0\1\75\56\0\1\11\1\0\1\11\1\0\2\11"+
"\22\0\5\11\1\114\15\11\4\0\1\11\1\0\1\11"+
"\1\0\2\11\22\0\2\11\1\115\20\11\4\0\1\11"+
"\1\0\1\11\1\0\2\11\22\0\1\116\22\11\4\0"+
"\1\11\1\0\1\11\1\0\2\11\22\0\2\11\1\117"+
"\20\11\4\0\1\11\1\0\1\11\1\0\2\11\22\0"+
"\20\11\1\120\2\11\4\0\1\11\1\0\1\11\1\0"+
"\2\11\22\0\2\11\1\121\20\11\4\0\1\11\1\0"+
"\1\11\1\0\2\11\22\0\1\11\1\122\21\11\4\0"+
"\1\11\1\0\1\11\1\0\2\11\22\0\21\11\1\123"+
"\1\11";
private static int [] zzUnpackTrans() {
int [] result = new int[2068];
int offset = 0;
offset = zzUnpackTrans(ZZ_TRANS_PACKED_0, offset, result);
return result;
}
private static int zzUnpackTrans(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++);
value--;
do result[j++] = value; while (--count > 0);
}
return j;
}
/* error codes */
private static final int ZZ_UNKNOWN_ERROR = 0;
private static final int ZZ_NO_MATCH = 1;
private static final int ZZ_PUSHBACK_2BIG = 2;
/* error messages for the codes above */
private static final String ZZ_ERROR_MSG[] = {
"Unkown internal scanner error",
"Error: could not match input",
"Error: pushback value was too large"
};
/**
* ZZ_ATTRIBUTE[aState] contains the attributes of state <code>aState</code>
*/
private static final int [] ZZ_ATTRIBUTE = zzUnpackAttribute();
private static final String ZZ_ATTRIBUTE_PACKED_0 =
"\3\0\1\11\1\1\1\11\3\1\23\11\14\1\2\11"+
"\1\1\1\11\1\1\1\0\17\1\1\0\25\1";
private static int [] zzUnpackAttribute() {
int [] result = new int[83];
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;
/** number of newlines encountered up to the start of the matched text */
private int yyline;
/** the number of characters up to the start of the matched text */
private int yychar;
/**
* the number of characters from the last newline up to the start of the
* matched text
*/
private int yycolumn;
/**
* zzAtBOL == true <=> the scanner is currently at the beginning of a line
*/
private boolean zzAtBOL = true;
/** zzAtEOF == true <=> the scanner is at the EOF */
private boolean zzAtEOF;
/** denotes if the user-EOF-code has already been executed */
private boolean zzEOFDone;
/* user code: */
StringBuffer string = new StringBuffer();
List liste;
private void ajouteNoeud(int type, String str){
liste.add(new Noeud(type, yyline, yycolumn - str.length(), str));
}
private void ajouteNoeud(int type, int categorie, int priorite) {
liste.add(new Noeud(type, categorie, priorite, yyline, yycolumn, yytext()));
}
private void ajouteNoeud(int type, int categorie, int priorite, Double valeur) {
liste.add(new Noeud(type, categorie, priorite, valeur, yyline, yycolumn, yytext()));
}
private void ajouteNoeud(int type, int categorie, int priorite, String nom) {
liste.add(new Noeud(type, categorie, priorite, nom, yyline, yycolumn, yytext()));
}
/** ***********************************************************************
* Ajoute un noeud en spécifiant le type, la catégorie, la priorité
* et un paramètre qui correspond aux nombre de paramètres de la fonction si
* c'est une fonction, ou à la puissance si c'est ² ou ³ ou....
* @param type
* @param categorie
* @param priorite
* @param param
* @return rien
************************************************************************* */
private void ajouteNoeud(int type, int categorie, int priorite, int param) {
liste.add(new Noeud(type, categorie, priorite, param, yyline, yycolumn, yytext()));
}
/**
* 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 Lexer(java.io.Reader in, List<Noeud> list) {
liste = list;
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 Lexer(java.io.InputStream in, List<Noeud> list) {
this(new java.io.InputStreamReader(in), list);
}
/**
* Unpacks the compressed character translation table.
*
* @param packed the packed character translation table
* @return the unpacked character translation table
*/
private static char [] zzUnpackCMap(String packed) {
char [] map = new char[0x10000];
int i = 0; /* index in packed string */
int j = 0; /* index in unpacked array */
while (i < 1760) {
int count = packed.charAt(i++);
char value = packed.charAt(i++);
do map[j++] = value; while (--count > 0);
}
return map;
}
/**
* Refills the input buffer.
*
* @return <code>false</code>, 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
* <b>cannot</b> be reused (internal buffer is discarded and lost).
* Lexical state is set to <tt>ZZ_INITIAL</tt>.
*
* @param reader the new input stream
*/
public final void yyreset(java.io.Reader reader) {
zzReader = reader;
zzAtBOL = true;
zzAtEOF = false;
zzEOFDone = false;
zzEndRead = zzStartRead = 0;
zzCurrentPos = zzMarkedPos = 0;
yyline = yychar = yycolumn = 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 <tt>pos</tt> 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;
}
/**
* Contains user EOF-code, which will be executed exactly once,
* when the end of file is reached
*/
private void zzDoEOF() throws java.io.IOException {
if (!zzEOFDone) {
zzEOFDone = true;
yyclose();
}
}
/**
* 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
*/
public int yylex() 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;
boolean zzR = false;
for (zzCurrentPosL = zzStartRead; zzCurrentPosL < zzMarkedPosL;
zzCurrentPosL++) {
switch (zzBufferL[zzCurrentPosL]) {
case '\u000B':
case '\u000C':
case '\u0085':
case '\u2028':
case '\u2029':
yyline++;
yycolumn = 0;
zzR = false;
break;
case '\r':
yyline++;
yycolumn = 0;
zzR = true;
break;
case '\n':
if (zzR)
zzR = false;
else {
yyline++;
yycolumn = 0;
}
break;
default:
zzR = false;
yycolumn++;
}
}
if (zzR) {
// peek one character ahead if it is \n (if we have counted one line too much)
boolean zzPeek;
if (zzMarkedPosL < zzEndReadL)
zzPeek = zzBufferL[zzMarkedPosL] == '\n';
else if (zzAtEOF)
zzPeek = false;
else {
boolean eof = zzRefill();
zzEndReadL = zzEndRead;
zzMarkedPosL = zzMarkedPos;
zzBufferL = zzBuffer;
if (eof)
zzPeek = false;
else
zzPeek = zzBufferL[zzMarkedPosL] == '\n';
}
if (zzPeek) yyline--;
}
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 38:
{ ajouteNoeud(Sym.SQRT, Sym.CATEGORIE_FONCTION, Sym.PRIORITE_HAUTE, 1);
}
case 45: break;
case 42:
{ ajouteNoeud(Sym.RAND, Sym.CATEGORIE_FONCTION, Sym.PRIORITE_HAUTE, 2);
}
case 46: break;
case 27:
{ yybegin(YYINITIAL); ajouteNoeud(Sym.UNIT_TEXT, string.toString());
}
case 47: break;
case 7:
{ string.setLength(0);
ajouteNoeud(Sym.UNIT, Sym.CATEGORIE_SANS, Sym.PRIORITE_SANS);
yybegin(UNIT);
}
case 48: break;
case 18:
{ ajouteNoeud(Sym.PUISN, Sym.CATEGORIE_OPERATEUR, Sym.PRIORITE_HAUTE, 6);
}
case 49: break;
case 34:
{ ajouteNoeud(Sym.TAN, Sym.CATEGORIE_FONCTION, Sym.PRIORITE_HAUTE, 1);
}
case 50: break;
case 39:
{ ajouteNoeud(Sym.ASIN, Sym.CATEGORIE_FONCTION, Sym.PRIORITE_HAUTE, 1);
}
case 51: break;
case 9:
{ ajouteNoeud(Sym.VIRGULE, Sym.CATEGORIE_OPERATEUR, Sym.PRIORITE_SANS);
}
case 52: break;
case 36:
{ ajouteNoeud(Sym.LOG, Sym.CATEGORIE_FONCTION, Sym.PRIORITE_HAUTE, 1);
}
case 53: break;
case 44:
{ ajouteNoeud(Sym.DERIVEE, Sym.CATEGORIE_FONCTION, Sym.PRIORITE_HAUTE, 2);
}
case 54: break;
case 24:
{ ajouteNoeud(Sym.E, Sym.CATEGORIE_CONSTANTE, Sym.PRIORITE_BASSE);
}
case 55: break;
case 17:
{ ajouteNoeud(Sym.PUISN, Sym.CATEGORIE_OPERATEUR, Sym.PRIORITE_HAUTE, 5);
}
case 56: break;
case 1:
{ //System.out.println(" Erreur : "+yytext());
ajouteNoeud(Sym.ERROR, Sym.CATEGORIE_SANS, Sym.PRIORITE_HAUTE);
}
case 57: break;
case 40:
{ ajouteNoeud(Sym.ACOS, Sym.CATEGORIE_FONCTION, Sym.PRIORITE_HAUTE, 1);
}
case 58: break;
case 10:
{ ajouteNoeud(Sym.PLUS, Sym.CATEGORIE_OPERATEUR, Sym.PRIORITE_BASSE);
}
case 59: break;
case 25:
{ ajouteNoeud(Sym.PI, Sym.CATEGORIE_CONSTANTE, Sym.PRIORITE_BASSE);
}
case 60: break;
case 16:
{ ajouteNoeud(Sym.PUISN, Sym.CATEGORIE_OPERATEUR, Sym.PRIORITE_HAUTE, 4);
}
case 61: break;
case 29:
{ yybegin(YYINITIAL); ajouteNoeud(Sym.COMMENT_TEXT, string.toString());
}
case 62: break;
case 22:
{ ajouteNoeud(Sym.PARENG, Sym.CATEGORIE_SANS, Sym.PRIORITE_SANS);
}
case 63: break;
case 15:
{ ajouteNoeud(Sym.PUISN, Sym.CATEGORIE_OPERATEUR, Sym.PRIORITE_HAUTE, 3);
}
case 64: break;
case 37:
{ ajouteNoeud(Sym.EXP, Sym.CATEGORIE_FONCTION, Sym.PRIORITE_HAUTE, 1);
}
case 65: break;
case 31:
{ ajouteNoeud(Sym.SIN, Sym.CATEGORIE_FONCTION, Sym.PRIORITE_HAUTE, 1);
}
case 66: break;
case 30:
{ ajouteNoeud(Sym.LN, Sym.CATEGORIE_FONCTION, Sym.PRIORITE_HAUTE, 1);
}
case 67: break;
case 3:
{ ajouteNoeud(Sym.NOMBRE, Sym.CATEGORIE_SANS, Sym.PRIORITE_BASSE, new Double(yytext()));
}
case 68: break;
case 14:
{ ajouteNoeud(Sym.PUISN, Sym.CATEGORIE_OPERATEUR, Sym.PRIORITE_HAUTE, 2);
}
case 69: break;
case 33:
{ ajouteNoeud(Sym.COS, Sym.CATEGORIE_FONCTION, Sym.PRIORITE_HAUTE, 1);
}
case 70: break;
case 2:
{ /* Ne rien faire */
}
case 71: break;
case 35:
{ ajouteNoeud(Sym.ABS, Sym.CATEGORIE_FONCTION, Sym.PRIORITE_HAUTE, 1);
}
case 72: break;
case 5:
{ ajouteNoeud(Sym.MOINS, Sym.CATEGORIE_OPERATEUR, Sym.PRIORITE_BASSE);
}
case 73: break;
case 11:
{ ajouteNoeud(Sym.FOIS, Sym.CATEGORIE_OPERATEUR, Sym.PRIORITE_MOYENNE);
}
case 74: break;
case 21:
{ ajouteNoeud(Sym.PUISN, Sym.CATEGORIE_OPERATEUR, Sym.PRIORITE_HAUTE, 9);
}
case 75: break;
case 13:
{ ajouteNoeud(Sym.PUIS, Sym.CATEGORIE_OPERATEUR, Sym.PRIORITE_HAUTE);
}
case 76: break;
case 32:
{ ajouteNoeud(Sym.SQR, Sym.CATEGORIE_FONCTION, Sym.PRIORITE_HAUTE, 1);
}
case 77: break;
case 43:
{ ajouteNoeud(Sym.MOYENNE, Sym.CATEGORIE_FONCTION, Sym.PRIORITE_HAUTE, Integer.MAX_VALUE);
}
case 78: break;
case 41:
{ ajouteNoeud(Sym.ATAN, Sym.CATEGORIE_FONCTION, Sym.PRIORITE_HAUTE, 1);
}
case 79: break;
case 20:
{ ajouteNoeud(Sym.PUISN, Sym.CATEGORIE_OPERATEUR, Sym.PRIORITE_HAUTE, 8);
}
case 80: break;
case 23:
{ ajouteNoeud(Sym.PAREND, Sym.CATEGORIE_SANS, Sym.PRIORITE_SANS);
}
case 81: break;
case 12:
{ ajouteNoeud(Sym.DIVISE, Sym.CATEGORIE_OPERATEUR, Sym.PRIORITE_MOYENNE);
}
case 82: break;
case 8:
{ ajouteNoeud(Sym.EGAL, Sym.CATEGORIE_OPERATEUR, Sym.PRIORITE_SANS);
}
case 83: break;
case 26:
{ string.append( yytext() );
}
case 84: break;
case 6:
{ string.setLength(0);
ajouteNoeud(Sym.COMMENT, Sym.CATEGORIE_SANS, Sym.PRIORITE_SANS);
yybegin(COMMENT);
}
case 85: break;
case 4:
{ //System.out.print(yytext());
ajouteNoeud(Sym.ID, Sym.CATEGORIE_SANS, Sym.PRIORITE_BASSE, yytext());
}
case 86: break;
case 19:
{ ajouteNoeud(Sym.PUISN, Sym.CATEGORIE_OPERATEUR, Sym.PRIORITE_HAUTE, 7);
}
case 87: break;
case 28:
{ ajouteNoeud(Sym.UNIT_TEXT, string.toString()); yybegin(COMMENT);
ajouteNoeud(Sym.COMMENT, Sym.CATEGORIE_SANS, Sym.PRIORITE_SANS);
string.setLength(0);
}
case 88: break;
default:
if (zzInput == YYEOF && zzStartRead == zzCurrentPos) {
zzAtEOF = true;
zzDoEOF();
return YYEOF;
}
else {
zzScanError(ZZ_NO_MATCH);
}
}
}
}
}