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

📄 casl_tab.c

📁 这是一个软件水平资格考试中使用的CASL汇编语言的编译器,实现文件中包括一个编译器,一个虚拟机,一个类似于Debug的调试器.
💻 C
📖 第 1 页 / 共 5 页
字号:
     0,    53,    55,    59,    61,    66,    68,    70,    78,    80,
    82,    84,    86,    88,   122,   124,     0,     0,     0
};

static const short yydefgoto[] = {   217,
    82,     5,     6,    46,     7,     8,     9,    88,    10,    11,
    12,    13,    94,   141,   142,   170,   199,    14,    54,    15,
    55,    16,    17,    56,    18,    57,    19,    20,    58,    21,
    59,    22,    60,    23,    24,    61,    25,    62,    26,    63,
    27,    64,    28,    65,    29,    66,    30,    31,    67,    32,
    68,    33,    69,    34,    70,    35,    71,    36,    37,    72,
    38,    73,    39,    40,    74,    41,    75,    42,    43,    76,
    44,    77,    45,    78
};

static const short yypact[] = {   102,
-32768,-32768,     2,   145,   -29,    59,-32768,-32768,-32768,-32768,
-32768,-32768,    -2,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
-32768,-32768,-32768,-32768,-32768,    40,-32768,    21,    42,-32768,
    60,     5,   191,    46,    47,    53,    78,    45,    51,    81,
    82,    83,    87,    80,    86,    88,    79,    84,   110,   114,
   115,   116,   120,   113,   119,    73,   111,   117,-32768,    42,
    42,-32768,   155,-32768,-32768,-32768,-32768,   157,-32768,-32768,
-32768,-32768,-32768,   140,   191,   191,   191,   191,   191,   191,
   191,   191,   191,   191,   191,   191,   191,    66,    66,    66,
    66,    66,    66,   191,    66,   182,   204,   206,   207,-32768,
-32768,-32768,-32768,    66,   172,   173,   174,   175,   176,   177,
   178,   179,   180,   181,   183,   184,   185,-32768,-32768,-32768,
   223,   186,   228,   229,   230,   231,   232,   233,   234,-32768,
-32768,   194,   195,   237,    66,    66,    66,    66,    66,    66,
    66,    66,    66,    66,    66,    66,    66,-32768,   198,-32768,
-32768,-32768,-32768,-32768,-32768,-32768,-32768,   235,   236,-32768,
   238,   239,   242,   243,   244,   245,   246,   247,   248,   249,
   250,   251,   252,-32768,-32768,-32768,-32768,-32768,-32768,   253,
   254,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
-32768,-32768,-32768,-32768,-32768,-32768,   258,   259,-32768
};

static const short yypgoto[] = {-32768,
   -43,    38,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
-32768,-32768,    94,  -109,-32768,-32768,-32768,-32768,-32768,-32768,
-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
-32768,-32768,-32768,-32768
};


#define	YYLAST		259


static const short yytable[] = {   143,
   144,   145,   146,   147,    47,   149,    51,    52,    84,    85,
    49,    86,    87,    53,   154,   -54,   -58,   -60,   -65,   -67,
   -69,   -77,   -79,   -81,   -83,   -85,   -87,   -94,   -96,   -98,
  -100,  -102,  -106,  -108,  -112,  -114,   120,   121,  -121,  -123,
  -119,    48,    79,    50,    81,   181,   182,   183,   184,   185,
   186,   187,   188,   189,   190,   191,   192,   193,    -7,     1,
    80,     2,    95,    83,    96,    99,     3,   -35,   -35,   138,
   139,    97,   100,   140,   -35,   -35,   -35,   -35,   -35,   -35,
   -35,   -35,   -35,   -35,   -35,   -35,   -35,   -35,   -35,   -35,
   -35,   -35,   -35,   -35,   -35,   -35,   -35,    98,    -7,   -35,
   -35,   -35,     1,   101,     2,   102,   105,   103,   108,     3,
   -35,   -35,   104,   106,   109,   117,   107,   -35,   -35,   -35,
   -35,   -35,   -35,   -35,   -35,   -35,   -35,   -35,   -35,   -35,
   -35,   -35,   -35,   -35,   -35,   -35,   -35,   -35,   -35,   -35,
     4,   110,   -35,   -35,   -35,     1,   111,     2,   112,   115,
   113,   118,     3,   -35,   -35,   114,   116,   122,   119,   123,
   -35,   -35,   -35,   -35,   -35,   -35,   -35,   -35,   -35,   -35,
   -35,   -35,   -35,   -35,   -35,   -35,   -35,   -35,   -35,   -35,
   -35,   -35,   -35,   124,   150,   -35,   -35,   -35,   125,   126,
   127,   128,   129,   130,   131,   132,   133,   134,   135,   136,
   137,    89,    90,    91,    92,    93,   151,   148,   194,   195,
   196,   197,   198,   152,   153,   155,   156,   157,   158,   159,
   160,   161,   162,   163,   164,   168,   165,   166,   167,   169,
   171,   172,   173,   174,   175,   176,   177,   178,   179,   180,
   202,   203,   200,   201,   204,   205,   206,   207,   208,   209,
   210,   211,   212,   213,   214,   215,   216,   218,   219
};

static const short yycheck[] = {   109,
   110,   111,   112,   113,     3,   115,     9,    10,     4,     5,
    40,     7,     8,    16,   124,    18,    19,    20,    21,    22,
    23,    24,    25,    26,    27,    28,    29,    30,    31,    32,
    33,    34,    35,    36,    37,    38,    80,    81,    41,    42,
    43,     4,     3,     6,     3,   155,   156,   157,   158,   159,
   160,   161,   162,   163,   164,   165,   166,   167,     0,     1,
    40,     3,    17,     4,    18,    21,     8,     9,    10,     4,
     5,    19,    22,     8,    16,    17,    18,    19,    20,    21,
    22,    23,    24,    25,    26,    27,    28,    29,    30,    31,
    32,    33,    34,    35,    36,    37,    38,    20,    40,    41,
    42,    43,     1,    23,     3,    24,    27,    25,    30,     8,
     9,    10,    26,    28,    31,    43,    29,    16,    17,    18,
    19,    20,    21,    22,    23,    24,    25,    26,    27,    28,
    29,    30,    31,    32,    33,    34,    35,    36,    37,    38,
    39,    32,    41,    42,    43,     1,    33,     3,    34,    37,
    35,    41,     8,     9,    10,    36,    38,     3,    42,     3,
    16,    17,    18,    19,    20,    21,    22,    23,    24,    25,
    26,    27,    28,    29,    30,    31,    32,    33,    34,    35,
    36,    37,    38,    44,     3,    41,    42,    43,    95,    96,
    97,    98,    99,   100,   101,   102,   103,   104,   105,   106,
   107,    11,    12,    13,    14,    15,     3,   114,    11,    12,
    13,    14,    15,     8,     8,    44,    44,    44,    44,    44,
    44,    44,    44,    44,    44,     3,    44,    44,    44,    44,
     3,     3,     3,     3,     3,     3,     3,    44,    44,     3,
     3,     3,     8,     8,     3,     3,     3,     3,     3,     3,
     3,     3,     3,     3,     3,     3,     3,     0,     0
};
/* -*-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 __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(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
#endif

int
yyparse(YYPARSE_PARAM)
     YYPARSE_PARAM_DECL
{
  register int yystate;

⌨️ 快捷键说明

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