/*
 *  dsppp_b.tab.C from ObjectProDSP 0.1
 *  Copyright (C) 1994, Mountain Math Software. All rights reserved.
 *  
 *  This file is part of ObjectProDSP, a tool for Digital Signal
 *  Processing design, development and implementation. It is free
 *  software provided you use and distribute it under the terms of
 *  version 2 of the GNU General Public License as published
 *  by the Free Software Foundation. You may NOT distribute it or
 *  works derived from it or code that it generates under ANY
 *  OTHER terms.  In particular NONE of the ObjectProDSP system is
 *  licensed for use under the GNU General Public LIBRARY License.
 *  Mountain Math Software plans to offer a commercial version of
 *  ObjectProDSP for a fee. That version will allow redistribution
 *  of generated code under standard commercial terms.
 *  
 *  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 version 2 of the GNU General
 *  Public License along with this program. See file COPYING. If not
 *  or if you wish information on commercial versions and licensing
 *  write Mountain Math Software, P. O. Box 2124, Saratoga, CA 95070,
 *  USA, or send us e-mail at: support@mtnmath.com.
 *  
 *  You may also obtain the GNU General Public License by writing the
 *  Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139,
 *  USA.  However if you received a copy of this program without the
 *  file COPYING or without a copyright notice attached to all text
 *  files, libraries and executables please inform Mountain Math Software.
 *  
 *  ObjectProDSP is a trademark of Mountain Math Software.
 */

/*  A Bison parser, made from ../dsppp_b.y with Bison version GNU Bison version 1.22
  */

#define YYBISON 1  /* Identify Bison output.  */

#define	IF	258
#define	ELSE	259
#define	NET_EDIT_COMMAND	260
#define	NAME	261
#define	STRING	262
#define	INTEGER	263
#define	MENU	264
#define	STATIC	265
#define	FLOAT	266
#define	DECL	267
#define	DECL_NAME	268
#define	PLUS_EQUAL	269
#define	MINUS_EQUAL	270
#define	OR	271
#define	AND	272
#define	EQU	273
#define	NEQ	274
#define	LEQ	275
#define	GEQ	276
#define	SHIFT_R	277
#define	SHIFT_L	278
#define	ARROW	279

#line 36 "../dsppp_b.y"

#include <stream.h>
#include "portable.h"
#include "yacintfc.h"
#include "prsdrv.h"
#include "cgidbg.h"
#include "sco_alloca.h"
#define YYDEBUG 1

#line 45 "../dsppp_b.y"
typedef union {
	int32 Int ;
	double Float ;
	const char * Name ;
	struct ValueType * Value ;
	} YYSTYPE;

#ifndef YYLTYPE
typedef
  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		115
#define	YYFLAG		-32768
#define	YYNTBASE	48

#define YYTRANSLATE(x) ((unsigned)(x) <= 279 ? yytranslate[x] : 71)

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,    40,     2,     2,     2,    36,    23,     2,    41,
    42,    34,    32,    45,    33,    37,    35,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,    18,    39,    26,
    14,    27,    17,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
    43,     2,    44,    22,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,    46,    21,    47,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     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,    10,    11,    12,    13,    15,    16,
    19,    20,    24,    25,    28,    29,    30,    31,    38
};

#if YYDEBUG != 0
static const short yyprhs[] = {     0,
     0,     3,     5,     8,    11,    13,    15,    17,    19,    21,
    23,    26,    29,    32,    36,    40,    44,    48,    52,    56,
    60,    64,    68,    72,    75,    78,    81,    83,    85,    87,
    89,    91,    93,    95,    99,   101,   103,   108,   113,   117,
   121,   123,   125,   127,   131,   133,   134,   139,   142,   145,
   147,   149,   151,   153,   157,   161,   166,   174,   176,   177,
   181,   183,   188,   193,   195,   197
};

static const short yyrhs[] = {     5,
    49,     0,    49,     0,    60,    39,     0,    50,    39,     0,
    39,     0,    51,     0,    64,     0,    65,     0,     1,     0,
     9,     0,    51,     9,     0,    64,     9,     0,     1,     9,
     0,    52,    14,    51,     0,    52,    15,    51,     0,    52,
    16,    51,     0,    51,    36,    51,     0,    51,    35,    51,
     0,    51,    34,    51,     0,    51,    32,    51,     0,    51,
    33,    51,     0,    51,    30,    51,     0,    51,    31,    51,
     0,    32,    54,     0,    33,    54,     0,    40,    54,     0,
    54,     0,    64,     0,    53,     0,    70,     0,    13,     0,
    55,     0,    62,     0,    41,    51,    42,     0,    63,     0,
    56,     0,    55,    41,    58,    42,     0,    55,    43,    57,
    44,     0,    55,    37,    70,     0,    55,    38,    70,     0,
    13,     0,    70,     0,    51,     0,    58,    45,    51,     0,
    57,     0,     0,     3,    41,    51,    42,     0,    59,    50,
     0,    61,    50,     0,     4,     0,     8,     0,    11,     0,
     7,     0,    64,    45,    68,     0,    66,    12,    68,     0,
    66,    12,    23,    68,     0,    66,    12,    69,    43,    44,
    14,    67,     0,    10,     0,     0,    46,    58,    47,     0,
    69,     0,    69,    41,    58,    42,     0,    69,    43,    57,
    44,     0,    70,     0,    13,     0,     6,     0
};

#endif

#if YYDEBUG != 0
static const short yyrline[] = { 0,
    74,    76,    78,    79,    80,    82,    83,    84,    85,    86,
    87,    88,    89,    91,    92,    93,    94,    95,    96,    97,
    98,    99,   100,   101,   102,   103,   104,   106,   107,   108,
   110,   112,   113,   114,   115,   117,   118,   119,   121,   122,
   124,   125,   127,   129,   131,   133,   136,   138,   140,   142,
   144,   146,   148,   150,   151,   152,   154,   157,   158,   160,
   162,   163,   164,   166,   167,   169
};

static const char * const yytname[] = {   "$","error","$illegal.","IF","ELSE",
"NET_EDIT_COMMAND","NAME","STRING","INTEGER","MENU","STATIC","FLOAT","DECL",
"DECL_NAME","'='","PLUS_EQUAL","MINUS_EQUAL","'?'","':'","OR","AND","'|'","'^'",
"'&'","EQU","NEQ","'<'","'>'","LEQ","GEQ","SHIFT_R","SHIFT_L","'+'","'-'","'*'",
"'/'","'%'","'.'","ARROW","';'","'!'","'('","')'","'['","']'","','","'{'","'}'",
"ProgramStatement","CompletedStatement","Statement","Expression","Lvalue","DeclaredLvalue",
"Primary","Variable","DeclaredName","NonEmptyParameterList","ParameterList",
"IfExpression","Conditional","Else","Number","String","Declaration","Initializer",
"Ignore","Initiator","DeclObj","Name","LegalName",""
};
#endif

static const short yyr1[] = {     0,
    48,    48,    49,    49,    49,    50,    50,    50,    50,    50,
    50,    50,    50,    51,    51,    51,    51,    51,    51,    51,
    51,    51,    51,    51,    51,    51,    51,    52,    52,    52,
    53,    54,    54,    54,    54,    55,    55,    55,    55,    55,
    56,    56,    57,    57,    58,    58,    59,    60,    60,    61,
    62,    62,    63,    64,    64,    64,    65,    66,    66,    67,
    68,    68,    68,    69,    69,    70
};

static const short yyr2[] = {     0,
     2,     1,     2,     2,     1,     1,     1,     1,     1,     1,
     2,     2,     2,     3,     3,     3,     3,     3,     3,     3,
     3,     3,     3,     2,     2,     2,     1,     1,     1,     1,
     1,     1,     1,     3,     1,     1,     4,     4,     3,     3,
     1,     1,     1,     3,     1,     0,     4,     2,     2,     1,
     1,     1,     1,     3,     3,     4,     7,     1,     0,     3,
     1,     4,     4,     1,     1,     1
};

static const short yydefact[] = {     0,
     9,     0,    50,     0,    66,    53,    51,    10,    58,    52,
    41,     0,     0,     5,     0,    59,     2,     0,     6,     0,
    29,    27,    32,    36,     0,     0,     0,    33,    35,    28,
     8,     0,    42,    13,    59,     1,    41,    24,    42,    25,
    26,     0,    28,     0,     4,    11,    59,    59,    59,    59,
    59,    59,    59,    59,    59,    59,     0,     0,    46,    46,
    48,     3,    49,    12,     0,     0,     0,    34,     0,    22,
    23,    20,    21,    19,    18,    17,    14,    15,    16,    39,
    40,    43,    45,     0,    45,     0,    65,    54,    61,    64,
     0,    55,    61,    47,    37,    59,    38,    46,    46,    56,
    46,    44,     0,    45,     0,    62,    63,     0,    46,    57,
     0,    60,     0,     0,     0
};

static const short yydefgoto[] = {   113,
    17,    18,    82,    20,    21,    22,    23,    24,    83,    86,
    25,    26,    27,    28,    29,    43,    31,    44,   110,    92,
    89,    33
};

