⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 adsmcoutput.tab.c

📁 这个工具集提供以下结构化分析和UML分析中所用的图形化绘图工具:ER-diagrams, data and event flow diagrams and state-transition diagr
💻 C
📖 第 1 页 / 共 2 页
字号:
/*  A Bison parser, made from adsmcoutput.y    by GNU Bison version 1.28  */#define YYBISON 1  /* Identify Bison output.  */#define yyparse adsmcoutputparse#define yylex adsmcoutputlex#define yyerror adsmcoutputerror#define yylval adsmcoutputlval#define yychar adsmcoutputchar#define yydebug adsmcoutputdebug#define yynerrs adsmcoutputnerrs#define	IQ	257#define	QUOTE	258#define	COMMENT	259#define	COUNTER	260#define	HASH	261#define	ISZERO	262#define	ISONE	263#define	STATE	264#define	NL	265#define	ARROW	266#define	STRING	267#define	ENABLED	268#define	IN	269#line 1 "adsmcoutput.y"#include "adsmcoutputparse.h"  /*typedef char *CHAR_PTR;#define YYSTYPE CHAR_PTR#define YYDEBUG 1  */int mctraceindex; int mctrace[100]; int mcfeedback; int enabledindex; int enabledhyperedge[2000]; int enabledstatenumber[2000]; char *sourcename[2000];  /* name of source */ char *targetname[2000];    /* name of target */ int sourcestatenumber[2000]; int targetstatenumber[2000]; /* what statecounter does sourcestatenumber[i] belong to?*/ int statecounter; int sourceindex, targetindex;#line 29 "adsmcoutput.y"typedef union  {  char *str_ptr;} YYSTYPE;#include <stdio.h>#ifndef __cplusplus#ifndef __STDC__#define const#endif#endif#define	YYFINAL		89#define	YYFLAG		-32768#define	YYNTBASE	16#define YYTRANSLATE(x) ((unsigned)(x) <= 269 ? yytranslate[x] : 38)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,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     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};#if YYDEBUG != 0static const short yyprhs[] = {     0,     0,     2,     6,     9,    12,    15,    18,    19,    22,    25,    28,    29,    33,    34,    39,    42,    43,    47,    50,    52,    58,    65,    67,    71,    72,    78,    80,    83,    84,    88,    91,    94,    98,   102,   105,   107,   111,   113,   116,   118,   121,   122,   129,   135,   138};static const short yyrhs[] = {    17,     0,    21,    22,    34,     0,    13,    18,     0,     9,    18,     0,     8,    18,     0,    12,    18,     0,     0,    13,    19,     0,     9,    19,     0,     8,    19,     0,     0,    19,    11,    20,     0,     0,    20,     5,    18,    11,     0,    23,    24,     0,     0,     5,    19,    11,     0,    26,    25,     0,    26,     0,     5,    33,     5,    11,    26,     0,    25,     5,    33,     5,    11,    26,     0,    27,     0,    28,    30,    27,     0,     0,    12,    29,    13,    13,    11,     0,    10,     0,    31,    30,     0,     0,    13,    14,    11,     0,    13,     8,     0,    13,     9,     0,    13,    13,     8,     0,    13,    13,     9,     0,    14,    11,     0,    11,     0,     6,    13,    11,     0,     7,     0,    32,     7,     0,    19,     0,    35,    36,     0,     0,    32,    11,    19,    37,    11,    19,     0,    32,    19,    37,    11,    19,     0,     5,    37,     0,     5,     0};#endif#if YYDEBUG != 0static const short yyrline[] = { 0,    39,    42,    47,    48,    49,    50,    51,    54,    55,    56,    57,    60,    60,    64,    67,    68,    71,    74,    74,    78,    79,    85,    90,    92,    97,   100,   104,   105,   108,   122,   135,   148,   149,   151,   152,   153,   162,   162,   164,   168,   168,   171,   174,   181,   182};#endif#if YYDEBUG != 0 || defined (YYERROR_VERBOSE)static const char * const yytname[] = {   "$","error","$undefined.","IQ","QUOTE","COMMENT","COUNTER","HASH","ISZERO","ISONE","STATE","NL","ARROW","STRING","ENABLED","IN","input","line","arrowstringseq","stringseq","stringlines","start","middle","middle1","middle2","middle4","feedback","enabledfeedback","stateseq","state","enabledfeedback2","enabledfeedbackatom","hashseq","loop","end","end1","end2","commentseq", NULL};#endifstatic const short yyr1[] = {     0,    16,    17,    18,    18,    18,    18,    18,    19,    19,    19,    19,    20,    20,    21,    22,    22,    23,    24,    24,    25,    25,    26,    27,    27,    28,    29,    30,    30,    31,    31,    31,    31,    31,    31,    31,    31,    32,    32,    33,    34,    34,    35,    36,    37,    37};static const short yyr2[] = {     0,     1,     3,     2,     2,     2,     2,     0,     2,     2,     2,     0,     3,     0,     4,     2,     0,     3,     2,     1,     5,     6,     1,     3,     0,     5,     1,     2,     0,     3,     2,     2,     3,     3,     2,     1,     3,     1,     2,     1,     2,     0,     6,     5,     2,     1};static const short yydefact[] = {    11,    11,    11,    11,     1,     0,     0,    16,    10,     9,     8,    11,     7,    11,    41,    24,    12,     7,     7,     7,     7,     0,     0,    37,     0,     2,     0,     0,    15,    19,    22,    28,     5,     4,     6,     3,    14,    17,    38,    11,    11,    40,    26,     0,    11,    18,     0,    35,     0,     0,    24,    28,     0,     0,     0,    39,     0,    11,     0,    30,    31,     0,     0,    34,    23,    27,    45,     0,     0,     0,     0,     0,    36,    32,    33,    29,    44,    11,    11,    25,    24,     0,    42,    43,    20,    24,    21,     0,     0,     0};static const short yydefgoto[] = {    87,     4,    21,     5,     6,     7,    14,    15,    28,    45,    29,    30,    31,    43,    50,    51,    24,    56,    25,    26,    41,    67};static const short yypact[] = {     0,    -2,    -2,    -2,-32768,    -7,     9,    19,-32768,-32768,-32768,     0,    21,    -2,    28,    30,-32768,    21,    21,    21,    21,    26,    37,-32768,    25,-32768,    28,    39,-32768,    45,-32768,     4,-32768,-32768,-32768,-32768,-32768,-32768,-32768,    -2,    12,-32768,-32768,    38,    -2,    47,    40,-32768,    14,    43,    30,     4,    50,    50,    44,-32768,    53,    -2,    48,-32768,-32768,    32,    49,-32768,-32768,-32768,    50,    51,    52,    54,    55,    56,-32768,-32768,-32768,-32768,-32768,    -2,    -2,-32768,    30,    57,-32768,-32768,-32768,    30,-32768,    64,    67,-32768};static const short yypgoto[] = {-32768,-32768,    27,    -1,    58,-32768,-32768,-32768,-32768,-32768,   -54,    20,-32768,-32768,    22,-32768,    46,    17,-32768,-32768,-32768,   -50};#define	YYLAST		77static const short yytable[] = {     8,     9,    10,    68,    11,   -13,     1,     2,     1,     2,    46,     3,    22,     3,    12,    47,    76,    48,    49,    38,     1,     2,    59,    60,    13,     3,    84,    61,    62,    17,    18,    86,    38,    19,    20,    23,    39,    36,    52,    53,    73,    74,    27,    55,    32,    33,    34,    35,    37,    42,    44,    54,    57,    58,    63,    66,    55,    69,    70,    72,    75,    81,    77,    78,    88,    79,    80,    89,    85,    16,    64,     0,    40,    65,    71,     0,    82,    83};static const short yycheck[] = {     1,     2,     3,    53,    11,     5,     8,     9,     8,     9,     6,    13,    13,    13,     5,    11,    66,    13,    14,     7,     8,     9,     8,     9,     5,    13,    80,    13,    14,     8,     9,    85,     7,    12,    13,     7,    11,    11,    39,    40,     8,     9,    12,    44,    17,    18,    19,    20,    11,    10,     5,    13,     5,    13,    11,     5,    57,    13,     5,    11,    11,     5,    11,    11,     0,    11,    11,     0,    11,    11,    50,    -1,    26,    51,    57,    -1,    77,    78};/* -*-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 <alloca.h>#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 <malloc.h>#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 <malloc.h>  */ #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 YYPUREint	yychar;			/*  the lookahead symbol		*/YYSTYPE	yylval;			/*  the semantic value of the		*/				/*  lookahead symbol			*/#ifdef YYLSP_NEEDEDYYLTYPE yylloc;			/*  location data for the lookahead	*/				/*  symbol				*/#endifint yynerrs;			/*  number of parse errors so far       */#endif  /* not YYPURE */#if YYDEBUG != 0int 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_PARAMint yyparse (void *);#elseint yyparse (void);#endif#endifintyyparse(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)

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -