Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
/* The following code was generated by JFlex 1.4.3 on 2/08/15 8:21 PM */
package net.ripe.db.whois.common.generated;
import net.ripe.db.whois.common.rpsl.ParserHelper;
/*
filename: peering.l
description:
Defines the tokenizer for an RPSL peering attribute. It was mostly
stolen from the IRRToolSet, simplified by removing ability to parse
things defined by a dictionary (we use XML for extensibility rather
than a dictionary).
notes:
Tokens are defined in the associated grammar, peering.y.
*/
/**
* This class is a scanner generated by
* JFlex 1.4.3
* on 2/08/15 8:21 PM from the specification file
* /Users/benjamin/Uni/COMP3500/rpsl4j-parser/src/main/parser/jflex/peering.flex
*/
public class PeeringLexer implements net.ripe.db.whois.common.rpsl.AttributeLexer {
/** 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 =
"\11\0\1\25\1\25\25\0\1\25\14\0\1\3\1\13\1\0\1\12"+
"\1\17\1\20\1\15\1\16\1\22\1\23\1\24\1\21\1\14\1\34"+
"\6\0\1\1\1\5\1\33\1\27\1\31\1\5\1\11\6\5\1\10"+
"\1\26\1\6\1\5\1\7\1\2\1\30\3\5\1\32\2\5\4\0"+
"\1\4\1\0\1\1\1\5\1\33\1\27\1\31\1\5\1\11\6\5"+
"\1\10\1\26\1\6\1\5\1\7\1\2\1\30\3\5\1\32\2\5"+
"\uff85\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\1\1\3\2\1\1\1\3\3\2\1\0\1\2"+
"\1\4\2\2\2\0\1\5\1\2\1\0\4\6\1\7"+
"\2\2\1\0\1\2\1\10\1\0\2\6\2\2\1\0"+
"\1\2\3\0\2\6\1\0\1\2\1\0\1\2\5\0"+
"\2\6\1\11\1\2\1\0\1\12\10\0\2\6\1\0"+
"\1\13\4\10\5\0\2\6\2\0\2\10\4\0\2\6"+
"\2\0\2\10\3\0\2\6\4\11\1\0\2\10\2\0"+
"\1\6\2\11\1\0\2\10\2\0\2\11\1\0\2\10"+
"\2\0\2\11\2\10\2\0\2\11\2\10\1\0\2\11"+
"\1\10\5\11";
private static int [] zzUnpackAction() {
int [] result = new int[142];
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\35\0\72\0\127\0\164\0\221\0\256\0\313"+
"\0\350\0\u0105\0\127\0\u0122\0\127\0\u013f\0\u015c\0\221"+
"\0\u0179\0\127\0\u0196\0\u01b3\0\u01d0\0\u01ed\0\u020a\0\u0227"+
"\0\127\0\u0244\0\u0261\0\u027e\0\u029b\0\u02b8\0\u02d5\0\u02f2"+
"\0\u030f\0\u032c\0\u0349\0\u0366\0\u0383\0\u03a0\0\u03bd\0\u03da"+
"\0\u03f7\0\u0414\0\u0431\0\u044e\0\u046b\0\u0488\0\u04a5\0\u04c2"+
"\0\u04df\0\u04fc\0\u0519\0\u0536\0\u0553\0\u0570\0\u01d0\0\u058d"+
"\0\127\0\u05aa\0\u05c7\0\u05e4\0\u0601\0\u061e\0\u063b\0\u0658"+
"\0\u0675\0\u0692\0\u06af\0\u06cc\0\u058d\0\u06e9\0\u0706\0\u0723"+
"\0\u0740\0\u075d\0\u077a\0\u0797\0\u07b4\0\u07d1\0\u07ee\0\u080b"+
"\0\u0828\0\u0845\0\u0862\0\u087f\0\u089c\0\u08b9\0\u08d6\0\u08f3"+
"\0\u0910\0\u092d\0\u094a\0\u0967\0\u0984\0\u09a1\0\u09be\0\u09db"+
"\0\u09f8\0\u0a15\0\u0a32\0\u0a4f\0\u0a6c\0\u0a89\0\u0aa6\0\u0ac3"+
"\0\u0ae0\0\u0afd\0\u0b1a\0\u0b37\0\u0b54\0\u0b71\0\u0b8e\0\u0bab"+
"\0\u0bc8\0\u0be5\0\u0c02\0\u0c1f\0\u0c3c\0\u0c59\0\u0c76\0\u0c93"+
"\0\u0cb0\0\u0ccd\0\u0cea\0\u0d07\0\u0d24\0\u0d41\0\u0d5e\0\u0d7b"+
"\0\u0d98\0\u0db5\0\u0dd2\0\u0def\0\u0e0c\0\u0e29\0\u0e46\0\u0e63"+
"\0\u0e80\0\u0e9d\0\u0eba\0\u0ed7\0\u0ef4\0\u0f11";
private static int [] zzUnpackRowMap() {
int [] result = new int[142];
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\4\2\2\1\4\1\5\3\4\1\6"+
"\1\2\11\6\1\7\1\10\2\4\1\11\2\4\1\2"+
"\36\0\1\4\1\12\1\13\1\0\3\4\1\14\2\4"+
"\1\0\11\4\1\0\2\4\1\15\3\4\2\0\2\4"+
"\1\13\1\0\6\4\1\0\11\4\1\0\6\4\2\0"+
"\2\4\1\13\1\0\2\4\1\16\3\4\1\0\11\4"+
"\1\0\3\4\1\17\2\4\13\0\1\20\1\21\11\20"+
"\35\0\1\7\10\0\2\4\1\13\1\0\2\4\1\22"+
"\3\4\1\0\11\4\1\0\6\4\2\0\2\4\1\13"+
"\1\0\6\4\1\0\11\4\1\0\4\4\1\23\1\4"+
"\2\0\2\4\1\24\1\0\5\4\1\25\1\0\1\26"+
"\1\27\1\30\2\27\4\26\1\0\6\4\2\0\2\4"+
"\1\13\1\0\6\4\1\0\11\4\1\0\1\4\1\31"+
"\4\4\2\0\2\4\1\13\1\0\3\4\1\32\2\4"+
"\1\0\11\4\1\0\6\4\2\0\2\4\1\13\1\0"+
"\6\4\1\0\11\4\1\0\3\4\1\33\2\4\13\0"+
"\1\34\1\0\11\34\11\0\2\4\1\13\1\0\6\4"+
"\1\0\11\4\1\0\5\4\1\35\2\0\2\36\2\24"+
"\6\36\1\0\11\36\1\0\6\36\2\0\2\4\1\13"+
"\1\0\6\4\1\0\11\4\1\0\6\4\1\37\1\0"+
"\2\4\1\13\1\0\5\4\1\40\1\0\11\40\1\0"+
"\6\4\1\37\1\0\2\4\1\13\1\0\5\4\1\26"+
"\1\0\11\26\1\0\6\4\1\37\1\0\2\4\1\13"+
"\1\0\5\4\1\26\1\0\3\40\1\26\1\41\4\40"+
"\1\0\6\4\1\37\1\0\2\4\1\13\1\0\4\4"+
"\1\42\1\4\1\0\11\4\1\0\6\4\2\0\2\4"+
"\1\13\1\0\2\4\1\43\3\4\1\0\11\4\1\0"+
"\6\4\13\0\1\34\1\44\11\34\11\0\2\4\1\13"+
"\1\0\6\4\1\0\11\4\1\0\3\4\1\45\2\4"+
"\2\0\2\36\2\24\6\36\1\0\11\36\1\0\6\36"+
"\1\46\1\0\1\47\4\0\1\50\27\0\2\4\1\13"+
"\1\0\5\4\1\51\1\0\11\51\1\0\6\4\1\37"+
"\1\0\2\4\1\13\1\0\5\4\1\40\1\0\1\52"+
"\10\40\1\0\6\4\1\37\1\0\2\4\1\53\1\0"+
"\6\4\1\0\11\4\1\0\6\4\2\0\1\54\1\4"+
"\1\13\1\0\6\4\1\0\11\4\1\0\6\4\13\0"+
"\1\55\1\0\11\55\11\0\2\4\1\13\1\0\1\4"+
"\1\56\4\4\1\0\11\4\1\0\6\4\2\0\1\57"+
"\4\0\1\60\30\0\1\61\41\0\1\62\21\0\1\63"+
"\4\0\2\4\1\13\1\0\5\4\1\64\1\0\11\64"+
"\1\0\6\4\1\37\1\0\2\4\1\13\1\0\5\4"+
"\1\51\1\0\1\64\1\51\1\65\2\51\4\64\1\0"+
"\6\4\1\37\1\0\2\66\2\53\6\66\1\0\11\66"+
"\1\0\6\66\2\0\1\4\1\67\1\13\1\0\6\4"+
"\1\0\11\4\1\0\6\4\13\0\1\55\1\70\11\55"+
"\11\0\2\4\1\13\1\0\6\4\1\0\11\4\1\0"+
"\2\4\1\71\3\4\3\0\1\72\63\0\1\73\6\0"+
"\1\24\6\0\1\74\1\0\1\75\1\76\1\77\2\76"+
"\4\75\20\0\1\100\55\0\1\101\4\0\2\4\1\13"+
"\1\0\5\4\1\102\1\0\11\102\1\0\6\4\1\37"+
"\1\0\2\4\1\13\1\0\5\4\1\64\1\0\1\103"+
"\10\64\1\0\6\4\1\37\1\0\2\66\2\53\6\66"+
"\1\0\11\66\1\0\6\66\1\104\12\0\1\105\1\0"+
"\11\105\13\0\1\24\6\0\1\106\1\0\1\107\1\110"+
"\1\111\2\110\4\107\41\0\1\112\37\0\1\37\12\0"+
"\1\113\1\0\11\113\7\0\1\37\12\0\1\75\1\0"+
"\11\75\7\0\1\37\12\0\1\75\1\0\3\113\1\75"+
"\1\114\4\113\7\0\1\37\11\0\1\115\32\0\1\116"+
"\26\0\2\4\1\13\1\0\5\4\1\117\1\0\11\117"+
"\1\0\6\4\1\37\1\0\2\4\1\13\1\0\5\4"+
"\1\102\1\0\1\117\4\102\1\117\1\102\1\120\1\117"+
"\1\0\6\4\1\37\1\0\1\121\4\0\1\122\62\0"+
"\1\46\12\0\1\123\1\0\11\123\7\0\1\46\12\0"+
"\1\107\1\0\11\107\7\0\1\46\12\0\1\107\1\0"+
"\3\123\1\107\1\124\4\123\7\0\1\46\7\0\1\125"+
"\37\0\1\126\1\0\11\126\7\0\1\37\12\0\1\113"+
"\1\0\1\127\10\113\7\0\1\37\3\0\1\53\32\0"+
"\1\130\34\0\2\4\1\13\1\0\5\4\1\131\1\0"+
"\11\131\1\0\6\4\1\37\1\0\2\4\1\13\1\0"+
"\5\4\1\117\1\0\1\131\4\117\1\131\2\117\1\132"+
"\1\0\6\4\1\37\2\0\1\133\41\0\1\62\21\0"+
"\1\134\15\0\1\135\1\0\11\135\7\0\1\46\12\0"+
"\1\123\1\0\1\136\10\123\7\0\1\46\1\0\1\137"+
"\45\0\1\140\1\0\11\140\7\0\1\37\12\0\1\126"+
"\1\0\1\140\1\126\1\141\2\126\4\140\7\0\1\37"+
"\2\0\1\74\33\0\2\4\1\13\1\0\5\4\1\142"+
"\1\0\11\142\1\0\6\4\1\37\1\0\2\4\1\13"+
"\1\0\5\4\1\131\1\0\3\142\1\131\1\143\4\142"+
"\1\0\6\4\1\37\12\0\1\144\1\0\1\145\1\146"+
"\1\147\2\146\4\145\41\0\1\150\15\0\1\151\1\0"+
"\11\151\7\0\1\46\12\0\1\135\1\0\1\151\1\135"+
"\1\152\2\135\4\151\7\0\1\46\2\0\1\106\44\0"+
"\1\153\1\0\11\153\7\0\1\37\12\0\1\140\1\0"+
"\1\154\10\140\7\0\1\37\1\0\2\4\1\13\1\0"+
"\5\4\1\25\1\0\11\25\1\0\6\4\1\37\1\0"+
"\2\4\1\13\1\0\5\4\1\142\1\0\1\155\10\142"+
"\1\0\6\4\1\37\34\0\1\104\12\0\1\156\1\0"+
"\11\156\7\0\1\104\12\0\1\145\1\0\11\145\7\0"+
"\1\104\12\0\1\145\1\0\3\156\1\145\1\157\4\156"+
"\7\0\1\104\7\0\1\160\37\0\1\161\1\0\11\161"+
"\7\0\1\46\12\0\1\151\1\0\1\162\10\151\7\0"+
"\1\46\12\0\1\163\1\0\11\163\7\0\1\37\12\0"+
"\1\153\1\0\1\163\4\153\1\163\1\153\1\164\1\163"+
"\7\0\1\37\1\0\2\4\1\13\1\0\5\4\1\25"+
"\1\0\1\4\4\25\1\4\1\25\2\4\1\0\6\4"+
"\1\37\12\0\1\165\1\0\11\165\7\0\1\104\12\0"+
"\1\156\1\0\1\166\10\156\7\0\1\104\1\0\1\167"+
"\45\0\1\170\1\0\11\170\7\0\1\46\12\0\1\161"+
"\1\0\1\170\4\161\1\170\1\161\1\171\1\170\7\0"+
"\1\46\12\0\1\172\1\0\11\172\7\0\1\37\12\0"+
"\1\163\1\0\1\172\4\163\1\172\2\163\1\173\7\0"+
"\1\37\12\0\1\174\1\0\11\174\7\0\1\104\12\0"+
"\1\165\1\0\1\174\1\165\1\175\2\165\4\174\7\0"+
"\1\104\2\0\1\144\44\0\1\176\1\0\11\176\7\0"+
"\1\46\12\0\1\170\1\0\1\176\4\170\1\176\2\170"+
"\1\177\7\0\1\46\12\0\1\200\1\0\11\200\7\0"+
"\1\37\12\0\1\172\1\0\3\200\1\172\1\201\4\200"+
"\7\0\1\37\12\0\1\202\1\0\11\202\7\0\1\104"+
"\12\0\1\174\1\0\1\203\10\174\7\0\1\104\12\0"+
"\1\204\1\0\11\204\7\0\1\46\12\0\1\176\1\0"+
"\3\204\1\176\1\205\4\204\7\0\1\46\12\0\1\74"+
"\1\0\11\74\7\0\1\37\12\0\1\200\1\0\1\206"+
"\10\200\7\0\1\37\12\0\1\207\1\0\11\207\7\0"+
"\1\104\12\0\1\202\1\0\1\207\4\202\1\207\1\202"+
"\1\210\1\207\7\0\1\104\12\0\1\106\1\0\11\106"+
"\7\0\1\46\12\0\1\204\1\0\1\211\10\204\7\0"+
"\1\46\12\0\1\74\2\0\4\74\1\0\1\74\11\0"+
"\1\37\12\0\1\212\1\0\11\212\7\0\1\104\12\0"+
"\1\207\1\0\1\212\4\207\1\212\2\207\1\213\7\0"+
"\1\104\12\0\1\106\2\0\4\106\1\0\1\106\11\0"+
"\1\46\12\0\1\214\1\0\11\214\7\0\1\104\12\0"+
"\1\212\1\0\3\214\1\212\1\215\4\214\7\0\1\104"+
"\12\0\1\144\1\0\11\144\7\0\1\104\12\0\1\214"+
"\1\0\1\216\10\214\7\0\1\104\12\0\1\144\2\0"+
"\4\144\1\0\1\144\11\0\1\104";
private static int [] zzUnpackTrans() {
int [] result = new int[3886];
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 aState
*/
private static final int [] ZZ_ATTRIBUTE = zzUnpackAttribute();
private static final String ZZ_ATTRIBUTE_PACKED_0 =
"\1\0\1\11\10\1\1\0\4\1\2\0\2\1\1\0"+
"\7\1\1\0\2\1\1\0\4\1\1\0\1\1\3\0"+
"\2\1\1\0\1\1\1\0\1\1\5\0\4\1\1\0"+
"\1\1\10\0\2\1\1\0\5\1\5\0\2\1\2\0"+
"\2\1\4\0\2\1\2\0\2\1\3\0\6\1\1\0"+
"\2\1\2\0\3\1\1\0\2\1\2\0\2\1\1\0"+
"\2\1\2\0\4\1\2\0\4\1\1\0\10\1";
private static int [] zzUnpackAttribute() {
int [] result = new int[142];
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: */
/* store a reference to the parser object */
private PeeringParser yyparser;
/* constructor taking an additional parser object */
public PeeringLexer(java.io.Reader r, PeeringParser yyparser) {
this(r);
this.yyparser = yyparser;
}
/* assign value associated with current token to the external parser variable yylval. */
private void storeTokenValue() {
if ((this.yyparser != null) && (this.yyparser.yylval != null)) {
yyparser.yylval.sval = 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 PeeringLexer(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 PeeringLexer(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 < 122) {
int count = packed.charAt(i++);
char value = packed.charAt(i++);
do map[j++] = value; while (--count > 0);
}
return map;
}
/**
* 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;
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 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;
}
/**
* 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;
yychar+= zzMarkedPosL-zzStartRead;
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 11:
{ ParserHelper.validateIpv4(yytext());
return PeeringParser.TKN_IPV4;
}
case 12: break;
case 6:
{ ParserHelper.validateAsNumber(yytext());
return PeeringParser.TKN_ASNO;
}
case 13: break;
case 7:
{ return PeeringParser.OP_AND;
}
case 14: break;
case 3:
{ ;
}
case 15: break;
case 1:
{ return yytext().charAt(0);
}
case 16: break;
case 2:
{ ParserHelper.validateDomainNameLabel(yytext());
storeTokenValue();
return PeeringParser.TKN_DNS;
}
case 17: break;
case 9:
{ return PeeringParser.TKN_PRNGNAME;
}
case 18: break;
case 10:
{ return PeeringParser.KEYW_EXCEPT;
}
case 19: break;
case 5:
{ return PeeringParser.OP_OR;
}
case 20: break;
case 4:
{ return PeeringParser.KEYW_AT;
}
case 21: break;
case 8:
{ return PeeringParser.TKN_ASNAME;
}
case 22: break;
default:
if (zzInput == YYEOF && zzStartRead == zzCurrentPos) {
zzAtEOF = true;
zzDoEOF();
{ return 0; }
}
else {
zzScanError(ZZ_NO_MATCH);
}
}
}
}
}
