/* A Bison parser, made from yacc.y by GNU Bison version 1.25 */ #define YYBISON 1 /* Identify Bison output. */ #define ID 258 #define CONSTANT_INT 259 #define CONSTANT_FLOAT 260 #define STRING_LITERAL 261 #define DEC_OP 262 #define INC_OP 263 #define VOID 264 #define INT 265 #define STRING 266 #define RETURN 267 #line 1 "yacc.y" /* ....[@@@..[@@@..............[@.................. MUD++ is a written from ....[@..[@..[@..[@..[@..[@@@@@....[@......[@.... scratch multi-user swords and ....[@..[@..[@..[@..[@..[@..[@..[@@@@@..[@@@@@.. sorcery game written in C++. ....[@......[@..[@..[@..[@..[@....[@......[@.... This server is an ongoing ....[@......[@..[@@@@@..[@@@@@.................. development project. All ................................................ contributions are welcome. ....Copyright(C).1995.Melvin.Smith.............. Enjoy. ------------------------------------------------------------------------------ Melvin Smith (aka Fusion) msmith@hom.net MUD++ development mailing list mudpp@van.ml.org ------------------------------------------------------------------------------ yacc.y Compiler grammar for MUDC Compiles to intermediate MUDAsm (see docs/vm) */ #include "sym.h" #include "parse.h" extern sym * sym_tab[]; extern char yytext[]; char id[ 256 ]; long line; #line 27 "yacc.y" typedef union { long lval; float fval; char * sval; sym * sym_ptr; node * node_ptr; } YYSTYPE; #include <stdio.h> #ifndef __cplusplus #ifndef __STDC__ #define const #endif #endif #define YYFINAL 72 #define YYFLAG -32768 #define YYNTBASE 23 #define YYTRANSLATE(x) ((unsigned)(x) <= 267 ? yytranslate[x] : 42) 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, 13, 14, 2, 2, 16, 2, 22, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 15, 2, 17, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 20, 2, 21, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 18, 2, 19, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 }; #if YYDEBUG != 0 static const short yyprhs[] = { 0, 0, 2, 5, 7, 11, 16, 18, 20, 22, 26, 28, 32, 34, 38, 39, 41, 44, 46, 50, 53, 56, 60, 64, 69, 71, 74, 77, 80, 82, 84, 87, 91, 95, 99, 103, 105, 107, 109, 111, 113, 118, 122, 125, 128, 130, 133, 136, 140 }; static const short yyrhs[] = { 37, 0, 23, 37, 0, 3, 0, 3, 13, 14, 0, 3, 13, 31, 14, 0, 9, 0, 10, 0, 11, 0, 25, 27, 15, 0, 28, 0, 27, 16, 28, 0, 24, 0, 24, 17, 29, 0, 0, 26, 0, 30, 26, 0, 32, 0, 31, 16, 32, 0, 25, 24, 0, 18, 19, 0, 18, 34, 19, 0, 18, 30, 19, 0, 18, 30, 34, 19, 0, 35, 0, 34, 35, 0, 40, 15, 0, 0, 15, 0, 36, 0, 15, 0, 12, 15, 0, 12, 3, 15, 0, 12, 41, 15, 0, 25, 24, 33, 0, 3, 13, 14, 0, 4, 0, 6, 0, 3, 0, 39, 0, 38, 0, 40, 20, 39, 21, 0, 40, 22, 40, 0, 40, 8, 0, 40, 7, 0, 40, 0, 8, 41, 0, 7, 41, 0, 41, 0, 0, 0, 17, 0 }; #endif #if YYDEBUG != 0 static const short yyrline[] = { 0, 64, 66, 69, 71, 72, 75, 77, 78, 81, 91, 93, 96, 98, 101, 104, 106, 113, 115, 118, 122, 124, 125, 126, 129, 131, 137, 139, 140, 141, 144, 146, 147, 150, 159, 168, 170, 171, 174, 176, 177, 178, 179, 180, 183, 185, 186, 189, 193 }; #endif #if YYDEBUG != 0 || defined (YYERROR_VERBOSE) static const char * const yytname[] = { "$","error","$undefined.","ID","CONSTANT_INT", "CONSTANT_FLOAT","STRING_LITERAL","DEC_OP","INC_OP","VOID","INT","STRING","RETURN", "'('","')'","';'","','","'='","'{'","'}'","'['","']'","'.'","unit","declarator", "type_specifier","declaration","init_declarator_list","init_declarator","initializer", "declaration_list","parameter_type_list","parameter_declaration","compound_statement", "statement_list","statement","jump_statement","function_def","function_call", "primary_expression","postfix_expression","unary_expression", NULL }; #endif static const short yyr1[] = { 0, 23, 23, 24, 24, 24, 25, 25, 25, 26, 27, 27, 28, 28, 29, 30, 30, 31, 31, 32, 33, 33, 33, 33, 34, 34, 35, -1, 35, 35, 36, 36, 36, 37, 38, 39, 39, 39, 40, 40, 40, 40, 40, 40, 41, 41, 41, -1, -1 }; static const short yyr2[] = { 0, 1, 2, 1, 3, 4, 1, 1, 1, 3, 1, 3, 1, 3, 0, 1, 2, 1, 3, 2, 2, 3, 3, 4, 1, 2, 2, 2, 1, 1, 2, 3, 3, 3, 3, 1, 1, 1, 1, 1, 4, 3, 2, 2, 1, 2, 2, 3, 1 }; static const short yydefact[] = { 0, 6, 7, 8, 0, 0, 1, 2, 3, 0, 0, 0, 33, 4, 0, 0, 17, 37, 35, 36, 0, 29, 20, 0, 15, 0, 0, 24, 28, 39, 38, 0, 19, 5, 0, 0, 37, 0, 0, 30, 44, 0, 12, 0, 10, 22, 16, 0, 21, 25, 43, 42, 26, 0, 0, 18, 34, 31, 46, 45, 32, 14, 9, 0, 23, 37, 0, 41, 13, 11, 40, 0, 0 }; static const short yydefgoto[] = { 4, 42, 5, 24, 43, 44, 68, 25, 15, 16, 12, 26, 27, 28, 6, 29, 30, 31, 41 }; static const short yypact[] = { 90, -32768,-32768,-32768, 74, 6,-32768,-32768, 1, -3, 84, 17,-32768,-32768, 6, 25,-32768, 9,-32768,-32768, 4, -32768,-32768, 6,-32768, 34, 44,-32768,-32768,-32768,-32768, 57,-32768,-32768, 90, 21, 63, 83, 83,-32768, 60, 40, 53, -10,-32768,-32768,-32768, 54,-32768,-32768,-32768, -32768,-32768, 27, 48,-32768,-32768,-32768,-32768,-32768,-32768, -32768,-32768, 6,-32768,-32768, 50, 60,-32768,-32768,-32768, 42,-32768 }; static const short yypgoto[] = {-32768, -1, -9, 56,-32768, 12,-32768,-32768,-32768, 58,-32768, 71, -23,-32768, 93,-32768, 35, -20, 24 }; #define YYLAST 101 static const short yytable[] = { 40, 14, 23, 49, 9, 62, 63, 36, 18, 8, 19, 37, 38, 32, 10, 11, 23, 40, 40, 39, 17, 18, 35, 19, 49, 14, 1, 2, 3, 20, 65, 18, 21, 19, 67, 56, 22, 17, 18, 33, 19, 34, 72, 1, 2, 3, 20, 17, 18, 21, 19, 17, 18, 45, 19, 60, 20, 17, 18, 21, 19, 58, 59, 48, 50, 51, 20, 50, 51, 21, 61, 70, 52, 64, 71, 69, 35, 53, 57, 54, 53, 46, 54, 1, 2, 3, 17, 18, 66, 19, 37, 38, 55, 1, 2, 3, 47, 7, 13, 1, 2, 3 }; static const short yycheck[] = { 20, 10, 11, 26, 5, 15, 16, 3, 4, 3, 6, 7, 8, 14, 13, 18, 25, 37, 38, 15, 3, 4, 13, 6, 47, 34, 9, 10, 11, 12, 3, 4, 15, 6, 54, 14, 19, 3, 4, 14, 6, 16, 0, 9, 10, 11, 12, 3, 4, 15, 6, 3, 4, 19, 6, 15, 12, 3, 4, 15, 6, 37, 38, 19, 7, 8, 12, 7, 8, 15, 17, 21, 15, 19, 0, 63, 13, 20, 15, 22, 20, 25, 22, 9, 10, 11, 3, 4, 53, 6, 7, 8, 34, 9, 10, 11, 25, 4, 14, 9, 10, 11 }; /* -*-C-*- Note some compilers choke on comments on `#line' lines. */ #line 3 "/usr/local/share/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 <alloca.h> #else /* not sparc */ #if defined (MSDOS) && !defined (__TURBOC__) #include <malloc.h> #else /* not MSDOS, or __TURBOC__ */ #if defined(_AIX) #include <malloc.h> #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/local/share/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 1: #line 65 "yacc.y" {; break;} case 2: #line 66 "yacc.y" {; break;} case 3: #line 70 "yacc.y" { yyval.sym_ptr = yyvsp[0].sym_ptr; ; break;} case 4: #line 71 "yacc.y" { yyval.sym_ptr = yyvsp[-2].sym_ptr; ; break;} case 5: #line 72 "yacc.y" { yyval.sym_ptr = yyvsp[-3].sym_ptr; yyval.sym_ptr->next = yyvsp[-1].sym_ptr; ; break;} case 6: #line 76 "yacc.y" { yyval.lval = TYPE_VOID; ; break;} case 7: #line 77 "yacc.y" { yyval.lval = TYPE_INT; ; break;} case 8: #line 78 "yacc.y" { yyval.lval = TYPE_STRING; ; break;} case 9: #line 83 "yacc.y" { /* $1 = lval (int), $2 = sym_ptr (symbol *) */ node * id = mkleaf_declaration( yyvsp[-2].lval, yyvsp[-1].sym_ptr ); yyval.node_ptr = id; printf( "declaration\n" ); ; break;} case 10: #line 92 "yacc.y" { yyval.sym_ptr = yyvsp[0].sym_ptr; ; break;} case 11: #line 93 "yacc.y" { yyvsp[-2].sym_ptr->next = yyvsp[0].sym_ptr; yyval.sym_ptr = yyvsp[-2].sym_ptr; ; break;} case 12: #line 97 "yacc.y" { yyval.sym_ptr = yyvsp[0].sym_ptr; ; break;} case 13: #line 98 "yacc.y" { yyval.sym_ptr = yyvsp[-2].sym_ptr; ; break;} case 16: #line 107 "yacc.y" { yyval.node_ptr = yyvsp[-1].node_ptr; yyval.node_ptr->right = yyvsp[0].node_ptr; ; break;} case 17: #line 114 "yacc.y" { yyval.sym_ptr = yyvsp[0].sym_ptr; ; break;} case 18: #line 115 "yacc.y" { yyval.sym_ptr->next = yyvsp[0].sym_ptr; ; break;} case 19: #line 119 "yacc.y" { mk_type( yyvsp[-1].lval, yyvsp[0].sym_ptr ); yyval.sym_ptr = yyvsp[0].sym_ptr; ; break;} case 20: #line 123 "yacc.y" { yyval.node_ptr = 0; ; break;} case 21: #line 124 "yacc.y" { yyval.node_ptr = yyvsp[-1].node_ptr; printf( "statement list\n" ); ; break;} case 22: #line 125 "yacc.y" { yyval.node_ptr = yyvsp[-1].node_ptr; printf( "dec list\n" ); ; break;} case 23: #line 126 "yacc.y" { yyval.node_ptr = add_leaf_right( yyvsp[-2].node_ptr, yyvsp[-1].node_ptr ); ; break;} case 24: #line 130 "yacc.y" { yyval.node_ptr = yyvsp[0].node_ptr; ; break;} case 25: #line 132 "yacc.y" { yyval.node_ptr = yyvsp[-1].node_ptr; yyval.node_ptr->right = yyvsp[0].node_ptr; ; break;} case 26: #line 138 "yacc.y" { yyval.node_ptr = yyvsp[-1].node_ptr; ; break;} case 28: #line 140 "yacc.y" { printf( "jump statement\n" ); ; break;} case 29: #line 141 "yacc.y" { yyval.node_ptr = (node *)0; ; break;} case 30: #line 145 "yacc.y" {; break;} case 31: #line 146 "yacc.y" {; break;} case 32: #line 147 "yacc.y" {; break;} case 33: #line 152 "yacc.y" { printf( "function def with args\n" ); yyval.node_ptr = mkleaf_function_def( yyvsp[-2].lval, yyvsp[-1].sym_ptr, yyvsp[0].node_ptr ); add_tree( yyval.node_ptr ); ; break;} case 34: #line 161 "yacc.y" { node * id = mknode( OP_CALL, yyvsp[-2].sym_ptr, 0, 0 ); yyval.node_ptr = id; printf( "function call\n" ); ; break;} case 35: #line 169 "yacc.y" { ; break;} case 36: #line 170 "yacc.y" { ; break;} case 37: #line 171 "yacc.y" { ; break;} case 38: #line 175 "yacc.y" { ; break;} case 39: #line 176 "yacc.y" { yyval.node_ptr = yyvsp[0].node_ptr; ; break;} case 45: #line 185 "yacc.y" {; break;} case 46: #line 186 "yacc.y" {; break;} } /* the action file gets copied in in place of this dollarsign */ #line 498 "/usr/local/share/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 197 "yacc.y" #include <stdio.h> extern FILE *yyin; int main( int argc, char * argv[] ) { if( argc > 1 ) { if( !( yyin = fopen( argv[1], "r" ) ) ) { printf( "Error reading source file %s.\n", argv[1] ); exit(0); } } else { printf( "No source file specified.\n" ); exit(0); } init_sym_tab(); yyparse(); fclose( yyin ); dump_sym_tab(); printf( "Generating MUDAsm.\n" ); emit_asm(); } int yyerror( char * s ) { printf( "(error) line %d: %s\n", line, s ); printf( "Didn't create output asm.\n" ); exit(0); }