Mercurial > hg > mpdl-group
view software/eXist/mpdl-modules/src/de/mpg/mpiwg/berlin/mpdl/lt/general/Unicode2BuckwalterLex.java @ 25:e9fe3186670c default tip
letzter Stand eingecheckt
author | Josef Willenborg <jwillenborg@mpiwg-berlin.mpg.de> |
---|---|
date | Tue, 21 May 2013 10:19:32 +0200 |
parents | 2396a569e446 |
children |
line wrap: on
line source
/* The following code was generated by JFlex 1.4.3 on 14.12.10 17:12 */ package de.mpg.mpiwg.berlin.mpdl.lt.general; /** * This class is a scanner generated by * <a href="http://www.jflex.de/">JFlex</a> 1.4.3 * on 14.12.10 17:12 from the specification file * <tt>/Users/jwillenborg/test/jflex/Unicode2Buckwalter.lex</tt> */ public class Unicode2BuckwalterLex { /** 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 YYINITIAL = 0; /** * 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 }; /** * Translates characters to character classes */ private static final String ZZ_CMAP_PACKED = "\12\0\1\0\30\0\1\120\2\0\1\117\11\0\1\121\2\0\1\122"+ "\5\0\1\123\1\0\1\112\1\1\1\0\1\2\2\0\32\124\4\0"+ "\1\105\1\0\1\115\3\124\1\107\1\124\1\116\4\124\1\113\3\124"+ "\1\114\1\124\1\110\1\124\1\111\1\124\1\106\4\124\u05a4\0\1\71"+ "\1\0\1\3\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\1\30\1\31\1\32\1\33\1\34\5\0\1\35\1\36"+ "\1\37\1\40\1\41\1\42\1\43\1\44\1\45\1\46\1\47\1\50"+ "\1\51\1\52\1\53\1\54\1\55\1\56\1\57\1\60\1\61\33\0"+ "\1\62\1\63\14\0\1\64\7\0\1\65\21\0\1\70\13\0\1\66"+ "\12\0\1\67\54\0\1\72\2\0\1\73\2\0\1\74\1\75\1\0"+ "\1\76\1\77\1\0\1\100\1\0\1\101\1\102\1\103\1\104\uf912\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 = "\1\0\2\1\1\2\1\3\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"+ "\1\30\1\31\1\32\1\33\1\34\1\35\1\36\1\37"+ "\1\40\1\41\1\42\1\43\1\44\1\45\1\46\1\47"+ "\1\50\1\51\1\52\1\53\1\54\1\55\1\56\1\57"+ "\1\60\1\61\1\62\1\63\1\64\1\65\1\66\1\67"+ "\1\70\1\71\1\72\1\73\1\74\1\75\1\76\1\77"+ "\1\100\1\101\1\102\1\103\2\1\30\0\1\104\1\0"+ "\1\105\13\0\1\106\1\107"; private static int [] zzUnpackAction() { int [] result = new int[111]; 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\125\0\252\0\125\0\125\0\125\0\125\0\125"+ "\0\125\0\125\0\125\0\125\0\125\0\125\0\125\0\125"+ "\0\125\0\125\0\125\0\125\0\125\0\125\0\125\0\125"+ "\0\125\0\125\0\125\0\125\0\125\0\125\0\125\0\125"+ "\0\125\0\125\0\125\0\125\0\125\0\125\0\125\0\125"+ "\0\125\0\125\0\125\0\125\0\125\0\125\0\125\0\125"+ "\0\125\0\125\0\125\0\125\0\125\0\125\0\125\0\125"+ "\0\125\0\125\0\125\0\125\0\125\0\125\0\125\0\125"+ "\0\125\0\125\0\125\0\125\0\125\0\377\0\u0154\0\u01a9"+ "\0\u01fe\0\u0253\0\u02a8\0\u02fd\0\u0352\0\u03a7\0\u03fc\0\u0451"+ "\0\u04a6\0\u04fb\0\u0550\0\u05a5\0\u05fa\0\u064f\0\u06a4\0\u06f9"+ "\0\u074e\0\u07a3\0\u07f8\0\u084d\0\u08a2\0\u08f7\0\u094c\0\125"+ "\0\u09a1\0\125\0\u09f6\0\u0a4b\0\u0aa0\0\u0af5\0\u0b4a\0\u0b9f"+ "\0\u0bf4\0\u0c49\0\u0c9e\0\u0cf3\0\u0d48\0\125\0\125"; private static int [] zzUnpackRowMap() { int [] result = new int[111]; 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\2\1\3\1\2\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\1\30"+ "\1\31\1\32\1\33\1\34\1\35\1\36\1\37\1\40"+ "\1\41\1\42\1\43\1\44\1\45\1\46\1\47\1\50"+ "\1\51\1\52\1\53\1\54\1\55\1\56\1\57\1\60"+ "\1\61\1\62\1\63\1\64\1\65\1\66\1\67\1\70"+ "\1\71\1\72\1\73\1\74\1\75\1\76\1\77\1\100"+ "\1\101\1\102\1\103\1\104\1\105\1\106\11\2\1\107"+ "\5\2\125\0\2\110\1\0\122\110\106\0\1\111\1\0"+ "\1\112\2\0\1\113\2\0\1\114\114\0\1\115\1\116"+ "\1\117\1\116\1\0\1\120\2\116\1\121\1\0\1\122"+ "\3\0\1\116\2\110\1\2\122\110\107\0\1\123\131\0"+ "\1\124\121\0\1\125\2\0\1\126\121\0\1\127\121\0"+ "\1\116\1\130\2\116\1\2\4\116\5\0\1\116\106\0"+ "\4\116\1\2\4\116\5\0\1\116\106\0\4\116\1\2"+ "\1\116\1\131\2\116\5\0\1\116\106\0\3\116\1\132"+ "\1\2\1\116\1\133\2\116\5\0\1\116\106\0\3\116"+ "\1\134\1\2\4\116\5\0\1\116\121\0\1\135\113\0"+ "\1\136\131\0\1\137\121\0\1\140\127\0\1\141\121\0"+ "\1\142\120\0\2\116\1\143\1\116\1\2\4\116\5\0"+ "\1\116\106\0\4\116\1\2\2\116\1\144\1\116\5\0"+ "\1\116\106\0\4\116\1\140\4\116\5\0\1\116\106\0"+ "\4\116\1\2\2\116\1\145\1\116\5\0\1\116\106\0"+ "\4\116\1\142\4\116\5\0\1\116\122\0\1\146\113\0"+ "\1\147\123\0\1\150\124\0\1\151\122\0\3\116\1\152"+ "\1\2\4\116\5\0\1\116\106\0\2\116\1\153\1\116"+ "\1\2\4\116\5\0\1\116\106\0\2\116\1\154\1\116"+ "\1\2\4\116\5\0\1\116\123\0\1\155\113\0\1\5"+ "\124\0\1\156\124\0\1\157\120\0\4\116\1\5\4\116"+ "\5\0\1\116\106\0\4\116\1\156\4\116\5\0\1\116"+ "\106\0\4\116\1\157\4\116\5\0\1\116\112\0\1\4"+ "\12\0"; private static int [] zzUnpackTrans() { int [] result = new int[3485]; 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 = "\1\0\1\11\1\1\102\11\2\1\30\0\1\11\1\0"+ "\1\11\13\0\2\11"; private static int [] zzUnpackAttribute() { int [] result = new int[111]; 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: */ /* * Betacode to Unicode conversion */ /** * 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 Unicode2BuckwalterLex(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 Unicode2BuckwalterLex(java.io.InputStream in) { this(new java.io.InputStreamReader(in)); } /** * 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 < 240) { 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; } /** * 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 java.lang.String 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; 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 23: { return "D"; } case 72: break; case 17: { return "*"; } case 73: break; case 46: { return "o"; } case 74: break; case 60: { return ";"; } case 75: break; case 63: { return "!"; } case 76: break; case 29: { return "f"; } case 77: break; case 36: { return "w"; } case 78: break; case 67: { return "]"; } case 79: break; case 70: { return ")"; } case 80: break; case 69: { return ">"; } case 81: break; case 34: { return "n"; } case 82: break; case 24: { return "T"; } case 83: break; case 57: { return ":"; } case 84: break; case 41: { return "K"; } case 85: break; case 12: { return "v"; } case 86: break; case 71: { return "("; } case 87: break; case 33: { return "m"; } case 88: break; case 22: { return "S"; } case 89: break; case 45: { return "~"; } case 90: break; case 16: { return "d"; } case 91: break; case 52: { return "J"; } case 92: break; case 43: { return "u"; } case 93: break; case 59: { return "["; } case 94: break; case 8: { return "A"; } case 95: break; case 2: { return "'"; } case 96: break; case 32: { return "l"; } case 97: break; case 55: { return "R"; } case 98: break; case 7: { return "}"; } case 99: break; case 11: { return "t"; } case 100: break; case 25: { return "Z"; } case 101: break; case 58: { return "@"; } case 102: break; case 5: { return "&"; } case 103: break; case 31: { return "k"; } case 104: break; case 3: { return "|"; } case 105: break; case 9: { return "b"; } case 106: break; case 14: { return "H"; } case 107: break; case 62: { return "."; } case 108: break; case 20: { return "s"; } case 109: break; case 37: { return "Y"; } case 110: break; case 56: { return "?"; } case 111: break; case 66: { return "%"; } case 112: break; case 13: { return "j"; } case 113: break; case 51: { return "P"; } case 114: break; case 50: { return "{"; } case 115: break; case 1: { return yytext(); } case 116: break; case 42: { return "a"; } case 117: break; case 54: { return "G"; } case 118: break; case 64: { return "-"; } case 119: break; case 18: { return "r"; } case 120: break; case 4: { return ">"; } case 121: break; case 21: { return "$"; } case 122: break; case 44: { return "i"; } case 123: break; case 19: { return "z"; } case 124: break; case 68: { return "<"; } case 125: break; case 49: { return "`"; } case 126: break; case 39: { return "F"; } case 127: break; case 61: { return ","; } case 128: break; case 30: { return "q"; } case 129: break; case 48: { return "#"; } case 130: break; case 35: { return "h"; } case 131: break; case 40: { return "N"; } case 132: break; case 38: { return "y"; } case 133: break; case 28: { return "_"; } case 134: break; case 26: { return "E"; } case 135: break; case 65: { return "+"; } case 136: break; case 10: { return "p"; } case 137: break; case 53: { return "V"; } case 138: break; case 6: { return "<"; } case 139: break; case 27: { return "g"; } case 140: break; case 15: { return "x"; } case 141: break; case 47: { return "^"; } case 142: break; default: if (zzInput == YYEOF && zzStartRead == zzCurrentPos) { zzAtEOF = true; return null; } else { zzScanError(ZZ_NO_MATCH); } } } } }