/* A Bison parser, made from ibm2.y with Bison version GNU Bison version 1.21 */ #define YYBISON 1 /* Identify Bison output. */ #define IDENTIFIER 258 #define NUMBER 259 #define MODULE 260 #define BEGIN 261 #define END 262 #define ARRAY 263 #define OF 264 #define POINTER 265 #define TO 266 #define RECORD 267 #define TRUE 268 #define FALSE 269 #define IF 270 #define THEN 271 #define ELSE 272 #define WHILE 273 #define DO 274 #define RETURN 275 #define INTEGER 276 #define BOOLEAN 277 #define TYPE 278 #define VAR 279 #define PROCEDURE 280 #define OR 281 #define AND 282 #define NOT 283 #line 1 "ibm2.y" #line 5 "ibm2.y" typedef union { char *id; int number; } YYSTYPE; #ifndef YYLTYPE typedef struct yyltype { int timestamp; int first_line; int first_column; int last_line; int last_column; char *text; } yyltype; #define YYLTYPE yyltype #endif #include #ifndef __cplusplus #ifndef __STDC__ #define const #endif #endif #define YYFINAL 118 #define YYFLAG -32768 #define YYNTBASE 41 #define YYTRANSLATE(x) ((unsigned)(x) <= 283 ? yytranslate[x] : 68) 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, 35, 36, 32, 29, 40, 30, 38, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 39, 37, 26, 27, 28, 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, 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, 31, 33, 34 }; #if YYDEBUG != 0 static const short yyprhs[] = { 0, 0, 10, 14, 16, 18, 20, 22, 25, 31, 36, 39, 45, 50, 54, 56, 68, 71, 72, 74, 76, 78, 82, 84, 86, 88, 90, 92, 94, 99, 106, 109, 110, 116, 120, 123, 125, 126, 131, 134, 136, 138, 140, 142, 144, 145, 150, 153, 155, 157, 159, 161, 163, 166, 168, 170, 172, 174, 176, 180 }; static const short yyrhs[] = { 5, 3, 37, 42, 6, 52, 7, 3, 38, 0, 42, 37, 43, 0, 43, 0, 44, 0, 46, 0, 49, 0, 23, 45, 0, 45, 3, 27, 51, 37, 0, 3, 27, 51, 37, 0, 24, 47, 0, 47, 48, 39, 51, 37, 0, 48, 39, 51, 37, 0, 48, 40, 3, 0, 3, 0, 3, 35, 36, 50, 37, 42, 6, 52, 7, 3, 37, 0, 39, 51, 0, 0, 3, 0, 21, 0, 22, 0, 52, 37, 53, 0, 53, 0, 54, 0, 55, 0, 57, 0, 58, 0, 59, 0, 3, 39, 27, 61, 0, 15, 61, 16, 52, 56, 7, 0, 17, 52, 0, 0, 18, 61, 19, 52, 7, 0, 3, 35, 36, 0, 20, 60, 0, 61, 0, 0, 61, 62, 63, 64, 0, 63, 64, 0, 26, 0, 27, 0, 28, 0, 29, 0, 30, 0, 0, 64, 65, 66, 67, 0, 66, 67, 0, 32, 0, 29, 0, 30, 0, 31, 0, 33, 0, 66, 34, 0, 34, 0, 13, 0, 14, 0, 4, 0, 3, 0, 3, 35, 36, 0, 35, 61, 36, 0 }; #endif #if YYDEBUG != 0 static const short yyrline[] = { 0, 26, 48, 49, 52, 53, 54, 57, 60, 61, 64, 67, 68, 71, 72, 75, 79, 80, 83, 84, 85, 88, 89, 92, 93, 94, 95, 96, 99, 102, 106, 107, 110, 114, 117, 120, 121, 124, 125, 128, 129, 130, 133, 134, 135, 138, 139, 142, 143, 144, 145, 146, 149, 150, 153, 154, 155, 156, 157, 158 }; static const char * const yytname[] = { "$","error","$illegal.","IDENTIFIER", "NUMBER","MODULE","BEGIN","END","ARRAY","OF","POINTER","TO","RECORD","TRUE", "FALSE","IF","THEN","ELSE","WHILE","DO","RETURN","INTEGER","BOOLEAN","TYPE", "VAR","PROCEDURE","'<'","'='","'>'","'+'","'-'","OR","'*'","AND","NOT","'('", "')'","';'","'.'","':'","','","program","declarations","declaration","type_decl", "type_tail","var_decl","var_tail","var_id_list","proc_decl","proc_type","typedenoter", "statementlist","statement","assign_statement","if_then_else_statement","else_part", "while_do_statement","proc_statement","return_statement","return_tail","expression", "rel_op","sign_part","exp_rest","bin_op","not_list","term","" }; #endif static const short yyr1[] = { 0, 41, 42, 42, 43, 43, 43, 44, 45, 45, 46, 47, 47, 48, 48, 49, 50, 50, 51, 51, 51, 52, 52, 53, 53, 53, 53, 53, 54, 55, 56, 56, 57, 58, 59, 60, 60, 61, 61, 62, 62, 62, 63, 63, 63, 64, 64, 65, 65, 65, 65, 65, 66, 66, 67, 67, 67, 67, 67, 67 }; static const short yyr2[] = { 0, 9, 3, 1, 1, 1, 1, 2, 5, 4, 2, 5, 4, 3, 1, 11, 2, 0, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 4, 6, 2, 0, 5, 3, 2, 1, 0, 4, 2, 1, 1, 1, 1, 1, 0, 4, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 3, 3 }; static const short yydefact[] = { 0, 0, 0, 0, 0, 0, 0, 0, 3, 4, 5, 6, 0, 0, 7, 14, 10, 0, 0, 0, 17, 0, 0, 0, 0, 0, 0, 44, 44, 36, 0, 22, 23, 24, 25, 26, 27, 2, 0, 0, 18, 19, 20, 0, 0, 0, 0, 13, 0, 0, 42, 43, 0, 0, 0, 34, 35, 0, 0, 16, 0, 9, 0, 0, 12, 33, 44, 0, 39, 40, 41, 44, 53, 38, 0, 0, 0, 21, 0, 8, 11, 28, 31, 0, 48, 49, 50, 47, 51, 0, 57, 56, 54, 55, 52, 44, 46, 0, 1, 0, 0, 0, 37, 0, 0, 0, 32, 0, 30, 29, 45, 58, 59, 0, 0, 15, 0, 0, 0 }; static const short yydefgoto[] = { 116, 7, 8, 9, 14, 10, 16, 17, 11, 39, 43, 30, 31, 32, 33, 101, 34, 35, 36, 55, 52, 71, 53, 73, 89, 74, 96 }; static const short yypact[] = { 12, 28, -29, 4, -9, 52, 55, 3,-32768,-32768,-32768, -32768, 40, 14, 76,-32768, 55, 13, 36, 4, 41, 26, 54, 23, 26, 79, -16, 48, 48, 16, -4, -32768,-32768,-32768,-32768,-32768,-32768,-32768, 26, 46,-32768, -32768,-32768, 49, 26, 26, 50,-32768, 53, 57,-32768, -32768, 33, 51, 38,-32768, 47, 85, 36,-32768, 4, -32768, 56, 58,-32768,-32768, 48, 36,-32768,-32768,-32768, 48,-32768, 39, 2, 36, 59,-32768, 5,-32768,-32768, 47, -5, 51,-32768,-32768,-32768,-32768,-32768, 51, 61, -32768,-32768,-32768,-32768, 48,-32768, 6,-32768, 36, 36, 83, 39, 2, 62, -6,-32768, 7, 63,-32768,-32768, -32768,-32768, 88, 64,-32768, 92, 94,-32768 }; static const short yypgoto[] = {-32768, 42, 80,-32768,-32768,-32768,-32768, 87,-32768,-32768, -20, -65, 60,-32768,-32768,-32768,-32768,-32768,-32768,-32768, -28, -32768, 34, 21,-32768, 17, 8 }; #define YYLAST 118 static const short yytable[] = { 54, 56, 82, 57, 46, 90, 91, 4, 3, 18, 97, 99, 100, 106, 113, 92, 93, 1, 59, 48, 68, 69, 70, 49, 62, 63, 12, 5, 6, 40, 112, 2, 58, 58, 107, 108, 94, 95, 81, 26, 19, 21, 19, 58, 58, 50, 51, 41, 42, 67, -44, 27, 24, 25, 28, 13, 29, 75, 15, 68, 69, 70, 45, 25, 68, 69, 70, 105, 84, 85, 86, 87, 88, 68, 69, 70, 20, 50, 51, 22, 38, 44, 47, 60, 66, 72, 61, 64, 76, 65, 109, 114, 117, 79, 118, 80, 104, 98, 111, 37, 58, 115, 78, 23, 102, 83, 103, 0, 0, 0, 0, 110, 0, 0, 0, 0, 0, 0, 77 }; static const short yycheck[] = { 28, 29, 67, 7, 24, 3, 4, 3, 37, 6, 75, 6, 17, 7, 7, 13, 14, 5, 38, 35, 26, 27, 28, 39, 44, 45, 35, 23, 24, 3, 36, 3, 37, 37, 99, 100, 34, 35, 66, 3, 37, 27, 37, 37, 37, 29, 30, 21, 22, 16, 34, 15, 39, 40, 18, 3, 20, 19, 3, 26, 27, 28, 39, 40, 26, 27, 28, 95, 29, 30, 31, 32, 33, 26, 27, 28, 36, 29, 30, 3, 39, 27, 3, 37, 27, 34, 37, 37, 3, 36, 7, 3, 0, 37, 0, 37, 35, 38, 36, 19, 37, 37, 60, 16, 83, 71, 89, -1, -1, -1, -1, 103, -1, -1, -1, -1, -1, -1, 58 }; /* -*-C-*- Note some compilers choke on comments on `#line' lines. */ #line 3 "/afs/sipb.mit.edu/project/gnu/lib/bison.simple" /* Skeleton output parser for bison, Copyright (C) 1984, 1989, 1990 Bob Corbett and Richard Stallman 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 1, 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. */ #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 (unsigned int); #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 #define YYLEX yylex(&yylval, &yylloc) #else #define YYLEX yylex(&yylval) #endif #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_bcopy(FROM,TO,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_bcopy (from, to, count) char *from; char *to; 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_bcopy (char *from, char *to, int count) { register char *f = from; register char *t = to; register int i = count; while (i-- > 0) *t++ = *f++; } #endif #endif #line 184 "/afs/sipb.mit.edu/project/gnu/lib/bison.simple" int yyparse() { 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; /* 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. */ yyoverflow("parser stack overflow", &yyss1, size * sizeof (*yyssp), &yyvs1, size * sizeof (*yyvsp), #ifdef YYLSP_NEEDED &yyls1, size * sizeof (*yylsp), #endif &yystacksize); 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_bcopy ((char *)yyss1, (char *)yyss, size * sizeof (*yyssp)); yyvs = (YYSTYPE *) alloca (yystacksize * sizeof (*yyvsp)); __yy_bcopy ((char *)yyvs1, (char *)yyvs, size * sizeof (*yyvsp)); #ifdef YYLSP_NEEDED yyls = (YYLTYPE *) alloca (yystacksize * sizeof (*yylsp)); __yy_bcopy ((char *)yyls1, (char *)yyls, 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]; 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) { } /* the action file gets copied in in place of this dollarsign */ #line 457 "/afs/sipb.mit.edu/project/gnu/lib/bison.simple" 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; } #line 161 "ibm2.y"