/*  A Bison parser, made from parser_core.yy
    by GNU Bison version 1.28  */

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

#define	EMIT	257
#define	MAIN	258
#define	METHOD	259
#define	WORD	260
#define	CONST	261
#define	IN	262
#define	OUT	263
#define	RETURN	264
#define	TRUE	265
#define	FALSE	266
#define	GOTO	267
#define	IF	268
#define	ELSE	269
#define	WHILE	270
#define	FOR	271
#define	BREAK	272
#define	CONTINUE	273
#define	ASM	274
#define	HALT	275
#define	ERR	276
#define	POP	277
#define	PUSH	278
#define	ALLOCA	279
#define	SHL	280
#define	EQUALS	281
#define	LOGAND	282
#define	LOGOR	283
#define	NAME	284
#define	STRING	285
#define	NUMBER	286

#line 31 "parser_core.yy"


#define YYDEBUG 1
#include "parse.h"

void yyerror(char *);
int yylex();
 

#line 41 "parser_core.yy"
typedef union {
	vector<string> *vs;
	
	EXV *exv;
	Expr *exp;
	EAdd *ea;

	Condition *c;
	
	SList *sl;
	Statement *st;
	
	string *s;
	int i;
} YYSTYPE;
#include <stdio.h>

#ifndef __cplusplus
#ifndef __STDC__
#define const
#endif
#endif



#define	YYFINAL		176
#define	YYFLAG		-32768
#define	YYNTBASE	52

#define YYTRANSLATE(x) ((unsigned)(x) <= 286 ? yytranslate[x] : 74)

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,    43,     2,     2,     2,     2,    50,     2,    37,
    38,    48,    33,    41,    34,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,    42,    36,    44,
    35,    45,     2,     2,     2,     2,     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,     2,    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,    39,    49,    40,    51,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     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,    16,
    17,    18,    19,    20,    21,    22,    23,    24,    25,    26,
    27,    28,    29,    30,    31,    32
};

#if YYDEBUG != 0
static const short yyprhs[] = {     0,
     0,     3,     7,    10,    13,    14,    17,    18,    25,    35,
    41,    42,    45,    50,    51,    56,    57,    60,    64,    68,
    71,    75,    79,    83,    86,    89,    93,    99,   107,   113,
   123,   126,   129,   133,   137,   139,   143,   145,   149,   151,
   154,   158,   160,   162,   164,   168,   172,   176,   181,   186,
   191,   192,   194,   198,   200,   204,   211,   213,   215,   217,
   219,   223,   227,   231,   233,   237,   241,   243,   247,   251,
   255,   257,   260,   262,   267,   269,   274,   279,   281
};

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

#endif

#if YYDEBUG != 0
static const short yyrline[] = { 0,
   125,   129,   133,   134,   137,   140,   145,   146,   152,   184,
   204,   207,   212,   218,   221,   230,   233,   237,   244,   248,
   251,   254,   257,   260,   263,   266,   269,   272,   275,   278,
   281,   284,   287,   291,   297,   298,   303,   304,   309,   310,
   315,   318,   321,   324,   327,   330,   333,   336,   339,   342,
   353,   357,   362,   368,   369,   373,   378,   379,   382,   383,
   384,   387,   388,   391,   392,   395,   400,   401,   404,   409,
   410,   414,   418,   425,   429,   432,   435,   438,   442
};
#endif


#if YYDEBUG != 0 || defined (YYERROR_VERBOSE)

static const char * const yytname[] = {   "$","error","$undefined.","EMIT","MAIN",
"METHOD","WORD","CONST","IN","OUT","RETURN","TRUE","FALSE","GOTO","IF","ELSE",
"WHILE","FOR","BREAK","CONTINUE","ASM","HALT","ERR","POP","PUSH","ALLOCA","SHL",
"EQUALS","LOGAND","LOGOR","NAME","STRING","NUMBER","'+'","'-'","'='","';'","'('",
"')'","'{'","'}'","','","':'","'!'","'<'","'>'","'['","']'","'*'","'|'","'&'",
"'~'","program","constants","@1","constant_list","method","main","param_list",
"var_list","statement_list","statement","condition","cond1","cond1a","cond2",
"expression_list","expr","expr01","expr0","eadd_list","expr1","expr11","expr2", NULL
};
#endif

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

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

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