static const short yypact[] = {    69,
     4,   -33,-32768,   110,-32768,-32768,-32768,-32768,-32768,-32768,
   111,    23,    23,-32768,    23,   205,-32768,   -11,    53,   124,
-32768,-32768,    57,-32768,   123,    -6,   123,-32768,-32768,    -7,
-32768,    32,   130,-32768,   205,-32768,-32768,-32768,-32768,-32768,
-32768,   153,    21,    51,-32768,-32768,   205,   205,   205,   205,
   205,   205,   205,   205,   205,   205,    85,    85,   169,   169,
-32768,-32768,-32768,-32768,    -1,    -3,   189,-32768,    -3,    71,
    71,   118,   118,-32768,-32768,-32768,   217,   217,   217,-32768,
-32768,   217,-32768,   -36,    68,    70,-32768,-32768,   -22,-32768,
    -1,-32768,    -2,-32768,-32768,   205,-32768,   169,   169,-32768,
   159,   217,    16,    84,   127,-32768,-32768,    91,   169,-32768,
    52,-32768,   147,   148,-32768
};

static const short yypgoto[] = {-32768,
   154,   132,     0,-32768,-32768,    11,-32768,-32768,   -59,   -52,
-32768,-32768,-32768,-32768,-32768,    18,-32768,    65,-32768,   -54,
    94,     2
};


#define	YYLAST		253


static const short yytable[] = {    19,
    85,    64,     5,    19,     5,    95,    84,    35,    96,    87,
    88,    87,    34,    39,    39,    42,    39,    30,    98,    91,
    99,    30,    38,    40,    19,    41,    19,    45,     5,     6,
     7,    -7,    62,    10,    67,    37,   100,    65,    98,   104,
   101,   104,    30,    66,    30,   103,    70,    71,    72,    73,
    74,    75,    76,    77,    78,    79,   111,   106,    80,    81,
    96,    46,    69,    16,    32,    65,    90,    90,    32,     1,
    90,     2,     3,     4,     5,     6,     7,     8,     9,    10,
   -59,    11,    47,    48,    49,    50,    51,    52,    53,    32,
     5,    32,    90,    57,    58,   102,    96,    59,   112,    60,
    12,    13,    49,    50,    51,    52,    53,    14,    15,    16,
     1,    97,     2,     3,    96,     5,     6,     7,     8,     9,
    10,   -59,    11,     1,   -31,   -31,   -31,   107,     5,     6,
     7,     8,     9,    10,   -59,    11,   109,    54,    55,    56,
   108,    12,    13,   -30,   -30,   -30,   114,   115,    14,    15,
    16,    51,    52,    53,    12,    13,    61,    36,    63,    93,
     0,     0,    15,    16,     5,     6,     7,     0,     9,    10,
   -59,    11,     0,     0,     5,     6,     7,     0,     9,    10,
   -59,    11,    47,    48,    49,    50,    51,    52,    53,     0,
    12,    13,     0,     0,    68,     0,     0,     0,    15,    16,
    12,    13,   105,     0,     0,     0,     0,     0,    15,    16,
     5,     6,     7,     0,     9,    10,     0,    11,    47,    48,
    49,    50,    51,    52,    53,     0,     0,     0,     0,     0,
    94,     0,     0,     0,     0,     0,    12,    13,     0,     0,
     0,     0,     0,     0,    15,    16,    47,    48,    49,    50,
    51,    52,    53
};

static const short yycheck[] = {     0,
    60,     9,     6,     4,     6,    42,    59,    41,    45,    13,
    65,    13,     9,    12,    13,    16,    15,     0,    41,    23,
    43,     4,    12,    13,    25,    15,    27,    39,     6,     7,
     8,    39,    39,    11,    35,    13,    91,    45,    41,    99,
    43,   101,    25,    12,    27,    98,    47,    48,    49,    50,
    51,    52,    53,    54,    55,    56,   109,    42,    57,    58,
    45,     9,    12,    41,     0,    45,    65,    66,     4,     1,
    69,     3,     4,     5,     6,     7,     8,     9,    10,    11,
    12,    13,    30,    31,    32,    33,    34,    35,    36,    25,
     6,    27,    91,    37,    38,    96,    45,    41,    47,    43,
    32,    33,    32,    33,    34,    35,    36,    39,    40,    41,
     1,    44,     3,     4,    45,     6,     7,     8,     9,    10,
    11,    12,    13,     1,    14,    15,    16,    44,     6,     7,
     8,     9,    10,    11,    12,    13,    46,    14,    15,    16,
    14,    32,    33,    14,    15,    16,     0,     0,    39,    40,
    41,    34,    35,    36,    32,    33,    25,     4,    27,    66,
    -1,    -1,    40,    41,     6,     7,     8,    -1,    10,    11,
    12,    13,    -1,    -1,     6,     7,     8,    -1,    10,    11,
    12,    13,    30,    31,    32,    33,    34,    35,    36,    -1,
    32,    33,    -1,    -1,    42,    -1,    -1,    -1,    40,    41,
    32,    33,    44,    -1,    -1,    -1,    -1,    -1,    40,    41,
     6,     7,     8,    -1,    10,    11,    -1,    13,    30,    31,
    32,    33,    34,    35,    36,    -1,    -1,    -1,    -1,    -1,
    42,    -1,    -1,    -1,    -1,    -1,    32,    33,    -1,    -1,
    -1,    -1,    -1,    -1,    40,    41,    30,    31,    32,    33,
    34,    35,    36
};
/* -*-C-*-  Note some compilers choke on comments on `#line' lines.  */
#line 3 "/usr/lib/bison.simple"

