/*  A Bison parser, made from fr_parser.y with Bison version GNU Bison version 1.24
  */

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

#define	INTEGER	258
#define	IDENTIFIER	259
#define	STRING_LITERAL	260
#define	IF	261
#define	ELSE	262
#define	WHILE	263
#define	LOOP	264
#define	BREAK	265
#define	CONTINUE	266
#define	EXIT	267
#define	TRUE_KEY	268
#define	FALSE_KEY	269
#define	CB	270
#define	ASSIGN	271
#define	ADD_ASSIGN	272
#define	SUB_ASSIGN	273
#define	INC	274
#define	DEC	275
#define	MUL_ASSIGN	276
#define	DIV_ASSIGN	277
#define	MOD_ASSIGN	278
#define	RSHIFT_ASSIGN	279
#define	LSHIFT_ASSIGN	280
#define	OR_ASSIGN	281
#define	XOR_ASSIGN	282
#define	AND_ASSIGN	283
#define	EQ	284
#define	STRICT_EQ	285
#define	NE	286
#define	STRICT_NE	287
#define	LE	288
#define	GE	289
#define	AND	290
#define	OR	291
#define	EOL	292
#define	LS	293
#define	RS	294
#define	UMINUS	295
#define	LOWER_THAN_ELSE	296


#include <stdio.h>
#include <stdlib.h>
#include <string>
#include "Common.h"
#include "fr_script.h"

/* ASTノードの実装（後述のCPPファイルで詳細実装するため、ここでは宣言のみ利用） */
/* 実際にはNode派生クラスのポインタをYYSTYPEとして扱います */

typedef union {
    int intValue;
    std::string* strValue;
    Node* nodePtr;
} YYSTYPE;

#ifndef YYLTYPE
typedef
  struct yyltype
    {
      int timestamp;
      int first_line;
      int first_column;
      int last_line;
      int last_column;
      char *text;
   }
  yyltype;

#define YYLTYPE yyltype
#endif

#include <stdio.h>

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



#define	YYFINAL		133
#define	YYFLAG		-32768
#define	YYNTBASE	60

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

static const char yytranslate[] = {     0,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,    50,     2,     2,     2,    49,    40,     2,    56,
    57,    47,    45,    59,    46,    58,    48,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,    41,
     2,    42,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,    39,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,    54,    38,    55,    51,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     1,     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,    30,    31,    32,    33,    34,    35,
    36,    37,    43,    44,    52,    53
};

#if YYDEBUG != 0
static const short yyprhs[] = {     0,
     0,     2,     4,     7,    11,    14,    19,    23,    26,    29,
    32,    36,    39,    42,    44,    45,    48,    54,    58,    62,
    65,    67,    71,    75,    79,    83,    87,    91,    95,    99,
   103,   107,   111,   115,   119,   123,   127,   131,   135,   139,
   143,   147,   151,   155,   159,   163,   167,   171,   175,   179,
   183,   186,   189,   192,   195,   197,   200,   203,   205,   207,
   209,   211,   215,   220,   227,   228,   230,   232
};

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

#endif

#if YYDEBUG != 0
static const short yyrline[] = { 0,
    50,    57,    66,    77,    81,    87,    89,    90,    91,    92,
    93,    94,    95,    96,    99,   101,   102,   108,   110,   111,
   112,   116,   118,   119,   120,   121,   122,   123,   124,   125,
   126,   127,   128,   129,   130,   131,   132,   133,   134,   135,
   136,   137,   138,   139,   140,   141,   142,   143,   144,   145,
   146,   147,   148,   149,   150,   154,   156,   157,   161,   163,
   164,   165,   166,   176,   189,   191,   194,   200
};

static const char * const yytname[] = {   "$","error","$undefined.","INTEGER",
"IDENTIFIER","STRING_LITERAL","IF","ELSE","WHILE","LOOP","BREAK","CONTINUE",
"EXIT","TRUE_KEY","FALSE_KEY","CB","ASSIGN","ADD_ASSIGN","SUB_ASSIGN","INC",
"DEC","MUL_ASSIGN","DIV_ASSIGN","MOD_ASSIGN","RSHIFT_ASSIGN","LSHIFT_ASSIGN",
"OR_ASSIGN","XOR_ASSIGN","AND_ASSIGN","EQ","STRICT_EQ","NE","STRICT_NE","LE",
"GE","AND","OR","EOL","'|'","'^'","'&'","'<'","'>'","LS","RS","'+'","'-'","'*'",
"'/'","'%'","'!'","'~'","UMINUS","LOWER_THAN_ELSE","'{'","'}'","'('","')'","'.'",
"','","program","stmt_list","block","stmt","opt_else","logic_expr","expr","term",
"factor","args","args_list",""
};
#endif

