/* A Bison parser, made from parser.y by GNU Bison version 1.25 */ #define YYBISON 1 /* Identify Bison output. */ #define NUM 258 #define FWNAME 259 #define REPEAT 260 #define DONE 261 #define LOOP 262 #define WAIT 263 #define ERR 264 #define END 265 #define NEG 266 #line 10 "parser.y" #include #include "pyro.h" #include #include /* parser specific stuff. */ struct vec { double x; double y; double z; }; typedef struct vec Vec; struct parser_fw_template { int type; Vec *start; Vec *dir; }; typedef struct parser_fw_template Fw; typedef struct stack Stack; struct stack { int type; int count; char *from; Stack *next; }; Stack *push(Stack *s, int type, int count, char* from); Stack *pop(Stack *s); int top_type(Stack *s); int top_count(Stack *s); char *top_from(Stack *s); int printfw(Fw *fw); int yyparse(); int yyerror(); int yylex(); static char *filestream=NULL; static char *cpos=NULL; static Stack *sstack=NULL; static double nextworktime; FILE *dispfile; static Fw *nextFwptr; int end=0; #line 62 "parser.y" typedef union { double val; Vec *vec; Fw *fw; } YYSTYPE; #include #ifndef __cplusplus #ifndef __STDC__ #define const #endif #endif #define YYFINAL 31 #define YYFLAG -32768 #define YYNTBASE 17 #define YYTRANSLATE(x) ((unsigned)(x) <= 266 ? yytranslate[x] : 25) static const char yytranslate[] = { 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 15, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 12, 13, 2, 2, 14, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 }; #if YYDEBUG != 0 static const short yyprhs[] = { 0, 0, 1, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 27, 31, 34, 37, 39, 47, 49 }; static const short yyrhs[] = { -1, 17, 18, 0, 15, 0, 19, 0, 7, 0, 20, 0, 21, 0, 22, 0, 9, 0, 1, 0, 10, 0, 4, 0, 4, 23, 0, 4, 23, 23, 0, 8, 24, 0, 5, 24, 0, 6, 0, 12, 24, 14, 24, 14, 24, 13, 0, 3, 0, 16, 3, 0 }; #endif #if YYDEBUG != 0 static const short yyrline[] = { 0, 93, 94, 97, 98, 99, 100, 101, 102, 105, 106, 107, 111, 112, 114, 119, 122, 125, 127, 131, 132 }; #endif #if YYDEBUG != 0 || defined (YYERROR_VERBOSE) static const char * const yytname[] = { "$","error","$undefined.","NUM","FWNAME", "REPEAT","DONE","LOOP","WAIT","ERR","END","NEG","'('","')'","','","'\\n'","'-'", "input","line","fw_template","delay","repeat","done","vec","val", NULL }; #endif static const short yyr1[] = { 0, 17, 17, 18, 18, 18, 18, 18, 18, 18, 18, 18, 19, 19, 19, 20, 21, 22, 23, 24, 24 }; static const short yyr2[] = { 0, 0, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 2, 2, 1, 7, 1, 2 }; static const short yydefact[] = { 1, 0, 10, 12, 0, 17, 5, 0, 9, 11, 3, 2, 4, 6, 7, 8, 0, 13, 19, 0, 16, 15, 0, 14, 20, 0, 0, 0, 0, 18, 0, 0 }; static const short yydefgoto[] = { 1, 11, 12, 13, 14, 15, 17, 20 }; static const short yypact[] = {-32768, 6,-32768, -11, 1,-32768,-32768, 1,-32768,-32768,-32768, -32768,-32768,-32768,-32768,-32768, 1, -11,-32768, -1,-32768, -32768, -9,-32768,-32768, 1, -6, 1, -10,-32768, 19, -32768 }; static const short yypgoto[] = {-32768, -32768,-32768,-32768,-32768,-32768, 5, -7 }; #define YYLAST 22 static const short yytable[] = { 21, 16, 24, 29, 18, 25, 30, 2, 27, 22, 3, 4, 5, 6, 7, 8, 9, 19, 26, 31, 28, 10, 23 }; static const short yycheck[] = { 7, 12, 3, 13, 3, 14, 0, 1, 14, 16, 4, 5, 6, 7, 8, 9, 10, 16, 25, 0, 27, 15, 17 }; /* -*-C-*- Note some compilers choke on comments on `#line' lines. */ #line 3 "/usr/lib/bison.simple" /* 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 #line 196 "/usr/lib/bison.simple" /* 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 4: #line 98 "parser.y" { nextFwptr=yyvsp[0].fw; YYACCEPT; ; break;} case 5: #line 99 "parser.y" { cpos=filestream; YYACCEPT; ; break;} case 6: #line 100 "parser.y" { nextworktime=yyvsp[0].val; YYACCEPT; ; break;} case 7: #line 101 "parser.y" { sstack=push(sstack,REPEAT,yyvsp[0].val,cpos); YYACCEPT;; break;} case 8: #line 102 "parser.y" { if(top_count(sstack)>1) { sstack->count--; cpos=sstack->from;} else { sstack=pop(sstack); } ; break;} case 9: #line 105 "parser.y" { yyerror("parse error"); YYERROR; ; break;} case 10: #line 106 "parser.y" { yyerrok; ; break;} case 11: #line 107 "parser.y" { cpos=filestream; end=1; YYACCEPT; ; break;} case 12: #line 111 "parser.y" { yyval.fw=yyvsp[0].fw; ; break;} case 13: #line 112 "parser.y" { yyval.fw=yyvsp[-1].fw; yyval.fw->start=yyvsp[0].vec; ; break;} case 14: #line 114 "parser.y" { yyval.fw=yyvsp[-2].fw; yyval.fw->start=yyvsp[-1].vec; yyval.fw->dir=yyvsp[0].vec; ; break;} case 15: #line 119 "parser.y" { yyval.val=yyvsp[0].val; ; break;} case 16: #line 122 "parser.y" { yyval.val=yyvsp[0].val; ; break;} case 18: #line 127 "parser.y" { yyval.vec=(Vec *)malloc(sizeof(Vec)); yyval.vec->x=yyvsp[-5].val; yyval.vec->y=yyvsp[-3].val; yyval.vec->z=yyvsp[-1].val; ; break;} case 19: #line 131 "parser.y" {yyval.val=yyvsp[0].val;; break;} case 20: #line 132 "parser.y" {yyval.val= -yyvsp[0].val;; break;} } /* the action file gets copied in in place of this dollarsign */ #line 498 "/usr/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 136 "parser.y" #include #include #include int yyerror (char *s) {printf ("%s\n", s); return 0;} int FindWork(char *name) { int work; for(work=0;workname)) return work; /* if(!STRCASECMP(name,"one")) return 1; if(!STRCASECMP(name,"two")) return 2; */ return -1; } int printfw(Fw *fw) { printf("\n"); printf("Firework: %d\n",fw->type); if(fw->start) printf(" start: (%f,%f,%f)\n",fw->start->x,fw->start->y,fw->start->z); if(fw->dir) printf(" dir: (%f,%f,%f)\n",fw->dir->x,fw->dir->y,fw->dir->z); printf("\n"); return 0; } #define FBUF 255 /* Functions main requires */ int ParseDisplayFile(char* filename) { int c; int len; int i; if((dispfile=fopen(filename,"r"))==NULL) { fprintf(stderr,"Failed to open display file: %s\n",filename); return -1; } len=FBUF; filestream=(char *)malloc(len+1); i=0; while((c=fgetc(dispfile))!=EOF) { if(i==len){ len+=FBUF; filestream=(char *)realloc(filestream, len+1); } if(c=='#') { while((c=fgetc(dispfile))!=EOF && c!='\n') ; c=fgetc(dispfile); } filestream[i++]=c; } filestream[i]='\0'; cpos=filestream; fclose(dispfile); return 0; } Firework *GetWork(void) { Firework *work=NULL; yyparse(); if(nextFwptr) { work=NewWork(Fireworks[nextFwptr->type]); if(nextFwptr->start) { work->x=nextFwptr->start->x; work->y=nextFwptr->start->y; work->z=nextFwptr->start->z; } if(nextFwptr->dir) { work->dx=nextFwptr->dir->x/40; work->dy=nextFwptr->dir->y/20; work->dz=nextFwptr->dir->z/40; } } nextFwptr=NULL; return work; } void UpdateDisplay(double elapsed) { nextworktime-=elapsed; } int CheckDisplay() { if(nextworktime<0.0) return 1; if(end) { end=0; return -1; } return 0; } void RestartDisplay(void) { cpos=filestream; } /* Stack stuff */ Stack *push(Stack *s, int type, int count, char* from) { Stack *n; n=(Stack *)malloc(sizeof(Stack)); n->type=type; n->count=count; n->from=from; n->next=s; return n; } Stack *pop(Stack *s) { Stack *n; if(s==NULL) fprintf(stderr,"Stack overflow.\n"); n=s->next; free(s); return n; } int top_type(Stack *s) { if(s==NULL) fprintf(stderr,"No Stack top.\n"); return s->type; } int top_count(Stack *s) { if(s==NULL) fprintf(stderr,"No Stack top.\n"); return s->count; } char *top_from(Stack *s) { if(s==NULL) fprintf(stderr,"No Stack top.\n"); return s->from; } /* yylex based on example in bison documentation */ int yylex() { int i; int c; int gotfw; /* skip whitespace */ while ((c = *cpos++) == ' ' || c == '\t'); if (c == '\0') { return END; } if (c == '.' || isdigit (c)){ cpos--; sscanf(cpos,"%lf%n", &yylval.val,&i); cpos+=i; return NUM; } if (isalpha (c)){ static char *symbuf = 0; static int length = 0; int i; if (length == 0) length = 40, symbuf = (char *)malloc (length + 1); i = 0; do{ if (i == length) { length *= 2; symbuf = (char *)realloc (symbuf, length + 1); } symbuf[i++] = c; c=*cpos++; } while (c != '\0' && isalnum (c)); cpos--; symbuf[i] = '\0'; if(!STRCASECMP(symbuf,"loop")) return LOOP; if(!STRCASECMP(symbuf,"end")) return END; if(!STRCASECMP(symbuf,"repeat")) return REPEAT; if(!STRCASECMP(symbuf,"done")) return DONE; if(!STRCASECMP(symbuf,"wait")) return WAIT; gotfw=FindWork(symbuf); if(gotfw!=-1){ yylval.fw= (Fw *) malloc (sizeof(Fw)); yylval.fw->type=gotfw; yylval.fw->start=NULL; yylval.fw->dir=NULL; return FWNAME; } /* unknown string */ return ERR; } /* character constant */ return c; }