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.
net.ripe.db.whois.common.generated.IfaddrParser Maven / Gradle / Ivy
//### This file created by BYACC 1.8(/Java extension 1.15)
//### Java capabilities added 7 Jan 97, Bob Jamison
//### Updated : 27 Nov 97 -- Bob Jamison, Joe Nieten
//### 01 Jan 98 -- Bob Jamison -- fixed generic semantic constructor
//### 01 Jun 99 -- Bob Jamison -- added Runnable support
//### 06 Aug 00 -- Bob Jamison -- made state variables class-global
//### 03 Jan 01 -- Bob Jamison -- improved flags, tracing
//### 16 May 01 -- Bob Jamison -- added custom stack sizing
//### 04 Mar 02 -- Yuval Oren -- improved java performance, added options
//### 14 Mar 02 -- Tomas Hurka -- -d support, static initializer workaround
//### Please send bug reports to [email protected]
//### static char yysccsid[] = "@(#)yaccpar 1.8 (Berkeley) 01/20/90";
package net.ripe.db.whois.common.generated;
//#line 2 "src/main/parser/byacc/ifaddr.y"
import net.ripe.db.whois.common.rpsl.AttributeParser;
import net.ripe.db.whois.common.rpsl.ParserHelper;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;
import java.io.IOException;
import java.io.StringReader;
/*
filename: ifaddr.y
description:
Defines the grammar for an RPSL ifaddr 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:
Defines tokens for the associated lexer, ifaddr.l.
*/
//#line 38 "IfaddrParser.java"
public class IfaddrParser
implements AttributeParser
{
boolean yydebug; //do I want debug output?
int yynerrs; //number of errors so far
int yyerrflag; //was there an error?
int yychar; //the current working character
//########## MESSAGES ##########
//###############################################################
// method: debug
//###############################################################
void debug(String msg)
{
if (yydebug)
System.out.println(msg);
}
//########## STATE STACK ##########
final static int YYSTACKSIZE = 500; //maximum stack size
int statestk[] = new int[YYSTACKSIZE]; //state stack
int stateptr;
int stateptrmax; //highest index of stackptr
int statemax; //state when highest index reached
//###############################################################
// methods: state stack push,pop,drop,peek
//###############################################################
final void state_push(int state)
{
try {
stateptr++;
statestk[stateptr]=state;
}
catch (ArrayIndexOutOfBoundsException e) {
int oldsize = statestk.length;
int newsize = oldsize * 2;
int[] newstack = new int[newsize];
System.arraycopy(statestk,0,newstack,0,oldsize);
statestk = newstack;
statestk[stateptr]=state;
}
}
final int state_pop()
{
return statestk[stateptr--];
}
final void state_drop(int cnt)
{
stateptr -= cnt;
}
final int state_peek(int relative)
{
return statestk[stateptr-relative];
}
//###############################################################
// method: init_stacks : allocate and prepare stacks
//###############################################################
final boolean init_stacks()
{
stateptr = -1;
val_init();
return true;
}
//###############################################################
// method: dump_stacks : show n levels of the stacks
//###############################################################
void dump_stacks(int count)
{
int i;
System.out.println("=index==state====value= s:"+stateptr+" v:"+valptr);
for (i=0;i=YYSTACKSIZE)
return;
valstk[++valptr]=val;
}
IfaddrParserVal val_pop()
{
if (valptr<0)
return new IfaddrParserVal();
return valstk[valptr--];
}
void val_drop(int cnt)
{
int ptr;
ptr=valptr-cnt;
if (ptr<0)
return;
valptr = ptr;
}
IfaddrParserVal val_peek(int relative)
{
int ptr;
ptr=valptr-relative;
if (ptr<0)
return new IfaddrParserVal();
return valstk[ptr];
}
final IfaddrParserVal dup_yyval(IfaddrParserVal val)
{
IfaddrParserVal dup = new IfaddrParserVal();
dup.ival = val.ival;
dup.dval = val.dval;
dup.sval = val.sval;
dup.obj = val.obj;
return dup;
}
//#### end semantic value section ####
public final static short OP_OR=257;
public final static short OP_EQUAL=258;
public final static short OP_APPEND=259;
public final static short OP_COMPARE=260;
public final static short TKN_ASNO=261;
public final static short TKN_IPV4=262;
public final static short KEYW_ACTION=263;
public final static short TKN_PREF=264;
public final static short TKN_MED=265;
public final static short TKN_DPA=266;
public final static short TKN_ASPATH=267;
public final static short TKN_COMMUNITY=268;
public final static short TKN_NEXT_HOP=269;
public final static short TKN_COST=270;
public final static short TKN_COMM_NO=271;
public final static short KEYW_IGP_COST=272;
public final static short KEYW_SELF=273;
public final static short KEYW_PREPEND=274;
public final static short KEYW_APPEND=275;
public final static short KEYW_DELETE=276;
public final static short KEYW_CONTAINS=277;
public final static short KEYW_INTERNET=278;
public final static short KEYW_NO_EXPORT=279;
public final static short KEYW_NO_ADVERTISE=280;
public final static short KEYW_MASKLEN=281;
public final static short TKN_INT=282;
public final static short TKN_DNS=283;
public final static short YYERRCODE=256;
final static short yylhs[] = { -1,
0, 0, 1, 2, 2, 3, 3, 3, 3, 3,
3, 3, 4, 5, 5, 6, 7, 11, 11, 8,
8, 8, 8, 8, 8, 8, 12, 13, 13, 14,
14, 14, 14, 14, 9, 9, 10,
};
final static short yylen[] = { 2,
3, 5, 1, 2, 3, 1, 1, 1, 1, 1,
1, 1, 3, 3, 3, 3, 6, 1, 3, 3,
3, 6, 6, 6, 4, 3, 3, 1, 3, 1,
1, 1, 1, 1, 3, 3, 3,
};
final static short yydefred[] = { 0,
0, 0, 0, 3, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 6, 7, 8, 9, 10,
11, 12, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 4, 13, 15, 14, 16, 0,
0, 20, 21, 26, 0, 0, 0, 34, 30, 31,
32, 33, 0, 28, 35, 36, 37, 5, 0, 0,
0, 0, 0, 25, 0, 18, 0, 27, 0, 0,
0, 29, 17, 0, 22, 23, 24, 19,
};
final static short yydgoto[] = { 2,
5, 14, 15, 16, 17, 18, 19, 20, 21, 22,
67, 42, 53, 54,
};
final static short yysindex[] = { -253,
-262, 0, -248, 0, -243, -239, -216, -215, -214, -1,
-40, -212, -211, -239, -11, 0, 0, 0, 0, 0,
0, 0, -233, -265, -232, -223, -71, -71, -71, -238,
-268, -258, -229, -5, 0, 0, 0, 0, 0, 15,
-268, 0, 0, 0, 16, 17, 18, 0, 0, 0,
0, 0, -36, 0, 0, 0, 0, 0, -202, -43,
-268, -268, -268, 0, -268, 0, -28, 0, -23, -9,
-8, 0, 0, -201, 0, 0, 0, 0,
};
final static short yyrindex[] = { 0,
0, 0, 0, 0, 61, 0, 0, 0, 0, 0,
0, 0, 0, 62, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
};
final static short yygindex[] = { 0,
0, 0, 49, 0, 0, 0, 0, 0, 0, 0,
0, 12, -39, 1,
};
final static int YYTABLESIZE=220;
static short yytable[];
static { yytable();}
static void yytable(){
yytable = new short[]{ 31,
65, 60, 48, 55, 64, 30, 37, 65, 1, 49,
50, 51, 73, 52, 56, 74, 38, 75, 3, 6,
65, 69, 70, 71, 7, 8, 9, 10, 11, 12,
13, 76, 77, 4, 65, 65, 45, 46, 47, 43,
44, 23, 24, 25, 26, 32, 33, 35, 36, 39,
40, 41, 57, 58, 59, 61, 62, 63, 66, 78,
1, 2, 34, 0, 0, 72, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 68, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 27, 28, 29,
};
}
static short yycheck[];
static { yycheck(); }
static void yycheck() {
yycheck = new short[] { 40,
44, 41, 271, 262, 41, 46, 272, 44, 262, 278,
279, 280, 41, 282, 273, 44, 282, 41, 281, 263,
44, 61, 62, 63, 264, 265, 266, 267, 268, 269,
270, 41, 41, 282, 44, 44, 275, 276, 277, 28,
29, 258, 258, 258, 46, 258, 258, 59, 282, 282,
274, 123, 282, 59, 40, 40, 40, 40, 261, 261,
0, 0, 14, -1, -1, 65, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, 125, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, 258, 259, 260,
};
}
final static short YYFINAL=2;
final static short YYMAXTOKEN=283;
final static String yyname[] = {
"end-of-file",null,null,null,null,null,null,null,null,null,null,null,null,null,
null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,
null,null,null,null,null,null,null,null,null,null,"'('","')'",null,null,"','",
null,"'.'",null,null,null,null,null,null,null,null,null,null,null,null,"';'",
null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,
null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,
null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,
null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,
"'{'",null,"'}'",null,null,null,null,null,null,null,null,null,null,null,null,
null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,
null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,
null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,
null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,
null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,
null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,
null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,
null,null,null,null,null,null,null,"OP_OR","OP_EQUAL","OP_APPEND","OP_COMPARE",
"TKN_ASNO","TKN_IPV4","KEYW_ACTION","TKN_PREF","TKN_MED","TKN_DPA","TKN_ASPATH",
"TKN_COMMUNITY","TKN_NEXT_HOP","TKN_COST","TKN_COMM_NO","KEYW_IGP_COST",
"KEYW_SELF","KEYW_PREPEND","KEYW_APPEND","KEYW_DELETE","KEYW_CONTAINS",
"KEYW_INTERNET","KEYW_NO_EXPORT","KEYW_NO_ADVERTISE","KEYW_MASKLEN","TKN_INT",
"TKN_DNS",
};
final static String yyrule[] = {
"$accept : ifaddr",
"ifaddr : TKN_IPV4 KEYW_MASKLEN masklen",
"ifaddr : TKN_IPV4 KEYW_MASKLEN masklen KEYW_ACTION action",
"masklen : TKN_INT",
"action : rp_attribute ';'",
"action : action rp_attribute ';'",
"rp_attribute : pref",
"rp_attribute : med",
"rp_attribute : dpa",
"rp_attribute : aspath",
"rp_attribute : community",
"rp_attribute : next_hop",
"rp_attribute : cost",
"pref : TKN_PREF OP_EQUAL TKN_INT",
"med : TKN_MED OP_EQUAL TKN_INT",
"med : TKN_MED OP_EQUAL KEYW_IGP_COST",
"dpa : TKN_DPA OP_EQUAL TKN_INT",
"aspath : TKN_ASPATH '.' KEYW_PREPEND '(' asno_list ')'",
"asno_list : TKN_ASNO",
"asno_list : asno_list ',' TKN_ASNO",
"community : TKN_COMMUNITY OP_EQUAL community_list",
"community : TKN_COMMUNITY OP_APPEND community_list",
"community : TKN_COMMUNITY '.' KEYW_APPEND '(' community_elm_list ')'",
"community : TKN_COMMUNITY '.' KEYW_DELETE '(' community_elm_list ')'",
"community : TKN_COMMUNITY '.' KEYW_CONTAINS '(' community_elm_list ')'",
"community : TKN_COMMUNITY '(' community_elm_list ')'",
"community : TKN_COMMUNITY OP_COMPARE community_list",
"community_list : '{' community_elm_list '}'",
"community_elm_list : community_elm",
"community_elm_list : community_elm_list ',' community_elm",
"community_elm : KEYW_INTERNET",
"community_elm : KEYW_NO_EXPORT",
"community_elm : KEYW_NO_ADVERTISE",
"community_elm : TKN_INT",
"community_elm : TKN_COMM_NO",
"next_hop : TKN_NEXT_HOP OP_EQUAL TKN_IPV4",
"next_hop : TKN_NEXT_HOP OP_EQUAL KEYW_SELF",
"cost : TKN_COST OP_EQUAL TKN_INT",
};
//#line 118 "src/main/parser/byacc/ifaddr.y"
protected final Logger LOGGER = LoggerFactory.getLogger(IfaddrParser.class);
private IfaddrLexer lexer;
@Override
public Void parse(final String attributeValue) {
lexer = new IfaddrLexer(new StringReader(attributeValue), this);
final int result = yyparse();
if (result > 0) {
LOGGER.error("can't parse " + attributeValue);
throw new IllegalArgumentException("Unexpected parse result: " + result);
}
return null;
}
public int yylex () {
int yyl_return = -1;
try {
yyl_return = lexer.yylex();
}
catch (IOException e) {
LOGGER.error(e.getMessage(), e);
}
return yyl_return;
}
public void yyerror (final String error) {
String errorMessage = (yylval.sval == null ? error : yylval.sval);
ParserHelper.parserError(errorMessage);
}
//#line 343 "IfaddrParser.java"
//###############################################################
// method: yylexdebug : check lexer state
//###############################################################
void yylexdebug(int state,int ch)
{
String s=null;
if (ch < 0) ch=0;
if (ch <= YYMAXTOKEN) //check index bounds
s = yyname[ch]; //now get it
if (s==null)
s = "illegal-symbol";
debug("state "+state+", reading "+ch+" ("+s+")");
}
//The following are now global, to aid in error reporting
int yyn; //next next thing to do
int yym; //
int yystate; //current parsing state from state table
String yys; //current token string
//###############################################################
// method: yyparse : parse input and execute indicated items
//###############################################################
int yyparse()
{
boolean doaction;
init_stacks();
yynerrs = 0;
yyerrflag = 0;
yychar = -1; //impossible char forces a read
yystate=0; //initial state
state_push(yystate); //save it
val_push(yylval); //save empty value
while (true) //until parsing is done, either correctly, or w/error
{
doaction=true;
//if (yydebug) debug("loop");
//#### NEXT ACTION (from reduction table)
for (yyn=yydefred[yystate];yyn==0;yyn=yydefred[yystate])
{
//if (yydebug) debug("yyn:"+yyn+" state:"+yystate+" yychar:"+yychar);
if (yychar < 0) //we want a char?
{
yychar = yylex(); //get next token
//if (yydebug) debug(" next yychar:"+yychar);
//#### ERROR CHECK ####
if (yychar < 0) //it it didn't work/error
{
yychar = 0; //change it to default string (no -1!)
//if (yydebug)
// yylexdebug(yystate,yychar);
}
}//yychar<0
yyn = yysindex[yystate]; //get amount to shift by (shift index)
if ((yyn != 0) && (yyn += yychar) >= 0 &&
yyn <= YYTABLESIZE && yycheck[yyn] == yychar)
{
//if (yydebug)
//debug("state "+yystate+", shifting to state "+yytable[yyn]);
//#### NEXT STATE ####
yystate = yytable[yyn];//we are in a new state
state_push(yystate); //save it
val_push(yylval); //push our lval as the input for next rule
yychar = -1; //since we have 'eaten' a token, say we need another
if (yyerrflag > 0) //have we recovered an error?
--yyerrflag; //give ourselves credit
doaction=false; //but don't process yet
break; //quit the yyn=0 loop
}
yyn = yyrindex[yystate]; //reduce
if ((yyn !=0 ) && (yyn += yychar) >= 0 &&
yyn <= YYTABLESIZE && yycheck[yyn] == yychar)
{ //we reduced!
//if (yydebug) debug("reduce");
yyn = yytable[yyn];
doaction=true; //get ready to execute
break; //drop down to actions
}
else //ERROR RECOVERY
{
if (yyerrflag==0)
{
yyerror("syntax error");
yynerrs++;
}
if (yyerrflag < 3) //low error count?
{
yyerrflag = 3;
while (true) //do until break
{
if (stateptr<0) //check for under & overflow here
{
yyerror("stack underflow. aborting..."); //note lower case 's'
return 1;
}
yyn = yysindex[state_peek(0)];
if ((yyn != 0) && (yyn += YYERRCODE) >= 0 &&
yyn <= YYTABLESIZE && yycheck[yyn] == YYERRCODE)
{
//if (yydebug)
//debug("state "+state_peek(0)+", error recovery shifting to state "+yytable[yyn]+" ");
yystate = yytable[yyn];
state_push(yystate);
val_push(yylval);
doaction=false;
break;
}
else
{
//if (yydebug)
//debug("error recovery discarding state "+state_peek(0)+" ");
if (stateptr<0) //check for under & overflow here
{
yyerror("Stack underflow. aborting..."); //capital 'S'
return 1;
}
state_pop();
val_pop();
}
}
}
else //discard this token
{
if (yychar == 0)
return 1; //yyabort
//if (yydebug)
//{
//yys = null;
//if (yychar <= YYMAXTOKEN) yys = yyname[yychar];
//if (yys == null) yys = "illegal-symbol";
//debug("state "+yystate+", error recovery discards token "+yychar+" ("+yys+")");
//}
yychar = -1; //read another
}
}//end error recovery
}//yyn=0 loop
if (!doaction) //any reason not to proceed?
continue; //skip action
yym = yylen[yyn]; //get count of terminals on rhs
//if (yydebug)
//debug("state "+yystate+", reducing "+yym+" by rule "+yyn+" ("+yyrule[yyn]+")");
if (yym>0) //if count of rhs not 'nil'
yyval = val_peek(yym-1); //get current semantic value
yyval = dup_yyval(yyval); //duplicate yyval if ParserVal is used as semantic value
switch(yyn)
{
//########## USER-SUPPLIED ACTIONS ##########
case 3:
//#line 42 "src/main/parser/byacc/ifaddr.y"
{
ParserHelper.checkMaskLength(val_peek(0).sval);
}
break;
case 13:
//#line 60 "src/main/parser/byacc/ifaddr.y"
{
ParserHelper.check16bit(val_peek(0).sval);
}
break;
case 14:
//#line 65 "src/main/parser/byacc/ifaddr.y"
{
ParserHelper.check16bit(val_peek(0).sval);
}
break;
case 16:
//#line 71 "src/main/parser/byacc/ifaddr.y"
{
ParserHelper.check16bit(val_peek(0).sval);
}
break;
case 33:
//#line 102 "src/main/parser/byacc/ifaddr.y"
{
ParserHelper.check32bit(val_peek(0).sval);
}
break;
case 37:
//#line 112 "src/main/parser/byacc/ifaddr.y"
{
ParserHelper.check16bit(val_peek(0).sval);
}
break;
//#line 528 "IfaddrParser.java"
//########## END OF USER-SUPPLIED ACTIONS ##########
}//switch
//#### Now let's reduce... ####
//if (yydebug) debug("reduce");
state_drop(yym); //we just reduced yylen states
yystate = state_peek(0); //get new state
val_drop(yym); //corresponding value drop
yym = yylhs[yyn]; //select next TERMINAL(on lhs)
if (yystate == 0 && yym == 0)//done? 'rest' state and at first TERMINAL
{
//if (yydebug) debug("After reduction, shifting from state 0 to state "+YYFINAL+"");
yystate = YYFINAL; //explicitly say we're done
state_push(YYFINAL); //and save it
val_push(yyval); //also save the semantic value of parsing
if (yychar < 0) //we want another character?
{
yychar = yylex(); //get next character
if (yychar<0) yychar=0; //clean, if necessary
//if (yydebug)
//yylexdebug(yystate,yychar);
}
if (yychar == 0) //Good exit (if lex returns 0 ;-)
break; //quit the loop--all DONE
}//if yystate
else //else not done yet
{ //get next state and push, for next yydefred[]
yyn = yygindex[yym]; //find out where to go
if ((yyn != 0) && (yyn += yystate) >= 0 &&
yyn <= YYTABLESIZE && yycheck[yyn] == yystate)
yystate = yytable[yyn]; //get new state
else
yystate = yydgoto[yym]; //else go to new defred
//if (yydebug) debug("after reduction, shifting from state "+state_peek(0)+" to state "+yystate+"");
state_push(yystate); //going again, so push state & val...
val_push(yyval); //for next action
}
}//main loop
return 0;//yyaccept!!
}
//## end of method parse() ######################################
//## run() --- for Thread #######################################
//## The -Jnorun option was used ##
//## end of method run() ########################################
//## Constructors ###############################################
//## The -Jnoconstruct option was used ##
//###############################################################
}
//################### END OF CLASS ##############################