static const short yydefgoto[] = {     2,
     3,     4,    40,    37,    39,   132,   111,    59,    99,    83,
    84,    85,    86,    94,    28,    29,    30,    31,    32,    33,
    34
};

static const short yypact[] = {    14,
   263,    87,    33,-32768,     9,-32768,    74,   267,    17,    21,
    35,    43,    18,    67,    82,    88,    90,-32768,   267,    91,
    84,-32768,-32768,   267,-32768,   102,-32768,    93,-32768,    31,
    41,   -10,   -38,    85,   263,   100,-32768,    96,-32768,   129,
-32768,   105,   106,   107,   108,    -2,    -2,   267,-32768,-32768,
   109,-32768,-32768,   111,   267,   267,   267,   110,   155,   112,
   104,-32768,   102,   102,   102,   119,   120,   102,   102,   267,
-32768,   117,-32768,   125,-32768,-32768,-32768,-32768,-32768,-32768,
    -2,    -2,   -16,   130,-32768,-32768,    40,   -11,   123,-32768,
-32768,   122,-32768,    53,-32768,-32768,    51,-32768,-32768,   267,
-32768,   104,-32768,-32768,-32768,-32768,   -38,   -38,   114,   160,
   161,   146,     2,   -19,-32768,    -2,   263,    -2,   267,   147,
    25,    38,   263,    -2,-32768,-32768,   267,-32768,   136,   149,
   158,    57,   159,   191,   164,-32768,   162,   175,   130,-32768,
   267,   267,-32768,   267,-32768,-32768,   -22,-32768,-32768,   267,
-32768,   154,   196,   167,-32768,   181,   263,-32768,-32768,-32768,
   267,-32768,-32768,   188,-32768,-32768,-32768,   182,   161,-32768,
   263,   227,-32768,-32768,   197,-32768
};

static const short yypgoto[] = {-32768,
-32768,-32768,-32768,-32768,-32768,-32768,    56,  -110,    -1,   -45,
   115,   142,-32768,-32768,    -4,-32768,    37,-32768,-32768,    39,
   242
};


#define	YYLAST		318


static const short yytable[] = {    27,
   134,    88,    43,    44,     5,     6,   116,   119,    79,    80,
    68,    69,   116,   161,    54,    66,     1,   116,    96,    58,
    18,   117,    20,   120,   121,   122,   123,    21,    22,    23,
   116,     5,     6,    71,    81,   113,    38,    67,    41,   136,
    82,    87,    87,    89,     5,     6,    45,    18,    26,    20,
    92,    93,    95,    49,    21,    22,    23,    46,   172,   142,
    18,    24,    20,    63,    64,   109,   119,    21,    22,    23,
   137,    47,   144,    65,    24,    26,   114,    87,   147,    48,
     5,     6,   120,   121,   122,    56,   175,    57,    26,    35,
   126,    36,   128,   127,   152,   129,    18,   153,    20,   101,
   103,   104,    50,    21,    42,    23,   107,   108,     5,     6,
    24,    87,    51,    87,   140,   138,   143,   145,    56,    87,
    57,   146,   148,    52,    26,    53,    20,    55,    62,    72,
    70,    60,    22,    23,    73,    74,   158,   159,    24,   160,
    75,    76,    77,    78,    90,   162,    91,    96,    57,   100,
   105,   106,    26,   110,   112,   167,   168,   118,   124,   125,
   130,     5,     6,     7,     8,   131,   133,     9,    10,   173,
    11,    12,    13,    14,    15,    16,    17,    18,    19,    20,
   135,   141,   149,   150,    97,    22,    23,   151,   154,   157,
   116,    24,   163,    25,    98,   156,   176,     5,     6,     7,
     8,   164,   165,     9,    10,    26,    11,    12,    13,    14,
    15,    16,    17,    18,    19,    20,   166,   170,   169,   171,
    97,    22,    23,   115,     0,     0,     0,    24,     0,    25,
   155,     0,   139,     5,     6,     7,     8,     0,     0,     9,
    10,    26,    11,    12,    13,    14,    15,    16,    17,    18,
    19,    20,     0,     0,     0,     0,    97,    22,    23,     0,
     0,     0,     0,    24,     0,    25,   174,    61,     0,     5,
     6,     7,     8,     5,     6,     9,    10,    26,    11,    12,
    13,    14,    15,    16,    17,    18,    19,    20,     0,    18,
     0,    20,    21,    22,    23,     0,    21,    22,    23,    24,
     0,    25,     0,    24,   102,   102,   102,     0,     0,   102,
   102,     0,     0,    26,     0,     0,     0,    26
};

