/*  A Bison parser, made from grammar.y
 by  GNU Bison version 1.27
  */

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

#define YYLSP_NEEDED

#define	NUM	257
#define	IDENTIFIER	258
#define	IF	259
#define	THEN	260
#define	ELSE	261
#define	LET	262
#define	IN	263
#define	PROC	264
#define	CALL	265
#define	EQ	266
#define	OPENPARA	267
#define	CLOSEPARA	268
#define	COMMA	269
#define	NOT	270
#define	ADD	271
#define	SUBTACT	272
#define	MULTIPLY	273
#define	TRUE	274
#define	FALSE	275
#define	INTTYPE	276
#define	BOOLTYPE	277
#define	SET	278
#define	BEGINSTATE	279
#define	ENDSTATE	280
#define	ARROW	281

#line 1 "grammar.y"

/*
Author:	Alan Macek
Date:	May 30, 2001

Terms of use: Please send me an email <al@alanmacek.com> if you are using this
		file or modifying it to let me know how it works for you.
*/

#include "parserClasses.h"
#include <string>
#include <vector>
int yylex();
int yyerror(char *s);
extern Expression* resultExp;
#define YYERROR_VERBOSE

#line 19 "grammar.y"
typedef union {
	int	val;
	Expression *expr;
	char* id;
	PrimExpression::Prim prim;
	ExpsList exprs;
	ArgsList args;
	Type* varType;
	vector<Type*> *types;
} 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

#ifndef YYDEBUG
#define YYDEBUG 1
#endif

#include <stdio.h>

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



#define	YYFINAL		65
#define	YYFLAG		-32768
#define	YYNTBASE	31

#define YYTRANSLATE(x) ((unsigned)(x) <= 283 ? yytranslate[x] : 39)

static const char yytranslate[] = {     0,
     2,     2,     2,     2,     2,     2,     2,     2,     2,    28,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     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,    29,    30
};

#if YYDEBUG != 0
static const short yyprhs[] = {     0,
     0,     1,     4,     6,     8,    10,    12,    14,    16,    23,
    30,    35,    41,    47,    52,    56,    58,    62,    65,    70,
    72,    74,    76,    78,    80,    82,    88,    90
};

static const short yyrhs[] = {    -1,
    31,    32,     0,    28,     0,    33,     0,     3,     0,    20,
     0,    21,     0,     4,     0,     5,    33,     6,    33,     7,
    33,     0,     8,     4,    12,    33,     9,    33,     0,    36,
    13,    34,    14,     0,    10,    13,    35,    14,    33,     0,
    11,    33,    13,    34,    14,     0,    24,     4,    12,    33,
     0,    25,    34,    26,     0,    33,     0,    34,    15,    33,
     0,    37,     4,     0,    35,    15,    37,     4,     0,    17,
     0,    19,     0,    18,     0,    12,     0,    22,     0,    23,
     0,    29,    38,    18,    37,    30,     0,    37,     0,    38,
    19,    37,     0
};

#endif

#if YYDEBUG != 0
static const short yyrline[] = { 0,
    65,    66,    69,    70,    74,    75,    76,    77,    79,    84,
    89,    93,    98,   103,   108,   114,   120,   127,   135,   144,
   145,   146,   147,   150,   151,   152,   163,   167
};
#endif

#define YYNTOKENS 31
#define YYNNTS 8
#define YYNRULES 28
#define YYNSTATES 66
#define YYMAXUTOK 283

static const char * const yytname[] = {   "$","error","$undefined.","NUM","IDENTIFIER",
"\"if\\\"","\"then\\\"","\"else\\\"","\"let\\\"","\"in\\\"","\"proc\\\"","\"call\\\"",
"\"=\\\"","\"(\\\"","\")\\\"","\",\\\"","\"!\\\"","\"+\\\"","\"-\\\"","\"*\\\"",
"\"true\\\"","\"false\\\"","\"int\\\"","\"bool\\\"","\"set\\\"","\"begin\\\"",
"\"end\\\"","\"->\\\"","'\\n'","\"[\\\"","\"]\\\"","input","line","exp","listOfExps",
"listOfArgs","primitive","varType","listOfTypes", NULL
};
static const short yytoknum[] = { 0,
   256,     2,   257,   258,   259,   260,   261,   262,   263,   264,
   265,   266,   267,   268,   269,   270,   271,   272,   273,   274,
   275,   276,   277,   278,   279,   280,   281,    10,   282,   283,
     0
};

static const short yyr1[] = {     0,
    31,    31,    32,    32,    33,    33,    33,    33,    33,    33,
    33,    33,    33,    33,    33,    34,    34,    35,    35,    36,
    36,    36,    36,    37,    37,    37,    38,    38
};

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