static const short yyr1[] = {     0,
    60,    61,    61,    62,    62,    63,    63,    63,    63,    63,
    63,    63,    63,    63,    64,    64,    64,    65,    65,    65,
    65,    66,    66,    66,    66,    66,    66,    66,    66,    66,
    66,    66,    66,    66,    66,    66,    66,    66,    66,    66,
    66,    66,    66,    66,    66,    66,    66,    66,    66,    66,
    66,    66,    66,    66,    66,    67,    67,    67,    68,    68,
    68,    68,    68,    68,    69,    69,    70,    70
};

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

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

static const short yydefgoto[] = {   131,
    18,    41,    19,   120,    20,    21,    22,    23,    88,    89
};

static const short yypact[] = {   158,
-32768,   243,-32768,    30,    30,   -45,   -15,     1,   182,   -18,
    37,    38,-32768,   195,    30,   195,    30,   158,-32768,   -29,
   244,-32768,-32768,   202,   202,   202,-32768,-32768,   202,   202,
   202,   202,   202,   202,   202,   202,   202,    62,    62,    84,
-32768,-32768,-32768,-32768,   -19,    39,-32768,-32768,   -12,-32768,
-32768,-32768,   -21,-32768,    30,    30,-32768,   202,   202,   202,
   202,   202,   202,   202,   202,   202,   202,   202,   202,   202,
   202,   202,   202,   202,   202,   244,   244,   244,   244,   244,
   244,   244,   244,   244,   244,   244,   244,   -11,    13,    40,
-32768,-32768,   138,-32768,    -8,-32768,-32768,    42,   333,   244,
   333,   244,    79,    79,   271,   292,   313,    79,    79,   249,
   249,   188,   188,   -20,   -20,   -20,-32768,   202,    17,-32768,
-32768,   202,   244,    30,-32768,    16,    62,-32768,    40,-32768,
    74,    75,-32768
};

static const short yypgoto[] = {-32768,
    44,   -36,   -14,   -51,    -4,    -5,    23,-32768,   -40,-32768
};


#define	YYLAST		382


static const short yytable[] = {    38,
    39,    90,    91,    54,    45,    55,    56,    57,    40,    59,
    51,    61,    53,    55,    56,    55,    56,    94,    76,    77,
    78,    42,   124,    79,    80,    81,    82,    83,    84,    85,
    86,    87,     1,     2,     3,    96,    50,    43,    52,    46,
    47,    48,    95,    37,    10,   117,   119,   122,    11,    12,
    97,    98,    99,   100,   101,   102,   103,   104,   105,   106,
   107,   108,   109,   110,   111,   112,   113,   114,   115,   116,
    40,   118,   128,   132,   133,    14,    55,   130,    54,    15,
    16,   126,   125,    93,     0,    17,     1,     2,     3,     4,
   129,     5,     6,     7,     8,     9,    55,    56,    10,     0,
     0,     0,    11,    12,     0,     0,     0,     0,    59,     0,
    61,     0,   123,     0,     0,    40,    87,     0,     0,   127,
    13,    69,    70,    71,    72,    73,    74,    75,     0,    14,
     0,     0,     0,    15,    16,     0,     0,     0,    92,    17,
     1,     2,     3,     4,     0,     5,     6,     7,     8,     9,
     0,     0,    10,     0,     0,     0,    11,    12,     0,     0,
     1,     2,     3,     4,     0,     5,     6,     7,     8,     9,
     0,     0,    10,     0,    13,     0,    11,    12,     0,     0,
     0,     0,     0,    14,     1,     2,     3,    15,    16,     0,
     0,     0,   121,    17,    13,     0,    10,     1,    49,     3,
    11,    12,     0,    14,     1,     2,     3,    15,    16,    10,
     0,     0,     0,    17,     0,     0,    10,    59,    44,    61,
    11,    12,     0,     0,     0,     0,     0,    14,     0,     0,
     0,    15,    16,     0,    73,    74,    75,    17,     0,     0,
    14,     0,     0,     0,     0,    16,     0,    14,     0,     0,
    17,     0,    16,     0,     0,     0,     0,    17,    24,    25,
    26,    27,    28,    29,    30,    31,    32,    33,    34,    35,
    36,     0,    58,    59,    60,    61,    62,    63,    59,     0,
    61,    64,    65,    66,    67,    68,    69,    70,    71,    72,
    73,    74,    75,    71,    72,    73,    74,    75,    37,    58,
    59,    60,    61,    62,    63,     0,     0,     0,     0,    65,
    66,    67,    68,    69,    70,    71,    72,    73,    74,    75,
    58,    59,    60,    61,    62,    63,     0,     0,     0,     0,
     0,    66,    67,    68,    69,    70,    71,    72,    73,    74,
    75,    58,    59,    60,    61,    62,    63,     0,     0,     0,
     0,     0,     0,    67,    68,    69,    70,    71,    72,    73,
    74,    75,    59,     0,    61,    62,    63,     0,     0,     0,
     0,     0,     0,    67,    68,    69,    70,    71,    72,    73,
    74,    75
};