static const short yycheck[] = {     1,
   111,    47,     7,     8,     7,     8,    29,    27,    11,    12,
    49,    50,    29,    36,    19,    26,     3,    29,    38,    24,
    23,    38,    25,    43,    44,    45,    38,    30,    31,    32,
    29,     7,     8,    35,    37,    81,     4,    48,    30,    38,
    43,    46,    47,    48,     7,     8,    30,    23,    51,    25,
    55,    56,    57,    36,    30,    31,    32,    37,   169,    35,
    23,    37,    25,    33,    34,    70,    27,    30,    31,    32,
   116,    37,    35,    33,    37,    51,    81,    82,   124,    37,
     7,     8,    43,    44,    45,    35,     0,    37,    51,     3,
    38,     5,    42,    41,    38,   100,    23,    41,    25,    63,
    64,    65,    36,    30,    31,    32,    68,    69,     7,     8,
    37,   116,    31,   118,   119,   117,   121,   122,    35,   124,
    37,   123,   127,    36,    51,    36,    25,    37,    36,    30,
    46,    30,    31,    32,    39,     7,   141,   142,    37,   144,
    36,    36,    36,    36,    36,   150,    36,    38,    37,    46,
    32,    32,    51,    37,    30,   157,   161,    28,    36,    38,
    47,     7,     8,     9,    10,     6,     6,    13,    14,   171,
    16,    17,    18,    19,    20,    21,    22,    23,    24,    25,
    35,    35,    47,    35,    30,    31,    32,    30,    30,    15,
    29,    37,    39,    39,    40,    32,     0,     7,     8,     9,
    10,     6,    36,    13,    14,    51,    16,    17,    18,    19,
    20,    21,    22,    23,    24,    25,    36,    30,   163,    38,
    30,    31,    32,    82,    -1,    -1,    -1,    37,    -1,    39,
    40,    -1,   118,     7,     8,     9,    10,    -1,    -1,    13,
    14,    51,    16,    17,    18,    19,    20,    21,    22,    23,
    24,    25,    -1,    -1,    -1,    -1,    30,    31,    32,    -1,
    -1,    -1,    -1,    37,    -1,    39,    40,    26,    -1,     7,
     8,     9,    10,     7,     8,    13,    14,    51,    16,    17,
    18,    19,    20,    21,    22,    23,    24,    25,    -1,    23,
    -1,    25,    30,    31,    32,    -1,    30,    31,    32,    37,
    -1,    39,    -1,    37,    63,    64,    65,    -1,    -1,    68,
    69,    -1,    -1,    51,    -1,    -1,    -1,    51
};
/* -*-C-*-  Note some compilers choke on comments on `#line' lines.  */
#line 3 "/usr/share/misc/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 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/misc/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
	    }
	  return 2;
	}
      yystacksize *= 2;
      if (yystacksize > YYMAXDEPTH)
	yystacksize = YYMAXDEPTH;
#ifndef YYSTACK_USE_ALLOCA
      yyfree_stacks = 1;
#endif
      yyss = (short *) YYSTACK_ALLOC (yystacksize * sizeof (*yyssp));
      __yy_memcpy ((char *)yyss, (char *)yyss1,
		   size * (unsigned int) sizeof (*yyssp));
      yyvs = (YYSTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yyvsp));
      __yy_memcpy ((char *)yyvs, (char *)yyvs1,
		   size * (unsigned int) sizeof (*yyvsp));
