/* A Bison parser, made from alpha.y by GNU Bison version 1.25 */ #define YYBISON 1 /* Identify Bison output. */ #define ERROR 258 #define SYMBOL 259 #define FINAL 260 #define SYNCHRONIZED 261 #define PUBLIC 262 #define ABSTRACT 263 #define INTERFACE 264 #define IMPLEMENTS 265 #define EXTENDS 266 #define CLASS 267 #define PRIVATE 268 #define PROTECTED 269 #define STATIC 270 #define TRANSIENT 271 #define VOLATILE 272 #define NATIVE 273 #define BOOLEAN 274 #define BYTE 275 #define CHAR 276 #define DOUBLE 277 #define FLOAT 278 #define VOID 279 #define LONG 280 #define STRING 281 #define INT 282 #define SHORT 283 package patch.src; import java.util.*; import java.io.*; import patch.src.util.*; import pp.src.jbf.*; #ifndef YYSTYPE #define YYSTYPE int #endif #include #ifndef __cplusplus #ifndef __STDC__ #define const #endif #endif #define YYFINAL 102 #define YYFLAG -32768 #define YYNTBASE 38 #define YYTRANSLATE(x) ((unsigned)(x) <= 283 ? yytranslate[x] : 64) static const char yytranslate[] = { 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 34, 35, 2, 2, 30, 2, 31, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 29, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 36, 2, 37, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 32, 2, 33, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28 }; #if YYDEBUG != 0 static const short yyprhs[] = { 0, 0, 2, 4, 6, 8, 11, 14, 18, 25, 27, 33, 35, 36, 39, 42, 45, 48, 49, 52, 56, 58, 62, 64, 67, 71, 75, 80, 82, 85, 88, 91, 94, 95, 98, 101, 104, 107, 110, 113, 116, 119, 122, 125, 128, 134, 139, 143, 146, 151, 154, 157, 161, 163, 165, 167, 169, 171, 173, 175, 177, 179, 181, 182, 184, 186, 190, 193, 195, 196, 200, 201 }; static const short yyrhs[] = { 39, 0, 29, 0, 40, 0, 41, 0, 42, 43, 0, 44, 45, 0, 46, 12, 48, 0, 46, 12, 48, 11, 48, 47, 0, 50, 0, 46, 9, 49, 11, 48, 0, 50, 0, 0, 46, 5, 0, 46, 6, 0, 46, 7, 0, 46, 8, 0, 0, 10, 48, 0, 47, 30, 48, 0, 49, 0, 48, 31, 49, 0, 4, 0, 32, 33, 0, 32, 51, 33, 0, 32, 33, 29, 0, 32, 51, 33, 29, 0, 52, 0, 51, 52, 0, 63, 29, 0, 53, 54, 0, 53, 56, 0, 0, 53, 13, 0, 53, 7, 0, 53, 14, 0, 53, 15, 0, 53, 16, 0, 53, 17, 0, 53, 5, 0, 53, 18, 0, 53, 6, 0, 53, 8, 0, 55, 29, 0, 58, 48, 34, 59, 35, 0, 49, 34, 59, 35, 0, 55, 36, 37, 0, 57, 29, 0, 48, 31, 4, 49, 0, 49, 49, 0, 58, 49, 0, 57, 36, 37, 0, 19, 0, 20, 0, 21, 0, 28, 0, 27, 0, 23, 0, 25, 0, 22, 0, 26, 0, 24, 0, 0, 60, 0, 61, 0, 60, 30, 61, 0, 58, 62, 0, 48, 0, 0, 62, 36, 37, 0, 0, 53, 15, 32, 33, 0 }; #endif #if YYDEBUG != 0 static const short yyrline[] = { 0, 21, 24, 25, 26, 29, 31, 34, 38, 47, 52, 59, 64, 65, 66, 67, 68, 71, 72, 73, 76, 78, 83, 88, 89, 90, 91, 94, 95, 98, 99, 100, 103, 104, 106, 108, 110, 112, 114, 116, 118, 120, 122, 126, 129, 130, 131, 134, 140, 146, 152, 156, 162, 166, 170, 174, 178, 182, 186, 190, 194, 198, 204, 205, 208, 209, 212, 213, 216, 217, 220, 221 }; #endif #if YYDEBUG != 0 || defined (YYERROR_VERBOSE) static const char * const yytname[] = { "$","error","$undefined.","ERROR", "SYMBOL","FINAL","SYNCHRONIZED","PUBLIC","ABSTRACT","INTERFACE","IMPLEMENTS", "EXTENDS","CLASS","PRIVATE","PROTECTED","STATIC","TRANSIENT","VOLATILE","NATIVE", "BOOLEAN","BYTE","CHAR","DOUBLE","FLOAT","VOID","LONG","STRING","INT","SHORT", "';'","','","'.'","'{'","'}'","'('","')'","'['","']'","compilationUnit","typeDeclaration", "classDeclaration","interfaceDeclaration","classDecl1","classDecl2","interfaceDecl1", "interfaceDecl2","classModifierList","interfaces","qualifiedSymbol","simpleSymbol", "classBlock","fieldList","field","modifierList","methodDeclaration","method", "variableDeclaration","variable","simpleType","optArgList","argList","arg","optArrayBounds", "ignore", NULL }; #endif static const short yyr1[] = { 0, 38, 39, 39, 39, 40, 41, 42, 42, 43, 44, 45, 46, 46, 46, 46, 46, 47, 47, 47, 48, 48, 49, 50, 50, 50, 50, 51, 51, 52, 52, 52, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 54, 55, 55, 55, 56, 57, 57, 57, 57, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 59, 59, 60, 60, 61, 61, 62, 62, 63, 63 }; static const short yyr2[] = { 0, 1, 1, 1, 1, 2, 2, 3, 6, 1, 5, 1, 0, 2, 2, 2, 2, 0, 2, 3, 1, 3, 1, 2, 3, 3, 4, 1, 2, 2, 2, 2, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 5, 4, 3, 2, 4, 2, 2, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 3, 2, 1, 0, 3, 0, 4 }; static const short yydefact[] = { 12, 2, 1, 3, 4, 0, 0, 0, 32, 5, 9, 6, 11, 13, 14, 15, 16, 0, 0, 23, 32, 27, 0, 0, 22, 0, 7, 20, 25, 24, 28, 39, 41, 34, 42, 33, 35, 36, 37, 38, 40, 52, 53, 54, 59, 57, 61, 58, 60, 56, 55, 0, 20, 30, 0, 31, 0, 0, 29, 0, 0, 0, 26, 0, 0, 62, 49, 43, 0, 47, 0, 0, 20, 10, 17, 21, 71, 22, 67, 68, 0, 63, 64, 46, 51, 62, 0, 8, 48, 66, 45, 0, 0, 18, 0, 0, 65, 44, 19, 69, 0, 0, 0 }; static const short yydefgoto[] = { 100, 2, 3, 4, 5, 9, 6, 11, 7, 87, 78, 27, 10, 20, 21, 22, 53, 54, 55, 56, 79, 80, 81, 82, 89, 23 }; static const short yypact[] = { -16, -32768,-32768,-32768,-32768, -21, -21, 28, 15,-32768,-32768, -32768,-32768,-32768,-32768,-32768,-32768, 11, 11, 0, 16, -32768, 65, 3,-32768, 17, -1,-32768,-32768, 23,-32768, -32768,-32768,-32768,-32768,-32768,-32768, 14,-32768,-32768,-32768, -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 22, -3,-32768, -24,-32768, -22, 11,-32768, 11, 11, 11,-32768, 24, 51, -2,-32768,-32768, 19,-32768, 21, 20, -20, 29, -4,-32768,-32768, 11, 29,-32768, 26, 32,-32768,-32768,-32768, -2, 11, 34,-32768, 30,-32768, -2, 39, 29, 11, 38,-32768,-32768, 29,-32768, 59, 67,-32768 }; static const short yypgoto[] = {-32768, -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, -18, -14, 71,-32768, 45,-32768,-32768,-32768,-32768,-32768, 72, 10,-32768, 5,-32768,-32768 }; #define YYLAST 96 static const short yytable[] = { 26, 24, 24, 25, 51, 67, 86, 69, 52, -50, 60, 8, 68, 1, 70, 24, -50, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 61, 59, 28, 61, 65, 58, 13, 14, 15, 16, 17, 66, 71, 18, 73, 74, 72, -70, -70, 63, 75, 19, 29, 75, 61, 62, 64, 85, 77, 83, 76, 84, 101, 61, 90, 91, 88, 94, 30, 95, 102, 93, 24, 31, 32, 33, 34, 97, 99, 98, 12, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 57, 92, 96 }; static const short yycheck[] = { 18, 4, 4, 17, 22, 29, 10, 29, 22, 29, 11, 32, 36, 29, 36, 4, 36, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 31, 11, 29, 31, 34, 29, 5, 6, 7, 8, 9, 52, 57, 12, 59, 60, 57, 29, 29, 32, 61, 33, 33, 64, 31, 29, 31, 34, 4, 37, 33, 37, 0, 31, 35, 30, 77, 30, 20, 36, 0, 86, 4, 5, 6, 7, 8, 35, 37, 94, 6, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 22, 85, 91 }; /* -*-C-*- Note some compilers choke on comments on `#line' lines. */ /* Skeleton output parser for bison, Copyright (C) 1984, 1989, 1990 Free Software Foundation, Inc. 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 2, 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, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ /* As a special exception, when this file is copied by Bison into a Bison output file, you may use that output file without restriction. This special exception was added by the Free Software Foundation in version 1.24 of Bison. */ #ifndef alloca #ifdef __GNUC__ #define alloca __builtin_alloca #else /* not GNU C. */ #if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi) #include #else /* not sparc */ #if defined (MSDOS) && !defined (__TURBOC__) #include #else /* not MSDOS, or __TURBOC__ */ #if defined(_AIX) #include #pragma alloca #else /* not MSDOS, __TURBOC__, or _AIX */ #ifdef __hpux #ifdef __cplusplus extern "C" { void *alloca (unsigned int); }; #else /* not __cplusplus */ void *alloca (); #endif /* not __cplusplus */ #endif /* __hpux */ #endif /* not _AIX */ #endif /* not MSDOS, or __TURBOC__ */ #endif /* not sparc. */ #endif /* not GNU C. */ #endif /* alloca not defined. */ /* This is the parser code that is written into each bison parser when the %semantic_parser declaration is not specified in the grammar. It was written by Richard Stallman by simplifying the hairy parser used when %semantic_parser is specified. */ /* Note: there must be only one dollar sign in this file. It is replaced by the list of actions, each action as one case of the switch. */ #define yyerrok (yyerrstatus = 0) #define yyclearin (yychar = YYEMPTY) #define YYEMPTY -2 #define YYEOF 0 #define YYACCEPT return(0) #define YYABORT return(1) #define YYERROR goto yyerrlab1 /* Like YYERROR except do call yyerror. This remains here temporarily to ease the transition to the new meaning of YYERROR, for GCC. Once GCC version 2 has supplanted version 1, this can go. */ #define YYFAIL goto yyerrlab #define YYRECOVERING() (!!yyerrstatus) #define YYBACKUP(token, value) \ do \ if (yychar == YYEMPTY && yylen == 1) \ { yychar = (token), yylval = (value); \ yychar1 = YYTRANSLATE (yychar); \ YYPOPSTACK; \ goto yybackup; \ } \ else \ { yyerror ("syntax error: cannot back up"); YYERROR; } \ while (0) #define YYTERROR 1 #define YYERRCODE 256 #ifndef YYPURE #define YYLEX yylex() #endif #ifdef YYPURE #ifdef YYLSP_NEEDED #ifdef YYLEX_PARAM #define YYLEX yylex(&yylval, &yylloc, YYLEX_PARAM) #else #define YYLEX yylex(&yylval, &yylloc) #endif #else /* not YYLSP_NEEDED */ #ifdef YYLEX_PARAM #define YYLEX yylex(&yylval, YYLEX_PARAM) #else #define YYLEX yylex(&yylval) #endif #endif /* not YYLSP_NEEDED */ #endif /* If nonreentrant, generate the variables here */ #ifndef YYPURE int yychar; /* the lookahead symbol */ YYSTYPE yylval; /* the semantic value of the */ /* lookahead symbol */ #ifdef YYLSP_NEEDED YYLTYPE yylloc; /* location data for the lookahead */ /* symbol */ #endif int yynerrs; /* number of parse errors so far */ #endif /* not YYPURE */ #if YYDEBUG != 0 int yydebug; /* nonzero means print parse trace */ /* Since this is uninitialized, it does not stop multiple parsers from coexisting. */ #endif /* YYINITDEPTH indicates the initial size of the parser's stacks */ #ifndef YYINITDEPTH #define YYINITDEPTH 200 #endif /* YYMAXDEPTH is the maximum size the stacks can grow to (effective only if the built-in stack extension method is used). */ #if YYMAXDEPTH == 0 #undef YYMAXDEPTH #endif #ifndef YYMAXDEPTH #define YYMAXDEPTH 10000 #endif /* Prevent warning if -Wstrict-prototypes. */ #ifdef __GNUC__ int yyparse (void); #endif #if __GNUC__ > 1 /* GNU C and GNU C++ define this. */ #define __yy_memcpy(TO,FROM,COUNT) __builtin_memcpy(TO,FROM,COUNT) #else /* not GNU C or C++ */ #ifndef __cplusplus /* This is the most reliable way to avoid incompatibilities in available built-in functions on various systems. */ static void __yy_memcpy (to, from, count) char *to; char *from; int count; { register char *f = from; register char *t = to; register int i = count; while (i-- > 0) *t++ = *f++; } #else /* __cplusplus */ /* This is the most reliable way to avoid incompatibilities in available built-in functions on various systems. */ static void __yy_memcpy (char *to, char *from, int count) { register char *f = from; register char *t = to; register int i = count; while (i-- > 0) *t++ = *f++; } #endif #endif /* The user can define YYPARSE_PARAM as the name of an argument to be passed into yyparse. The argument should have type void *. It should actually point to an object. Grammar actions can access the variable by casting it to the proper pointer type. */ #ifdef YYPARSE_PARAM #ifdef __cplusplus #define YYPARSE_PARAM_ARG void *YYPARSE_PARAM #define YYPARSE_PARAM_DECL #else /* not __cplusplus */ #define YYPARSE_PARAM_ARG YYPARSE_PARAM #define YYPARSE_PARAM_DECL void *YYPARSE_PARAM; #endif /* not __cplusplus */ #else /* not YYPARSE_PARAM */ #define YYPARSE_PARAM_ARG #define YYPARSE_PARAM_DECL #endif /* not YYPARSE_PARAM */ int yyparse(YYPARSE_PARAM_ARG) YYPARSE_PARAM_DECL { register int yystate; register int yyn; register short *yyssp; register YYSTYPE *yyvsp; int yyerrstatus; /* number of tokens to shift before error messages enabled */ int yychar1 = 0; /* lookahead token as an internal (translated) token number */ short yyssa[YYINITDEPTH]; /* the state stack */ YYSTYPE yyvsa[YYINITDEPTH]; /* the semantic value stack */ short *yyss = yyssa; /* refer to the stacks thru separate pointers */ YYSTYPE *yyvs = yyvsa; /* to allow yyoverflow to reallocate them elsewhere */ #ifdef YYLSP_NEEDED YYLTYPE yylsa[YYINITDEPTH]; /* the location stack */ YYLTYPE *yyls = yylsa; YYLTYPE *yylsp; #define YYPOPSTACK (yyvsp--, yyssp--, yylsp--) #else #define YYPOPSTACK (yyvsp--, yyssp--) #endif int yystacksize = YYINITDEPTH; #ifdef YYPURE int yychar; YYSTYPE yylval; int yynerrs; #ifdef YYLSP_NEEDED YYLTYPE yylloc; #endif #endif YYSTYPE yyval; /* the variable used to return */ /* semantic values from the action */ /* routines */ int yylen; #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Starting parse\n"); #endif yystate = 0; yyerrstatus = 0; yynerrs = 0; yychar = YYEMPTY; /* Cause a token to be read. */ /* Initialize stack pointers. Waste one element of value and location stack so that they stay on the same level as the state stack. The wasted elements are never initialized. */ yyssp = yyss - 1; yyvsp = yyvs; #ifdef YYLSP_NEEDED yylsp = yyls; #endif /* Push a new state, which is found in yystate . */ /* In all cases, when you get here, the value and location stacks have just been pushed. so pushing a state here evens the stacks. */ yynewstate: *++yyssp = yystate; if (yyssp >= yyss + yystacksize - 1) { /* Give user a chance to reallocate the stack */ /* Use copies of these so that the &'s don't force the real ones into memory. */ YYSTYPE *yyvs1 = yyvs; short *yyss1 = yyss; #ifdef YYLSP_NEEDED YYLTYPE *yyls1 = yyls; #endif /* Get the current used size of the three stacks, in elements. */ int size = yyssp - yyss + 1; #ifdef yyoverflow /* Each stack pointer address is followed by the size of the data in use in that stack, in bytes. */ #ifdef YYLSP_NEEDED /* This used to be a conditional around just the two extra args, but that might be undefined if yyoverflow is a macro. */ yyoverflow("parser stack overflow", &yyss1, size * sizeof (*yyssp), &yyvs1, size * sizeof (*yyvsp), &yyls1, size * sizeof (*yylsp), &yystacksize); #else yyoverflow("parser stack overflow", &yyss1, size * sizeof (*yyssp), &yyvs1, size * sizeof (*yyvsp), &yystacksize); #endif yyss = yyss1; yyvs = yyvs1; #ifdef YYLSP_NEEDED yyls = yyls1; #endif #else /* no yyoverflow */ /* Extend the stack our own way. */ if (yystacksize >= YYMAXDEPTH) { yyerror("parser stack overflow"); return 2; } yystacksize *= 2; if (yystacksize > YYMAXDEPTH) yystacksize = YYMAXDEPTH; yyss = (short *) alloca (yystacksize * sizeof (*yyssp)); __yy_memcpy ((char *)yyss, (char *)yyss1, size * sizeof (*yyssp)); yyvs = (YYSTYPE *) alloca (yystacksize * sizeof (*yyvsp)); __yy_memcpy ((char *)yyvs, (char *)yyvs1, size * sizeof (*yyvsp)); #ifdef YYLSP_NEEDED yyls = (YYLTYPE *) alloca (yystacksize * sizeof (*yylsp)); __yy_memcpy ((char *)yyls, (char *)yyls1, size * sizeof (*yylsp)); #endif #endif /* no yyoverflow */ yyssp = yyss + size - 1; yyvsp = yyvs + size - 1; #ifdef YYLSP_NEEDED yylsp = yyls + size - 1; #endif #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Stack size increased to %d\n", yystacksize); #endif if (yyssp >= yyss + yystacksize - 1) YYABORT; } #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Entering state %d\n", yystate); #endif goto yybackup; yybackup: /* Do appropriate processing given the current state. */ /* Read a lookahead token if we need one and don't already have one. */ /* yyresume: */ /* First try to decide what to do without reference to lookahead token. */ yyn = yypact[yystate]; if (yyn == YYFLAG) goto yydefault; /* Not known => get a lookahead token if don't already have one. */ /* yychar is either YYEMPTY or YYEOF or a valid token in external form. */ if (yychar == YYEMPTY) { #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Reading a token: "); #endif yychar = YYLEX; } /* Convert token to internal form (in yychar1) for indexing tables with */ if (yychar <= 0) /* This means end of input. */ { yychar1 = 0; yychar = YYEOF; /* Don't call YYLEX any more */ #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Now at end of input.\n"); #endif } else { yychar1 = YYTRANSLATE(yychar); #if YYDEBUG != 0 if (yydebug) { fprintf (stderr, "Next token is %d (%s", yychar, yytname[yychar1]); /* Give the individual parser a way to print the precise meaning of a token, for further debugging info. */ #ifdef YYPRINT YYPRINT (stderr, yychar, yylval); #endif fprintf (stderr, ")\n"); } #endif } yyn += yychar1; if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1) goto yydefault; yyn = yytable[yyn]; /* yyn is what to do for this token type in this state. Negative => reduce, -yyn is rule number. Positive => shift, yyn is new state. New state is final state => don't bother to shift, just return success. 0, or most negative number => error. */ if (yyn < 0) { if (yyn == YYFLAG) goto yyerrlab; yyn = -yyn; goto yyreduce; } else if (yyn == 0) goto yyerrlab; if (yyn == YYFINAL) YYACCEPT; /* Shift the lookahead token. */ #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Shifting token %d (%s), ", yychar, yytname[yychar1]); #endif /* Discard the token being shifted unless it is eof. */ if (yychar != YYEOF) yychar = YYEMPTY; *++yyvsp = yylval; #ifdef YYLSP_NEEDED *++yylsp = yylloc; #endif /* count tokens shifted since error; after three, turn off error status. */ if (yyerrstatus) yyerrstatus--; yystate = yyn; goto yynewstate; /* Do the default action for the current state. */ yydefault: yyn = yydefact[yystate]; if (yyn == 0) goto yyerrlab; /* Do a reduction. yyn is the number of a rule to reduce with. */ yyreduce: yylen = yyr2[yyn]; if (yylen > 0) yyval = yyvsp[1-yylen]; /* implement default value of the action */ #if YYDEBUG != 0 if (yydebug) { int i; fprintf (stderr, "Reducing via rule %d (line %d), ", yyn, yyrline[yyn]); /* Print the symbols being reduced, and their result. */ for (i = yyprhs[yyn]; yyrhs[i] > 0; i++) fprintf (stderr, "%s ", yytname[yyrhs[i]]); fprintf (stderr, " -> %s\n", yytname[yyr1[yyn]]); } #endif switch (yyn) { case 7: { // pat.startClass($3); nothing needed at this point ; break;} case 8: { // pat.startClass(new ClassNode($3, $4, $5));} // pat.startClass($3, $5); boolean addVar = true; // Add Var of Parent Class to current scope pat.parseClass(yyvsp[-1].text, addVar); ; break;} case 9: { // pat.endClass(); ; break;} case 10: { // pat.startClass($3, $5); boolean addVar = true; // Add Var of Parent Class to current scope pat.parseClass(yyvsp[0].text, addVar); ; break;} case 11: { // pat.endClass(); ; break;} case 20: { yyval = yyvsp[0]; ; break;} case 21: { (yyvsp[-2]).text += ("."+(yyvsp[0]).text); yyval = yyvsp[-2];; break;} case 22: { // System.out.println($1.text); yyval = yyvsp[0] ; ; break;} case 33: { yyval = yyvsp[0]; ; break;} case 34: { yyval = yyvsp[0]; ; break;} case 35: { yyval = yyvsp[0]; ; break;} case 36: { yyval = yyvsp[0]; ; break;} case 37: { yyval = yyvsp[0]; ; break;} case 38: { yyval = yyvsp[0]; ; break;} case 39: { yyval = yyvsp[0]; ; break;} case 40: { yyval = yyvsp[0]; ; break;} case 41: { yyval = yyvsp[0]; ; break;} case 42: { yyval = yyvsp[0]; ; break;} case 47: { pat.addLocalVar((FormalNode)(yyvsp[-1])); ; break;} case 48: { yyval = (YYtoken) (new FormalNode(new TypeNode(yyvsp[-1]), yyvsp[0])); boolean addVar = false; pat.parseClass(yyvsp[-1].text, addVar); ; break;} case 49: { yyval = (YYtoken) (new FormalNode(new TypeNode(yyvsp[-1]), yyvsp[0])); boolean addVar = false; pat.parseClass(yyvsp[-1].text, addVar); ; break;} case 50: { yyval = (YYtoken) (new FormalNode(yyvsp[-1], yyvsp[0])); ; break;} case 51: { ((FormalNode)yyvsp[-2]).type.addDim(1); ; break;} case 52: { yyval = (YYtoken) (new TypeNode(TypeNode.BOOL, yyvsp[0])); ; break;} case 53: { yyval = (YYtoken) (new TypeNode(TypeNode.BYTE, yyvsp[0])); ; break;} case 54: { yyval = (YYtoken) (new TypeNode(TypeNode.CHAR, yyvsp[0])); ; break;} case 55: { yyval = (YYtoken) (new TypeNode(TypeNode.SHORT, yyvsp[0])); ; break;} case 56: { yyval = (YYtoken) (new TypeNode(TypeNode.INT, yyvsp[0])); ; break;} case 57: { yyval = (YYtoken) (new TypeNode(TypeNode.FLOAT, yyvsp[0])); ; break;} case 58: { yyval = (YYtoken) (new TypeNode(TypeNode.LONG, yyvsp[0])); ; break;} case 59: { yyval = (YYtoken) (new TypeNode(TypeNode.DOUBLE, yyvsp[0])); ; break;} case 60: { yyval = (YYtoken) (new TypeNode(TypeNode.STRING, yyvsp[0])); ; break;} case 61: { yyval = (YYtoken) (new TypeNode(TypeNode.VOID, yyvsp[0])); ; break;} case 71: { if (!(yyvsp[-3].text).equals("static")) { System.err.println("UnHandled Profiler Output in "+pat.modName+".tmp"); } ; break;} } /* the action file gets copied in in place of this dollarsign */ yyvsp -= yylen; yyssp -= yylen; #ifdef YYLSP_NEEDED yylsp -= yylen; #endif #if YYDEBUG != 0 if (yydebug) { short *ssp1 = yyss - 1; fprintf (stderr, "state stack now"); while (ssp1 != yyssp) fprintf (stderr, " %d", *++ssp1); fprintf (stderr, "\n"); } #endif *++yyvsp = yyval; #ifdef YYLSP_NEEDED yylsp++; if (yylen == 0) { yylsp->first_line = yylloc.first_line; yylsp->first_column = yylloc.first_column; yylsp->last_line = (yylsp-1)->last_line; yylsp->last_column = (yylsp-1)->last_column; yylsp->text = 0; } else { yylsp->last_line = (yylsp+yylen-1)->last_line; yylsp->last_column = (yylsp+yylen-1)->last_column; } #endif /* Now "shift" the result of the reduction. Determine what state that goes to, based on the state we popped back to and the rule number reduced by. */ yyn = yyr1[yyn]; yystate = yypgoto[yyn - YYNTBASE] + *yyssp; if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp) yystate = yytable[yystate]; else yystate = yydefgoto[yyn - YYNTBASE]; goto yynewstate; yyerrlab: /* here on detecting error */ if (! yyerrstatus) /* If not already recovering from an error, report this error. */ { ++yynerrs; #ifdef YYERROR_VERBOSE yyn = yypact[yystate]; if (yyn > YYFLAG && yyn < YYLAST) { int size = 0; char *msg; int x, count; count = 0; /* Start X at -yyn if nec to avoid negative indexes in yycheck. */ for (x = (yyn < 0 ? -yyn : 0); x < (sizeof(yytname) / sizeof(char *)); x++) if (yycheck[x + yyn] == x) size += strlen(yytname[x]) + 15, count++; msg = (char *) malloc(size + 15); if (msg != 0) { strcpy(msg, "parse error"); if (count < 5) { count = 0; for (x = (yyn < 0 ? -yyn : 0); x < (sizeof(yytname) / sizeof(char *)); x++) if (yycheck[x + yyn] == x) { strcat(msg, count == 0 ? ", expecting `" : " or `"); strcat(msg, yytname[x]); strcat(msg, "'"); count++; } } yyerror(msg); free(msg); } else yyerror ("parse error; also virtual memory exceeded"); } else #endif /* YYERROR_VERBOSE */ yyerror("parse error"); } goto yyerrlab1; yyerrlab1: /* here on error raised explicitly by an action */ if (yyerrstatus == 3) { /* if just tried and failed to reuse lookahead token after an error, discard it. */ /* return failure if at end of input */ if (yychar == YYEOF) YYABORT; #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]); #endif yychar = YYEMPTY; } /* Else will try to reuse lookahead token after shifting the error token. */ yyerrstatus = 3; /* Each real token shifted decrements this */ goto yyerrhandle; yyerrdefault: /* current state does not do anything special for the error token. */ #if 0 /* This is wrong; only states that explicitly want error tokens should shift them. */ yyn = yydefact[yystate]; /* If its default is to accept any token, ok. Otherwise pop it.*/ if (yyn) goto yydefault; #endif yyerrpop: /* pop the current state because it cannot handle the error token */ if (yyssp == yyss) YYABORT; yyvsp--; yystate = *--yyssp; #ifdef YYLSP_NEEDED yylsp--; #endif #if YYDEBUG != 0 if (yydebug) { short *ssp1 = yyss - 1; fprintf (stderr, "Error: state stack now"); while (ssp1 != yyssp) fprintf (stderr, " %d", *++ssp1); fprintf (stderr, "\n"); } #endif yyerrhandle: yyn = yypact[yystate]; if (yyn == YYFLAG) goto yyerrdefault; yyn += YYTERROR; if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR) goto yyerrdefault; yyn = yytable[yyn]; if (yyn < 0) { if (yyn == YYFLAG) goto yyerrpop; yyn = -yyn; goto yyreduce; } else if (yyn == 0) goto yyerrpop; if (yyn == YYFINAL) YYACCEPT; #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Shifting error token, "); #endif *++yyvsp = yylval; #ifdef YYLSP_NEEDED *++yylsp = yylloc; #endif yystate = yyn; goto yynewstate; } /* put suffix code here */ /* Override yyerror */ public void yyverror(String s) throws ParseException { yyerror(s, true); //throw new ParseException(s); } // protected Patch pat; protected npp.src.util.NslPreProcessor pat; public void init(npp.src.util.NslPreProcessor p) { pat = p; } /* init(npp.src.NPP p) { pat = p; } */