static const short yycheck[] = {     4,
     5,    38,    39,    18,     9,    35,    36,    37,    54,    30,
    15,    32,    17,    35,    36,    35,    36,    37,    24,    25,
    26,    37,     6,    29,    30,    31,    32,    33,    34,    35,
    36,    37,     3,     4,     5,    57,    14,    37,    16,    58,
     4,     4,     4,    56,    15,    57,     7,    56,    19,    20,
    55,    56,    58,    59,    60,    61,    62,    63,    64,    65,
    66,    67,    68,    69,    70,    71,    72,    73,    74,    75,
    54,    59,    57,     0,     0,    46,    35,   129,    93,    50,
    51,   122,   119,    40,    -1,    56,     3,     4,     5,     6,
   127,     8,     9,    10,    11,    12,    35,    36,    15,    -1,
    -1,    -1,    19,    20,    -1,    -1,    -1,    -1,    30,    -1,
    32,    -1,   118,    -1,    -1,    54,   122,    -1,    -1,   124,
    37,    43,    44,    45,    46,    47,    48,    49,    -1,    46,
    -1,    -1,    -1,    50,    51,    -1,    -1,    -1,    55,    56,
     3,     4,     5,     6,    -1,     8,     9,    10,    11,    12,
    -1,    -1,    15,    -1,    -1,    -1,    19,    20,    -1,    -1,
     3,     4,     5,     6,    -1,     8,     9,    10,    11,    12,
    -1,    -1,    15,    -1,    37,    -1,    19,    20,    -1,    -1,
    -1,    -1,    -1,    46,     3,     4,     5,    50,    51,    -1,
    -1,    -1,    55,    56,    37,    -1,    15,     3,     4,     5,
    19,    20,    -1,    46,     3,     4,     5,    50,    51,    15,
    -1,    -1,    -1,    56,    -1,    -1,    15,    30,    37,    32,
    19,    20,    -1,    -1,    -1,    -1,    -1,    46,    -1,    -1,
    -1,    50,    51,    -1,    47,    48,    49,    56,    -1,    -1,
    46,    -1,    -1,    -1,    -1,    51,    -1,    46,    -1,    -1,
    56,    -1,    51,    -1,    -1,    -1,    -1,    56,    16,    17,
    18,    19,    20,    21,    22,    23,    24,    25,    26,    27,
    28,    -1,    29,    30,    31,    32,    33,    34,    30,    -1,
    32,    38,    39,    40,    41,    42,    43,    44,    45,    46,
    47,    48,    49,    45,    46,    47,    48,    49,    56,    29,
    30,    31,    32,    33,    34,    -1,    -1,    -1,    -1,    39,
    40,    41,    42,    43,    44,    45,    46,    47,    48,    49,
    29,    30,    31,    32,    33,    34,    -1,    -1,    -1,    -1,
    -1,    40,    41,    42,    43,    44,    45,    46,    47,    48,
    49,    29,    30,    31,    32,    33,    34,    -1,    -1,    -1,
    -1,    -1,    -1,    41,    42,    43,    44,    45,    46,    47,
    48,    49,    30,    -1,    32,    33,    34,    -1,    -1,    -1,
    -1,    -1,    -1,    41,    42,    43,    44,    45,    46,    47,
    48,    49
};
/* -*-C-*-  Note some compilers choke on comments on `#line' lines.  */


/* 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., 675 Mass Ave, Cambridge, MA 02139, 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.  */

#ifndef alloca
#ifdef __GNUC__
#define alloca __builtin_alloca
#else /* not GNU C.  */
#if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi)
#include <alloca.h>
#else /* not sparc */
#if defined (MSDOS) && !defined (__TURBOC__)
#include <malloc.h>
#else /* not MSDOS, or __TURBOC__ */
#if defined(_AIX)
#include <malloc.h>
 #pragma alloca
