coach_lang_par.cc

在LINUX下运行的仿真机器人服务器源代码

-32768,    94,-32768,   247,   283,   148,-32768,-32768,-32768,-32768,
   315,   316,-32768,-32768,    32,-32768,-32768,-32768,-32768,   317,
-32768,-32768,   318,   148,-32768,-32768,-32768,-32768,-32768,-32768,
   319,-32768,   296,   321,-32768
};

static const short yypgoto[] = {-32768,
    -6,-32768,-32768,   252,    12,-32768,-32768,-32768,-32768,   278,
-32768,-32768,   308,-32768,  -117,-32768,-32768,-32768,-32768,-32768,
   238,   320,  -235,   -75,-32768,    93,   -49,-32768,-32768,-32768,
-32768,-32768,   132,   236,   -88,-32768,  -109,    18,  -151,   -18,
-32768,    92,-32768,-32768
};


#define	YYLAST		342


static const short yytable[] = {    73,
   111,   134,   182,   161,    22,   208,   106,    39,   276,   283,
    39,   179,   297,   153,    39,    40,     1,    49,    39,   179,
   112,    71,   113,    72,   187,   110,    21,    54,    55,    56,
    57,    42,    23,   150,   157,    13,    14,    15,    16,    17,
    18,   307,    24,   161,   139,   204,   205,    27,   302,   211,
   212,    28,    82,   247,    83,    29,   252,   213,    11,    12,
    84,    13,    14,    15,    16,    17,    18,    50,   106,   209,
   107,   308,    81,    24,    46,   218,   219,   220,    41,   223,
   225,    41,   227,   228,   230,    41,    58,   192,   192,    41,
    33,    68,    69,    36,   246,   286,    19,    43,   112,    20,
   113,   255,   256,    44,   161,   161,   161,   161,    45,   214,
   215,   216,   217,    71,    64,    72,   190,   277,    29,    51,
   206,   254,    19,    86,    48,    20,   200,   201,    61,   235,
   207,   116,    66,   117,   304,    64,   285,    71,    64,    72,
    67,   106,   291,   107,   149,   292,    74,   221,   222,   224,
    68,    69,   311,   229,   236,    79,   237,   238,   234,    75,
   298,   280,    76,    87,    88,    89,    90,    91,    92,    93,
    94,    95,    77,   148,    78,   303,   164,   165,   166,   167,
   168,   169,   170,   245,    96,    97,    98,    99,   100,   183,
   184,   185,   186,   300,    85,    71,   171,    72,   191,    71,
   153,    72,   193,   150,   124,   125,   126,   127,   128,   129,
    29,    53,   172,   173,   174,   175,   176,   177,   154,   155,
   156,   157,   158,   159,   160,   121,   235,   141,   142,   143,
   144,   257,   258,   259,   260,   236,   122,   237,   238,   249,
   133,   250,   251,   112,   135,   113,   253,   106,   123,   107,
   299,   116,   131,   117,   301,    33,    59,    36,    62,   119,
   120,   145,   146,   132,   153,   290,   216,   217,    52,    52,
   140,   147,   148,   151,   152,   163,   178,   196,   187,   189,
   194,   195,   197,   198,   199,   202,   203,   226,    63,   153,
   241,   231,   294,   232,   233,   314,   242,   243,   244,   248,
   261,   262,    47,   263,   265,   266,   267,   268,   269,   270,
   271,   272,   273,   274,   275,   282,   287,   288,   289,   293,
   315,   296,   305,   306,   309,   310,   312,   279,   138,     0,
   281,     0,     0,     0,     0,     0,    32,     0,     0,     0,
     0,    60
};

static const short yycheck[] = {    49,
    76,    90,   120,   113,    11,   157,     5,     6,     7,   245,
     6,     7,     8,     7,     6,     7,     7,     3,     6,     7,
     5,     5,     7,     7,     9,    75,     7,    20,    21,    22,
    23,    20,     3,   109,    28,    14,    15,    16,    17,    18,
    19,    10,     7,   153,    94,   155,   156,     5,   284,   159,
   160,     8,     6,   205,     8,     7,   208,     8,    11,    12,
    67,    14,    15,    16,    17,    18,    19,    53,     5,   158,
     7,    40,    61,     7,     8,   164,   165,   166,    77,   168,
   169,    77,   171,   172,   173,    77,    79,   137,   138,    77,
     7,     3,     4,     7,   204,   247,    75,     8,     5,    78,
     7,   211,   212,    13,   214,   215,   216,   217,    24,    60,
    61,    62,    63,     5,     6,     7,   135,   235,     7,     8,
    32,   210,    75,     3,     8,    78,   145,   146,    76,   179,
    42,     5,     8,     7,   286,     6,   246,     5,     6,     7,
     3,     5,   252,     7,     8,   255,     8,   166,   167,   168,
     3,     4,   304,   172,     3,     6,     5,     6,   177,     5,
   278,    10,     5,    43,    44,    45,    46,    47,    48,    49,
    50,    51,     5,    41,     5,   285,    33,    34,    35,    36,
    37,    38,    39,   202,    64,    65,    66,    67,    68,    64,
    65,    66,    67,   282,     8,     5,    53,     7,     8,     5,
     7,     7,     8,   279,    54,    55,    56,    57,    58,    59,
     7,     8,    69,    70,    71,    72,    73,    74,    25,    26,
    27,    28,    29,    30,    31,     8,   276,    96,    97,    98,
    99,   214,   215,   216,   217,     3,     8,     5,     6,     3,
    42,     5,     6,     5,    42,     7,     8,     5,     8,     7,
     8,     5,     8,     7,     8,     7,     8,     7,     8,    80,
    81,     5,     6,     8,     7,     8,    62,    63,    31,    32,
    52,     8,    41,     8,     8,     8,     8,     3,     9,     8,
     8,     8,     3,     3,     3,    42,     8,     3,    37,     7,
     3,     8,    40,     8,     8,     0,     8,     8,     8,     8,
     8,     8,    25,     9,     8,     8,     8,     8,     8,     8,
     8,     8,     8,     8,     8,     3,     8,     8,     8,     8,
     0,     8,     8,     8,     8,     8,     8,   235,    93,    -1,
   239,    -1,    -1,    -1,    -1,    -1,    17,    -1,    -1,    -1,
    -1,    34
};
#define YYPURE 1

/* -*-C-*-  Note some compilers choke on comments on `#line' lines.  */
#line 3 "/usr/share/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 /* [e-mail] 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/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 */

/* 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