static const short yydefact[] = {     1,
     0,     5,     8,     0,     0,     0,     0,    23,    20,    22,
    21,     6,     7,     0,     0,     3,     2,     4,     0,     0,
     0,     0,     0,     0,    16,     0,     0,     0,     0,    24,
    25,     0,     0,     0,     0,     0,     0,    15,     0,     0,
     0,    27,     0,     0,     0,    18,     0,    14,    17,    11,
     0,     0,     0,     0,    12,     0,    13,     9,    10,     0,
    28,    19,    26,     0,     0
};

static const short yydefgoto[] = {     1,
    17,    25,    26,    33,    19,    34,    43
};

static const short yypact[] = {-32768,
     5,-32768,-32768,    36,    -2,    -9,    36,-32768,-32768,-32768,
-32768,-32768,-32768,     3,    36,-32768,-32768,-32768,     1,    12,
    22,     9,    24,    30,-32768,   -14,    36,    36,    36,-32768,
-32768,     9,     6,    45,    36,    36,    36,-32768,    48,    52,
    43,-32768,    46,    36,     9,-32768,    54,-32768,-32768,-32768,
    36,    36,     9,     9,-32768,    66,-32768,-32768,-32768,    41,
-32768,-32768,-32768,    72,-32768
};

static const short yypgoto[] = {-32768,
-32768,    -1,   -16,-32768,-32768,    13,-32768
};


#define	YYLAST		72


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

static const short yycheck[] = {     1,
    15,     4,     4,    13,     0,     7,     4,     3,     4,     5,
    27,    26,     8,    13,    10,    11,    12,     6,    35,    14,
    15,    17,    18,    19,    20,    21,    28,    29,    24,    25,
    22,    23,    28,    12,    36,    37,    13,    29,     3,     4,
     5,    12,    44,     8,    32,    10,    11,    12,     4,    51,
    52,     9,    17,    18,    19,    20,    21,    45,     7,    24,
    25,    14,    15,    18,    19,    53,    54,    14,    15,     4,
    30,     0
};
/* -*-C-*-  Note some compilers choke on comments on `#line' lines.  */
#line 3 "/usr/lib/bison.simple"
/* This file comes from bison-1.27.  */

