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

📄 gram

📁 c语言编译器
💻
📖 第 1 页 / 共 2 页
字号:
/*  A Bison parser, made from lburg/gram.y with Bison version GNU Bison version 1.24  */#define YYBISON 1  /* Identify Bison output.  */#define	TERMINAL	258#define	START	259#define	PPERCENT	260#define	ID	261#define	TEMPLATE	262#define	CODE	263#define	INT	264#line 1 "lburg/gram.y"#include <stdio.h>#include "lburg.h"static char rcsid[] = "$Id: gram.y,v 2.5 1997/11/21 18:59:34 drh Exp $";/*lint -e616 -e527 -e652 -esym(552,yynerrs) -esym(563,yynewstate,yyerrlab) */static int yylineno = 0;#line 8 "lburg/gram.y"typedef union {	int n;	char *string;	Tree tree;} YYSTYPE;#ifndef YYLTYPEtypedef  struct yyltype    {      int timestamp;      int first_line;      int first_column;      int last_line;      int last_column;      char *text;   }  yyltype;#define YYLTYPE yyltype#endif#include <stdio.h>#ifndef __cplusplus#ifndef __STDC__#define const#endif#endif#define	YYFINAL		37#define	YYFLAG		-32768#define	YYNTBASE	16#define YYTRANSLATE(x) ((unsigned)(x) <= 264 ? yytranslate[x] : 24)static const char yytranslate[] = {     0,     2,     2,     2,     2,     2,     2,     2,     2,     2,    10,     2,     2,     2,     2,     2,     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,    15,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,    12,     2,     2,    11,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,     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};#if YYDEBUG != 0static const short yyprhs[] = {     0,     0,     4,     6,     7,    10,    14,    18,    20,    23,    24,    29,    30,    38,    41,    45,    47,    49,    54,    61};static const short yyrhs[] = {    17,     5,    20,     0,    17,     0,     0,    17,    18,     0,     3,    19,    10,     0,     4,    21,    10,     0,    10,     0,     1,    10,     0,     0,    19,     6,    11,     9,     0,     0,    20,    21,    12,    22,     7,    23,    10,     0,    20,    10,     0,    20,     1,    10,     0,     6,     0,     6,     0,     6,    13,    22,    14,     0,     6,    13,    22,    15,    22,    14,     0,     8,     0};#endif#if YYDEBUG != 0static const short yyrline[] = { 0,    22,    23,    26,    27,    30,    31,    35,    36,    39,    40,    43,    44,    45,    46,    49,    52,    53,    54,    57};static const char * const yytname[] = {   "$","error","$undefined.","TERMINAL","START","PPERCENT","ID","TEMPLATE","CODE","INT","'\\n'","'='","':'","'('","')'","','","spec","decls","decl","blist","rules","nonterm","tree","cost",""};#endifstatic const short yyr1[] = {     0,    16,    16,    17,    17,    18,    18,    18,    18,    19,    19,    20,    20,    20,    20,    21,    22,    22,    22,    23};static const short yyr2[] = {     0,     3,     1,     0,     2,     3,     3,     1,     2,     0,     4,     0,     7,     2,     3,     1,     1,     4,     6,     1};static const short yydefact[] = {     3,     0,     0,     9,     0,    11,     7,     4,     8,     0,    15,     0,     0,     0,     5,     6,     0,    13,     0,     0,    14,     0,    10,    16,     0,     0,     0,     0,    19,     0,    17,     0,    12,     0,    18,     0,     0,     0};static const short yydefgoto[] = {    35,     1,     7,     9,    12,    11,    24,    29};static const short yypact[] = {-32768,     0,     1,-32768,     8,-32768,-32768,-32768,-32768,     3,-32768,     5,     6,     9,-32768,-32768,     7,-32768,    10,    12,-32768,    17,-32768,    11,    18,    17,    19,     4,-32768,    16,-32768,    17,-32768,    14,-32768,    29,    30,-32768};static const short yypgoto[] = {-32768,-32768,-32768,-32768,-32768,    20,   -23,-32768};#define	YYLAST		32static const short yytable[] = {    -2,     2,    27,     3,     4,     5,    -1,    16,    33,    13,     6,     8,    10,    14,    10,    15,    17,    20,    30,    31,    19,    22,    21,    23,    25,    26,    32,    28,    34,    36,    37,     0,    18};static const short yycheck[] = {     0,     1,    25,     3,     4,     5,     0,     1,    31,     6,    10,    10,     6,    10,     6,    10,    10,    10,    14,    15,    11,     9,    12,     6,    13,     7,    10,     8,    14,     0,     0,    -1,    12};/* -*-C-*-  Note some compilers choke on comments on `#line' lines.  */#line 3 "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 __cplusplusextern "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 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/* Prevent warning if -Wstrict-prototypes.  */#ifdef __GNUC__int yyparse (void);#endif#if __GNUC__ > 1		/* GNU C and GNU C++ define this.  */#define __yy_memcpy(FROM,TO,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 (from, to, count)     char *from;     char *to;     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 *from, char *to, int count){  register char *f = from;  register char *t = to;  register int i = count;  while (i-- > 0)    *t++ = *f++;}#endif#endif#line 192 "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#define YYPARSE_PARAM_DECL void *YYPARSE_PARAM;#else#define YYPARSE_PARAM#define YYPARSE_PARAM_DECL#endifintyyparse(YYPARSE_PARAM)     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 *)yyss1, (char *)yyss, size * sizeof (*yyssp));      yyvs = (YYSTYPE *) alloca (yystacksize * sizeof (*yyvsp));      __yy_memcpy ((char *)yyvs1, (char *)yyvs, size * sizeof (*yyvsp));#ifdef YYLSP_NEEDED      yyls = (YYLTYPE *) alloca (yystacksize * sizeof (*yylsp));      __yy_memcpy ((char *)yyls1, (char *)yyls, 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:

⌨️ 快捷键说明

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