#else /* not MSDOS, __TURBOC__, or _AIX */
#ifdef __hpux
#ifdef __cplusplus
extern "C" {
void *alloca (unsigned int);
};
#else /* not __cplusplus */
void *alloca ();
#endif /* not __cplusplus */
#endif /* __hpux */
#endif /* not _AIX */
#endif /* not MSDOS, or __TURBOC__ */
#endif /* not sparc.  */
#endif /* not GNU C.  */
#endif /* alloca not defined.  */

/* This is the parser code that is written into each bison parser
  when the %semantic_parser declaration is not specified in the grammar.
  It was written by Richard Stallman by simplifying the hairy parser
  used when %semantic_parser is specified.  */

/* Note: there must be only one dollar sign in this file.
   It is replaced by the list of actions, each action
   as one case of the switch.  */

#define yyerrok		(yyerrstatus = 0)
#define yyclearin	(yychar = YYEMPTY)
#define YYEMPTY		-2
#define YYEOF		0
#define YYACCEPT	return(0)
#define YYABORT 	return(1)
#define YYERROR		goto yyerrlab1
/* Like YYERROR except do call yyerror.
   This remains here temporarily to ease the
   transition to the new meaning of YYERROR, for GCC.
   Once GCC version 2 has supplanted version 1, this can go.  */
#define YYFAIL		goto yyerrlab
#define YYRECOVERING()  (!!yyerrstatus)
#define YYBACKUP(token, value) \
do								\
  if (yychar == YYEMPTY && yylen == 1)				\
    { yychar = (token), yylval = (value);			\
      yychar1 = YYTRANSLATE (yychar);				\
      YYPOPSTACK;						\
      goto yybackup;						\
    }								\
  else								\
    { yyerror ("syntax error: cannot back up"); YYERROR; }	\
while (0)

#define YYTERROR	1
#define YYERRCODE	256

#ifndef YYPURE
#define YYLEX		yylex()
#endif

#ifdef YYPURE
#ifdef YYLSP_NEEDED
#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

/* Prevent warning if -Wstrict-prototypes.  */
#ifdef __GNUC__
int yyparse (void);
#endif

#if __GNUC__ > 1		/* GNU C and GNU C++ define this.  */
#define __yy_memcpy(FROM,TO,COUNT)	__builtin_memcpy(TO,FROM,COUNT)
#else				/* not GNU C or C++ */
#ifndef __cplusplus

/* This is the most reliable way to avoid incompatibilities
   in available built-in functions on various systems.  */
static void
__yy_memcpy (from, to, count)
     char *from;
     char *to;
     int count;
{
  register char *f = from;
  register char *t = to;
  register int i = count;

  while (i-- > 0)
    *t++ = *f++;
}

#else /* __cplusplus */

/* This is the most reliable way to avoid incompatibilities
   in available built-in functions on various systems.  */
static void
__yy_memcpy (char *from, char *to, int count)
{
  register char *f = from;
  register char *t = to;
  register int i = count;

  while (i-- > 0)
    *t++ = *f++;
}

#endif
#endif



/* 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
#define YYPARSE_PARAM_DECL void *YYPARSE_PARAM;
#else
#define YYPARSE_PARAM
#define YYPARSE_PARAM_DECL
#endif

int
yyparse(YYPARSE_PARAM)
     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;

#ifdef YYPURE
  int yychar;
  YYSTYPE yylval;
  int yynerrs;
#ifdef YYLSP_NEEDED
  YYLTYPE yylloc;
#endif
#endif

  YYSTYPE yyval;		/*  the variable used to return		*/
				/*  semantic values from the action	*/
				/*  routines				*/

  int yylen;

#if YYDEBUG != 0
  if (yydebug)
    fprintf(stderr, "Starting parse\n");
#endif

  yystate = 0;
  yyerrstatus = 0;
  yynerrs = 0;
  yychar = YYEMPTY;		/* Cause a token to be read.  */

  /* Initialize stack pointers.
     Waste one element of value and location stack
     so that they stay on the same level as the state stack.
     The wasted elements are never initialized.  */

  yyssp = yyss - 1;
  yyvsp = yyvs;
#ifdef YYLSP_NEEDED
  yylsp = yyls;
#endif

/* Push a new state, which is found in  yystate  .  */
/* In all cases, when you get here, the value and location stacks
   have just been pushed. so pushing a state here evens the stacks.  */