/* 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 216 "/usr/lib/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 4:
#line 70 "grammar.y"
{ resultExp = yyvsp[0].expr;
			      YYACCEPT ;
    break;}
case 5:
#line 74 "grammar.y"
{ yyval.expr = new IntExpression(yyvsp[0].val, yylsp[0].text); ;
    break;}
case 6:
#line 75 "grammar.y"
{ yyval.expr = new BoolExpression(true, yylsp[0].text); ;
    break;}
case 7:
#line 76 "grammar.y"
{ yyval.expr = new BoolExpression(false, yylsp[0].text); ;
    break;}
case 8:
#line 78 "grammar.y"
{ yyval.expr = new VarExpression(yyvsp[0].id, yylsp[0].text); ;
    break;}
case 9:
#line 80 "grammar.y"
{ string text = (string)yylsp[-5].text + " " + (string)yylsp[-4].text + " "
								+ (string)yylsp[-3].text + " " + (string)yylsp[-2].text + " "
								+ (string)yylsp[-1].text + " " + (string)yylsp[0].text;
				  yyval.expr = new IfExpression(yyvsp[-4].expr, yyvsp[-2].expr, yyvsp[0].expr, text); ;
    break;}
case 10:
#line 85 "grammar.y"
{ string text = (string)yylsp[-5].text + " " + (string)yylsp[-4].text + " " 
								+ (string)yylsp[-3].text + " " + (string)yylsp[-2].text + " "
								+ (string)yylsp[-1].text + " " + (string)yylsp[0].text;
				  yyval.expr = new LetExpression(yyvsp[-4].id, yyvsp[-2].expr, yyvsp[0].expr, text); ;
    break;}
case 11:
#line 90 "grammar.y"
{ string text = (string)yylsp[-3].text + " " + (string)yylsp[-2].text + " "
								+ *(yyvsp[-1].exprs.listText) + " " + (string)yylsp[0].text;
				  yyval.expr = new PrimExpression(yyvsp[-3].prim, yyvsp[-1].exprs, text); ;
    break;}
case 12:
#line 94 "grammar.y"
{ string text = (string)yylsp[-4].text + " " + (string)yylsp[-3].text + " "
								+ *(yyvsp[-2].args.listText) + " " + (string)yylsp[-1].text + " "
								+ (string)yylsp[0].text;
				  yyval.expr = new ProcExpression(yyvsp[-2].args, yyvsp[0].expr, text); ;
    break;}
case 13:
#line 99 "grammar.y"
{ string text = (string)yylsp[-4].text + " " + (string)yylsp[-3].text + " "
								+ (string)yylsp[-2].text + " " + *(yyvsp[-1].exprs.listText) + " "
								+ (string)yylsp[0].text;
				  yyval.expr = new CallExpression(yyvsp[-3].expr, yyvsp[-1].exprs, text); ;
    break;}
case 14:
#line 104 "grammar.y"
{ string text = (string)yylsp[-3].text + " " + (string)yylsp[-2].text + " "
								+ (string)yylsp[-1].text + " " +
								(string)yylsp[0].text;
				  yyval.expr = new SetVarExpression(yyvsp[-2].id, yyvsp[0].expr, text); ;
    break;}
case 15:
#line 109 "grammar.y"
{ string text = (string)yylsp[-2].text + " " + *(yyvsp[-1].exprs.listText) + " "
								+ (string)yylsp[0].text;
				  yyval.expr = new BeginExpression(yyvsp[-1].exprs, text); ;
    break;}
case 16:
#line 114 "grammar.y"
{ ExpsList l;
				  l.exps = new vector<Expression*>;
				  l.exps->push_back(yyvsp[0].expr);
				  l.listText = new string(yylsp[0].text);
				  yyval.exprs = l;
				 ;
    break;}
case 17:
#line 121 "grammar.y"
{ ExpsList l = yyvsp[-2].exprs;
				  l.exps->push_back(yyvsp[0].expr);
				  *(l.listText) += ", " + (string)yylsp[0].text;
				  yyval.exprs = l; ;
    break;}
case 18:
#line 127 "grammar.y"
{ ArgsList a;
								 a.types = new vector<Type*>;
								 a.types->push_back(yyvsp[-1].varType);
								 a.args = new vector<string>;
								 a.args->push_back(yyvsp[0].id);
								 a.listText = new string(yyvsp[-1].varType->print() + " " + (string)yylsp[0].text);
								 yyval.args = a;
							   ;
    break;}
case 19:
#line 136 "grammar.y"
{ ArgsList a = yyvsp[-3].args;
					  	  a.types->push_back(yyvsp[-1].varType);
						  a.args->push_back(yyvsp[0].id);
						  *(a.listText) += ", " + yyvsp[-1].varType->print() + " " + (string)yylsp[0].text;
						  yyval.args = a;
						;
    break;}
case 20:
#line 144 "grammar.y"
{ yyval.prim = PrimExpression::Add; ;
    break;}
case 21:
#line 145 "grammar.y"
{ yyval.prim = PrimExpression::Multiply; ;
    break;}
case 22:
#line 146 "grammar.y"
{ yyval.prim = PrimExpression::Subtract; ;
    break;}
case 23:
#line 147 "grammar.y"
{ yyval.prim = PrimExpression::Equal; ;
    break;}
case 24:
#line 150 "grammar.y"
{ yyval.varType = new IntType; ;
    break;}
case 25:
#line 151 "grammar.y"
{ yyval.varType = new BoolType; ;
    break;}
case 26:
#line 153 "grammar.y"
{ ClosureType *c = new ClosureType ( yyvsp[-1].varType, yyvsp[-3].types->size());
				  vector<Type*>::iterator it = yyvsp[-3].types->begin();
				  for (int i = 0; i < (int)yyvsp[-3].types->size(); ++i)
				  	{
				  	   c->setNthArgType(i, *it);
				  	   it++;
				  	}
				  yyval.varType = c;
				 ;
    break;}
case 27:
#line 163 "grammar.y"
{ vector<Type*> *l = new vector<Type*>;
				  l->push_back(yyvsp[0].varType);
				  yyval.types = l;
				 ;
    break;}
case 28:
#line 168 "grammar.y"
{ yyvsp[-2].types->push_back(yyvsp[0].varType);
				  yyval.types = yyvsp[-2].types; ;
    break;}
}
   /* the action file gets copied in in place of this dollarsign */
#line 542 "/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;

 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 171 "grammar.y"


int yyerror (char *s)  /* Called by yyparse on error */
{
  printf ("%s\n", s);
  return 0;
}

int lookupTokens(char *s)
{
	for (int i = 0; i < YYNTOKENS; i++)
	{
//		printf("Match attempt between '%s' and '%s' (item %d)\n", s, yytname[i],i);
		if (yytname[i] != 0
			&& yytname[i][0] == '"'
			&& strncmp (yytname[i] + 1, s, strlen (s)) == 0
#ifdef EXTRA_BACK_SLASH
			&& yytname[i][strlen (s) + 1] == '\\'
			&& yytname[i][strlen (s) + 2] == '"'
			&& yytname[i][strlen (s) + 3] == 0)
#else
			&& yytname[i][strlen (s) + 1] == '"'
			&& yytname[i][strlen (s) + 2] == 0)
#endif			
		{
//			printf("Matched '%s' to '%s' which has value %d\n", s, yytname[i], i); 
			return yytoknum[i];
		}
	}
	return 0;
}