/* A Bison parser, made from adsedgelabel.y by GNU Bison version 1.28 */ #define YYBISON 1 /* Identify Bison output. */ #define yyparse adsedgelabelparse #define yylex adsedgelabellex #define yyerror adsedgelabelerror #define yylval adsedgelabellval #define yychar adsedgelabelchar #define yydebug adsedgelabeldebug #define yynerrs adsedgelabelnerrs #define QUOTE 257 #define OPEN 258 #define CLOSE 259 #define OPENB 260 #define CLOSEB 261 #define NL 262 #define DAYS 263 #define HOURS 264 #define MINUTES 265 #define SECONDS 266 #define TIME 267 #define COLON 268 #define WHENTOKEN 269 #define AFTERTOKEN 270 #define ELSE 271 #define TRUE 272 #define LEQ 273 #define GEQ 274 #define EQ 275 #define NEQ 276 #define GT 277 #define LT 278 #define IDENTIFIER 279 #define INTEGER 280 #define MINUS 281 #define PLUS 282 #define OR 283 #define TIMES 284 #define DIV 285 #define AND 286 #define NEG 287 #define NOT 288 #define IN 289 #line 1 "adsedgelabel.y" #include "adsedgelabelparse.h" #include "adspropertytype.h" #include "adsclocktypes.h" #include #include #include #include /* typedef char *CHAR_PTR; #define YYSTYPE CHAR_PTR #define YYDEBUG 1 */ /* variables for normal guards */ int iprop; /* index on propname and proptype */ int isintorstrexp; /* bool to check wether integer of string expression is meant */ int ivar; /* index on varname and vartype */ int indexin; /* index on in nodes */ int notindexin; /* index on in nodes */ int isvar; /* true iff variable occurs in edge label */ int iselse; /* true iff else clause exists */ char temp[100]; char *propname[200]; /* name of prop */ char *varname[100]; /* name of var */ char *inname[100]; /* name of in nodes */ char *notinname[100]; /* name of in nodes */ enum PropType proptype[200]; enum PropType vartype[200]; /* variables for clock constraints */ int timetype; /* h/s/m */ int isclock; int iclock; /* index on clockconstraint, clockconstrainttype and clocktype */ int clockconstraint[200]; /* amount */ enum PropType clockconstrainttype[200];/*, after, when (mod) */ enum ClockType clocktype[200]; /* h/s/m */ /* variables for send actions */ int hasaction; /* true iff action clause exists */ char *sendeventname; int broadcast; /* is the action event also directed to the environment? 1= system+environment, 0= only system */ #line 61 "adsedgelabel.y" typedef union { char *str_ptr; } YYSTYPE; #include #ifndef __cplusplus #ifndef __STDC__ #define const #endif #endif #define YYFINAL 80 #define YYFLAG -32768 #define YYNTBASE 37 #define YYTRANSLATE(x) ((unsigned)(x) <= 289 ? yytranslate[x] : 54) 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 29, 30, 31, 32, 33, 34, 35 }; #if YYDEBUG != 0 static const short yyprhs[] = { 0, 0, 2, 6, 7, 9, 11, 17, 18, 20, 22, 24, 26, 27, 31, 32, 40, 41, 54, 55, 69, 70, 79, 80, 82, 84, 88, 92, 95, 99, 101, 102, 106, 107, 110, 113, 115, 117, 119, 121, 123, 125, 127, 129, 130 }; static const short yyrhs[] = { 38, 0, 39, 42, 53, 0, 0, 40, 0, 25, 0, 16, 4, 26, 41, 5, 0, 0, 10, 0, 11, 0, 12, 0, 9, 0, 0, 6, 47, 7, 0, 0, 6, 35, 4, 25, 43, 5, 7, 0, 0, 6, 34, 4, 4, 35, 4, 25, 44, 5, 5, 5, 7, 0, 0, 6, 34, 4, 4, 34, 35, 4, 25, 45, 5, 5, 5, 7, 0, 0, 6, 34, 35, 4, 25, 46, 5, 7, 0, 0, 17, 0, 48, 0, 47, 29, 47, 0, 47, 32, 47, 0, 34, 47, 0, 4, 47, 5, 0, 18, 0, 0, 25, 49, 50, 0, 0, 51, 26, 0, 52, 3, 0, 21, 0, 22, 0, 23, 0, 24, 0, 20, 0, 19, 0, 21, 0, 22, 0, 0, 31, 25, 0 }; #endif #if YYDEBUG != 0 static const short yyrline[] = { 0, 79, 82, 88, 89, 90, 100, 111, 112, 113, 114, 115, 120, 121, 122, 126, 127, 131, 132, 136, 137, 141, 145, 145, 146, 147, 148, 149, 150, 156, 157, 163, 182, 183, 189, 197, 198, 199, 200, 201, 202, 207, 208, 212, 216 }; #endif #if YYDEBUG != 0 || defined (YYERROR_VERBOSE) static const char * const yytname[] = { "$","error","$undefined.","QUOTE", "OPEN","CLOSE","OPENB","CLOSEB","NL","DAYS","HOURS","MINUTES","SECONDS","TIME", "COLON","WHENTOKEN","AFTERTOKEN","ELSE","TRUE","LEQ","GEQ","EQ","NEQ","GT","LT", "IDENTIFIER","INTEGER","MINUS","PLUS","OR","TIMES","DIV","AND","NEG","NOT","IN", "'^'","input","line","event","time","type","guard","@1","@2","@3","@4","pexp", "atomic","@5","isexp","irel","srel","action", NULL }; #endif static const short yyr1[] = { 0, 37, 38, 39, 39, 39, 40, 41, 41, 41, 41, 41, 42, 42, 43, 42, 44, 42, 45, 42, 46, 42, 47, 47, 47, 47, 47, 47, 47, 48, 49, 48, 50, 50, 50, 51, 51, 51, 51, 51, 51, 52, 52, 53, 53 }; static const short yyr2[] = { 0, 1, 3, 0, 1, 1, 5, 0, 1, 1, 1, 1, 0, 3, 0, 7, 0, 12, 0, 13, 0, 8, 0, 1, 1, 3, 3, 2, 3, 1, 0, 3, 0, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 0, 2 }; static const short yydefact[] = { 3, 0, 5, 1, 12, 4, 0, 22, 43, 7, 22, 23, 29, 30, 22, 0, 0, 24, 0, 2, 11, 8, 9, 10, 0, 22, 0, 32, 22, 0, 27, 0, 13, 22, 22, 44, 6, 28, 40, 39, 35, 36, 37, 38, 31, 0, 0, 22, 0, 14, 25, 26, 33, 34, 22, 0, 20, 0, 0, 0, 0, 0, 0, 16, 0, 15, 18, 0, 21, 0, 0, 0, 0, 0, 0, 0, 17, 19, 0, 0, 0 }; static const short yydefgoto[] = { 78, 3, 4, 5, 24, 8, 57, 67, 69, 60, 26, 17, 27, 44, 45, 46, 19 }; static const short yypact[] = { -14, 0,-32768,-32768, 2,-32768, -21, -3, -25, 70, 24, -32768,-32768,-32768, -1, 5, 28,-32768, -15,-32768,-32768, -32768,-32768,-32768, 7, 24, 35, 51, 44, 9,-32768, -6,-32768, 24, 24,-32768,-32768,-32768,-32768,-32768, 17, 18,-32768,-32768,-32768, 3, 27, 19, 20,-32768, 11, -32768,-32768,-32768, 21, 46,-32768, 47, 55, 26, 58, 59, 40,-32768, 61,-32768,-32768, 71,-32768, 72, 78, 79, 80, 81, 82, 83,-32768,-32768, 87, 88,-32768 }; static const short yypgoto[] = {-32768, -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, -7, -32768,-32768,-32768,-32768,-32768,-32768 }; #define YYLAST 90 static const short yytable[] = { 16, 10, 1, 28, 6, 9, 18, 30, 7, 31, 35, 2, 36, 48, 11, 12, 11, 12, 30, 49, -41, -42, 13, 10, 13, 10, 50, 51, 10, 52, 53, 14, 15, 25, 29, 32, 11, 12, 11, 12, 37, 11, 12, 34, 13, 56, 13, 30, 47, 13, 59, 63, 61, 54, 55, 25, 58, 33, 25, 62, 34, 11, 12, 64, 33, 66, 65, 34, 68, 13, 38, 39, 40, 41, 42, 43, 70, 71, 25, 20, 21, 22, 23, 72, 73, 74, 75, 79, 80, 76, 77 }; static const short yycheck[] = { 7, 4, 16, 4, 4, 26, 31, 14, 6, 4, 25, 25, 5, 4, 17, 18, 17, 18, 25, 25, 3, 3, 25, 4, 25, 4, 33, 34, 4, 26, 3, 34, 35, 34, 35, 7, 17, 18, 17, 18, 5, 17, 18, 32, 25, 25, 25, 54, 4, 25, 4, 25, 5, 34, 35, 34, 35, 29, 34, 4, 32, 17, 18, 5, 29, 25, 7, 32, 7, 25, 19, 20, 21, 22, 23, 24, 5, 5, 34, 9, 10, 11, 12, 5, 5, 5, 5, 0, 0, 7, 7 }; /* -*-C-*- Note some compilers choke on comments on `#line' lines. */ #line 3 "/usr/lib/bison.simple" /* This file comes from bison-1.28. */ /* 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., 59 Temple Place - Suite 330, Boston, MA 02111-1307, 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. */ /* 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. */ #ifndef YYSTACK_USE_ALLOCA #ifdef alloca #define YYSTACK_USE_ALLOCA #else /* alloca not defined */ #ifdef __GNUC__ #define YYSTACK_USE_ALLOCA #define alloca __builtin_alloca #else /* not GNU C. */ #if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi) || (defined (__sun) && defined (__i386)) #define YYSTACK_USE_ALLOCA #include #else /* not sparc */ /* We think this test detects Watcom and Microsoft C. */ /* This used to test MSDOS, but that is a bad idea since that symbol is in the user namespace. */ #if (defined (_MSDOS) || defined (_MSDOS_)) && !defined (__TURBOC__) #if 0 /* No need for malloc.h, which pollutes the namespace; instead, just don't use alloca. */ #include #endif #else /* not MSDOS, or __TURBOC__ */ #if defined(_AIX) /* I don't know what this was needed for, but it pollutes the namespace. So I turned it off. rms, 2 May 1997. */ /* #include */ #pragma alloca #define YYSTACK_USE_ALLOCA #else /* not MSDOS, or __TURBOC__, or _AIX */ #if 0 #ifdef __hpux /* haible@ilog.fr says this works for HPUX 9.05 and up, and on HPUX 10. Eventually we can turn this on. */ #define YYSTACK_USE_ALLOCA #define alloca __builtin_alloca #endif /* __hpux */ #endif #endif /* not _AIX */ #endif /* not MSDOS, or __TURBOC__ */ #endif /* not sparc */ #endif /* not GNU C */ #endif /* alloca not defined */ #endif /* YYSTACK_USE_ALLOCA not defined */ #ifdef YYSTACK_USE_ALLOCA #define YYSTACK_ALLOC alloca #else #define YYSTACK_ALLOC malloc #endif /* 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 goto yyacceptlab #define YYABORT goto yyabortlab #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 /* Define __yy_memcpy. Note that the size argument should be passed with type unsigned int, because that is what the non-GCC definitions require. With GCC, __builtin_memcpy takes an arg of type size_t, but it can handle unsigned int. */ #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; unsigned 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, unsigned int count) { register char *t = to; register char *f = from; register int i = count; while (i-- > 0) *t++ = *f++; } #endif #endif #line 217 "/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 */ /* Prevent warning if -Wstrict-prototypes. */ #ifdef __GNUC__ #ifdef YYPARSE_PARAM int yyparse (void *); #else int yyparse (void); #endif #endif 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; int yyfree_stacks = 0; #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"); if (yyfree_stacks) { free (yyss); free (yyvs); #ifdef YYLSP_NEEDED free (yyls); #endif } return 2; } yystacksize *= 2; if (yystacksize > YYMAXDEPTH) yystacksize = YYMAXDEPTH; #ifndef YYSTACK_USE_ALLOCA yyfree_stacks = 1; #endif yyss = (short *) YYSTACK_ALLOC (yystacksize * sizeof (*yyssp)); __yy_memcpy ((char *)yyss, (char *)yyss1, size * (unsigned int) sizeof (*yyssp)); yyvs = (YYSTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yyvsp)); __yy_memcpy ((char *)yyvs, (char *)yyvs1, size * (unsigned int) sizeof (*yyvsp)); #ifdef YYLSP_NEEDED yyls = (YYLTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yylsp)); __yy_memcpy ((char *)yyls, (char *)yyls1, size * (unsigned int) 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 5: #line 90 "adsedgelabel.y" { proptype[iprop]= EV_FROM_ENV; /* later it will be changed for EV_INT if we detect that it is sent as the action of some transition */ propname[iprop]= (char *)malloc (strlen(yyvsp[0].str_ptr)+1); strcpy(propname[iprop],yyvsp[0].str_ptr); iprop++; ; break;} case 6: #line 100 "adsedgelabel.y" { int amount; isclock=1; clockconstrainttype[iclock]=AFTER; amount=strtol(yyvsp[-2].str_ptr,NULL,10); clockconstraint[iclock] = amount; clocktype[iclock]=timetype; iclock++; ; break;} case 7: #line 111 "adsedgelabel.y" {timetype=SECOND;; break;} case 8: #line 112 "adsedgelabel.y" {timetype=HOUR;; break;} case 9: #line 113 "adsedgelabel.y" {timetype=MINUTE;; break;} case 10: #line 114 "adsedgelabel.y" {timetype=SECOND;; break;} case 11: #line 115 "adsedgelabel.y" {timetype=DAY;; break;} case 14: #line 122 "adsedgelabel.y" { inname[indexin]= (char *)malloc (strlen(yyvsp[0].str_ptr)+1); strcpy(inname[indexin],yyvsp[0].str_ptr); indexin++; ; break;} case 16: #line 127 "adsedgelabel.y" { notinname[notindexin]= (char *)malloc (strlen(yyvsp[0].str_ptr)+1); strcpy(notinname[notindexin],yyvsp[0].str_ptr); notindexin++; ; break;} case 18: #line 132 "adsedgelabel.y" { inname[indexin]= (char *)malloc (strlen(yyvsp[0].str_ptr)+1); strcpy(inname[indexin],yyvsp[0].str_ptr); indexin++; ; break;} case 20: #line 137 "adsedgelabel.y" { notinname[notindexin]= (char *)malloc (strlen(yyvsp[0].str_ptr)+1); strcpy(notinname[notindexin],yyvsp[0].str_ptr); notindexin++; ; break;} case 23: #line 145 "adsedgelabel.y" {iselse=1;; break;} case 24: #line 146 "adsedgelabel.y" {; break;} case 29: #line 156 "adsedgelabel.y" {isvar=0;; break;} case 30: #line 157 "adsedgelabel.y" { varname[ivar]= (char *)malloc (strlen(yyvsp[0].str_ptr)+1); strcpy(varname[ivar],yyvsp[0].str_ptr);; strcpy(temp,yyvsp[0].str_ptr); isvar=1; ; break;} case 31: #line 163 "adsedgelabel.y" { char name[100]; if (!isintorstrexp) { strcpy(name,temp); proptype[iprop]= PROP; if (isvar) { vartype[ivar]=PROP; ivar++; }; } else { strcpy(name,yyvsp[-2].str_ptr); } propname[iprop]= (char *)malloc (strlen(name)+1); strcpy(propname[iprop],name); iprop++; ; break;} case 32: #line 182 "adsedgelabel.y" {isintorstrexp=0;; break;} case 33: #line 183 "adsedgelabel.y" { proptype[iprop]= INT; if (isvar) {vartype[ivar]=INT; ivar++; }; isintorstrexp =1;; break;} case 34: #line 189 "adsedgelabel.y" { proptype[iprop]= STRING; if (isvar) {vartype[ivar]= STRING; ivar++;}; isintorstrexp=1;; break;} case 43: #line 212 "adsedgelabel.y" {hasaction=0; broadcast= 0;; break;} case 44: #line 216 "adsedgelabel.y" { hasaction= 1; if (strncmp(yyvsp[0].str_ptr,"broadcast ",10)==0){ int lon= strlen(yyvsp[0].str_ptr)-10+1; /* -10 because of "broadcast ", +1 for the \0 */ int i; sendeventname= (char *) malloc (lon*sizeof(char)); for (i=0; i< lon-1; i++) sendeventname[i]= yyvsp[0].str_ptr[i+10]; sendeventname[i]= '\0'; broadcast= 1; } else{ broadcast= 0; sendeventname= (char *)malloc ((strlen(yyvsp[0].str_ptr)+1)*sizeof(char)); strcpy(sendeventname,yyvsp[0].str_ptr); } ; break;} } /* the action file gets copied in in place of this dollarsign */ #line 543 "/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; yyacceptlab: /* YYACCEPT comes here. */ if (yyfree_stacks) { free (yyss); free (yyvs); #ifdef YYLSP_NEEDED free (yyls); #endif } return 0; yyabortlab: /* YYABORT comes here. */ if (yyfree_stacks) { free (yyss); free (yyvs); #ifdef YYLSP_NEEDED free (yyls); #endif } return 1; } #line 233 "adsedgelabel.y"