yynewstate:

  *++yyssp = yystate;

  if (yyssp >= yyss + yystacksize - 1)
    {
      /* Give user a chance to reallocate the stack */
      /* Use copies of these so that the &'s don't force the real ones into memory. */
      YYSTYPE *yyvs1 = yyvs;
      short *yyss1 = yyss;
#ifdef YYLSP_NEEDED
      YYLTYPE *yyls1 = yyls;
#endif

      /* Get the current used size of the three stacks, in elements.  */
      int size = yyssp - yyss + 1;

#ifdef yyoverflow
      /* Each stack pointer address is followed by the size of
	 the data in use in that stack, in bytes.  */
#ifdef YYLSP_NEEDED
      /* This used to be a conditional around just the two extra args,
	 but that might be undefined if yyoverflow is a macro.  */
      yyoverflow("parser stack overflow",
		 &yyss1, size * sizeof (*yyssp),
		 &yyvs1, size * sizeof (*yyvsp),
		 &yyls1, size * sizeof (*yylsp),
		 &yystacksize);
#else
      yyoverflow("parser stack overflow",
		 &yyss1, size * sizeof (*yyssp),
		 &yyvs1, size * sizeof (*yyvsp),
		 &yystacksize);
#endif

      yyss = yyss1; yyvs = yyvs1;
#ifdef YYLSP_NEEDED
      yyls = yyls1;
#endif
#else /* no yyoverflow */
      /* Extend the stack our own way.  */
      if (yystacksize >= YYMAXDEPTH)
	{
	  yyerror("parser stack overflow");
	  return 2;
	}
      yystacksize *= 2;
      if (yystacksize > YYMAXDEPTH)
	yystacksize = YYMAXDEPTH;
      yyss = (short *) alloca (yystacksize * sizeof (*yyssp));
      __yy_memcpy ((char *)yyss1, (char *)yyss, size * sizeof (*yyssp));
      yyvs = (YYSTYPE *) alloca (yystacksize * sizeof (*yyvsp));
      __yy_memcpy ((char *)yyvs1, (char *)yyvs, size * sizeof (*yyvsp));
#ifdef YYLSP_NEEDED
      yyls = (YYLTYPE *) alloca (yystacksize * sizeof (*yylsp));
      __yy_memcpy ((char *)yyls1, (char *)yyls, size * sizeof (*yylsp));
#endif
#endif /* no yyoverflow */

      yyssp = yyss + size - 1;
      yyvsp = yyvs + size - 1;
#ifdef YYLSP_NEEDED
      yylsp = yyls + size - 1;
#endif

#if YYDEBUG != 0
      if (yydebug)
	fprintf(stderr, "Stack size increased to %d\n", yystacksize);
#endif

      if (yyssp >= yyss + yystacksize - 1)
	YYABORT;
    }

#if YYDEBUG != 0
  if (yydebug)
    fprintf(stderr, "Entering state %d\n", yystate);
#endif

  goto yybackup;
 yybackup:

/* Do appropriate processing given the current state.  */
/* Read a lookahead token if we need one and don't already have one.  */
/* yyresume: */

  /* First try to decide what to do without reference to lookahead token.  */

  yyn = yypact[yystate];
  if (yyn == YYFLAG)
    goto yydefault;

  /* Not known => get a lookahead token if don't already have one.  */

  /* yychar is either YYEMPTY or YYEOF
     or a valid token in external form.  */

  if (yychar == YYEMPTY)
    {
#if YYDEBUG != 0
      if (yydebug)
	fprintf(stderr, "Reading a token: ");
#endif
      yychar = YYLEX;
    }

  /* Convert token to internal form (in yychar1) for indexing tables with */

  if (yychar <= 0)		/* This means end of input. */
    {
      yychar1 = 0;
      yychar = YYEOF;		/* Don't call YYLEX any more */

#if YYDEBUG != 0
      if (yydebug)
	fprintf(stderr, "Now at end of input.\n");
#endif
    }
  else
    {
      yychar1 = YYTRANSLATE(yychar);

#if YYDEBUG != 0
      if (yydebug)
	{
	  fprintf (stderr, "Next token is %d (%s", yychar, yytname[yychar1]);
	  /* Give the individual parser a way to print the precise meaning
	     of a token, for further debugging info.  */
#ifdef YYPRINT
	  YYPRINT (stderr, yychar, yylval);
#endif
	  fprintf (stderr, ")\n");
	}
#endif
    }

  yyn += yychar1;
  if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1)
    goto yydefault;

  yyn = yytable[yyn];

  /* yyn is what to do for this token type in this state.
     Negative => reduce, -yyn is rule number.
     Positive => shift, yyn is new state.
       New state is final state => don't bother to shift,
       just return success.
     0, or most negative number => error.  */

  if (yyn < 0)
    {
      if (yyn == YYFLAG)
	goto yyerrlab;
      yyn = -yyn;
      goto yyreduce;
    }
  else if (yyn == 0)
    goto yyerrlab;

  if (yyn == YYFINAL)
    YYACCEPT;

  /* Shift the lookahead token.  */

