text: /* A Bison parser, made by GNU Bison 3.7.4.  */
  
  /* Bison implementation for Yacc-like parsers in C
  
     Copyright (C) 1984, 1989-1990, 2000-2015, 2018-2020 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 3 of the License, 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, see <http://www.gnu.org/licenses/>.  */
  
  /* As a special exception, you may create a larger work that contains
     part or all of the Bison parser skeleton and distribute that work
     under terms of your choice, so long as that work isn't itself a
     parser generator using the skeleton or a modified version thereof
     as a parser skeleton.  Alternatively, if you modify or redistribute
     the parser skeleton itself, you may (at your option) remove this
     special exception, which will cause the skeleton and the resulting
     Bison output files to be licensed under the GNU General Public
     License without this special exception.
  
     This special exception was added by the Free Software Foundation in
     version 2.2 of Bison.  */
  
  /* C LALR(1) parser skeleton written by Richard Stallman, by
     simplifying the original so-called "semantic" parser.  */
  
  /* DO NOT RELY ON FEATURES THAT ARE NOT DOCUMENTED in the manual,
     especially those whose name start with YY_ or yy_.  They are
     private implementation details that can be changed or removed.  */
  
  /* All symbols defined below should begin with yy or YY, to avoid
     infringing on user name space.  This should be done even for local
     variables, as they might otherwise be expanded by user macros.
     There are some unavoidable exceptions within include files to
     define necessary library symbols; they are noted "INFRINGES ON
     USER NAME SPACE" below.  */
  
  /* Identify Bison output, and Bison version.  */
  #define YYBISON 30704
  
  /* Bison version string.  */
  #define YYBISON_VERSION "3.7.4"
  
  /* Skeleton name.  */
  #define YYSKELETON_NAME "yacc.c"
  
  /* Pure parsers.  */
  #define YYPURE 0
  
  /* Push parsers.  */
  #define YYPUSH 0
  
  /* Pull parsers.  */
  #define YYPULL 1
  
  
  
  
  /* First part of user prologue.  */
  #line 1 "exptree.y"
  
  	#include <stdlib.h>
  	#include <stdio.h>
  	#include<string.h> 
  	int yylex(void);
  	int yyerror(char const *s);
  	FILE *code;
  	int register_index;
  	int firstreg;
  
  	#include "exptree.h"
  	#include "exptree.c"
  
  
  #line 86 "y.tab.c"
  
  # ifndef YY_CAST
  #  ifdef __cplusplus
  #   define YY_CAST(Type, Val) static_cast<Type> (Val)
  #   define YY_REINTERPRET_CAST(Type, Val) reinterpret_cast<Type> (Val)
  #  else
  #   define YY_CAST(Type, Val) ((Type) (Val))
  #   define YY_REINTERPRET_CAST(Type, Val) ((Type) (Val))
  #  endif
  # endif
  # ifndef YY_NULLPTR
  #  if defined __cplusplus
  #   if 201103L <= __cplusplus
  #    define YY_NULLPTR nullptr
  #   else
  #    define YY_NULLPTR 0
  #   endif
  #  else
  #   define YY_NULLPTR ((void*)0)
  #  endif
  # endif
  
  /* Use api.header.include to #include this header
     instead of duplicating it here.  */
  #ifndef YY_YY_Y_TAB_H_INCLUDED
  # define YY_YY_Y_TAB_H_INCLUDED
  /* Debug traces.  */
  #ifndef YYDEBUG
  # define YYDEBUG 0
  #endif
  #if YYDEBUG
  extern int yydebug;
  #endif
  
  /* Token kinds.  */
  #ifndef YYTOKENTYPE
  # define YYTOKENTYPE
    enum yytokentype
    {
      YYEMPTY = -2,
      YYEOF = 0,                     /* "end of file"  */
      YYerror = 256,                 /* error  */
      YYUNDEF = 257,                 /* "invalid token"  */
      NODE_NUM = 258,                /* NODE_NUM  */
      NODE_PLUS = 259,               /* NODE_PLUS  */
      NODE_MINUS = 260,              /* NODE_MINUS  */
      NODE_MUL = 261,                /* NODE_MUL  */
      NODE_DIV = 262,                /* NODE_DIV  */
      NODE_OP = 263,                 /* NODE_OP  */
      NODE_GRT = 264,                /* NODE_GRT  */
      NODE_LES = 265,                /* NODE_LES  */
      NODE_GEQ = 266,                /* NODE_GEQ  */
      NODE_LEQ = 267,                /* NODE_LEQ  */
      NODE_NEQUALS = 268,            /* NODE_NEQUALS  */
      NODE_EQUALS = 269,             /* NODE_EQUALS  */
      NODE_ID = 270,                 /* NODE_ID  */
      NODE_CONNECT = 271,            /* NODE_CONNECT  */
      NODE_BEGIN = 272,              /* NODE_BEGIN  */
      NODE_END = 273,                /* NODE_END  */
      NODE_BREAK = 274,              /* NODE_BREAK  */
      NODE_CONTINUE = 275,           /* NODE_CONTINUE  */
      NODE_ENDWHILE = 276,           /* NODE_ENDWHILE  */
      NODE_DO = 277,                 /* NODE_DO  */
      NODE_WHILE = 278,              /* NODE_WHILE  */
      NODE_IF = 279,                 /* NODE_IF  */
      NODE_THEN = 280,               /* NODE_THEN  */
      NODE_ELSE = 281,               /* NODE_ELSE  */
      NODE_ENDIF = 282,              /* NODE_ENDIF  */
      NODE_READ = 283,               /* NODE_READ  */
      NODE_WRITE = 284               /* NODE_WRITE  */
    };
    typedef enum yytokentype yytoken_kind_t;
  #endif
  /* Token kinds.  */
  #define YYEMPTY -2
  #define YYEOF 0
  #define YYerror 256
  #define YYUNDEF 257
  #define NODE_NUM 258
  #define NODE_PLUS 259
  #define NODE_MINUS 260
  #define NODE_MUL 261
  #define NODE_DIV 262
  #define NODE_OP 263
  #define NODE_GRT 264
  #define NODE_LES 265
  #define NODE_GEQ 266
  #define NODE_LEQ 267
  #define NODE_NEQUALS 268
  #define NODE_EQUALS 269
  #define NODE_ID 270
  #define NODE_CONNECT 271
  #define NODE_BEGIN 272
  #define NODE_END 273
  #define NODE_BREAK 274
  #define NODE_CONTINUE 275
  #define NODE_ENDWHILE 276
  #define NODE_DO 277
  #define NODE_WHILE 278
  #define NODE_IF 279
  #define NODE_THEN 280
  #define NODE_ELSE 281
  #define NODE_ENDIF 282
  #define NODE_READ 283
  #define NODE_WRITE 284
  
  /* Value type.  */
  #if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
  union YYSTYPE
  {
  #line 18 "exptree.y"
  
  	struct tnode *no;
  	
  
  #line 202 "y.tab.c"
  
  };
  typedef union YYSTYPE YYSTYPE;
  # define YYSTYPE_IS_TRIVIAL 1
  # define YYSTYPE_IS_DECLARED 1
  #endif
  
  
  extern YYSTYPE yylval;
  
  int yyparse (void);
  
  #endif /* !YY_YY_Y_TAB_H_INCLUDED  */
  /* Symbol kind.  */
  enum yysymbol_kind_t
  {
    YYSYMBOL_YYEMPTY = -2,
    YYSYMBOL_YYEOF = 0,                      /* "end of file"  */
    YYSYMBOL_YYerror = 1,                    /* error  */
    YYSYMBOL_YYUNDEF = 2,                    /* "invalid token"  */
    YYSYMBOL_NODE_NUM = 3,                   /* NODE_NUM  */
    YYSYMBOL_NODE_PLUS = 4,                  /* NODE_PLUS  */
    YYSYMBOL_NODE_MINUS = 5,                 /* NODE_MINUS  */
    YYSYMBOL_NODE_MUL = 6,                   /* NODE_MUL  */
    YYSYMBOL_NODE_DIV = 7,                   /* NODE_DIV  */
    YYSYMBOL_NODE_OP = 8,                    /* NODE_OP  */
    YYSYMBOL_NODE_GRT = 9,                   /* NODE_GRT  */
    YYSYMBOL_NODE_LES = 10,                  /* NODE_LES  */
    YYSYMBOL_NODE_GEQ = 11,                  /* NODE_GEQ  */
    YYSYMBOL_NODE_LEQ = 12,                  /* NODE_LEQ  */
    YYSYMBOL_NODE_NEQUALS = 13,              /* NODE_NEQUALS  */
    YYSYMBOL_NODE_EQUALS = 14,               /* NODE_EQUALS  */
    YYSYMBOL_NODE_ID = 15,                   /* NODE_ID  */
    YYSYMBOL_NODE_CONNECT = 16,              /* NODE_CONNECT  */
    YYSYMBOL_NODE_BEGIN = 17,                /* NODE_BEGIN  */
    YYSYMBOL_NODE_END = 18,                  /* NODE_END  */
    YYSYMBOL_NODE_BREAK = 19,                /* NODE_BREAK  */
    YYSYMBOL_NODE_CONTINUE = 20,             /* NODE_CONTINUE  */
    YYSYMBOL_NODE_ENDWHILE = 21,             /* NODE_ENDWHILE  */
    YYSYMBOL_NODE_DO = 22,                   /* NODE_DO  */
    YYSYMBOL_NODE_WHILE = 23,                /* NODE_WHILE  */
    YYSYMBOL_NODE_IF = 24,                   /* NODE_IF  */
    YYSYMBOL_NODE_THEN = 25,                 /* NODE_THEN  */
    YYSYMBOL_NODE_ELSE = 26,                 /* NODE_ELSE  */
    YYSYMBOL_NODE_ENDIF = 27,                /* NODE_ENDIF  */
    YYSYMBOL_NODE_READ = 28,                 /* NODE_READ  */
    YYSYMBOL_NODE_WRITE = 29,                /* NODE_WRITE  */
    YYSYMBOL_30_ = 30,                       /* '('  */
    YYSYMBOL_31_ = 31,                       /* ')'  */
    YYSYMBOL_32_ = 32,                       /* ';'  */
    YYSYMBOL_33_ = 33,                       /* '='  */
    YYSYMBOL_YYACCEPT = 34,                  /* $accept  */
    YYSYMBOL_Program = 35,                   /* Program  */
    YYSYMBOL_Slist = 36,                     /* Slist  */
    YYSYMBOL_Stmt = 37,                      /* Stmt  */
    YYSYMBOL_CntStmnt = 38,                  /* CntStmnt  */
    YYSYMBOL_BrkStmnt = 39,                  /* BrkStmnt  */
    YYSYMBOL_InputStmt = 40,                 /* InputStmt  */
    YYSYMBOL_OutputStmt = 41,                /* OutputStmt  */
    YYSYMBOL_AsgStmt = 42,                   /* AsgStmt  */
    YYSYMBOL_expr = 43                       /* expr  */
  };
  typedef enum yysymbol_kind_t yysymbol_kind_t;
  
  
  
  
  #ifdef short
  # undef short
  #endif
  
  /* On compilers that do not define __PTRDIFF_MAX__ etc., make sure
     <limits.h> and (if available) <stdint.h> are included
     so that the code can choose integer types of a good width.  */
  
  #ifndef __PTRDIFF_MAX__
  # include <limits.h> /* INFRINGES ON USER NAME SPACE */
  # if defined __STDC_VERSION__ && 199901 <= __STDC_VERSION__
  #  include <stdint.h> /* INFRINGES ON USER NAME SPACE */
  #  define YY_STDINT_H
  # endif
  #endif
  
  /* Narrow types that promote to a signed type and that can represent a
     signed or unsigned integer of at least N bits.  In tables they can
     save space and decrease cache pressure.  Promoting to a signed type
     helps avoid bugs in integer arithmetic.  */
  
  #ifdef __INT_LEAST8_MAX__
  typedef __INT_LEAST8_TYPE__ yytype_int8;
  #elif defined YY_STDINT_H
  typedef int_least8_t yytype_int8;
  #else
  typedef signed char yytype_int8;
  #endif
  
  #ifdef __INT_LEAST16_MAX__
  typedef __INT_LEAST16_TYPE__ yytype_int16;
  #elif defined YY_STDINT_H
  typedef int_least16_t yytype_int16;
  #else
  typedef short yytype_int16;
  #endif
  
  #if defined __UINT_LEAST8_MAX__ && __UINT_LEAST8_MAX__ <= __INT_MAX__
  typedef __UINT_LEAST8_TYPE__ yytype_uint8;
  #elif (!defined __UINT_LEAST8_MAX__ && defined YY_STDINT_H \
         && UINT_LEAST8_MAX <= INT_MAX)
  typedef uint_least8_t yytype_uint8;
  #elif !defined __UINT_LEAST8_MAX__ && UCHAR_MAX <= INT_MAX
  typedef unsigned char yytype_uint8;
  #else
  typedef short yytype_uint8;
  #endif
  
  #if defined __UINT_LEAST16_MAX__ && __UINT_LEAST16_MAX__ <= __INT_MAX__
  typedef __UINT_LEAST16_TYPE__ yytype_uint16;
  #elif (!defined __UINT_LEAST16_MAX__ && defined YY_STDINT_H \
         && UINT_LEAST16_MAX <= INT_MAX)
  typedef uint_least16_t yytype_uint16;
  #elif !defined __UINT_LEAST16_MAX__ && USHRT_MAX <= INT_MAX
  typedef unsigned short yytype_uint16;
  #else
  typedef int yytype_uint16;
  #endif
  
  #ifndef YYPTRDIFF_T
  # if defined __PTRDIFF_TYPE__ && defined __PTRDIFF_MAX__
  #  define YYPTRDIFF_T __PTRDIFF_TYPE__
  #  define YYPTRDIFF_MAXIMUM __PTRDIFF_MAX__
  # elif defined PTRDIFF_MAX
  #  ifndef ptrdiff_t
  #   include <stddef.h> /* INFRINGES ON USER NAME SPACE */
  #  endif
  #  define YYPTRDIFF_T ptrdiff_t
  #  define YYPTRDIFF_MAXIMUM PTRDIFF_MAX
  # else
  #  define YYPTRDIFF_T long
  #  define YYPTRDIFF_MAXIMUM LONG_MAX
  # endif
  #endif
  
  #ifndef YYSIZE_T
  # ifdef __SIZE_TYPE__
  #  define YYSIZE_T __SIZE_TYPE__
  # elif defined size_t
  #  define YYSIZE_T size_t
  # elif defined __STDC_VERSION__ && 199901 <= __STDC_VERSION__
  #  include <stddef.h> /* INFRINGES ON USER NAME SPACE */
  #  define YYSIZE_T size_t
  # else
  #  define YYSIZE_T unsigned
  # endif
  #endif
  
  #define YYSIZE_MAXIMUM                                  \
    YY_CAST (YYPTRDIFF_T,                                 \
             (YYPTRDIFF_MAXIMUM < YY_CAST (YYSIZE_T, -1)  \
              ? YYPTRDIFF_MAXIMUM                         \
              : YY_CAST (YYSIZE_T, -1)))
  
  #define YYSIZEOF(X) YY_CAST (YYPTRDIFF_T, sizeof (X))
  
  
  /* Stored state numbers (used for stacks). */
  typedef yytype_int8 yy_state_t;
  
  /* State numbers in computations.  */
  typedef int yy_state_fast_t;
  
  #ifndef YY_
  # if defined YYENABLE_NLS && YYENABLE_NLS
  #  if ENABLE_NLS
  #   include <libintl.h> /* INFRINGES ON USER NAME SPACE */
  #   define YY_(Msgid) dgettext ("bison-runtime", Msgid)
  #  endif
  # endif
  # ifndef YY_
  #  define YY_(Msgid) Msgid
  # endif
  #endif
  
  
  #ifndef YY_ATTRIBUTE_PURE
  # if defined __GNUC__ && 2 < __GNUC__ + (96 <= __GNUC_MINOR__)
  #  define YY_ATTRIBUTE_PURE __attribute__ ((__pure__))
  # else
  #  define YY_ATTRIBUTE_PURE
  # endif
  #endif
  
  #ifndef YY_ATTRIBUTE_UNUSED
  # if defined __GNUC__ && 2 < __GNUC__ + (7 <= __GNUC_MINOR__)
  #  define YY_ATTRIBUTE_UNUSED __attribute__ ((__unused__))
  # else
  #  define YY_ATTRIBUTE_UNUSED
  # endif
  #endif
  
  /* Suppress unused-variable warnings by "using" E.  */
  #if ! defined lint || defined __GNUC__
  # define YYUSE(E) ((void) (E))
  #else
  # define YYUSE(E) /* empty */
  #endif
  
  #if defined __GNUC__ && ! defined __ICC && 407 <= __GNUC__ * 100 + __GNUC_MINOR__
  /* Suppress an incorrect diagnostic about yylval being uninitialized.  */
  # define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN                            \
      _Pragma ("GCC diagnostic push")                                     \
      _Pragma ("GCC diagnostic ignored \"-Wuninitialized\"")              \
      _Pragma ("GCC diagnostic ignored \"-Wmaybe-uninitialized\"")
  # define YY_IGNORE_MAYBE_UNINITIALIZED_END      \
      _Pragma ("GCC diagnostic pop")
  #else
  # define YY_INITIAL_VALUE(Value) Value
  #endif
  #ifndef YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
  # define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
  # define YY_IGNORE_MAYBE_UNINITIALIZED_END
  #endif
  #ifndef YY_INITIAL_VALUE
  # define YY_INITIAL_VALUE(Value) /* Nothing. */
  #endif
  
  #if defined __cplusplus && defined __GNUC__ && ! defined __ICC && 6 <= __GNUC__
  # define YY_IGNORE_USELESS_CAST_BEGIN                          \
      _Pragma ("GCC diagnostic push")                            \
      _Pragma ("GCC diagnostic ignored \"-Wuseless-cast\"")
  # define YY_IGNORE_USELESS_CAST_END            \
      _Pragma ("GCC diagnostic pop")
  #endif
  #ifndef YY_IGNORE_USELESS_CAST_BEGIN
  # define YY_IGNORE_USELESS_CAST_BEGIN
  # define YY_IGNORE_USELESS_CAST_END
  #endif
  
  
  #define YY_ASSERT(E) ((void) (0 && (E)))
  
  #if 1
  
  /* The parser invokes alloca or malloc; define the necessary symbols.  */
  
  # ifdef YYSTACK_USE_ALLOCA
  #  if YYSTACK_USE_ALLOCA
  #   ifdef __GNUC__
  #    define YYSTACK_ALLOC __builtin_alloca
  #   elif defined __BUILTIN_VA_ARG_INCR
  #    include <alloca.h> /* INFRINGES ON USER NAME SPACE */
  #   elif defined _AIX
  #    define YYSTACK_ALLOC __alloca
  #   elif defined _MSC_VER
  #    include <malloc.h> /* INFRINGES ON USER NAME SPACE */
  #    define alloca _alloca
  #   else
  #    define YYSTACK_ALLOC alloca
  #    if ! defined _ALLOCA_H && ! defined EXIT_SUCCESS
  #     include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
        /* Use EXIT_SUCCESS as a witness for stdlib.h.  */
  #     ifndef EXIT_SUCCESS
  #      define EXIT_SUCCESS 0
  #     endif
  #    endif
  #   endif
  #  endif
  # endif
  
  # ifdef YYSTACK_ALLOC
     /* Pacify GCC's 'empty if-body' warning.  */
  #  define YYSTACK_FREE(Ptr) do { /* empty */; } while (0)
  #  ifndef YYSTACK_ALLOC_MAXIMUM
      /* The OS might guarantee only one guard page at the bottom of the stack,
         and a page size can be as small as 4096 bytes.  So we cannot safely
         invoke alloca (N) if N exceeds 4096.  Use a slightly smaller number
         to allow for a few compiler-allocated temporary stack slots.  */
  #   define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2006 */
  #  endif
  # else
  #  define YYSTACK_ALLOC YYMALLOC
  #  define YYSTACK_FREE YYFREE
  #  ifndef YYSTACK_ALLOC_MAXIMUM
  #   define YYSTACK_ALLOC_MAXIMUM YYSIZE_MAXIMUM
  #  endif
  #  if (defined __cplusplus && ! defined EXIT_SUCCESS \
         && ! ((defined YYMALLOC || defined malloc) \
               && (defined YYFREE || defined free)))
  #   include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
  #   ifndef EXIT_SUCCESS
  #    define EXIT_SUCCESS 0
  #   endif
  #  endif
  #  ifndef YYMALLOC
  #   define YYMALLOC malloc
  #   if ! defined malloc && ! defined EXIT_SUCCESS
  void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */
  #   endif
  #  endif
  #  ifndef YYFREE
  #   define YYFREE free
  #   if ! defined free && ! defined EXIT_SUCCESS
  void free (void *); /* INFRINGES ON USER NAME SPACE */
  #   endif
  #  endif
  # endif
  #endif /* 1 */
  
  #if (! defined yyoverflow \
       && (! defined __cplusplus \
           || (defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL)))
  
  /* A type that is properly aligned for any stack member.  */
  union yyalloc
  {
    yy_state_t yyss_alloc;
    YYSTYPE yyvs_alloc;
  };
  
  /* The size of the maximum gap between one aligned stack and the next.  */
  # define YYSTACK_GAP_MAXIMUM (YYSIZEOF (union yyalloc) - 1)
  
  /* The size of an array large to enough to hold all stacks, each with
     N elements.  */
  # define YYSTACK_BYTES(N) \
       ((N) * (YYSIZEOF (yy_state_t) + YYSIZEOF (YYSTYPE)) \
        + YYSTACK_GAP_MAXIMUM)
  
  # define YYCOPY_NEEDED 1
  
  /* Relocate STACK from its old location to the new one.  The
     local variables YYSIZE and YYSTACKSIZE give the old and new number of
     elements in the stack, and YYPTR gives the new location of the
     stack.  Advance YYPTR to a properly aligned location for the next
     stack.  */
  # define YYSTACK_RELOCATE(Stack_alloc, Stack)                           \
      do                                                                  \
        {                                                                 \
          YYPTRDIFF_T yynewbytes;                                         \
          YYCOPY (&yyptr->Stack_alloc, Stack, yysize);                    \
          Stack = &yyptr->Stack_alloc;                                    \
          yynewbytes = yystacksize * YYSIZEOF (*Stack) + YYSTACK_GAP_MAXIMUM; \
          yyptr += yynewbytes / YYSIZEOF (*yyptr);                        \
        }                                                                 \
      while (0)
  
  #endif
  
  #if defined YYCOPY_NEEDED && YYCOPY_NEEDED
  /* Copy COUNT objects from SRC to DST.  The source and destination do
     not overlap.  */
  # ifndef YYCOPY
  #  if defined __GNUC__ && 1 < __GNUC__
  #   define YYCOPY(Dst, Src, Count) \
        __builtin_memcpy (Dst, Src, YY_CAST (YYSIZE_T, (Count)) * sizeof (*(Src)))
  #  else
  #   define YYCOPY(Dst, Src, Count)              \
        do                                        \
          {                                       \
            YYPTRDIFF_T yyi;                      \
            for (yyi = 0; yyi < (Count); yyi++)   \
              (Dst)[yyi] = (Src)[yyi];            \
          }                                       \
        while (0)
  #  endif
  # endif
  #endif /* !YYCOPY_NEEDED */
  
  /* YYFINAL -- State number of the termination state.  */
  #define YYFINAL  18
  /* YYLAST -- Last index in YYTABLE.  */
  #define YYLAST   178
  
  /* YYNTOKENS -- Number of terminals.  */
  #define YYNTOKENS  34
  /* YYNNTS -- Number of nonterminals.  */
  #define YYNNTS  10
  /* YYNRULES -- Number of rules.  */
  #define YYNRULES  31
  /* YYNSTATES -- Number of states.  */
  #define YYNSTATES  77
  
  /* YYMAXUTOK -- Last valid token kind.  */
  #define YYMAXUTOK   284
  
  
  /* YYTRANSLATE(TOKEN-NUM) -- Symbol number corresponding to TOKEN-NUM
     as returned by yylex, with out-of-bounds checking.  */
  #define YYTRANSLATE(YYX)                                \
    (0 <= (YYX) && (YYX) <= YYMAXUTOK                     \
     ? YY_CAST (yysymbol_kind_t, yytranslate[YYX])        \
     : YYSYMBOL_YYUNDEF)
  
  /* YYTRANSLATE[TOKEN-NUM] -- Symbol number corresponding to TOKEN-NUM
     as returned by yylex.  */
  static const yytype_int8 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,     2,     2,     2,     2,     2,     2,     2,
        30,    31,     2,     2,     2,     2,     2,     2,     2,     2,
         2,     2,     2,     2,     2,     2,     2,     2,     2,    32,
         2,    33,     2,     2,     2,     2,     2,     2,     2,     2,
         2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
         2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
         2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
         2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
         2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
         2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
         2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
         2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
         2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
         2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
         2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
         2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
         2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
         2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
         2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
         2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
         2,     2,     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,    14,
        15,    16,    17,    18,    19,    20,    21,    22,    23,    24,
        25,    26,    27,    28,    29
  };
  
  #if YYDEBUG
    /* YYRLINE[YYN] -- Source line where rule number YYN was defined.  */
  static const yytype_int8 yyrline[] =
  {
         0,    50,    50,    56,    62,    63,    68,    69,    70,    71,
        72,    73,    74,    75,    81,    82,    85,    88,    91,    96,
        97,    98,    99,   100,   101,   102,   103,   104,   105,   106,
       107,   108
  };
  #endif
  
  /** Accessing symbol of state STATE.  */
  #define YY_ACCESSING_SYMBOL(State) YY_CAST (yysymbol_kind_t, yystos[State])
  
  #if 1
  /* The user-facing name of the symbol whose (internal) number is
     YYSYMBOL.  No bounds checking.  */
  static const char *yysymbol_name (yysymbol_kind_t yysymbol) YY_ATTRIBUTE_UNUSED;
  
  /* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.
     First, the terminals, then, starting at YYNTOKENS, nonterminals.  */
  static const char *const yytname[] =
  {
    "\"end of file\"", "error", "\"invalid token\"", "NODE_NUM",
    "NODE_PLUS", "NODE_MINUS", "NODE_MUL", "NODE_DIV", "NODE_OP", "NODE_GRT",
    "NODE_LES", "NODE_GEQ", "NODE_LEQ", "NODE_NEQUALS", "NODE_EQUALS",
    "NODE_ID", "NODE_CONNECT", "NODE_BEGIN", "NODE_END", "NODE_BREAK",
    "NODE_CONTINUE", "NODE_ENDWHILE", "NODE_DO", "NODE_WHILE", "NODE_IF",
    "NODE_THEN", "NODE_ELSE", "NODE_ENDIF", "NODE_READ", "NODE_WRITE", "'('",
    "')'", "';'", "'='", "$accept", "Program", "Slist", "Stmt", "CntStmnt",
    "BrkStmnt", "InputStmt", "OutputStmt", "AsgStmt", "expr", YY_NULLPTR
  };
  
  static const char *
  yysymbol_name (yysymbol_kind_t yysymbol)
  {
    return yytname[yysymbol];
  }
  #endif
  
  #ifdef YYPRINT
  /* YYTOKNUM[NUM] -- (External) token number corresponding to the
     (internal) symbol number NUM (which must be that of a token).  */
  static const yytype_int16 yytoknum[] =
  {
         0,   256,   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,   282,   283,   284,
        40,    41,    59,    61
  };
  #endif
  
  #define YYPACT_NINF (-27)
  
  #define yypact_value_is_default(Yyn) \
    ((Yyn) == YYPACT_NINF)
  
  #define YYTABLE_NINF (-1)
  
  #define yytable_value_is_error(Yyn) \
    ((Yyn) == YYTABLE_NINF)
  
    /* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
       STATE-NUM.  */
  static const yytype_int16 yypact[] =
  {
       -12,   102,    16,     3,   -27,    19,    22,    23,    25,    28,
        29,   109,   -27,   -27,   -27,   -27,   -27,   -27,   -27,    71,
       -27,   -27,    71,    71,    45,    71,   -27,   -27,   -27,   -27,
        71,    -3,     8,    21,    30,    36,    59,    71,    71,    71,
        71,    71,    71,    71,    71,    71,    71,   -27,    53,    55,
        46,    49,   -27,    17,    17,   -27,   -27,   164,   164,   164,
       164,   164,   164,   138,   138,   -27,   -27,   120,    87,    50,
       138,    51,   -27,   127,   -27,    56,   -27
  };
  
    /* YYDEFACT[STATE-NUM] -- Default reduction number in state STATE-NUM.
       Performed when YYTABLE does not specify something else to do.  Zero
       means the default is an error.  */
  static const yytype_int8 yydefact[] =
  {
         0,     0,     0,     0,     3,     0,     0,     0,     0,     0,
         0,     0,     5,     9,    10,     6,     7,     8,     1,     0,
        15,    14,     0,     0,     0,     0,     2,     4,    31,    30,
         0,     0,     0,     0,     0,     0,     0,     0,     0,     0,
         0,     0,     0,     0,     0,     0,     0,    18,     0,     0,
         0,     0,    29,    25,    26,    27,    28,    19,    20,    21,
        22,    23,    24,     0,     0,    16,    17,     0,     0,     0,
         0,     0,    11,     0,    13,     0,    12
  };
  
    /* YYPGOTO[NTERM-NUM].  */
  static const yytype_int8 yypgoto[] =
  {
       -27,   -27,   -26,   -11,   -27,   -27,   -27,   -27,   -27,    54
  };
  
    /* YYDEFGOTO[NTERM-NUM].  */
  static const yytype_int8 yydefgoto[] =
  {
        -1,     2,    11,    12,    13,    14,    15,    16,    17,    31
  };
  
    /* YYTABLE[YYPACT[STATE-NUM]] -- What to do in state STATE-NUM.  If
       positive, shift that token.  If negative, reduce the rule whose
       number is the opposite.  If YYTABLE_NINF, syntax error.  */
  static const yytype_int8 yytable[] =
  {
        27,    37,    38,    39,    40,     1,    41,    42,    43,    44,
        45,    46,    37,    38,    39,    40,    18,    41,    42,    43,
        44,    45,    46,    39,    40,    37,    38,    39,    40,    47,
        41,    42,    43,    44,    45,    46,    19,    67,    68,    48,
        37,    38,    39,    40,    73,    41,    42,    43,    44,    45,
        46,    20,    49,    22,    21,    23,    27,    27,    24,    25,
        34,    50,    27,    37,    38,    39,    40,    51,    41,    42,
        43,    44,    45,    46,    28,    63,    32,    33,    65,    35,
        64,    66,    72,    74,    36,     0,    29,     0,    76,     0,
        52,    53,    54,    55,    56,    57,    58,    59,    60,    61,
        62,    30,     3,     0,     0,     0,     5,     6,     0,     0,
         7,     8,     0,    70,    71,     9,    10,     3,     0,     0,
         4,     5,     6,     0,     3,     7,     8,    26,     5,     6,
         9,    10,     7,     8,     0,     3,     0,     9,    10,     5,
         6,    69,     3,     7,     8,     0,     5,     6,     9,    10,
         7,     8,     0,     3,    75,     9,    10,     5,     6,     0,
         0,     7,     8,     0,     0,     0,     9,    10,    37,    38,
        39,    40,     0,    -1,    -1,    -1,    -1,    -1,    -1
  };
  
  static const yytype_int8 yycheck[] =
  {
        11,     4,     5,     6,     7,    17,     9,    10,    11,    12,
        13,    14,     4,     5,     6,     7,     0,     9,    10,    11,
        12,    13,    14,     6,     7,     4,     5,     6,     7,    32,
         9,    10,    11,    12,    13,    14,    33,    63,    64,    31,
         4,     5,     6,     7,    70,     9,    10,    11,    12,    13,
        14,    32,    31,    30,    32,    30,    67,    68,    30,    30,
        15,    31,    73,     4,     5,     6,     7,    31,     9,    10,
        11,    12,    13,    14,     3,    22,    22,    23,    32,    25,
        25,    32,    32,    32,    30,    -1,    15,    -1,    32,    -1,
        31,    37,    38,    39,    40,    41,    42,    43,    44,    45,
        46,    30,    15,    -1,    -1,    -1,    19,    20,    -1,    -1,
        23,    24,    -1,    26,    27,    28,    29,    15,    -1,    -1,
        18,    19,    20,    -1,    15,    23,    24,    18,    19,    20,
        28,    29,    23,    24,    -1,    15,    -1,    28,    29,    19,
        20,    21,    15,    23,    24,    -1,    19,    20,    28,    29,
        23,    24,    -1,    15,    27,    28,    29,    19,    20,    -1,
        -1,    23,    24,    -1,    -1,    -1,    28,    29,     4,     5,
         6,     7,    -1,     9,    10,    11,    12,    13,    14
  };
  
    /* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
       symbol of state STATE-NUM.  */
  static const yytype_int8 yystos[] =
  {
         0,    17,    35,    15,    18,    19,    20,    23,    24,    28,
        29,    36,    37,    38,    39,    40,    41,    42,     0,    33,
        32,    32,    30,    30,    30,    30,    18,    37,     3,    15,
        30,    43,    43,    43,    15,    43,    43,     4,     5,     6,
         7,     9,    10,    11,    12,    13,    14,    32,    31,    31,
        31,    31,    31,    43,    43,    43,    43,    43,    43,    43,
        43,    43,    43,    22,    25,    32,    32,    36,    36,    21,
        26,    27,    32,    36,    32,    27,    32
  };
  
    /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives.  */
  static const yytype_int8 yyr1[] =
  {
         0,    34,    35,    35,    36,    36,    37,    37,    37,    37,
        37,    37,    37,    37,    38,    39,    40,    41,    42,    43,
        43,    43,    43,    43,    43,    43,    43,    43,    43,    43,
        43,    43
  };
  
    /* YYR2[YYN] -- Number of symbols on the right hand side of rule YYN.  */
  static const yytype_int8 yyr2[] =
  {
         0,     2,     3,     2,     2,     1,     1,     1,     1,     1,
         1,     8,    10,     8,     2,     2,     5,     5,     4,     3,
         3,     3,     3,     3,     3,     3,     3,     3,     3,     3,
         1,     1
  };
  
  
  enum { YYENOMEM = -2 };
  
  #define yyerrok         (yyerrstatus = 0)
  #define yyclearin       (yychar = YYEMPTY)
  
  #define YYACCEPT        goto yyacceptlab
  #define YYABORT         goto yyabortlab
  #define YYERROR         goto yyerrorlab
  
  
  #define YYRECOVERING()  (!!yyerrstatus)
  
  #define YYBACKUP(Token, Value)                                    \
    do                                                              \
      if (yychar == YYEMPTY)                                        \
        {                                                           \
          yychar = (Token);                                         \
          yylval = (Value);                                         \
          YYPOPSTACK (yylen);                                       \
          yystate = *yyssp;                                         \
          goto yybackup;                                            \
        }                                                           \
      else                                                          \
        {                                                           \
          yyerror (YY_("syntax error: cannot back up")); \
          YYERROR;                                                  \
        }                                                           \
    while (0)
  
  /* Backward compatibility with an undocumented macro.
     Use YYerror or YYUNDEF. */
  #define YYERRCODE YYUNDEF
  
  
  /* Enable debugging if requested.  */
  #if YYDEBUG
  
  # ifndef YYFPRINTF
  #  include <stdio.h> /* INFRINGES ON USER NAME SPACE */
  #  define YYFPRINTF fprintf
  # endif
  
  # define YYDPRINTF(Args)                        \
  do {                                            \
    if (yydebug)                                  \
      YYFPRINTF Args;                             \
  } while (0)
  
  /* This macro is provided for backward compatibility. */
  # ifndef YY_LOCATION_PRINT
  #  define YY_LOCATION_PRINT(File, Loc) ((void) 0)
  # endif
  
  
  # define YY_SYMBOL_PRINT(Title, Kind, Value, Location)                    \
  do {                                                                      \
    if (yydebug)                                                            \
      {                                                                     \
        YYFPRINTF (stderr, "%s ", Title);                                   \
        yy_symbol_print (stderr,                                            \
                    Kind, Value); \
        YYFPRINTF (stderr, "\n");                                           \
      }                                                                     \
  } while (0)
  
  
  /*-----------------------------------.
  | Print this symbol's value on YYO.  |
  `-----------------------------------*/
  
  static void
  yy_symbol_value_print (FILE *yyo,
                         yysymbol_kind_t yykind, YYSTYPE const * const yyvaluep)
  {
    FILE *yyoutput = yyo;
    YYUSE (yyoutput);
    if (!yyvaluep)
      return;
  # ifdef YYPRINT
    if (yykind < YYNTOKENS)
      YYPRINT (yyo, yytoknum[yykind], *yyvaluep);
  # endif
    YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
    YYUSE (yykind);
    YY_IGNORE_MAYBE_UNINITIALIZED_END
  }
  
  
  /*---------------------------.
  | Print this symbol on YYO.  |
  `---------------------------*/
  
  static void
  yy_symbol_print (FILE *yyo,
                   yysymbol_kind_t yykind, YYSTYPE const * const yyvaluep)
  {
    YYFPRINTF (yyo, "%s %s (",
               yykind < YYNTOKENS ? "token" : "nterm", yysymbol_name (yykind));
  
    yy_symbol_value_print (yyo, yykind, yyvaluep);
    YYFPRINTF (yyo, ")");
  }
  
  /*------------------------------------------------------------------.
  | yy_stack_print -- Print the state stack from its BOTTOM up to its |
  | TOP (included).                                                   |
  `------------------------------------------------------------------*/
  
  static void
  yy_stack_print (yy_state_t *yybottom, yy_state_t *yytop)
  {
    YYFPRINTF (stderr, "Stack now");
    for (; yybottom <= yytop; yybottom++)
      {
        int yybot = *yybottom;
        YYFPRINTF (stderr, " %d", yybot);
      }
    YYFPRINTF (stderr, "\n");
  }
  
  # define YY_STACK_PRINT(Bottom, Top)                            \
  do {                                                            \
    if (yydebug)                                                  \
      yy_stack_print ((Bottom), (Top));                           \
  } while (0)
  
  
  /*------------------------------------------------.
  | Report that the YYRULE is going to be reduced.  |
  `------------------------------------------------*/
  
  static void
  yy_reduce_print (yy_state_t *yyssp, YYSTYPE *yyvsp,
                   int yyrule)
  {
    int yylno = yyrline[yyrule];
    int yynrhs = yyr2[yyrule];
    int yyi;
    YYFPRINTF (stderr, "Reducing stack by rule %d (line %d):\n",
               yyrule - 1, yylno);
    /* The symbols being reduced.  */
    for (yyi = 0; yyi < yynrhs; yyi++)
      {
        YYFPRINTF (stderr, "   $%d = ", yyi + 1);
        yy_symbol_print (stderr,
                         YY_ACCESSING_SYMBOL (+yyssp[yyi + 1 - yynrhs]),
                         &yyvsp[(yyi + 1) - (yynrhs)]);
        YYFPRINTF (stderr, "\n");
      }
  }
  
  # define YY_REDUCE_PRINT(Rule)          \
  do {                                    \
    if (yydebug)                          \
      yy_reduce_print (yyssp, yyvsp, Rule); \
  } while (0)
  
  /* Nonzero means print parse trace.  It is left uninitialized so that
     multiple parsers can coexist.  */
  int yydebug;
  #else /* !YYDEBUG */
  # define YYDPRINTF(Args) ((void) 0)
  # define YY_SYMBOL_PRINT(Title, Kind, Value, Location)
  # define YY_STACK_PRINT(Bottom, Top)
  # define YY_REDUCE_PRINT(Rule)
  #endif /* !YYDEBUG */
  
  
  /* YYINITDEPTH -- initial size of the parser's stacks.  */
  #ifndef YYINITDEPTH
  # define YYINITDEPTH 200
  #endif
  
  /* YYMAXDEPTH -- maximum size the stacks can grow to (effective only
     if the built-in stack extension method is used).
  
     Do not make this value too large; the results are undefined if
     YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH)
     evaluated with infinite-precision integer arithmetic.  */
  
  #ifndef YYMAXDEPTH
  # define YYMAXDEPTH 10000
  #endif
  
  
  /* Context of a parse error.  */
  typedef struct
  {
    yy_state_t *yyssp;
    yysymbol_kind_t yytoken;
  } yypcontext_t;
  
  /* Put in YYARG at most YYARGN of the expected tokens given the
     current YYCTX, and return the number of tokens stored in YYARG.  If
     YYARG is null, return the number of expected tokens (guaranteed to
     be less than YYNTOKENS).  Return YYENOMEM on memory exhaustion.
     Return 0 if there are more than YYARGN expected tokens, yet fill
     YYARG up to YYARGN. */
  static int
  yypcontext_expected_tokens (const yypcontext_t *yyctx,
                              yysymbol_kind_t yyarg[], int yyargn)
  {
    /* Actual size of YYARG. */
    int yycount = 0;
    int yyn = yypact[+*yyctx->yyssp];
    if (!yypact_value_is_default (yyn))
      {
        /* Start YYX at -YYN if negative to avoid negative indexes in
           YYCHECK.  In other words, skip the first -YYN actions for
           this state because they are default actions.  */
        int yyxbegin = yyn < 0 ? -yyn : 0;
        /* Stay within bounds of both yycheck and yytname.  */
        int yychecklim = YYLAST - yyn + 1;
        int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS;
        int yyx;
        for (yyx = yyxbegin; yyx < yyxend; ++yyx)
          if (yycheck[yyx + yyn] == yyx && yyx != YYSYMBOL_YYerror
              && !yytable_value_is_error (yytable[yyx + yyn]))
            {
              if (!yyarg)
                ++yycount;
              else if (yycount == yyargn)
                return 0;
              else
                yyarg[yycount++] = YY_CAST (yysymbol_kind_t, yyx);
            }
      }
    if (yyarg && yycount == 0 && 0 < yyargn)
      yyarg[0] = YYSYMBOL_YYEMPTY;
    return yycount;
  }
  
  
  
  
  #ifndef yystrlen
  # if defined __GLIBC__ && defined _STRING_H
  #  define yystrlen(S) (YY_CAST (YYPTRDIFF_T, strlen (S)))
  # else
  /* Return the length of YYSTR.  */
  static YYPTRDIFF_T
  yystrlen (const char *yystr)
  {
    YYPTRDIFF_T yylen;
    for (yylen = 0; yystr[yylen]; yylen++)
      continue;
    return yylen;
  }
  # endif
  #endif
  
  #ifndef yystpcpy
  # if defined __GLIBC__ && defined _STRING_H && defined _GNU_SOURCE
  #  define yystpcpy stpcpy
  # else
  /* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in
     YYDEST.  */
  static char *
  yystpcpy (char *yydest, const char *yysrc)
  {
    char *yyd = yydest;
    const char *yys = yysrc;
  
    while ((*yyd++ = *yys++) != '\0')
      continue;
  
    return yyd - 1;
  }
  # endif
  #endif
  
  #ifndef yytnamerr
  /* Copy to YYRES the contents of YYSTR after stripping away unnecessary
     quotes and backslashes, so that it's suitable for yyerror.  The
     heuristic is that double-quoting is unnecessary unless the string
     contains an apostrophe, a comma, or backslash (other than
     backslash-backslash).  YYSTR is taken from yytname.  If YYRES is
     null, do not copy; instead, return the length of what the result
     would have been.  */
  static YYPTRDIFF_T
  yytnamerr (char *yyres, const char *yystr)
  {
    if (*yystr == '"')
      {
        YYPTRDIFF_T yyn = 0;
        char const *yyp = yystr;
        for (;;)
          switch (*++yyp)
            {
            case '\'':
            case ',':
              goto do_not_strip_quotes;
  
            case '\\':
              if (*++yyp != '\\')
                goto do_not_strip_quotes;
              else
                goto append;
  
            append:
            default:
              if (yyres)
                yyres[yyn] = *yyp;
              yyn++;
              break;
  
            case '"':
              if (yyres)
                yyres[yyn] = '\0';
              return yyn;
            }
      do_not_strip_quotes: ;
      }
  
    if (yyres)
      return yystpcpy (yyres, yystr) - yyres;
    else
      return yystrlen (yystr);
  }
  #endif
  
  
  static int
  yy_syntax_error_arguments (const yypcontext_t *yyctx,
                             yysymbol_kind_t yyarg[], int yyargn)
  {
    /* Actual size of YYARG. */
    int yycount = 0;
    /* There are many possibilities here to consider:
       - If this state is a consistent state with a default action, then
         the only way this function was invoked is if the default action
         is an error action.  In that case, don't check for expected
         tokens because there are none.
       - The only way there can be no lookahead present (in yychar) is if
         this state is a consistent state with a default action.  Thus,
         detecting the absence of a lookahead is sufficient to determine
         that there is no unexpected or expected token to report.  In that
         case, just report a simple "syntax error".
       - Don't assume there isn't a lookahead just because this state is a
         consistent state with a default action.  There might have been a
         previous inconsistent state, consistent state with a non-default
         action, or user semantic action that manipulated yychar.
       - Of course, the expected token list depends on states to have
         correct lookahead information, and it depends on the parser not
         to perform extra reductions after fetching a lookahead from the
         scanner and before detecting a syntax error.  Thus, state merging
         (from LALR or IELR) and default reductions corrupt the expected
         token list.  However, the list is correct for canonical LR with
         one exception: it will still contain any token that will not be
         accepted due to an error action in a later state.
    */
    if (yyctx->yytoken != YYSYMBOL_YYEMPTY)
      {
        int yyn;
        if (yyarg)
          yyarg[yycount] = yyctx->yytoken;
        ++yycount;
        yyn = yypcontext_expected_tokens (yyctx,
                                          yyarg ? yyarg + 1 : yyarg, yyargn - 1);
        if (yyn == YYENOMEM)
          return YYENOMEM;
        else
          yycount += yyn;
      }
    return yycount;
  }
  
  /* Copy into *YYMSG, which is of size *YYMSG_ALLOC, an error message
     about the unexpected token YYTOKEN for the state stack whose top is
     YYSSP.
  
     Return 0 if *YYMSG was successfully written.  Return -1 if *YYMSG is
     not large enough to hold the message.  In that case, also set
     *YYMSG_ALLOC to the required number of bytes.  Return YYENOMEM if the
     required number of bytes is too large to store.  */
  static int
  yysyntax_error (YYPTRDIFF_T *yymsg_alloc, char **yymsg,
                  const yypcontext_t *yyctx)
  {
    enum { YYARGS_MAX = 5 };
    /* Internationalized format string. */
    const char *yyformat = YY_NULLPTR;
    /* Arguments of yyformat: reported tokens (one for the "unexpected",
       one per "expected"). */
    yysymbol_kind_t yyarg[YYARGS_MAX];
    /* Cumulated lengths of YYARG.  */
    YYPTRDIFF_T yysize = 0;
  
    /* Actual size of YYARG. */
    int yycount = yy_syntax_error_arguments (yyctx, yyarg, YYARGS_MAX);
    if (yycount == YYENOMEM)
      return YYENOMEM;
  
    switch (yycount)
      {
  #define YYCASE_(N, S)                       \
        case N:                               \
          yyformat = S;                       \
          break
      default: /* Avoid compiler warnings. */
        YYCASE_(0, YY_("syntax error"));
        YYCASE_(1, YY_("syntax error, unexpected %s"));
        YYCASE_(2, YY_("syntax error, unexpected %s, expecting %s"));
        YYCASE_(3, YY_("syntax error, unexpected %s, expecting %s or %s"));
        YYCASE_(4, YY_("syntax error, unexpected %s, expecting %s or %s or %s"));
        YYCASE_(5, YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s"));
  #undef YYCASE_
      }
  
    /* Compute error message size.  Don't count the "%s"s, but reserve
       room for the terminator.  */
    yysize = yystrlen (yyformat) - 2 * yycount + 1;
    {
      int yyi;
      for (yyi = 0; yyi < yycount; ++yyi)
        {
          YYPTRDIFF_T yysize1
            = yysize + yytnamerr (YY_NULLPTR, yytname[yyarg[yyi]]);
          if (yysize <= yysize1 && yysize1 <= YYSTACK_ALLOC_MAXIMUM)
            yysize = yysize1;
          else
            return YYENOMEM;
        }
    }
  
    if (*yymsg_alloc < yysize)
      {
        *yymsg_alloc = 2 * yysize;
        if (! (yysize <= *yymsg_alloc
               && *yymsg_alloc <= YYSTACK_ALLOC_MAXIMUM))
          *yymsg_alloc = YYSTACK_ALLOC_MAXIMUM;
        return -1;
      }
  
    /* Avoid sprintf, as that infringes on the user's name space.
       Don't have undefined behavior even if the translation
       produced a string with the wrong number of "%s"s.  */
    {
      char *yyp = *yymsg;
      int yyi = 0;
      while ((*yyp = *yyformat) != '\0')
        if (*yyp == '%' && yyformat[1] == 's' && yyi < yycount)
          {
            yyp += yytnamerr (yyp, yytname[yyarg[yyi++]]);
            yyformat += 2;
          }
        else
          {
            ++yyp;
            ++yyformat;
          }
    }
    return 0;
  }
  
  
  /*-----------------------------------------------.
  | Release the memory associated to this symbol.  |
  `-----------------------------------------------*/
  
  static void
  yydestruct (const char *yymsg,
              yysymbol_kind_t yykind, YYSTYPE *yyvaluep)
  {
    YYUSE (yyvaluep);
    if (!yymsg)
      yymsg = "Deleting";
    YY_SYMBOL_PRINT (yymsg, yykind, yyvaluep, yylocationp);
  
    YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
    YYUSE (yykind);
    YY_IGNORE_MAYBE_UNINITIALIZED_END
  }
  
  
  /* Lookahead token kind.  */
  int yychar;
  
  /* The semantic value of the lookahead symbol.  */
  YYSTYPE yylval;
  /* Number of syntax errors so far.  */
  int yynerrs;
  
  
  
  
  /*----------.
  | yyparse.  |
  `----------*/
  
  int
  yyparse (void)
  {
      yy_state_fast_t yystate = 0;
      /* Number of tokens to shift before error messages enabled.  */
      int yyerrstatus = 0;
  
      /* Refer to the stacks through separate pointers, to allow yyoverflow
         to reallocate them elsewhere.  */
  
      /* Their size.  */
      YYPTRDIFF_T yystacksize = YYINITDEPTH;
  
      /* The state stack: array, bottom, top.  */
      yy_state_t yyssa[YYINITDEPTH];
      yy_state_t *yyss = yyssa;
      yy_state_t *yyssp = yyss;
  
      /* The semantic value stack: array, bottom, top.  */
      YYSTYPE yyvsa[YYINITDEPTH];
      YYSTYPE *yyvs = yyvsa;
      YYSTYPE *yyvsp = yyvs;
  
    int yyn;
    /* The return value of yyparse.  */
    int yyresult;
    /* Lookahead symbol kind.  */
    yysymbol_kind_t yytoken = YYSYMBOL_YYEMPTY;
    /* The variables used to return semantic value and location from the
       action routines.  */
    YYSTYPE yyval;
  
    /* Buffer for error messages, and its allocated size.  */
    char yymsgbuf[128];
    char *yymsg = yymsgbuf;
    YYPTRDIFF_T yymsg_alloc = sizeof yymsgbuf;
  
  #define YYPOPSTACK(N)   (yyvsp -= (N), yyssp -= (N))
  
    /* The number of symbols on the RHS of the reduced rule.
       Keep to zero when no symbol should be popped.  */
    int yylen = 0;
  
    YYDPRINTF ((stderr, "Starting parse\n"));
  
    yychar = YYEMPTY; /* Cause a token to be read.  */
    goto yysetstate;
  
  
  /*------------------------------------------------------------.
  | yynewstate -- push a new state, which is found in yystate.  |
  `------------------------------------------------------------*/
  yynewstate:
    /* In all cases, when you get here, the value and location stacks
       have just been pushed.  So pushing a state here evens the stacks.  */
    yyssp++;
  
  
  /*--------------------------------------------------------------------.
  | yysetstate -- set current state (the top of the stack) to yystate.  |
  `--------------------------------------------------------------------*/
  yysetstate:
    YYDPRINTF ((stderr, "Entering state %d\n", yystate));
    YY_ASSERT (0 <= yystate && yystate < YYNSTATES);
    YY_IGNORE_USELESS_CAST_BEGIN
    *yyssp = YY_CAST (yy_state_t, yystate);
    YY_IGNORE_USELESS_CAST_END
    YY_STACK_PRINT (yyss, yyssp);
  
    if (yyss + yystacksize - 1 <= yyssp)
  #if !defined yyoverflow && !defined YYSTACK_RELOCATE
      goto yyexhaustedlab;
  #else
      {
        /* Get the current used size of the three stacks, in elements.  */
        YYPTRDIFF_T yysize = yyssp - yyss + 1;
  
  # if defined yyoverflow
        {
          /* Give user a chance to reallocate the stack.  Use copies of
             these so that the &'s don't force the real ones into
             memory.  */
          yy_state_t *yyss1 = yyss;
          YYSTYPE *yyvs1 = yyvs;
  
          /* Each stack pointer address is followed by the size of the
             data in use in that stack, in bytes.  This used to be a
             conditional around just the two extra args, but that might
             be undefined if yyoverflow is a macro.  */
          yyoverflow (YY_("memory exhausted"),
                      &yyss1, yysize * YYSIZEOF (*yyssp),
                      &yyvs1, yysize * YYSIZEOF (*yyvsp),
                      &yystacksize);
          yyss = yyss1;
          yyvs = yyvs1;
        }
  # else /* defined YYSTACK_RELOCATE */
        /* Extend the stack our own way.  */
        if (YYMAXDEPTH <= yystacksize)
          goto yyexhaustedlab;
        yystacksize *= 2;
        if (YYMAXDEPTH < yystacksize)
          yystacksize = YYMAXDEPTH;
  
        {
          yy_state_t *yyss1 = yyss;
          union yyalloc *yyptr =
            YY_CAST (union yyalloc *,
                     YYSTACK_ALLOC (YY_CAST (YYSIZE_T, YYSTACK_BYTES (yystacksize))));
          if (! yyptr)
            goto yyexhaustedlab;
          YYSTACK_RELOCATE (yyss_alloc, yyss);
          YYSTACK_RELOCATE (yyvs_alloc, yyvs);
  #  undef YYSTACK_RELOCATE
          if (yyss1 != yyssa)
            YYSTACK_FREE (yyss1);
        }
  # endif
  
        yyssp = yyss + yysize - 1;
        yyvsp = yyvs + yysize - 1;
  
        YY_IGNORE_USELESS_CAST_BEGIN
        YYDPRINTF ((stderr, "Stack size increased to %ld\n",
                    YY_CAST (long, yystacksize)));
        YY_IGNORE_USELESS_CAST_END
  
        if (yyss + yystacksize - 1 <= yyssp)
          YYABORT;
      }
  #endif /* !defined yyoverflow && !defined YYSTACK_RELOCATE */
  
    if (yystate == YYFINAL)
      YYACCEPT;
  
    goto yybackup;
  
  
  /*-----------.
  | yybackup.  |
  `-----------*/
  yybackup:
    /* Do appropriate processing given the current state.  Read a
       lookahead token if we need one and don't already have one.  */
  
    /* First try to decide what to do without reference to lookahead token.  */
    yyn = yypact[yystate];
    if (yypact_value_is_default (yyn))
      goto yydefault;
  
    /* Not known => get a lookahead token if don't already have one.  */
  
    /* YYCHAR is either empty, or end-of-input, or a valid lookahead.  */
    if (yychar == YYEMPTY)
      {
        YYDPRINTF ((stderr, "Reading a token\n"));
        yychar = yylex ();
      }
  
    if (yychar <= YYEOF)
      {
        yychar = YYEOF;
        yytoken = YYSYMBOL_YYEOF;
        YYDPRINTF ((stderr, "Now at end of input.\n"));
      }
    else if (yychar == YYerror)
      {
        /* The scanner already issued an error message, process directly
           to error recovery.  But do not keep the error token as
           lookahead, it is too special and may lead us to an endless
           loop in error recovery. */
        yychar = YYUNDEF;
        yytoken = YYSYMBOL_YYerror;
        goto yyerrlab1;
      }
    else
      {
        yytoken = YYTRANSLATE (yychar);
        YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc);
      }
  
    /* If the proper action on seeing token YYTOKEN is to reduce or to
       detect an error, take that action.  */
    yyn += yytoken;
    if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken)
      goto yydefault;
    yyn = yytable[yyn];
    if (yyn <= 0)
      {
        if (yytable_value_is_error (yyn))
          goto yyerrlab;
        yyn = -yyn;
        goto yyreduce;
      }
  
    /* Count tokens shifted since error; after three, turn off error
       status.  */
    if (yyerrstatus)
      yyerrstatus--;
  
    /* Shift the lookahead token.  */
    YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc);
    yystate = yyn;
    YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
    *++yyvsp = yylval;
    YY_IGNORE_MAYBE_UNINITIALIZED_END
  
    /* Discard the shifted token.  */
    yychar = YYEMPTY;
    goto yynewstate;
  
  
  /*-----------------------------------------------------------.
  | yydefault -- do the default action for the current state.  |
  `-----------------------------------------------------------*/
  yydefault:
    yyn = yydefact[yystate];
    if (yyn == 0)
      goto yyerrlab;
    goto yyreduce;
  
  
  /*-----------------------------.
  | yyreduce -- do a reduction.  |
  `-----------------------------*/
  yyreduce:
    /* yyn is the number of a rule to reduce with.  */
    yylen = yyr2[yyn];
  
    /* If YYLEN is nonzero, implement the default value of the action:
       '$$ = $1'.
  
       Otherwise, the following line sets YYVAL to garbage.
       This behavior is undocumented and Bison
       users should not rely upon it.  Assigning to YYVAL
       unconditionally makes the parser a bit smaller, and it avoids a
       GCC warning that YYVAL may be used uninitialized.  */
    yyval = yyvsp[1-yylen];
  
  
    YY_REDUCE_PRINT (yyn);
    switch (yyn)
      {
    case 2: /* Program: NODE_BEGIN Slist NODE_END  */
  #line 50 "exptree.y"
                                      {
  				(yyval.no) = (yyvsp[-1].no);
  				evaluate((yyvsp[-1].no),code);
  				//printf($2);
  				exit(0);}
  #line 1553 "y.tab.c"
      break;
  
    case 3: /* Program: NODE_BEGIN NODE_END  */
  #line 56 "exptree.y"
                                        {(yyval.no) = NULL;}
  #line 1559 "y.tab.c"
      break;
  
    case 4: /* Slist: Slist Stmt  */
  #line 62 "exptree.y"
                     {(yyval.no) = createTree(0 ,0,CONNECT ,NULL, (yyvsp[-1].no), (yyvsp[0].no));}
  #line 1565 "y.tab.c"
      break;
  
    case 5: /* Slist: Stmt  */
  #line 63 "exptree.y"
                       {(yyval.no) = (yyvsp[0].no);}
  #line 1571 "y.tab.c"
      break;
  
    case 6: /* Stmt: InputStmt  */
  #line 68 "exptree.y"
                   {(yyval.no) = (yyvsp[0].no);}
  #line 1577 "y.tab.c"
      break;
  
    case 7: /* Stmt: OutputStmt  */
  #line 69 "exptree.y"
                       {(yyval.no) = (yyvsp[0].no);}
  #line 1583 "y.tab.c"
      break;
  
    case 8: /* Stmt: AsgStmt  */
  #line 70 "exptree.y"
                    {(yyval.no) = (yyvsp[0].no);}
  #line 1589 "y.tab.c"
      break;
  
    case 9: /* Stmt: CntStmnt  */
  #line 71 "exptree.y"
                     {(yyval.no) = (yyvsp[0].no);}
  #line 1595 "y.tab.c"
      break;
  
    case 10: /* Stmt: BrkStmnt  */
  #line 72 "exptree.y"
                     {(yyval.no) = (yyvsp[0].no);}
  #line 1601 "y.tab.c"
      break;
  
    case 11: /* Stmt: NODE_WHILE '(' expr ')' NODE_DO Slist NODE_ENDWHILE ';'  */
  #line 73 "exptree.y"
                                                                 {(yyval.no) = createTree(0 ,0,WHILE ,NULL,(yyvsp[-5].no), (yyvsp[-2].no));}
  #line 1607 "y.tab.c"
      break;
  
    case 12: /* Stmt: NODE_IF '(' expr ')' NODE_THEN Slist NODE_ELSE Slist NODE_ENDIF ';'  */
  #line 74 "exptree.y"
                                                                             {(yyval.no) = createTree(0 ,IF_DOUBLE,IF ,NULL,(yyvsp[-7].no), createTree(0 ,0,CONNECT ,NULL, (yyvsp[-4].no), (yyvsp[-2].no)));}
  #line 1613 "y.tab.c"
      break;
  
    case 13: /* Stmt: NODE_IF '(' expr ')' NODE_THEN Slist NODE_ENDIF ';'  */
  #line 75 "exptree.y"
                                                             {(yyval.no) = createTree(0 ,IF_SINGLE,IF ,NULL,(yyvsp[-5].no), (yyvsp[-2].no));}
  #line 1619 "y.tab.c"
      break;
  
    case 14: /* CntStmnt: NODE_CONTINUE ';'  */
  #line 81 "exptree.y"
                              {(yyval.no) = createTree(0 ,0,CONTINUE ,NULL, NULL, NULL);}
  #line 1625 "y.tab.c"
      break;
  
    case 15: /* BrkStmnt: NODE_BREAK ';'  */
  #line 82 "exptree.y"
                           {(yyval.no) = createTree(0 ,0,BREAK ,NULL, NULL, NULL);}
  #line 1631 "y.tab.c"
      break;
  
    case 16: /* InputStmt: NODE_READ '(' NODE_ID ')' ';'  */
  #line 85 "exptree.y"
                                          {(yyval.no) = createTree(0 ,0,READ ,NULL, (yyvsp[-2].no), NULL);}
  #line 1637 "y.tab.c"
      break;
  
    case 17: /* OutputStmt: NODE_WRITE '(' expr ')' ';'  */
  #line 88 "exptree.y"
                                          {(yyval.no) = createTree(0 ,0,WRITE ,NULL, (yyvsp[-2].no), NULL);}
  #line 1643 "y.tab.c"
      break;
  
    case 18: /* AsgStmt: NODE_ID '=' expr ';'  */
  #line 91 "exptree.y"
                                                  {(yyval.no) = createTree(0 ,0,ASSIGN ,"=", (yyvsp[-3].no), (yyvsp[-1].no));}
  #line 1649 "y.tab.c"
      break;
  
    case 19: /* expr: expr NODE_GRT expr  */
  #line 96 "exptree.y"
                                                  {(yyval.no) = createTree(0 ,BOOL_TYPE,LOGIC_OP ,"<", (yyvsp[-2].no), (yyvsp[0].no));}
  #line 1655 "y.tab.c"
      break;
  
    case 20: /* expr: expr NODE_LES expr  */
  #line 97 "exptree.y"
                                                  {(yyval.no) = createTree(0 ,BOOL_TYPE,LOGIC_OP ,">", (yyvsp[-2].no), (yyvsp[0].no));}
  #line 1661 "y.tab.c"
      break;
  
    case 21: /* expr: expr NODE_GEQ expr  */
  #line 98 "exptree.y"
                                                  {(yyval.no) = createTree(0 ,BOOL_TYPE,LOGIC_OP ,"<=", (yyvsp[-2].no), (yyvsp[0].no));}
  #line 1667 "y.tab.c"
      break;
  
    case 22: /* expr: expr NODE_LEQ expr  */
  #line 99 "exptree.y"
                                                  {(yyval.no) = createTree(0 ,BOOL_TYPE,LOGIC_OP ,">=", (yyvsp[-2].no), (yyvsp[0].no));}
  #line 1673 "y.tab.c"
      break;
  
    case 23: /* expr: expr NODE_NEQUALS expr  */
  #line 100 "exptree.y"
                                                          {(yyval.no) = createTree(0 ,BOOL_TYPE,LOGIC_OP ,"!=", (yyvsp[-2].no), (yyvsp[0].no));}
  #line 1679 "y.tab.c"
      break;
  
    case 24: /* expr: expr NODE_EQUALS expr  */
  #line 101 "exptree.y"
                                                          {(yyval.no) = createTree(0 ,BOOL_TYPE,LOGIC_OP ,"==", (yyvsp[-2].no), (yyvsp[0].no));}
  #line 1685 "y.tab.c"
      break;
  
    case 25: /* expr: expr NODE_PLUS expr  */
  #line 102 "exptree.y"
                                          {(yyval.no) = createTree(0 ,0,OP ,"+", (yyvsp[-2].no), (yyvsp[0].no));}
  #line 1691 "y.tab.c"
      break;
  
    case 26: /* expr: expr NODE_MINUS expr  */
  #line 103 "exptree.y"
                                          {(yyval.no) = createTree(0 ,0,OP ,"-", (yyvsp[-2].no), (yyvsp[0].no));}
  #line 1697 "y.tab.c"
      break;
  
    case 27: /* expr: expr NODE_MUL expr  */
  #line 104 "exptree.y"
                                          {(yyval.no) = createTree(0 ,0,OP ,"*", (yyvsp[-2].no), (yyvsp[0].no));}
  #line 1703 "y.tab.c"
      break;
  
    case 28: /* expr: expr NODE_DIV expr  */
  #line 105 "exptree.y"
                                          {(yyval.no) = createTree(0 ,0,OP ,"/", (yyvsp[-2].no), (yyvsp[0].no));}
  #line 1709 "y.tab.c"
      break;
  
    case 29: /* expr: '(' expr ')'  */
  #line 106 "exptree.y"
                                                  {(yyval.no) = (yyvsp[-1].no);}
  #line 1715 "y.tab.c"
      break;
  
    case 30: /* expr: NODE_ID  */
  #line 107 "exptree.y"
                                                          {(yyval.no) = (yyvsp[0].no);}
  #line 1721 "y.tab.c"
      break;
  
    case 31: /* expr: NODE_NUM  */
  #line 108 "exptree.y"
                                                          {(yyval.no) = (yyvsp[0].no);}
  #line 1727 "y.tab.c"
      break;
  
  
  #line 1731 "y.tab.c"
  
        default: break;
      }
    /* User semantic actions sometimes alter yychar, and that requires
       that yytoken be updated with the new translation.  We take the
       approach of translating immediately before every use of yytoken.
       One alternative is translating here after every semantic action,
       but that translation would be missed if the semantic action invokes
       YYABORT, YYACCEPT, or YYERROR immediately after altering yychar or
       if it invokes YYBACKUP.  In the case of YYABORT or YYACCEPT, an
       incorrect destructor might then be invoked immediately.  In the
       case of YYERROR or YYBACKUP, subsequent parser actions might lead
       to an incorrect destructor call or verbose syntax error message
       before the lookahead is translated.  */
    YY_SYMBOL_PRINT ("-> $$ =", YY_CAST (yysymbol_kind_t, yyr1[yyn]), &yyval, &yyloc);
  
    YYPOPSTACK (yylen);
    yylen = 0;
  
    *++yyvsp = yyval;
  
    /* 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.  */
    {
      const int yylhs = yyr1[yyn] - YYNTOKENS;
      const int yyi = yypgoto[yylhs] + *yyssp;
      yystate = (0 <= yyi && yyi <= YYLAST && yycheck[yyi] == *yyssp
                 ? yytable[yyi]
                 : yydefgoto[yylhs]);
    }
  
    goto yynewstate;
  
  
  /*--------------------------------------.
  | yyerrlab -- here on detecting error.  |
  `--------------------------------------*/
  yyerrlab:
    /* Make sure we have latest lookahead translation.  See comments at
       user semantic actions for why this is necessary.  */
    yytoken = yychar == YYEMPTY ? YYSYMBOL_YYEMPTY : YYTRANSLATE (yychar);
    /* If not already recovering from an error, report this error.  */
    if (!yyerrstatus)
      {
        ++yynerrs;
        {
          yypcontext_t yyctx
            = {yyssp, yytoken};
          char const *yymsgp = YY_("syntax error");
          int yysyntax_error_status;
          yysyntax_error_status = yysyntax_error (&yymsg_alloc, &yymsg, &yyctx);
          if (yysyntax_error_status == 0)
            yymsgp = yymsg;
          else if (yysyntax_error_status == -1)
            {
              if (yymsg != yymsgbuf)
                YYSTACK_FREE (yymsg);
              yymsg = YY_CAST (char *,
                               YYSTACK_ALLOC (YY_CAST (YYSIZE_T, yymsg_alloc)));
              if (yymsg)
                {
                  yysyntax_error_status
                    = yysyntax_error (&yymsg_alloc, &yymsg, &yyctx);
                  yymsgp = yymsg;
                }
              else
                {
                  yymsg = yymsgbuf;
                  yymsg_alloc = sizeof yymsgbuf;
                  yysyntax_error_status = YYENOMEM;
                }
            }
          yyerror (yymsgp);
          if (yysyntax_error_status == YYENOMEM)
            goto yyexhaustedlab;
        }
      }
  
    if (yyerrstatus == 3)
      {
        /* If just tried and failed to reuse lookahead token after an
           error, discard it.  */
  
        if (yychar <= YYEOF)
          {
            /* Return failure if at end of input.  */
            if (yychar == YYEOF)
              YYABORT;
          }
        else
          {
            yydestruct ("Error: discarding",
                        yytoken, &yylval);
            yychar = YYEMPTY;
          }
      }
  
    /* Else will try to reuse lookahead token after shifting the error
       token.  */
    goto yyerrlab1;
  
  
  /*---------------------------------------------------.
  | yyerrorlab -- error raised explicitly by YYERROR.  |
  `---------------------------------------------------*/
  yyerrorlab:
    /* Pacify compilers when the user code never invokes YYERROR and the
       label yyerrorlab therefore never appears in user code.  */
    if (0)
      YYERROR;
  
    /* Do not reclaim the symbols of the rule whose action triggered
       this YYERROR.  */
    YYPOPSTACK (yylen);
    yylen = 0;
    YY_STACK_PRINT (yyss, yyssp);
    yystate = *yyssp;
    goto yyerrlab1;
  
  
  /*-------------------------------------------------------------.
  | yyerrlab1 -- common code for both syntax error and YYERROR.  |
  `-------------------------------------------------------------*/
  yyerrlab1:
    yyerrstatus = 3;      /* Each real token shifted decrements this.  */
  
    /* Pop stack until we find a state that shifts the error token.  */
    for (;;)
      {
        yyn = yypact[yystate];
        if (!yypact_value_is_default (yyn))
          {
            yyn += YYSYMBOL_YYerror;
            if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYSYMBOL_YYerror)
              {
                yyn = yytable[yyn];
                if (0 < yyn)
                  break;
              }
          }
  
        /* Pop the current state because it cannot handle the error token.  */
        if (yyssp == yyss)
          YYABORT;
  
  
        yydestruct ("Error: popping",
                    YY_ACCESSING_SYMBOL (yystate), yyvsp);
        YYPOPSTACK (1);
        yystate = *yyssp;
        YY_STACK_PRINT (yyss, yyssp);
      }
  
    YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
    *++yyvsp = yylval;
    YY_IGNORE_MAYBE_UNINITIALIZED_END
  
  
    /* Shift the error token.  */
    YY_SYMBOL_PRINT ("Shifting", YY_ACCESSING_SYMBOL (yyn), yyvsp, yylsp);
  
    yystate = yyn;
    goto yynewstate;
  
  
  /*-------------------------------------.
  | yyacceptlab -- YYACCEPT comes here.  |
  `-------------------------------------*/
  yyacceptlab:
    yyresult = 0;
    goto yyreturn;
  
  
  /*-----------------------------------.
  | yyabortlab -- YYABORT comes here.  |
  `-----------------------------------*/
  yyabortlab:
    yyresult = 1;
    goto yyreturn;
  
  
  #if 1
  /*-------------------------------------------------.
  | yyexhaustedlab -- memory exhaustion comes here.  |
  `-------------------------------------------------*/
  yyexhaustedlab:
    yyerror (YY_("memory exhausted"));
    yyresult = 2;
    goto yyreturn;
  #endif
  
  
  /*-------------------------------------------------------.
  | yyreturn -- parsing is finished, clean up and return.  |
  `-------------------------------------------------------*/
  yyreturn:
    if (yychar != YYEMPTY)
      {
        /* Make sure we have latest lookahead translation.  See comments at
           user semantic actions for why this is necessary.  */
        yytoken = YYTRANSLATE (yychar);
        yydestruct ("Cleanup: discarding lookahead",
                    yytoken, &yylval);
      }
    /* Do not reclaim the symbols of the rule whose action triggered
       this YYABORT or YYACCEPT.  */
    YYPOPSTACK (yylen);
    YY_STACK_PRINT (yyss, yyssp);
    while (yyssp != yyss)
      {
        yydestruct ("Cleanup: popping",
                    YY_ACCESSING_SYMBOL (+*yyssp), yyvsp);
        YYPOPSTACK (1);
      }
  #ifndef yyoverflow
    if (yyss != yyssa)
      YYSTACK_FREE (yyss);
  #endif
    if (yymsg != yymsgbuf)
      YYSTACK_FREE (yymsg);
    return yyresult;
  }
  
  #line 111 "exptree.y"
  
  
  
  
  int main(void) {
  	extern FILE *yyin; 
  
  	register_index = 0;
  	firstreg = 1;
  	code = fopen("out.txt", "w");
  
  	yyin = fopen("inp.txt", "r"); 
  
  	if( yyin == NULL)
  	{
  	     printf("\n Error ! \n");
  	} else {
  	    printf("parsing started!\n");
  	    yyparse();
  	}
  	
  	return 0;
  }
  