/* Skeleton output parser for bison,
   Copyright (C) 1984, 1989, 1990 Bob Corbett and Richard Stallman

   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 1, 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.  */


#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
#define YYLEX		yylex(&yylval, &yylloc)
#else
#define YYLEX		yylex(&yylval)
#endif
#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_bcopy(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_bcopy (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_bcopy (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 184 "/usr/lib/bison.simple"
int
yyparse()
{
  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_bcopy ((char *)yyss1, (char *)yyss, size * sizeof (*yyssp));
      yyvs = (YYSTYPE *) alloca (yystacksize * sizeof (*yyvsp));
      __yy_bcopy ((char *)yyvs1, (char *)yyvs, size * sizeof (*yyvsp));
#ifdef YYLSP_NEEDED
      yyls = (YYLTYPE *) alloca (yystacksize * sizeof (*yylsp));
      __yy_bcopy ((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:

/* 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 3:
#line 78 "../dsppp_b.y"
{YYACCEPT;;
    break;}
case 4:
#line 79 "../dsppp_b.y"
{NotConditional(); YYACCEPT;;
    break;}
case 5:
#line 80 "../dsppp_b.y"
{NotConditional(); YYACCEPT;;
    break;}
case 6:
#line 82 "../dsppp_b.y"
{/* prevents type clash warning */;;
    break;}
case 7:
#line 83 "../dsppp_b.y"
{/* prevents type clash warning */;;
    break;}
case 8:
#line 84 "../dsppp_b.y"
{/* prevents type clash warning */;;
    break;}
case 10:
#line 86 "../dsppp_b.y"
{/* prevents type clash warning */;;
    break;}
case 11:
#line 87 "../dsppp_b.y"
{/* prevents type clash warning */;;
    break;}
case 12:
#line 88 "../dsppp_b.y"
{/* prevents type clash warning */;;
    break;}
case 13:
#line 89 "../dsppp_b.y"
{/* prevents type clash warning */;;
    break;}
case 14:
#line 91 "../dsppp_b.y"
{ yyval.Value=Equal(yyvsp[-2].Value,yyvsp[0].Value); ;
    break;}
case 15:
#line 92 "../dsppp_b.y"
{ yyval.Value=Equal(yyvsp[-2].Value,yyvsp[0].Value,'+'); ;
    break;}
case 16:
#line 93 "../dsppp_b.y"
{ yyval.Value=Equal(yyvsp[-2].Value,yyvsp[0].Value,'-'); ;
    break;}
case 17:
#line 94 "../dsppp_b.y"
{ yyval.Value=BinOp(yyvsp[-2].Value,'%',yyvsp[0].Value); ;
    break;}
case 18:
#line 95 "../dsppp_b.y"
{ yyval.Value=BinOp(yyvsp[-2].Value,'/',yyvsp[0].Value); ;
    break;}
case 19:
#line 96 "../dsppp_b.y"
{ yyval.Value=BinOp(yyvsp[-2].Value,'*',yyvsp[0].Value); ;
    break;}
case 20:
#line 97 "../dsppp_b.y"
{ yyval.Value=BinOp(yyvsp[-2].Value,'+',yyvsp[0].Value); ;
    break;}
case 21:
#line 98 "../dsppp_b.y"
{ yyval.Value=BinOp(yyvsp[-2].Value,'-',yyvsp[0].Value); ;
    break;}
case 22:
#line 99 "../dsppp_b.y"
{ yyval.Value=BinOp(yyvsp[-2].Value,SHIFT_R,yyvsp[0].Value); ;
    break;}
case 23:
#line 100 "../dsppp_b.y"
{ yyval.Value=BinOp(yyvsp[-2].Value,SHIFT_L,yyvsp[0].Value); ;
    break;}
case 24:
#line 101 "../dsppp_b.y"
{yyval.Value = yyvsp[0].Value ;;
    break;}
case 25:
#line 102 "../dsppp_b.y"
{yyval.Value = UnOp('-',yyvsp[0].Value);;
    break;}
case 26:
#line 103 "../dsppp_b.y"
{yyval.Value = UnOp('!',yyvsp[0].Value);;
    break;}
case 30:
#line 108 "../dsppp_b.y"
{yyval.Value=DoDeclareLval(yyvsp[0].Value);;
    break;}
case 34:
#line 114 "../dsppp_b.y"
{ yyval.Value = yyvsp[-1].Value ; ;
    break;}
case 37:
#line 118 "../dsppp_b.y"
{ yyval.Value = DoProcedure(yyvsp[-3].Value,yyvsp[-1].Value);;
    break;}
case 38:
#line 119 "../dsppp_b.y"
{ yyval.Value = SelectArrayElement(
							yyvsp[-3].Value,yyvsp[-1].Value);;
    break;}
case 39:
#line 121 "../dsppp_b.y"
{yyval.Value=MemberRef(yyvsp[-2].Value,yyvsp[0].Value);;
    break;}
case 41:
#line 124 "../dsppp_b.y"
{yyval.Value=InsureValueExists(yyvsp[0].Value);;
    break;}
case 42:
#line 125 "../dsppp_b.y"
{yyval.Value=DoDeclare(yyvsp[0].Value);;
    break;}
case 43:
#line 127 "../dsppp_b.y"
{yyval.Value = DoParameter(yyvsp[0].Value);;
    break;}
case 44:
#line 129 "../dsppp_b.y"
{yyval.Value = DoParameterList(yyvsp[-2].Value,yyvsp[0].Value);;
    break;}
case 46:
#line 133 "../dsppp_b.y"
{yyval.Value = new ValueType(DecParam,
						new ParameterList);;
    break;}
case 47:
#line 136 "../dsppp_b.y"
{IfPush(yyvsp[-1].Value);;
    break;}
case 48:
#line 138 "../dsppp_b.y"
{IfPartEnd();;
    break;}
case 49:
#line 140 "../dsppp_b.y"
{IfPop();;
    break;}
case 50:
#line 142 "../dsppp_b.y"
{Else();;
    break;}
case 51:
#line 144 "../dsppp_b.y"
{yyval.Value = MakeIntValue(yyvsp[0].Int);;
    break;}
case 52:
#line 146 "../dsppp_b.y"
{yyval.Value = MakeFloatValue(yyvsp[0].Float);;
    break;}
case 53:
#line 148 "../dsppp_b.y"
{yyval.Value = ReturnStringValue(yyvsp[0].Name);;
    break;}
case 54:
#line 150 "../dsppp_b.y"
{yyval.Value = CommaDeclare(yyvsp[-2].Value,yyvsp[0].Value);;
    break;}
case 55:
#line 151 "../dsppp_b.y"
{yyval.Value = Declare(yyvsp[-1].Value,yyvsp[0].Value);;
    break;}
case 56:
#line 152 "../dsppp_b.y"
{SemanticError(ErrorSimpleDeclare);;
    break;}
case 57:
#line 155 "../dsppp_b.y"
{yyval.Value = DeclarePtr(yyvsp[-5].Value,yyvsp[-4].Value,yyvsp[0].Value);;
    break;}
case 58:
#line 157 "../dsppp_b.y"
{/* prevents type clash warning */;;
    break;}
case 60:
#line 160 "../dsppp_b.y"
{yyval.Value=yyvsp[-1].Value;;
    break;}
case 62:
#line 163 "../dsppp_b.y"
{yyval.Value = NameOfList(yyvsp[-3].Value,yyvsp[-1].Value);;
    break;}
case 63:
#line 164 "../dsppp_b.y"
{yyval.Value = SetArraySize(yyvsp[-3].Value,yyvsp[-1].Value);;
    break;}
case 65:
#line 167 "../dsppp_b.y"
{yyval.Value = AlreadyDeclared(yyvsp[0].Value); ;
    break;}
case 66:
#line 169 "../dsppp_b.y"
{yyval.Value = CheckLegal(MakeStringValue(yyvsp[0].Name));;
    break;}
}
   /* the action file gets copied in in place of this dollarsign */
#line 465 "/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;
}
#line 170 "../dsppp_b.y"