#if YYDEBUG != 0
  if (yydebug)
    fprintf(stderr, "Shifting token %d (%s), ", yychar, yytname[yychar1]);
#endif

  /* Discard the token being shifted unless it is eof.  */
  if (yychar != YYEOF)
    yychar = YYEMPTY;

  *++yyvsp = yylval;
#ifdef YYLSP_NEEDED
  *++yylsp = yylloc;
#endif

  /* count tokens shifted since error; after three, turn off error status.  */
  if (yyerrstatus) yyerrstatus--;

  yystate = yyn;
  goto yynewstate;

/* Do the default action for the current state.  */
yydefault:

  yyn = yydefact[yystate];
  if (yyn == 0)
    goto yyerrlab;

/* Do a reduction.  yyn is the number of a rule to reduce with.  */
yyreduce:
  yylen = yyr2[yyn];
  if (yylen > 0)
    yyval = yyvsp[1-yylen]; /* implement default value of the action */

#if YYDEBUG != 0
  if (yydebug)
    {
      int i;

      fprintf (stderr, "Reducing via rule %d (line %d), ",
	       yyn, yyrline[yyn]);

      /* Print the symbols being reduced, and their result.  */
      for (i = yyprhs[yyn]; yyrhs[i] > 0; i++)
	fprintf (stderr, "%s ", yytname[yyrhs[i]]);
      fprintf (stderr, " -> %s\n", yytname[yyr1[yyn]]);
    }