#ifdef YYLSP_NEEDED
      yyls = (YYLTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yylsp));
      __yy_memcpy ((char *)yyls, (char *)yyls1,
		   size * (unsigned int) 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 1:
#line 125 "parser_core.yy"
{
	yyvsp[0].st->code();
	delete yyvsp[0].st;
;
    break;}
case 2:
#line 129 "parser_core.yy"
{
	yyvsp[0].st->code();
	delete yyvsp[0].st;
;
    break;}
case 5:
#line 137 "parser_core.yy"
{
	fprintf(of, ".constant\n");
	fprintf(of, "objref 0x14a11\n");
;
    break;}
case 6:
#line 140 "parser_core.yy"
{
	fprintf(of, ".end-constant\n");
;
    break;}
case 8:
#line 146 "parser_core.yy"
{
	fprintf(of, "%s 0x%X\n", yyvsp[-3].s->c_str(), yyvsp[-1].i);
	delete yyvsp[-3].s;
;
    break;}
case 9:
#line 152 "parser_core.yy"
{
	int l;
	
	fprintf(of, "\n.method %s(", yyvsp[-7].s->c_str());
	delete yyvsp[-7].s;

	l = yyvsp[-5].vs->size();
	for (int i = 0; i < l; i++) {
		if (i) fprintf(of, ", ");
		fprintf(of, "%s", (*yyvsp[-5].vs)[i].c_str());
	}

	delete yyvsp[-5].vs;
	fprintf(of, ")\n");
	
	fprintf(of, ".var\n");

 	l = yyvsp[-2].vs->size();
 	for(int i = 0; i < l; i++) {
		fprintf(of, "%s\n", (*yyvsp[-2].vs)[i].c_str());
	}
	
	fprintf(of, ".end-var\n");
	delete yyvsp[-2].vs;
		
	yyvsp[-1].sl->code();
	delete yyvsp[-1].sl;

	fprintf(of, ".end-method\n");
;
    break;}
case 10:
#line 184 "parser_core.yy"
{
	int l;

	fprintf(of, "\n.main\n");
	fprintf(of, ".var\n");

	l = yyvsp[-2].vs->size();
	for(int i = 0; i < l; i++) {
		fprintf(of, "%s\n", (*yyvsp[-2].vs)[i].c_str());
	}
	
	fprintf(of, ".end-var\n");
	delete yyvsp[-2].vs;
		
	yyvsp[-1].sl->code();
	delete yyvsp[-1].sl;
	fprintf(of, ".end-main\n");
;
    break;}
case 11:
#line 204 "parser_core.yy"
{
	yyval.vs = new vector<string>;
;
    break;}
case 12:
#line 207 "parser_core.yy"
{
	yyval.vs = new vector<string>;
	yyval.vs->push_back(*yyvsp[0].s);
	delete yyvsp[0].s;
;
    break;}
case 13:
#line 212 "parser_core.yy"
{
	yyval.vs = yyvsp[-3].vs;
	yyval.vs->push_back(*yyvsp[0].s);
	delete yyvsp[0].s;
;
    break;}
case 14:
#line 218 "parser_core.yy"
{
	yyval.vs = new vector<string>;
;
    break;}
case 15:
#line 221 "parser_core.yy"
{
	yyval.vs = yyvsp[-3].vs;
	yyval.vs->push_back(*yyvsp[-1].s);
	delete yyvsp[-1].s;
;
    break;}
case 16:
#line 230 "parser_core.yy"
{
	yyval.sl = new SList();
;
    break;}
case 17:
#line 233 "parser_core.yy"
{
	yyval.sl = yyvsp[-1].sl;
	yyval.sl->add(yyvsp[0].st);
;
    break;}
case 18:
#line 237 "parser_core.yy"
{
	yyval.sl = yyvsp[-2].sl;
	yyval.sl->add(new SLabel(*yyvsp[-1].s));
	delete yyvsp[-1].s;
;
    break;}
case 19:
#line 244 "parser_core.yy"
{
	yyval.st = new SGoto(*yyvsp[-1].s);
	delete yyvsp[-1].s;
;
    break;}
case 20:
#line 248 "parser_core.yy"
{
	yyval.st = new SExprRaw(yyvsp[-1].exp);
;
    break;}
case 21:
#line 251 "parser_core.yy"
{
	yyval.st = new SOut(yyvsp[-1].exp);
;
    break;}
case 22:
#line 254 "parser_core.yy"
{
	yyval.st = new SPush(yyvsp[-1].exp);
;
    break;}
case 23:
#line 257 "parser_core.yy"
{
	yyval.st = new SReturn(yyvsp[-1].exp);
;
    break;}
case 24:
#line 260 "parser_core.yy"
{
	yyval.st = new SBreak;
;
    break;}
case 25:
#line 263 "parser_core.yy"
{
	yyval.st = new SContinue;
;
    break;}
case 26:
#line 266 "parser_core.yy"
{
	yyval.st = yyvsp[-1].sl;
;
    break;}
case 27:
#line 269 "parser_core.yy"
{
	yyval.st = new SIf(yyvsp[-2].c, yyvsp[0].st);
;
    break;}
case 28:
#line 272 "parser_core.yy"
{
	yyval.st = new SIfElse(yyvsp[-4].c, yyvsp[-2].st, yyvsp[0].st);
;
    break;}
case 29:
#line 275 "parser_core.yy"
{
	yyval.st = new SWhile(yyvsp[-2].c, yyvsp[0].st);
;
    break;}
case 30:
#line 278 "parser_core.yy"
{
	yyval.st = new SFor(yyvsp[-6].exp, yyvsp[-4].c, yyvsp[-2].exp, yyvsp[0].st);
;
    break;}
case 31:
#line 281 "parser_core.yy"
{
	yyval.st = new SAsm("HALT");
;
    break;}
case 32:
#line 284 "parser_core.yy"
{
	yyval.st = new SAsm("ERR");
;
    break;}
case 33:
#line 287 "parser_core.yy"
{
	yyval.st = new SAsm(*yyvsp[-1].s);
	delete yyvsp[-1].s;
;
    break;}
case 34:
#line 291 "parser_core.yy"
{
	yyval.st = new SOutString(*yyvsp[-1].s);
	delete yyvsp[-1].s;
;
    break;}
case 35:
#line 297 "parser_core.yy"
{ yyval.c = yyvsp[0].c; ;
    break;}
case 36:
#line 298 "parser_core.yy"
{
	yyval.c = new COr(yyvsp[-2].c, yyvsp[0].c);
;
    break;}
case 37:
#line 303 "parser_core.yy"
{ yyval.c = yyvsp[0].c; ;
    break;}
case 38:
#line 304 "parser_core.yy"
{
	yyval.c = new CAnd(yyvsp[-2].c, yyvsp[0].c);
;
    break;}
case 39:
#line 309 "parser_core.yy"
{ yyval.c = yyvsp[0].c; ;
    break;}
case 40:
#line 310 "parser_core.yy"
{
	yyval.c = new CNot(yyvsp[0].c);
;
    break;}
case 41:
#line 315 "parser_core.yy"
{
	yyval.c = yyvsp[-1].c;
;
    break;}
case 42:
#line 318 "parser_core.yy"
{
	yyval.c = new CTrue();
;
    break;}
case 43:
#line 321 "parser_core.yy"
{
	yyval.c = new CFalse();
;
    break;}
case 44:
#line 324 "parser_core.yy"
{
	yyval.c = new CExpr(yyvsp[0].exp);
;
    break;}
case 45:
#line 327 "parser_core.yy"
{
	yyval.c = new CLt(yyvsp[-2].exp, yyvsp[0].exp);
;
    break;}
case 46:
#line 330 "parser_core.yy"
{
	yyval.c = new CGt(yyvsp[-2].exp, yyvsp[0].exp);
;
    break;}
case 47:
#line 333 "parser_core.yy"
{
	yyval.c = new CEq(yyvsp[-2].exp, yyvsp[0].exp);
;
    break;}
case 48:
#line 336 "parser_core.yy"
{
	yyval.c = new CNot(new CEq(yyvsp[-3].exp, yyvsp[0].exp));
;
    break;}
case 49:
#line 339 "parser_core.yy"
{
	yyval.c = new CNot(new CGt(yyvsp[-3].exp, yyvsp[0].exp));
;
    break;}
case 50:
#line 342 "parser_core.yy"
{
	yyval.c = new CNot(new CLt(yyvsp[-3].exp, yyvsp[0].exp));
;
    break;}
case 51:
#line 353 "parser_core.yy"
{
	yyval.exv = new EXV;
	yyval.exv->push_back(new ENamedConst("OBJREF"));
;
    break;}
case 52:
#line 357 "parser_core.yy"
{
	yyval.exv = new EXV;
	yyval.exv->push_back(new ENamedConst("OBJREF"));
	yyval.exv->push_back(yyvsp[0].exp);
;
    break;}
case 53:
#line 362 "parser_core.yy"
{
	yyval.exv = yyvsp[-2].exv;
	yyval.exv->push_back(yyvsp[0].exp);
;
    break;}
case 54:
#line 368 "parser_core.yy"
{ yyval.exp = yyvsp[0].exp; ;
    break;}
case 55:
#line 369 "parser_core.yy"
{
	yyval.exp = new EStore(*yyvsp[-2].s, yyvsp[0].exp);
	delete yyvsp[-2].s;
;
    break;}
case 56:
#line 373 "parser_core.yy"
{
	yyval.exp = new EAStore(yyvsp[-5].exp, yyvsp[-3].exp, yyvsp[0].exp);
;
    break;}
case 57:
#line 378 "parser_core.yy"
{ yyval.exp = yyvsp[0].exp; ;
    break;}
case 58:
#line 379 "parser_core.yy"
{ yyval.exp = new EPop(); ;
    break;}
case 59:
#line 382 "parser_core.yy"
{ yyval.exp = yyvsp[0].exp; ;
    break;}
case 60:
#line 383 "parser_core.yy"
{ yyval.exp = yyvsp[0].ea; ;
    break;}
case 61:
#line 384 "parser_core.yy"
{ yyval.exp = new ESub(yyvsp[-2].exp, yyvsp[0].exp); ;
    break;}
case 62:
#line 387 "parser_core.yy"
{ yyval.ea = new EAdd(yyvsp[-2].exp, yyvsp[0].exp); ;
    break;}
case 63:
#line 388 "parser_core.yy"
{ yyvsp[-2].ea->addterm(yyvsp[0].exp); yyval.ea = yyvsp[-2].ea; ;
    break;}
case 64:
#line 391 "parser_core.yy"
{ yyval.exp = yyvsp[0].exp; ;
    break;}
case 65:
#line 392 "parser_core.yy"
{
	yyval.exp = new EMul(yyvsp[-2].exp, yyvsp[0].i);
;
    break;}
case 66:
#line 395 "parser_core.yy"
{
	yyval.exp = new EShl(yyvsp[-2].exp, yyvsp[0].i);
;
    break;}
case 67:
#line 400 "parser_core.yy"
{ yyval.exp = yyvsp[0].exp; ;
    break;}
case 68:
#line 401 "parser_core.yy"
{
	yyval.exp = new EOr(yyvsp[-2].exp, yyvsp[0].exp);
;
    break;}
case 69:
#line 404 "parser_core.yy"
{
	yyval.exp = new EAnd(yyvsp[-2].exp, yyvsp[0].exp);
;
    break;}
case 70:
#line 409 "parser_core.yy"
{ yyval.exp = yyvsp[-1].exp; ;
    break;}
case 71:
#line 410 "parser_core.yy"
{
	yyval.exp = new EFetch(*yyvsp[0].s);
	delete yyvsp[0].s;
;
    break;}
case 72:
#line 414 "parser_core.yy"
{
	yyval.exp = new ENamedConst(*yyvsp[0].s);
	delete yyvsp[0].s;
;
    break;}
case 73:
#line 418 "parser_core.yy"
{
	if (yyvsp[0].i < 0 || yyvsp[0].i > 255) {
		yyerror("Numeric constant out of range.");
	}
	
	yyval.exp = new EConst(yyvsp[0].i);
;
    break;}
case 74:
#line 425 "parser_core.yy"
{
	yyval.exp = new EMethod(*yyvsp[-3].s, yyvsp[-1].exv);
	delete yyvsp[-3].s;
;
    break;}
case 75:
#line 429 "parser_core.yy"
{
	yyval.exp = new EIn;
;
    break;}
case 76:
#line 432 "parser_core.yy"
{
	yyval.exp = new EAFetch(yyvsp[-3].exp, yyvsp[-1].exp);
;
    break;}
case 77:
#line 435 "parser_core.yy"
{
	yyval.exp = new EAlloca(yyvsp[-1].exp);
;
    break;}
case 78:
#line 438 "parser_core.yy"
{
	yyval.exp = new EAString(*yyvsp[0].s);
	delete yyvsp[0].s;
;
    break;}
case 79:
#line 442 "parser_core.yy"
{
	yyval.exp = new ENot(yyvsp[0].exp);
;
    break;}
}
   /* the action file gets copied in in place of this dollarsign */
#line 543 "/usr/share/misc/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;

 yyacceptlab:
  /* YYACCEPT comes here.  */
  if (yyfree_stacks)
    {
      free (yyss);
      free (yyvs);
#ifdef YYLSP_NEEDED
      free (yyls);
#endif
    }
  return 0;

 yyabortlab:
  /* YYABORT comes here.  */
  if (yyfree_stacks)
    {
      free (yyss);
      free (yyvs);
#ifdef YYLSP_NEEDED
      free (yyls);
#endif
    }
  return 1;
}
#line 447 "parser_core.yy"


extern int yylineno;

void yyerror(char *err) {
	fprintf(stderr, "error at line %d: %s\n", yylineno, err);
	exit(-1);
}