1 /* -*-C-*- Note some compilers choke on comments on `#line' lines. */
4 /* Skeleton output parser for bison,
5 Copyright (C) 1984, 1989, 1990 Bob Corbett and Richard Stallman
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 1, or (at your option)
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with this program; if not, write to the Free Software
19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
24 #define alloca __builtin_alloca
25 #else /* not GNU C. */
26 #if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi)
29 #if defined (MSDOS) && !defined (__TURBOC__)
31 #else /* not MSDOS, or __TURBOC__ */
35 #else /* not MSDOS, __TURBOC__, or _AIX */
39 void *alloca (unsigned int);
41 #else /* not __cplusplus */
43 #endif /* not __cplusplus */
46 #endif /* not MSDOS, or __TURBOC__ */
47 #endif /* not sparc. */
48 #endif /* not GNU C. */
49 #endif /* alloca not defined. */
51 /* This is the parser code that is written into each bison parser
52 when the %semantic_parser declaration is not specified in the grammar.
53 It was written by Richard Stallman by simplifying the hairy parser
54 used when %semantic_parser is specified. */
56 /* Note: there must be only one dollar sign in this file.
57 It is replaced by the list of actions, each action
58 as one case of the switch. */
60 #define yyerrok (yyerrstatus = 0)
61 #define yyclearin (yychar = YYEMPTY)
64 #define YYACCEPT return(0)
65 #define YYABORT return(1)
66 #define YYERROR goto yyerrlab1
67 /* Like YYERROR except do call yyerror.
68 This remains here temporarily to ease the
69 transition to the new meaning of YYERROR, for GCC.
70 Once GCC version 2 has supplanted version 1, this can go. */
71 #define YYFAIL goto yyerrlab
72 #define YYRECOVERING() (!!yyerrstatus)
73 #define YYBACKUP(token, value) \
75 if (yychar == YYEMPTY && yylen == 1) \
76 { yychar = (token), yylval = (value); \
77 yychar1 = YYTRANSLATE (yychar); \
82 { yyerror ("syntax error: cannot back up"); YYERROR; } \
94 #define YYLEX yylex(&yylval, &yylloc)
96 #define YYLEX yylex(&yylval)
100 /* If nonreentrant, generate the variables here */
104 int yychar; /* the lookahead symbol */
105 YYSTYPE yylval; /* the semantic value of the */
106 /* lookahead symbol */
109 YYLTYPE yylloc; /* location data for the lookahead */
113 int yynerrs; /* number of parse errors so far */
114 #endif /* not YYPURE */
117 int yydebug; /* nonzero means print parse trace */
118 /* Since this is uninitialized, it does not stop multiple parsers
122 /* YYINITDEPTH indicates the initial size of the parser's stacks */
125 #define YYINITDEPTH 200
128 /* YYMAXDEPTH is the maximum size the stacks can grow to
129 (effective only if the built-in stack extension method is used). */
136 #define YYMAXDEPTH 10000
139 /* Prevent warning if -Wstrict-prototypes. */
144 #if __GNUC__ > 1 /* GNU C and GNU C++ define this. */
145 #define __yy_bcopy(FROM,TO,COUNT) __builtin_memcpy(TO,FROM,COUNT)
146 #else /* not GNU C or C++ */
149 /* This is the most reliable way to avoid incompatibilities
150 in available built-in functions on various systems. */
152 __yy_bcopy (from, to, count)
157 register char *f = from;
158 register char *t = to;
159 register int i = count;
165 #else /* __cplusplus */
167 /* This is the most reliable way to avoid incompatibilities
168 in available built-in functions on various systems. */
170 __yy_bcopy (char *from, char *to, int count)
172 register char *f = from;
173 register char *t = to;
174 register int i = count;
183 #line 184 "bison.simple"
187 register int yystate;
189 register short *yyssp;
190 register YYSTYPE *yyvsp;
191 int yyerrstatus; /* number of tokens to shift before error messages enabled */
192 int yychar1; /* lookahead token as an internal (translated) token number */
194 short yyssa[YYINITDEPTH]; /* the state stack */
195 YYSTYPE yyvsa[YYINITDEPTH]; /* the semantic value stack */
197 short *yyss = yyssa; /* refer to the stacks thru separate pointers */
198 YYSTYPE *yyvs = yyvsa; /* to allow yyoverflow to reallocate them elsewhere */
201 YYLTYPE yylsa[YYINITDEPTH]; /* the location stack */
202 YYLTYPE *yyls = yylsa;
205 #define YYPOPSTACK (yyvsp--, yyssp--, yylsp--)
207 #define YYPOPSTACK (yyvsp--, yyssp--)
210 int yystacksize = YYINITDEPTH;
221 YYSTYPE yyval; /* the variable used to return */
222 /* semantic values from the action */
229 fprintf(stderr, "Starting parse\n");
235 yychar = YYEMPTY; /* Cause a token to be read. */
237 /* Initialize stack pointers.
238 Waste one element of value and location stack
239 so that they stay on the same level as the state stack.
240 The wasted elements are never initialized. */
248 /* Push a new state, which is found in yystate . */
249 /* In all cases, when you get here, the value and location stacks
250 have just been pushed. so pushing a state here evens the stacks. */
255 if (yyssp >= yyss + yystacksize - 1)
257 /* Give user a chance to reallocate the stack */
258 /* Use copies of these so that the &'s don't force the real ones into memory. */
259 YYSTYPE *yyvs1 = yyvs;
262 YYLTYPE *yyls1 = yyls;
265 /* Get the current used size of the three stacks, in elements. */
266 int size = yyssp - yyss + 1;
269 /* Each stack pointer address is followed by the size of
270 the data in use in that stack, in bytes. */
272 /* This used to be a conditional around just the two extra args,
273 but that might be undefined if yyoverflow is a macro. */
274 yyoverflow("parser stack overflow",
275 &yyss1, size * sizeof (*yyssp),
276 &yyvs1, size * sizeof (*yyvsp),
277 &yyls1, size * sizeof (*yylsp),
280 yyoverflow("parser stack overflow",
281 &yyss1, size * sizeof (*yyssp),
282 &yyvs1, size * sizeof (*yyvsp),
286 yyss = yyss1; yyvs = yyvs1;
290 #else /* no yyoverflow */
291 /* Extend the stack our own way. */
292 if (yystacksize >= YYMAXDEPTH)
294 yyerror("parser stack overflow");
298 if (yystacksize > YYMAXDEPTH)
299 yystacksize = YYMAXDEPTH;
300 yyss = (short *) alloca (yystacksize * sizeof (*yyssp));
301 __yy_bcopy ((char *)yyss1, (char *)yyss, size * sizeof (*yyssp));
302 yyvs = (YYSTYPE *) alloca (yystacksize * sizeof (*yyvsp));
303 __yy_bcopy ((char *)yyvs1, (char *)yyvs, size * sizeof (*yyvsp));
305 yyls = (YYLTYPE *) alloca (yystacksize * sizeof (*yylsp));
306 __yy_bcopy ((char *)yyls1, (char *)yyls, size * sizeof (*yylsp));
308 #endif /* no yyoverflow */
310 yyssp = yyss + size - 1;
311 yyvsp = yyvs + size - 1;
313 yylsp = yyls + size - 1;
318 fprintf(stderr, "Stack size increased to %d\n", yystacksize);
321 if (yyssp >= yyss + yystacksize - 1)
327 fprintf(stderr, "Entering state %d\n", yystate);
333 /* Do appropriate processing given the current state. */
334 /* Read a lookahead token if we need one and don't already have one. */
337 /* First try to decide what to do without reference to lookahead token. */
339 yyn = yypact[yystate];
343 /* Not known => get a lookahead token if don't already have one. */
345 /* yychar is either YYEMPTY or YYEOF
346 or a valid token in external form. */
348 if (yychar == YYEMPTY)
352 fprintf(stderr, "Reading a token: ");
357 /* Convert token to internal form (in yychar1) for indexing tables with */
359 if (yychar <= 0) /* This means end of input. */
362 yychar = YYEOF; /* Don't call YYLEX any more */
366 fprintf(stderr, "Now at end of input.\n");
371 yychar1 = YYTRANSLATE(yychar);
376 fprintf (stderr, "Next token is %d (%s", yychar, yytname[yychar1]);
377 /* Give the individual parser a way to print the precise meaning
378 of a token, for further debugging info. */
380 YYPRINT (stderr, yychar, yylval);
382 fprintf (stderr, ")\n");
388 if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1)
393 /* yyn is what to do for this token type in this state.
394 Negative => reduce, -yyn is rule number.
395 Positive => shift, yyn is new state.
396 New state is final state => don't bother to shift,
398 0, or most negative number => error. */
413 /* Shift the lookahead token. */
417 fprintf(stderr, "Shifting token %d (%s), ", yychar, yytname[yychar1]);
420 /* Discard the token being shifted unless it is eof. */
429 /* count tokens shifted since error; after three, turn off error status. */
430 if (yyerrstatus) yyerrstatus--;
435 /* Do the default action for the current state. */
438 yyn = yydefact[yystate];
442 /* Do a reduction. yyn is the number of a rule to reduce with. */
445 yyval = yyvsp[1-yylen]; /* implement default value of the action */
452 fprintf (stderr, "Reducing via rule %d (line %d), ",
455 /* Print the symbols being reduced, and their result. */
456 for (i = yyprhs[yyn]; yyrhs[i] > 0; i++)
457 fprintf (stderr, "%s ", yytname[yyrhs[i]]);
458 fprintf (stderr, " -> %s\n", yytname[yyr1[yyn]]);
462 $ /* the action file gets copied in in place of this dollarsign */
463 #line 464 "bison.simple"
474 short *ssp1 = yyss - 1;
475 fprintf (stderr, "state stack now");
476 while (ssp1 != yyssp)
477 fprintf (stderr, " %d", *++ssp1);
478 fprintf (stderr, "\n");
488 yylsp->first_line = yylloc.first_line;
489 yylsp->first_column = yylloc.first_column;
490 yylsp->last_line = (yylsp-1)->last_line;
491 yylsp->last_column = (yylsp-1)->last_column;
496 yylsp->last_line = (yylsp+yylen-1)->last_line;
497 yylsp->last_column = (yylsp+yylen-1)->last_column;
501 /* Now "shift" the result of the reduction.
502 Determine what state that goes to,
503 based on the state we popped back to
504 and the rule number reduced by. */
508 yystate = yypgoto[yyn - YYNTBASE] + *yyssp;
509 if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp)
510 yystate = yytable[yystate];
512 yystate = yydefgoto[yyn - YYNTBASE];
516 yyerrlab: /* here on detecting error */
519 /* If not already recovering from an error, report this error. */
523 #ifdef YYERROR_VERBOSE
524 yyn = yypact[yystate];
526 if (yyn > YYFLAG && yyn < YYLAST)
533 /* Start X at -yyn if nec to avoid negative indexes in yycheck. */
534 for (x = (yyn < 0 ? -yyn : 0);
535 x < (sizeof(yytname) / sizeof(char *)); x++)
536 if (yycheck[x + yyn] == x)
537 size += strlen(yytname[x]) + 15, count++;
538 msg = (char *) malloc(size + 15);
541 strcpy(msg, "parse error");
546 for (x = (yyn < 0 ? -yyn : 0);
547 x < (sizeof(yytname) / sizeof(char *)); x++)
548 if (yycheck[x + yyn] == x)
550 strcat(msg, count == 0 ? ", expecting `" : " or `");
551 strcat(msg, yytname[x]);
560 yyerror ("parse error; also virtual memory exceeded");
563 #endif /* YYERROR_VERBOSE */
564 yyerror("parse error");
568 yyerrlab1: /* here on error raised explicitly by an action */
570 if (yyerrstatus == 3)
572 /* if just tried and failed to reuse lookahead token after an error, discard it. */
574 /* return failure if at end of input */
580 fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]);
586 /* Else will try to reuse lookahead token
587 after shifting the error token. */
589 yyerrstatus = 3; /* Each real token shifted decrements this */
593 yyerrdefault: /* current state does not do anything special for the error token. */
596 /* This is wrong; only states that explicitly want error tokens
597 should shift them. */
598 yyn = yydefact[yystate]; /* If its default is to accept any token, ok. Otherwise pop it.*/
599 if (yyn) goto yydefault;
602 yyerrpop: /* pop the current state because it cannot handle the error token */
604 if (yyssp == yyss) YYABORT;
614 short *ssp1 = yyss - 1;
615 fprintf (stderr, "Error: state stack now");
616 while (ssp1 != yyssp)
617 fprintf (stderr, " %d", *++ssp1);
618 fprintf (stderr, "\n");
624 yyn = yypact[yystate];
629 if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR)
648 fprintf(stderr, "Shifting error token, ");