#endif


  switch (yyn) {

case 1:
{ 
          g_root = yyvsp[0].nodePtr; 
      ;
    break;}
case 2:
{
          // 最初の文が見つかったら、新しいBlockNodeを作成して追加する
          BlockNode* b = new BlockNode();
          if (yyvsp[0].nodePtr != NULL) {
              b->add(yyvsp[0].nodePtr);
          }
          yyval.nodePtr = b;
      ;
    break;}
case 3:
{
          // すでに作成済みのBlockNode ($1) に、次の文 ($2) を追加する
          BlockNode* b = (BlockNode*)yyvsp[-1].nodePtr;
          if (yyvsp[0].nodePtr != NULL) {
              b->add(yyvsp[0].nodePtr);
          }
          yyval.nodePtr = b;
      ;
    break;}
case 4:
{ 
          yyval.nodePtr = yyvsp[-1].nodePtr; 
      ;
    break;}
case 5:
{ 
          // 空のブロック
          yyval.nodePtr = new BlockNode(); 
      ;
    break;}
case 6:
{ yyval.nodePtr = new IfNode(yyvsp[-2].nodePtr, yyvsp[-1].nodePtr, yyvsp[0].nodePtr); ;
    break;}
case 7:
{ yyval.nodePtr = new WhileNode(yyvsp[-1].nodePtr, yyvsp[0].nodePtr, false); ;
    break;}
case 8:
{ yyval.nodePtr = new WhileNode(NULL, yyvsp[0].nodePtr, true); ;
    break;}
case 9:
{ yyval.nodePtr = new FlowNode(ND_BREAK); ;
    break;}
case 10:
{ yyval.nodePtr = new FlowNode(ND_CONTINUE); ;
    break;}
case 11:
{ yyval.nodePtr = new ExitNode(yyvsp[-1].nodePtr); ;
    break;}
case 12:
{ yyval.nodePtr = new ExitNode(NULL); ;
    break;}
case 13:
{ yyval.nodePtr = yyvsp[-1].nodePtr; ;
    break;}
case 14:
{ yyval.nodePtr = NULL; ;
    break;}
case 15:
{ yyval.nodePtr = NULL; ;
    break;}
case 16:
{ yyval.nodePtr = yyvsp[0].nodePtr; ;
    break;}
case 17:
{ yyval.nodePtr = new IfNode(yyvsp[-2].nodePtr, yyvsp[-1].nodePtr, yyvsp[0].nodePtr); ;
    break;}
case 18:
{ yyval.nodePtr = new BinaryNode(ND_LOGIC_AND, yyvsp[-2].nodePtr, yyvsp[0].nodePtr); ;
    break;}
case 19:
{ yyval.nodePtr = new BinaryNode(ND_LOGIC_OR, yyvsp[-2].nodePtr, yyvsp[0].nodePtr); ;
    break;}
case 20:
{ yyval.nodePtr = new UnaryNode(ND_LOGIC_NOT, yyvsp[0].nodePtr); ;
    break;}
case 21:
{ yyval.nodePtr = yyvsp[0].nodePtr; ;
    break;}
case 22:
{ yyval.nodePtr = new BinaryNode(ND_ADD, yyvsp[-2].nodePtr, yyvsp[0].nodePtr); ;
    break;}
case 23:
{ yyval.nodePtr = new BinaryNode(ND_SUB, yyvsp[-2].nodePtr, yyvsp[0].nodePtr); ;
    break;}
case 24:
{ yyval.nodePtr = new BinaryNode(ND_MUL, yyvsp[-2].nodePtr, yyvsp[0].nodePtr); ;
    break;}
case 25:
{ yyval.nodePtr = new BinaryNode(ND_DIV, yyvsp[-2].nodePtr, yyvsp[0].nodePtr); ;
    break;}
case 26:
{ yyval.nodePtr = new BinaryNode(ND_MOD, yyvsp[-2].nodePtr, yyvsp[0].nodePtr); ;
    break;}
case 27:
{ yyval.nodePtr = new BinaryNode(ND_BIT_OR, yyvsp[-2].nodePtr, yyvsp[0].nodePtr); ;
    break;}
case 28:
{ yyval.nodePtr = new BinaryNode(ND_BIT_AND, yyvsp[-2].nodePtr, yyvsp[0].nodePtr); ;
    break;}
case 29:
{ yyval.nodePtr = new BinaryNode(ND_BIT_XOR, yyvsp[-2].nodePtr, yyvsp[0].nodePtr); ;
    break;}
case 30:
{ yyval.nodePtr = new BinaryNode(ND_LSHIFT, yyvsp[-2].nodePtr, yyvsp[0].nodePtr); ;
    break;}
case 31:
{ yyval.nodePtr = new BinaryNode(ND_RSHIFT, yyvsp[-2].nodePtr, yyvsp[0].nodePtr); ;
    break;}
case 32:
{ yyval.nodePtr = new BinaryNode(ND_EQ, yyvsp[-2].nodePtr, yyvsp[0].nodePtr); ;
    break;}
case 33:
{ yyval.nodePtr = new BinaryNode(ND_NE, yyvsp[-2].nodePtr, yyvsp[0].nodePtr); ;
    break;}
case 34:
{ yyval.nodePtr = new BinaryNode(ND_STRICT_EQ, yyvsp[-2].nodePtr, yyvsp[0].nodePtr); ;
    break;}
case 35:
{ yyval.nodePtr = new BinaryNode(ND_STRICT_NE, yyvsp[-2].nodePtr, yyvsp[0].nodePtr); ;
    break;}
case 36:
{ yyval.nodePtr = new BinaryNode(ND_LT, yyvsp[-2].nodePtr, yyvsp[0].nodePtr); ;
    break;}
case 37:
{ yyval.nodePtr = new BinaryNode(ND_GT, yyvsp[-2].nodePtr, yyvsp[0].nodePtr); ;
    break;}
case 38:
{ yyval.nodePtr = new BinaryNode(ND_LE, yyvsp[-2].nodePtr, yyvsp[0].nodePtr); ;
    break;}
case 39:
{ yyval.nodePtr = new BinaryNode(ND_GE, yyvsp[-2].nodePtr, yyvsp[0].nodePtr); ;
    break;}
case 40:
{ yyval.nodePtr = new AssignNode(new VarNode(yyvsp[-2].strValue), yyvsp[0].nodePtr, ND_ASSIGN); ;
    break;}
case 41:
{ yyval.nodePtr = new AssignNode(new VarNode(yyvsp[-2].strValue), yyvsp[0].nodePtr, ND_ADD_ASSIGN); ;
    break;}
case 42:
{ yyval.nodePtr = new AssignNode(new VarNode(yyvsp[-2].strValue), yyvsp[0].nodePtr, ND_SUB_ASSIGN); ;
    break;}
case 43:
{ yyval.nodePtr = new AssignNode(new VarNode(yyvsp[-2].strValue), yyvsp[0].nodePtr, ND_MUL_ASSIGN); ;
    break;}
case 44:
{ yyval.nodePtr = new AssignNode(new VarNode(yyvsp[-2].strValue), yyvsp[0].nodePtr, ND_DIV_ASSIGN); ;
    break;}
case 45:
{ yyval.nodePtr = new AssignNode(new VarNode(yyvsp[-2].strValue), yyvsp[0].nodePtr, ND_MOD_ASSIGN); ;
    break;}
case 46:
{ yyval.nodePtr = new AssignNode(new VarNode(yyvsp[-2].strValue), yyvsp[0].nodePtr, ND_RSHIFT_ASSIGN); ;
    break;}
case 47:
{ yyval.nodePtr = new AssignNode(new VarNode(yyvsp[-2].strValue), yyvsp[0].nodePtr, ND_LSHIFT_ASSIGN); ;
    break;}
case 48:
{ yyval.nodePtr = new AssignNode(new VarNode(yyvsp[-2].strValue), yyvsp[0].nodePtr, ND_OR_ASSIGN); ;
    break;}
case 49:
{ yyval.nodePtr = new AssignNode(new VarNode(yyvsp[-2].strValue), yyvsp[0].nodePtr, ND_XOR_ASSIGN); ;
    break;}
case 50:
{ yyval.nodePtr = new AssignNode(new VarNode(yyvsp[-2].strValue), yyvsp[0].nodePtr, ND_AND_ASSIGN); ;
    break;}
case 51:
{ yyval.nodePtr = new AssignNode(new VarNode(yyvsp[0].strValue), new IntNode(1), ND_ADD_ASSIGN); ;
    break;}
case 52:
{ yyval.nodePtr = new AssignNode(new VarNode(yyvsp[0].strValue), new IntNode(1), ND_SUB_ASSIGN); ;
    break;}
case 53:
{ yyval.nodePtr = new AssignNode(new VarNode(yyvsp[-1].strValue), new IntNode(1), ND_ADD_ASSIGN_AFTER); ;
    break;}
case 54:
{ yyval.nodePtr = new AssignNode(new VarNode(yyvsp[-1].strValue), new IntNode(1), ND_SUB_ASSIGN_AFTER); ;
    break;}
case 55:
{ yyval.nodePtr = yyvsp[0].nodePtr; ;
    break;}
case 56:
{ yyval.nodePtr = new UnaryNode(ND_SUB, yyvsp[0].nodePtr); ;
    break;}
case 57:
{ yyval.nodePtr = new UnaryNode(ND_BIT_NOT, yyvsp[0].nodePtr); ;
    break;}
case 58:
{ yyval.nodePtr = yyvsp[0].nodePtr; ;
    break;}
case 59:
{ yyval.nodePtr = new IntNode(yyvsp[0].intValue); ;
    break;}
case 60:
{ yyval.nodePtr = new VarNode(yyvsp[0].strValue); /* $1はlexerでnew std::stringされている */ ;
    break;}
case 61:
{ yyval.nodePtr = new StringNode(yyvsp[0].strValue); /* Lexerで生成された std::string* を StringNode に渡す */ ;
    break;}
case 62:
{ yyval.nodePtr = yyvsp[-1].nodePtr; ;
    break;}
case 63:
{ 
        /* 関数呼び出し */
        FuncCallNode* func = new FuncCallNode(yyvsp[-3].strValue); /* $1(名前)の解放責任はFuncCallNodeへ */
        ListNode* argList = (ListNode*)yyvsp[-1].nodePtr;
        for(size_t i=0; i<argList->nodes.size(); ++i) {
            func->addArg(argList->nodes[i]);
        }
        delete argList; // コンテナだけ削除(中身はfuncへ移動済)
        yyval.nodePtr = func;
    ;
    break;}
case 64:
{
        /* コールバック呼び出し */
        CBCallNode* cb = new CBCallNode(yyvsp[-3].strValue);
        ListNode* argList = (ListNode*)yyvsp[-1].nodePtr;
        for(size_t i=0; i<argList->nodes.size(); ++i) {
            cb->addArg(argList->nodes[i]);
        }
        delete argList;
        yyval.nodePtr = cb;
    ;
    break;}
case 65:
{ yyval.nodePtr = new ListNode(); ;
    break;}
case 66:
{ yyval.nodePtr = yyvsp[0].nodePtr; ;
    break;}
case 67:
{ 
          ListNode* list = new ListNode();
          list->push(yyvsp[0].nodePtr);
          yyval.nodePtr = list;
      ;
    break;}
case 68:
{
          ListNode* list = (ListNode*)yyvsp[-2].nodePtr;
          list->push(yyvsp[0].nodePtr);
          yyval.nodePtr = list;
      ;
    break;}
}
   /* the action file gets copied in in place of this dollarsign */


  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;
}


void yyerror(const char *s) {
	/* エラー発生コールバック */
	char errmes[1025];
	wsprintfA(errmes, "Error at line %d: %s\n", yylineno, s);
	errorCall(ERROR_PARSE_ERR, yylineno, errmes);
}