2023-11-03 23:10:40 -05:00
|
|
|
/* A Bison parser, made by GNU Bison 3.8.2. */
|
2023-10-16 13:41:40 -07:00
|
|
|
|
|
|
|
|
/* Bison implementation for Yacc-like parsers in C
|
|
|
|
|
|
2023-11-03 23:10:40 -05:00
|
|
|
Copyright (C) 1984, 1989-1990, 2000-2015, 2018-2021 Free Software Foundation,
|
2023-10-16 13:41:40 -07:00
|
|
|
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
|
2023-11-03 23:10:40 -05:00
|
|
|
along with this program. If not, see <https://www.gnu.org/licenses/>. */
|
2023-10-16 13:41:40 -07:00
|
|
|
|
|
|
|
|
/* 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. */
|
|
|
|
|
|
2023-11-03 23:10:40 -05:00
|
|
|
/* 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. */
|
|
|
|
|
|
2023-10-16 13:41:40 -07:00
|
|
|
/* 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. */
|
|
|
|
|
|
2023-11-03 23:10:40 -05:00
|
|
|
/* Identify Bison output, and Bison version. */
|
|
|
|
|
#define YYBISON 30802
|
2023-10-16 13:41:40 -07:00
|
|
|
|
2023-11-03 23:10:40 -05:00
|
|
|
/* Bison version string. */
|
|
|
|
|
#define YYBISON_VERSION "3.8.2"
|
2023-10-16 13:41:40 -07:00
|
|
|
|
|
|
|
|
/* 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 8 "parser.y"
|
|
|
|
|
|
|
|
|
|
#include <stdio.h>
|
|
|
|
|
#include <stdexcept>
|
|
|
|
|
#include <string>
|
|
|
|
|
|
|
|
|
|
#include <glog/logging.h>
|
|
|
|
|
|
|
|
|
|
#include "raw_ast.hpp"
|
|
|
|
|
|
|
|
|
|
int
|
|
|
|
|
yyparse(rocprofiler::counters::RawAST** result);
|
|
|
|
|
int
|
|
|
|
|
yylex(void);
|
|
|
|
|
void
|
|
|
|
|
yyerror(rocprofiler::counters::RawAST**, const char* s)
|
|
|
|
|
{
|
|
|
|
|
LOG(ERROR) << s;
|
|
|
|
|
}
|
|
|
|
|
|
2023-11-03 23:10:40 -05:00
|
|
|
#line 85 "parser.cpp"
|
2023-10-16 13:41:40 -07:00
|
|
|
|
|
|
|
|
#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
|
|
|
|
|
|
2023-11-03 23:10:40 -05:00
|
|
|
#include "parser.h"
|
|
|
|
|
/* Symbol kind. */
|
|
|
|
|
enum yysymbol_kind_t
|
2023-10-16 13:41:40 -07:00
|
|
|
{
|
2023-11-03 23:10:40 -05:00
|
|
|
YYSYMBOL_YYEMPTY = -2,
|
|
|
|
|
YYSYMBOL_YYEOF = 0, /* "end of file" */
|
|
|
|
|
YYSYMBOL_YYerror = 1, /* error */
|
|
|
|
|
YYSYMBOL_YYUNDEF = 2, /* "invalid token" */
|
|
|
|
|
YYSYMBOL_ADD = 3, /* ADD */
|
|
|
|
|
YYSYMBOL_SUB = 4, /* SUB */
|
|
|
|
|
YYSYMBOL_MUL = 5, /* MUL */
|
|
|
|
|
YYSYMBOL_DIV = 6, /* DIV */
|
|
|
|
|
YYSYMBOL_ABS = 7, /* ABS */
|
|
|
|
|
YYSYMBOL_EQUALS = 8, /* EQUALS */
|
|
|
|
|
YYSYMBOL_OP = 9, /* OP */
|
|
|
|
|
YYSYMBOL_CP = 10, /* CP */
|
|
|
|
|
YYSYMBOL_O_SQ = 11, /* O_SQ */
|
|
|
|
|
YYSYMBOL_C_SQ = 12, /* C_SQ */
|
|
|
|
|
YYSYMBOL_COLON = 13, /* COLON */
|
|
|
|
|
YYSYMBOL_EOL = 14, /* EOL */
|
|
|
|
|
YYSYMBOL_15_ = 15, /* '|' */
|
|
|
|
|
YYSYMBOL_UMINUS = 16, /* UMINUS */
|
|
|
|
|
YYSYMBOL_CM = 17, /* CM */
|
|
|
|
|
YYSYMBOL_NUMBER = 18, /* NUMBER */
|
|
|
|
|
YYSYMBOL_RANGE = 19, /* RANGE */
|
|
|
|
|
YYSYMBOL_NAME = 20, /* NAME */
|
|
|
|
|
YYSYMBOL_REDUCE = 21, /* REDUCE */
|
|
|
|
|
YYSYMBOL_SELECT = 22, /* SELECT */
|
|
|
|
|
YYSYMBOL_LOWER_THAN_ELSE = 23, /* LOWER_THAN_ELSE */
|
|
|
|
|
YYSYMBOL_ELSE = 24, /* ELSE */
|
|
|
|
|
YYSYMBOL_YYACCEPT = 25, /* $accept */
|
|
|
|
|
YYSYMBOL_top = 26, /* top */
|
|
|
|
|
YYSYMBOL_exp = 27, /* exp */
|
|
|
|
|
YYSYMBOL_reduce_dim_args = 28, /* reduce_dim_args */
|
|
|
|
|
YYSYMBOL_select_dim_args = 29 /* select_dim_args */
|
2023-10-16 13:41:40 -07:00
|
|
|
};
|
2023-11-03 23:10:40 -05:00
|
|
|
typedef enum yysymbol_kind_t yysymbol_kind_t;
|
2023-10-16 13:41:40 -07:00
|
|
|
|
|
|
|
|
#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
|
|
|
|
|
|
2023-11-03 23:10:40 -05:00
|
|
|
/* Work around bug in HP-UX 11.23, which defines these macros
|
|
|
|
|
incorrectly for preprocessor constants. This workaround can likely
|
|
|
|
|
be removed in 2023, as HPE has promised support for HP-UX 11.23
|
|
|
|
|
(aka HP-UX 11i v2) only through the end of 2022; see Table 2 of
|
|
|
|
|
<https://h20195.www2.hpe.com/V2/getpdf.aspx/4AA4-7673ENW.pdf>. */
|
|
|
|
|
#ifdef __hpux
|
|
|
|
|
# undef UINT_LEAST8_MAX
|
|
|
|
|
# undef UINT_LEAST16_MAX
|
|
|
|
|
# define UINT_LEAST8_MAX 255
|
|
|
|
|
# define UINT_LEAST16_MAX 65535
|
|
|
|
|
#endif
|
|
|
|
|
|
2023-10-16 13:41:40 -07:00
|
|
|
#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__
|
2023-11-03 23:10:40 -05:00
|
|
|
# define YY_USE(E) ((void) (E))
|
2023-10-16 13:41:40 -07:00
|
|
|
#else
|
2023-11-03 23:10:40 -05:00
|
|
|
# define YY_USE(E) /* empty */
|
2023-10-16 13:41:40 -07:00
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
/* Suppress an incorrect diagnostic about yylval being uninitialized. */
|
2023-11-03 23:10:40 -05:00
|
|
|
#if defined __GNUC__ && !defined __ICC && 406 <= __GNUC__ * 100 + __GNUC_MINOR__
|
|
|
|
|
# if __GNUC__ * 100 + __GNUC_MINOR__ < 407
|
|
|
|
|
# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN \
|
|
|
|
|
_Pragma("GCC diagnostic push") _Pragma("GCC diagnostic ignored \"-Wuninitialized\"")
|
|
|
|
|
# else
|
|
|
|
|
# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN \
|
|
|
|
|
_Pragma("GCC diagnostic push") _Pragma("GCC diagnostic ignored \"-Wuninitialized\"") \
|
|
|
|
|
_Pragma("GCC diagnostic ignored \"-Wmaybe-uninitialized\"")
|
|
|
|
|
# endif
|
2023-10-16 13:41:40 -07:00
|
|
|
# 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)))
|
|
|
|
|
|
2023-11-03 23:10:40 -05:00
|
|
|
#if !defined yyoverflow
|
2023-10-16 13:41:40 -07:00
|
|
|
|
|
|
|
|
/* 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
|
2023-11-03 23:10:40 -05:00
|
|
|
#endif /* !defined yyoverflow */
|
2023-10-16 13:41:40 -07:00
|
|
|
|
|
|
|
|
#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. */
|
2023-11-03 23:10:40 -05:00
|
|
|
#define YYFINAL 11
|
2023-10-16 13:41:40 -07:00
|
|
|
/* YYLAST -- Last index in YYTABLE. */
|
2023-11-03 23:10:40 -05:00
|
|
|
#define YYLAST 54
|
2023-10-16 13:41:40 -07:00
|
|
|
|
|
|
|
|
/* YYNTOKENS -- Number of terminals. */
|
|
|
|
|
#define YYNTOKENS 25
|
|
|
|
|
/* YYNNTS -- Number of nonterminals. */
|
2023-11-03 23:10:40 -05:00
|
|
|
#define YYNNTS 5
|
2023-10-16 13:41:40 -07:00
|
|
|
/* YYNRULES -- Number of rules. */
|
|
|
|
|
#define YYNRULES 16
|
|
|
|
|
/* YYNSTATES -- Number of states. */
|
|
|
|
|
#define YYNSTATES 44
|
|
|
|
|
|
2023-11-03 23:10:40 -05:00
|
|
|
/* YYMAXUTOK -- Last valid token kind. */
|
|
|
|
|
#define YYMAXUTOK 278
|
2023-10-16 13:41:40 -07:00
|
|
|
|
|
|
|
|
/* YYTRANSLATE(TOKEN-NUM) -- Symbol number corresponding to TOKEN-NUM
|
|
|
|
|
as returned by yylex, with out-of-bounds checking. */
|
2023-11-03 23:10:40 -05:00
|
|
|
#define YYTRANSLATE(YYX) \
|
|
|
|
|
(0 <= (YYX) && (YYX) <= YYMAXUTOK ? YY_CAST(yysymbol_kind_t, yytranslate[YYX]) \
|
|
|
|
|
: YYSYMBOL_YYUNDEF)
|
2023-10-16 13:41:40 -07:00
|
|
|
|
|
|
|
|
/* 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 15, 2, 2, 2, 2, 2,
|
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 16, 17, 18, 19, 20, 21, 22, 23, 24};
|
|
|
|
|
|
|
|
|
|
#if YYDEBUG
|
|
|
|
|
/* YYRLINE[YYN] -- Source line where rule number YYN was defined. */
|
|
|
|
|
static const yytype_int8 yyrline[] =
|
2023-11-03 23:10:40 -05:00
|
|
|
{0, 57, 57, 60, 61, 62, 63, 64, 65, 66, 69, 73, 77, 84, 87, 94, 97};
|
2023-10-16 13:41:40 -07:00
|
|
|
#endif
|
|
|
|
|
|
2023-11-03 23:10:40 -05:00
|
|
|
/** Accessing symbol of state STATE. */
|
|
|
|
|
#define YY_ACCESSING_SYMBOL(State) YY_CAST(yysymbol_kind_t, yystos[State])
|
|
|
|
|
|
|
|
|
|
#if YYDEBUG || 0
|
|
|
|
|
/* 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;
|
|
|
|
|
|
2023-10-16 13:41:40 -07:00
|
|
|
/* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.
|
|
|
|
|
First, the terminals, then, starting at YYNTOKENS, nonterminals. */
|
2023-11-03 23:10:40 -05:00
|
|
|
static const char* const yytname[] = {"\"end of file\"",
|
|
|
|
|
"error",
|
|
|
|
|
"\"invalid token\"",
|
|
|
|
|
"ADD",
|
|
|
|
|
"SUB",
|
|
|
|
|
"MUL",
|
|
|
|
|
"DIV",
|
|
|
|
|
"ABS",
|
|
|
|
|
"EQUALS",
|
|
|
|
|
"OP",
|
|
|
|
|
"CP",
|
|
|
|
|
"O_SQ",
|
|
|
|
|
"C_SQ",
|
|
|
|
|
"COLON",
|
|
|
|
|
"EOL",
|
|
|
|
|
"'|'",
|
|
|
|
|
"UMINUS",
|
|
|
|
|
"CM",
|
|
|
|
|
"NUMBER",
|
|
|
|
|
"RANGE",
|
|
|
|
|
"NAME",
|
|
|
|
|
"REDUCE",
|
|
|
|
|
"SELECT",
|
|
|
|
|
"LOWER_THAN_ELSE",
|
|
|
|
|
"ELSE",
|
|
|
|
|
"$accept",
|
|
|
|
|
"top",
|
|
|
|
|
"exp",
|
|
|
|
|
"reduce_dim_args",
|
|
|
|
|
"select_dim_args",
|
|
|
|
|
YY_NULLPTR};
|
|
|
|
|
|
|
|
|
|
static const char*
|
|
|
|
|
yysymbol_name(yysymbol_kind_t yysymbol)
|
|
|
|
|
{
|
|
|
|
|
return yytname[yysymbol];
|
|
|
|
|
}
|
2023-10-16 13:41:40 -07:00
|
|
|
#endif
|
|
|
|
|
|
2023-11-03 23:10:40 -05:00
|
|
|
#define YYPACT_NINF (-3)
|
2023-10-16 13:41:40 -07:00
|
|
|
|
|
|
|
|
#define yypact_value_is_default(Yyn) ((Yyn) == YYPACT_NINF)
|
|
|
|
|
|
|
|
|
|
#define YYTABLE_NINF (-1)
|
|
|
|
|
|
|
|
|
|
#define yytable_value_is_error(Yyn) 0
|
|
|
|
|
|
|
|
|
|
/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
|
|
|
|
|
STATE-NUM. */
|
2023-11-03 23:10:40 -05:00
|
|
|
static const yytype_int8 yypact[] = {11, 11, -3, -3, 1, 16, 7, 32, 18, 11, 11, -3, 11, 11, 11,
|
|
|
|
|
11, -3, -2, 13, 0, 0, -3, -3, 6, 28, 17, 20, -3, 30, 34,
|
|
|
|
|
31, 24, 27, 36, 33, 35, 37, -3, 24, 38, 20, -3, -3, -3};
|
2023-10-16 13:41:40 -07:00
|
|
|
|
|
|
|
|
/* 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. */
|
2023-11-03 23:10:40 -05:00
|
|
|
static const yytype_int8 yydefact[] = {0, 0, 3, 9, 0, 0, 0, 2, 0, 0, 0, 1, 0, 0, 0,
|
|
|
|
|
0, 8, 0, 0, 4, 5, 6, 7, 0, 0, 0, 0, 10, 0, 0,
|
|
|
|
|
0, 0, 0, 0, 13, 0, 15, 12, 0, 0, 0, 14, 11, 16};
|
2023-10-16 13:41:40 -07:00
|
|
|
|
|
|
|
|
/* YYPGOTO[NTERM-NUM]. */
|
2023-11-03 23:10:40 -05:00
|
|
|
static const yytype_int8 yypgoto[] = {-3, -3, -1, 14, 9};
|
2023-10-16 13:41:40 -07:00
|
|
|
|
|
|
|
|
/* YYDEFGOTO[NTERM-NUM]. */
|
2023-11-03 23:10:40 -05:00
|
|
|
static const yytype_int8 yydefgoto[] = {0, 6, 7, 35, 30};
|
2023-10-16 13:41:40 -07:00
|
|
|
|
|
|
|
|
/* 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. */
|
2023-11-03 23:10:40 -05:00
|
|
|
static const yytype_int8 yytable[] = {8, 12, 13, 14, 15, 14, 15, 11, 17, 18, 9, 19, 20, 21,
|
|
|
|
|
22, 23, 12, 13, 14, 15, 1, 12, 13, 14, 15, 10, 25, 27,
|
|
|
|
|
16, 2, 24, 3, 4, 5, 28, 12, 13, 14, 15, 26, 29, 31,
|
|
|
|
|
32, 33, 34, 36, 37, 39, 42, 43, 38, 0, 41, 0, 40};
|
|
|
|
|
|
|
|
|
|
static const yytype_int8 yycheck[] = {1, 3, 4, 5, 6, 5, 6, 0, 9, 10, 9, 12, 13, 14,
|
|
|
|
|
15, 17, 3, 4, 5, 6, 9, 3, 4, 5, 6, 9, 20, 10,
|
|
|
|
|
10, 18, 17, 20, 21, 22, 17, 3, 4, 5, 6, 11, 20, 11,
|
|
|
|
|
8, 12, 20, 18, 10, 12, 10, 40, 17, -1, 38, -1, 17};
|
|
|
|
|
|
|
|
|
|
/* YYSTOS[STATE-NUM] -- The symbol kind of the accessing symbol of
|
|
|
|
|
state STATE-NUM. */
|
|
|
|
|
static const yytype_int8 yystos[] = {0, 9, 18, 20, 21, 22, 26, 27, 27, 9, 9, 0, 3, 4, 5,
|
|
|
|
|
6, 10, 27, 27, 27, 27, 27, 27, 17, 17, 20, 11, 10, 17, 20,
|
|
|
|
|
29, 11, 8, 12, 20, 28, 18, 10, 17, 12, 17, 28, 10, 29};
|
|
|
|
|
|
|
|
|
|
/* YYR1[RULE-NUM] -- Symbol kind of the left-hand side of rule RULE-NUM. */
|
2023-10-16 13:41:40 -07:00
|
|
|
static const yytype_int8 yyr1[] =
|
2023-11-03 23:10:40 -05:00
|
|
|
{0, 25, 26, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 28, 28, 29, 29};
|
2023-10-16 13:41:40 -07:00
|
|
|
|
2023-11-03 23:10:40 -05:00
|
|
|
/* YYR2[RULE-NUM] -- Number of symbols on the right-hand side of rule RULE-NUM. */
|
|
|
|
|
static const yytype_int8 yyr2[] = {0, 2, 1, 1, 3, 3, 3, 3, 3, 1, 6, 10, 8, 1, 3, 3, 5};
|
|
|
|
|
|
|
|
|
|
enum
|
|
|
|
|
{
|
|
|
|
|
YYENOMEM = -2
|
|
|
|
|
};
|
2023-10-16 13:41:40 -07:00
|
|
|
|
|
|
|
|
#define yyerrok (yyerrstatus = 0)
|
|
|
|
|
#define yyclearin (yychar = YYEMPTY)
|
|
|
|
|
|
|
|
|
|
#define YYACCEPT goto yyacceptlab
|
|
|
|
|
#define YYABORT goto yyabortlab
|
|
|
|
|
#define YYERROR goto yyerrorlab
|
2023-11-03 23:10:40 -05:00
|
|
|
#define YYNOMEM goto yyexhaustedlab
|
2023-10-16 13:41:40 -07:00
|
|
|
|
|
|
|
|
#define YYRECOVERING() (!!yyerrstatus)
|
|
|
|
|
|
|
|
|
|
#define YYBACKUP(Token, Value) \
|
|
|
|
|
do \
|
|
|
|
|
if(yychar == YYEMPTY) \
|
|
|
|
|
{ \
|
|
|
|
|
yychar = (Token); \
|
|
|
|
|
yylval = (Value); \
|
|
|
|
|
YYPOPSTACK(yylen); \
|
|
|
|
|
yystate = *yyssp; \
|
|
|
|
|
goto yybackup; \
|
|
|
|
|
} \
|
|
|
|
|
else \
|
|
|
|
|
{ \
|
|
|
|
|
yyerror(result, YY_("syntax error: cannot back up")); \
|
|
|
|
|
YYERROR; \
|
|
|
|
|
} \
|
|
|
|
|
while(0)
|
|
|
|
|
|
2023-11-03 23:10:40 -05:00
|
|
|
/* Backward compatibility with an undocumented macro.
|
|
|
|
|
Use YYerror or YYUNDEF. */
|
|
|
|
|
#define YYERRCODE YYUNDEF
|
2023-10-16 13:41:40 -07:00
|
|
|
|
|
|
|
|
/* 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)
|
|
|
|
|
|
2023-11-03 23:10:40 -05:00
|
|
|
# define YY_SYMBOL_PRINT(Title, Kind, Value, Location) \
|
2023-10-16 13:41:40 -07:00
|
|
|
do \
|
|
|
|
|
{ \
|
|
|
|
|
if(yydebug) \
|
|
|
|
|
{ \
|
|
|
|
|
YYFPRINTF(stderr, "%s ", Title); \
|
2023-11-03 23:10:40 -05:00
|
|
|
yy_symbol_print(stderr, Kind, Value, result); \
|
2023-10-16 13:41:40 -07:00
|
|
|
YYFPRINTF(stderr, "\n"); \
|
|
|
|
|
} \
|
|
|
|
|
} while(0)
|
|
|
|
|
|
|
|
|
|
/*-----------------------------------.
|
|
|
|
|
| Print this symbol's value on YYO. |
|
|
|
|
|
`-----------------------------------*/
|
|
|
|
|
|
|
|
|
|
static void
|
2023-11-03 23:10:40 -05:00
|
|
|
yy_symbol_value_print(FILE* yyo,
|
|
|
|
|
yysymbol_kind_t yykind,
|
|
|
|
|
YYSTYPE const* const yyvaluep,
|
|
|
|
|
RawAST** result)
|
2023-10-16 13:41:40 -07:00
|
|
|
{
|
|
|
|
|
FILE* yyoutput = yyo;
|
2023-11-03 23:10:40 -05:00
|
|
|
YY_USE(yyoutput);
|
|
|
|
|
YY_USE(result);
|
2023-10-16 13:41:40 -07:00
|
|
|
if(!yyvaluep) return;
|
|
|
|
|
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
|
2023-11-03 23:10:40 -05:00
|
|
|
YY_USE(yykind);
|
2023-10-16 13:41:40 -07:00
|
|
|
YY_IGNORE_MAYBE_UNINITIALIZED_END
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*---------------------------.
|
|
|
|
|
| Print this symbol on YYO. |
|
|
|
|
|
`---------------------------*/
|
|
|
|
|
|
|
|
|
|
static void
|
2023-11-03 23:10:40 -05:00
|
|
|
yy_symbol_print(FILE* yyo, yysymbol_kind_t yykind, YYSTYPE const* const yyvaluep, RawAST** result)
|
2023-10-16 13:41:40 -07:00
|
|
|
{
|
2023-11-03 23:10:40 -05:00
|
|
|
YYFPRINTF(yyo, "%s %s (", yykind < YYNTOKENS ? "token" : "nterm", yysymbol_name(yykind));
|
2023-10-16 13:41:40 -07:00
|
|
|
|
2023-11-03 23:10:40 -05:00
|
|
|
yy_symbol_value_print(yyo, yykind, yyvaluep, result);
|
2023-10-16 13:41:40 -07:00
|
|
|
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, RawAST** result)
|
|
|
|
|
{
|
|
|
|
|
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);
|
2023-11-03 23:10:40 -05:00
|
|
|
yy_symbol_print(stderr,
|
|
|
|
|
YY_ACCESSING_SYMBOL(+yyssp[yyi + 1 - yynrhs]),
|
|
|
|
|
&yyvsp[(yyi + 1) - (yynrhs)],
|
|
|
|
|
result);
|
2023-10-16 13:41:40 -07:00
|
|
|
YYFPRINTF(stderr, "\n");
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
# define YY_REDUCE_PRINT(Rule) \
|
|
|
|
|
do \
|
|
|
|
|
{ \
|
|
|
|
|
if(yydebug) yy_reduce_print(yyssp, yyvsp, Rule, result); \
|
|
|
|
|
} while(0)
|
|
|
|
|
|
|
|
|
|
/* Nonzero means print parse trace. It is left uninitialized so that
|
|
|
|
|
multiple parsers can coexist. */
|
|
|
|
|
int yydebug;
|
|
|
|
|
#else /* !YYDEBUG */
|
2023-11-03 23:10:40 -05:00
|
|
|
# define YYDPRINTF(Args) ((void) 0)
|
|
|
|
|
# define YY_SYMBOL_PRINT(Title, Kind, Value, Location)
|
2023-10-16 13:41:40 -07:00
|
|
|
# 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
|
|
|
|
|
|
|
|
|
|
/*-----------------------------------------------.
|
|
|
|
|
| Release the memory associated to this symbol. |
|
|
|
|
|
`-----------------------------------------------*/
|
|
|
|
|
|
|
|
|
|
static void
|
2023-11-03 23:10:40 -05:00
|
|
|
yydestruct(const char* yymsg, yysymbol_kind_t yykind, YYSTYPE* yyvaluep, RawAST** result)
|
2023-10-16 13:41:40 -07:00
|
|
|
{
|
2023-11-03 23:10:40 -05:00
|
|
|
YY_USE(yyvaluep);
|
|
|
|
|
YY_USE(result);
|
2023-10-16 13:41:40 -07:00
|
|
|
if(!yymsg) yymsg = "Deleting";
|
2023-11-03 23:10:40 -05:00
|
|
|
YY_SYMBOL_PRINT(yymsg, yykind, yyvaluep, yylocationp);
|
2023-10-16 13:41:40 -07:00
|
|
|
|
|
|
|
|
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
|
2023-11-03 23:10:40 -05:00
|
|
|
YY_USE(yykind);
|
2023-10-16 13:41:40 -07:00
|
|
|
YY_IGNORE_MAYBE_UNINITIALIZED_END
|
|
|
|
|
}
|
|
|
|
|
|
2023-11-03 23:10:40 -05:00
|
|
|
/* Lookahead token kind. */
|
2023-10-16 13:41:40 -07:00
|
|
|
int yychar;
|
|
|
|
|
|
|
|
|
|
/* The semantic value of the lookahead symbol. */
|
|
|
|
|
YYSTYPE yylval;
|
|
|
|
|
/* Number of syntax errors so far. */
|
|
|
|
|
int yynerrs;
|
|
|
|
|
|
|
|
|
|
/*----------.
|
|
|
|
|
| yyparse. |
|
|
|
|
|
`----------*/
|
|
|
|
|
|
|
|
|
|
int
|
|
|
|
|
yyparse(RawAST** result)
|
|
|
|
|
{
|
2023-11-03 23:10:40 -05:00
|
|
|
yy_state_fast_t yystate = 0;
|
2023-10-16 13:41:40 -07:00
|
|
|
/* Number of tokens to shift before error messages enabled. */
|
2023-11-03 23:10:40 -05:00
|
|
|
int yyerrstatus = 0;
|
2023-10-16 13:41:40 -07:00
|
|
|
|
2023-11-03 23:10:40 -05:00
|
|
|
/* Refer to the stacks through separate pointers, to allow yyoverflow
|
2023-10-16 13:41:40 -07:00
|
|
|
to reallocate them elsewhere. */
|
|
|
|
|
|
2023-11-03 23:10:40 -05:00
|
|
|
/* Their size. */
|
|
|
|
|
YYPTRDIFF_T yystacksize = YYINITDEPTH;
|
|
|
|
|
|
|
|
|
|
/* The state stack: array, bottom, top. */
|
2023-10-16 13:41:40 -07:00
|
|
|
yy_state_t yyssa[YYINITDEPTH];
|
2023-11-03 23:10:40 -05:00
|
|
|
yy_state_t* yyss = yyssa;
|
|
|
|
|
yy_state_t* yyssp = yyss;
|
2023-10-16 13:41:40 -07:00
|
|
|
|
2023-11-03 23:10:40 -05:00
|
|
|
/* The semantic value stack: array, bottom, top. */
|
2023-10-16 13:41:40 -07:00
|
|
|
YYSTYPE yyvsa[YYINITDEPTH];
|
2023-11-03 23:10:40 -05:00
|
|
|
YYSTYPE* yyvs = yyvsa;
|
|
|
|
|
YYSTYPE* yyvsp = yyvs;
|
2023-10-16 13:41:40 -07:00
|
|
|
|
|
|
|
|
int yyn;
|
2023-11-03 23:10:40 -05:00
|
|
|
/* The return value of yyparse. */
|
2023-10-16 13:41:40 -07:00
|
|
|
int yyresult;
|
2023-11-03 23:10:40 -05:00
|
|
|
/* Lookahead symbol kind. */
|
|
|
|
|
yysymbol_kind_t yytoken = YYSYMBOL_YYEMPTY;
|
2023-10-16 13:41:40 -07:00
|
|
|
/* The variables used to return semantic value and location from the
|
|
|
|
|
action routines. */
|
|
|
|
|
YYSTYPE yyval;
|
|
|
|
|
|
|
|
|
|
#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"));
|
|
|
|
|
|
2023-11-03 23:10:40 -05:00
|
|
|
yychar = YYEMPTY; /* Cause a token to be read. */
|
|
|
|
|
|
2023-10-16 13:41:40 -07:00
|
|
|
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
|
2023-11-03 23:10:40 -05:00
|
|
|
YY_STACK_PRINT(yyss, yyssp);
|
2023-10-16 13:41:40 -07:00
|
|
|
|
|
|
|
|
if(yyss + yystacksize - 1 <= yyssp)
|
|
|
|
|
#if !defined yyoverflow && !defined YYSTACK_RELOCATE
|
2023-11-03 23:10:40 -05:00
|
|
|
YYNOMEM;
|
2023-10-16 13:41:40 -07:00
|
|
|
#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. */
|
2023-11-03 23:10:40 -05:00
|
|
|
if(YYMAXDEPTH <= yystacksize) YYNOMEM;
|
2023-10-16 13:41:40 -07:00
|
|
|
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))));
|
2023-11-03 23:10:40 -05:00
|
|
|
if(!yyptr) YYNOMEM;
|
2023-10-16 13:41:40 -07:00
|
|
|
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. */
|
|
|
|
|
|
2023-11-03 23:10:40 -05:00
|
|
|
/* YYCHAR is either empty, or end-of-input, or a valid lookahead. */
|
2023-10-16 13:41:40 -07:00
|
|
|
if(yychar == YYEMPTY)
|
|
|
|
|
{
|
2023-11-03 23:10:40 -05:00
|
|
|
YYDPRINTF((stderr, "Reading a token\n"));
|
2023-10-16 13:41:40 -07:00
|
|
|
yychar = yylex();
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if(yychar <= YYEOF)
|
|
|
|
|
{
|
2023-11-03 23:10:40 -05:00
|
|
|
yychar = YYEOF;
|
|
|
|
|
yytoken = YYSYMBOL_YYEOF;
|
2023-10-16 13:41:40 -07:00
|
|
|
YYDPRINTF((stderr, "Now at end of input.\n"));
|
|
|
|
|
}
|
2023-11-03 23:10:40 -05:00
|
|
|
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;
|
|
|
|
|
}
|
2023-10-16 13:41:40 -07:00
|
|
|
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)
|
|
|
|
|
{
|
2023-11-03 23:10:40 -05:00
|
|
|
case 2: /* top: exp */
|
|
|
|
|
#line 57 "parser.y"
|
2023-10-16 13:41:40 -07:00
|
|
|
{
|
|
|
|
|
*result = (yyvsp[0].a);
|
|
|
|
|
}
|
2023-11-03 23:10:40 -05:00
|
|
|
#line 1119 "parser.cpp"
|
2023-10-16 13:41:40 -07:00
|
|
|
break;
|
|
|
|
|
|
2023-11-03 23:10:40 -05:00
|
|
|
case 3: /* exp: NUMBER */
|
|
|
|
|
#line 60 "parser.y"
|
2023-10-16 13:41:40 -07:00
|
|
|
{
|
|
|
|
|
(yyval.a) = new RawAST(NUMBER_NODE, (yyvsp[0].d));
|
|
|
|
|
}
|
2023-11-03 23:10:40 -05:00
|
|
|
#line 1125 "parser.cpp"
|
2023-10-16 13:41:40 -07:00
|
|
|
break;
|
|
|
|
|
|
2023-11-03 23:10:40 -05:00
|
|
|
case 4: /* exp: exp ADD exp */
|
|
|
|
|
#line 61 "parser.y"
|
2023-10-16 13:41:40 -07:00
|
|
|
{
|
|
|
|
|
(yyval.a) = new RawAST(ADDITION_NODE, {(yyvsp[-2].a), (yyvsp[0].a)});
|
|
|
|
|
}
|
2023-11-03 23:10:40 -05:00
|
|
|
#line 1131 "parser.cpp"
|
2023-10-16 13:41:40 -07:00
|
|
|
break;
|
|
|
|
|
|
2023-11-03 23:10:40 -05:00
|
|
|
case 5: /* exp: exp SUB exp */
|
|
|
|
|
#line 62 "parser.y"
|
2023-10-16 13:41:40 -07:00
|
|
|
{
|
|
|
|
|
(yyval.a) = new RawAST(SUBTRACTION_NODE, {(yyvsp[-2].a), (yyvsp[0].a)});
|
|
|
|
|
}
|
2023-11-03 23:10:40 -05:00
|
|
|
#line 1137 "parser.cpp"
|
2023-10-16 13:41:40 -07:00
|
|
|
break;
|
|
|
|
|
|
2023-11-03 23:10:40 -05:00
|
|
|
case 6: /* exp: exp MUL exp */
|
|
|
|
|
#line 63 "parser.y"
|
2023-10-16 13:41:40 -07:00
|
|
|
{
|
|
|
|
|
(yyval.a) = new RawAST(MULTIPLY_NODE, {(yyvsp[-2].a), (yyvsp[0].a)});
|
|
|
|
|
}
|
2023-11-03 23:10:40 -05:00
|
|
|
#line 1143 "parser.cpp"
|
2023-10-16 13:41:40 -07:00
|
|
|
break;
|
|
|
|
|
|
2023-11-03 23:10:40 -05:00
|
|
|
case 7: /* exp: exp DIV exp */
|
|
|
|
|
#line 64 "parser.y"
|
2023-10-16 13:41:40 -07:00
|
|
|
{
|
|
|
|
|
(yyval.a) = new RawAST(DIVIDE_NODE, {(yyvsp[-2].a), (yyvsp[0].a)});
|
|
|
|
|
}
|
2023-11-03 23:10:40 -05:00
|
|
|
#line 1149 "parser.cpp"
|
2023-10-16 13:41:40 -07:00
|
|
|
break;
|
|
|
|
|
|
2023-11-03 23:10:40 -05:00
|
|
|
case 8: /* exp: OP exp CP */
|
|
|
|
|
#line 65 "parser.y"
|
2023-10-16 13:41:40 -07:00
|
|
|
{
|
|
|
|
|
(yyval.a) = (yyvsp[-1].a);
|
|
|
|
|
}
|
2023-11-03 23:10:40 -05:00
|
|
|
#line 1155 "parser.cpp"
|
2023-10-16 13:41:40 -07:00
|
|
|
break;
|
|
|
|
|
|
2023-11-03 23:10:40 -05:00
|
|
|
case 9: /* exp: NAME */
|
|
|
|
|
#line 66 "parser.y"
|
2023-10-16 13:41:40 -07:00
|
|
|
{
|
2023-11-03 23:10:40 -05:00
|
|
|
(yyval.a) = new RawAST(REFERENCE_NODE, (yyvsp[0].s));
|
|
|
|
|
free((yyvsp[0].s));
|
2023-10-16 13:41:40 -07:00
|
|
|
}
|
2023-11-03 23:10:40 -05:00
|
|
|
#line 1163 "parser.cpp"
|
2023-10-16 13:41:40 -07:00
|
|
|
break;
|
|
|
|
|
|
2023-11-03 23:10:40 -05:00
|
|
|
case 10: /* exp: REDUCE OP exp CM NAME CP */
|
|
|
|
|
#line 69 "parser.y"
|
2023-10-16 13:41:40 -07:00
|
|
|
{
|
2023-11-03 23:10:40 -05:00
|
|
|
(yyval.a) = new RawAST(REDUCE_NODE, (yyvsp[-3].a), (yyvsp[-1].s), NULL);
|
|
|
|
|
free((yyvsp[-1].s));
|
2023-10-16 13:41:40 -07:00
|
|
|
}
|
2023-11-03 23:10:40 -05:00
|
|
|
#line 1172 "parser.cpp"
|
2023-10-16 13:41:40 -07:00
|
|
|
break;
|
|
|
|
|
|
2023-11-03 23:10:40 -05:00
|
|
|
case 11: /* exp: REDUCE OP exp CM NAME CM O_SQ reduce_dim_args C_SQ CP */
|
|
|
|
|
#line 73 "parser.y"
|
2023-10-16 13:41:40 -07:00
|
|
|
{
|
2023-11-03 23:10:40 -05:00
|
|
|
(yyval.a) = new RawAST(REDUCE_NODE, (yyvsp[-7].a), (yyvsp[-5].s), (yyvsp[-2].ll));
|
|
|
|
|
free((yyvsp[-5].s));
|
2023-10-16 13:41:40 -07:00
|
|
|
}
|
2023-11-03 23:10:40 -05:00
|
|
|
#line 1181 "parser.cpp"
|
2023-10-16 13:41:40 -07:00
|
|
|
break;
|
|
|
|
|
|
2023-11-03 23:10:40 -05:00
|
|
|
case 12: /* exp: SELECT OP exp CM O_SQ select_dim_args C_SQ CP */
|
|
|
|
|
#line 77 "parser.y"
|
2023-10-16 13:41:40 -07:00
|
|
|
{
|
2023-11-03 23:10:40 -05:00
|
|
|
(yyval.a) = new RawAST(SELECT_NODE, (yyvsp[-5].a), (yyvsp[-2].ll));
|
2023-10-16 13:41:40 -07:00
|
|
|
}
|
2023-11-03 23:10:40 -05:00
|
|
|
#line 1189 "parser.cpp"
|
2023-10-16 13:41:40 -07:00
|
|
|
break;
|
|
|
|
|
|
2023-11-03 23:10:40 -05:00
|
|
|
case 13: /* reduce_dim_args: NAME */
|
|
|
|
|
#line 84 "parser.y"
|
2023-10-16 13:41:40 -07:00
|
|
|
{
|
2023-11-03 23:10:40 -05:00
|
|
|
(yyval.ll) = new LinkedList((yyvsp[0].s), NULL);
|
|
|
|
|
free((yyvsp[0].s));
|
2023-10-16 13:41:40 -07:00
|
|
|
}
|
2023-11-03 23:10:40 -05:00
|
|
|
#line 1197 "parser.cpp"
|
2023-10-16 13:41:40 -07:00
|
|
|
break;
|
|
|
|
|
|
2023-11-03 23:10:40 -05:00
|
|
|
case 14: /* reduce_dim_args: NAME CM reduce_dim_args */
|
|
|
|
|
#line 87 "parser.y"
|
2023-10-16 13:41:40 -07:00
|
|
|
{
|
2023-11-03 23:10:40 -05:00
|
|
|
(yyval.ll) = new LinkedList((yyvsp[-2].s), (yyvsp[0].ll));
|
|
|
|
|
free((yyvsp[-2].s));
|
2023-10-16 13:41:40 -07:00
|
|
|
}
|
2023-11-03 23:10:40 -05:00
|
|
|
#line 1205 "parser.cpp"
|
2023-10-16 13:41:40 -07:00
|
|
|
break;
|
|
|
|
|
|
2023-11-03 23:10:40 -05:00
|
|
|
case 15: /* select_dim_args: NAME EQUALS NUMBER */
|
|
|
|
|
#line 94 "parser.y"
|
2023-10-16 13:41:40 -07:00
|
|
|
{
|
2023-11-03 23:10:40 -05:00
|
|
|
(yyval.ll) = new LinkedList((yyvsp[-2].s), (yyvsp[0].d), NULL);
|
|
|
|
|
free((yyvsp[-2].s));
|
2023-10-16 13:41:40 -07:00
|
|
|
}
|
2023-11-03 23:10:40 -05:00
|
|
|
#line 1213 "parser.cpp"
|
2023-10-16 13:41:40 -07:00
|
|
|
break;
|
|
|
|
|
|
2023-11-03 23:10:40 -05:00
|
|
|
case 16: /* select_dim_args: NAME EQUALS NUMBER CM select_dim_args */
|
|
|
|
|
#line 97 "parser.y"
|
2023-10-16 13:41:40 -07:00
|
|
|
{
|
2023-11-03 23:10:40 -05:00
|
|
|
(yyval.ll) = new LinkedList((yyvsp[-4].s), (yyvsp[-2].d), (yyvsp[0].ll));
|
|
|
|
|
free((yyvsp[-4].s));
|
2023-10-16 13:41:40 -07:00
|
|
|
}
|
2023-11-03 23:10:40 -05:00
|
|
|
#line 1221 "parser.cpp"
|
2023-10-16 13:41:40 -07:00
|
|
|
break;
|
|
|
|
|
|
2023-11-03 23:10:40 -05:00
|
|
|
#line 1225 "parser.cpp"
|
2023-10-16 13:41:40 -07:00
|
|
|
|
|
|
|
|
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. */
|
2023-11-03 23:10:40 -05:00
|
|
|
YY_SYMBOL_PRINT("-> $$ =", YY_CAST(yysymbol_kind_t, yyr1[yyn]), &yyval, &yyloc);
|
2023-10-16 13:41:40 -07:00
|
|
|
|
|
|
|
|
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. */
|
2023-11-03 23:10:40 -05:00
|
|
|
yytoken = yychar == YYEMPTY ? YYSYMBOL_YYEMPTY : YYTRANSLATE(yychar);
|
2023-10-16 13:41:40 -07:00
|
|
|
/* If not already recovering from an error, report this error. */
|
|
|
|
|
if(!yyerrstatus)
|
|
|
|
|
{
|
|
|
|
|
++yynerrs;
|
|
|
|
|
yyerror(result, YY_("syntax error"));
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
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, result);
|
|
|
|
|
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;
|
2023-11-03 23:10:40 -05:00
|
|
|
++yynerrs;
|
2023-10-16 13:41:40 -07:00
|
|
|
|
|
|
|
|
/* 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. */
|
|
|
|
|
|
2023-11-03 23:10:40 -05:00
|
|
|
/* Pop stack until we find a state that shifts the error token. */
|
2023-10-16 13:41:40 -07:00
|
|
|
for(;;)
|
|
|
|
|
{
|
|
|
|
|
yyn = yypact[yystate];
|
|
|
|
|
if(!yypact_value_is_default(yyn))
|
|
|
|
|
{
|
2023-11-03 23:10:40 -05:00
|
|
|
yyn += YYSYMBOL_YYerror;
|
|
|
|
|
if(0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYSYMBOL_YYerror)
|
2023-10-16 13:41:40 -07:00
|
|
|
{
|
|
|
|
|
yyn = yytable[yyn];
|
|
|
|
|
if(0 < yyn) break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Pop the current state because it cannot handle the error token. */
|
|
|
|
|
if(yyssp == yyss) YYABORT;
|
|
|
|
|
|
2023-11-03 23:10:40 -05:00
|
|
|
yydestruct("Error: popping", YY_ACCESSING_SYMBOL(yystate), yyvsp, result);
|
2023-10-16 13:41:40 -07:00
|
|
|
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. */
|
2023-11-03 23:10:40 -05:00
|
|
|
YY_SYMBOL_PRINT("Shifting", YY_ACCESSING_SYMBOL(yyn), yyvsp, yylsp);
|
2023-10-16 13:41:40 -07:00
|
|
|
|
|
|
|
|
yystate = yyn;
|
|
|
|
|
goto yynewstate;
|
|
|
|
|
|
|
|
|
|
/*-------------------------------------.
|
|
|
|
|
| yyacceptlab -- YYACCEPT comes here. |
|
|
|
|
|
`-------------------------------------*/
|
|
|
|
|
yyacceptlab:
|
|
|
|
|
yyresult = 0;
|
2023-11-03 23:10:40 -05:00
|
|
|
goto yyreturnlab;
|
2023-10-16 13:41:40 -07:00
|
|
|
|
|
|
|
|
/*-----------------------------------.
|
|
|
|
|
| yyabortlab -- YYABORT comes here. |
|
|
|
|
|
`-----------------------------------*/
|
|
|
|
|
yyabortlab:
|
|
|
|
|
yyresult = 1;
|
2023-11-03 23:10:40 -05:00
|
|
|
goto yyreturnlab;
|
2023-10-16 13:41:40 -07:00
|
|
|
|
2023-11-03 23:10:40 -05:00
|
|
|
/*-----------------------------------------------------------.
|
|
|
|
|
| yyexhaustedlab -- YYNOMEM (memory exhaustion) comes here. |
|
|
|
|
|
`-----------------------------------------------------------*/
|
2023-10-16 13:41:40 -07:00
|
|
|
yyexhaustedlab:
|
|
|
|
|
yyerror(result, YY_("memory exhausted"));
|
|
|
|
|
yyresult = 2;
|
2023-11-03 23:10:40 -05:00
|
|
|
goto yyreturnlab;
|
2023-10-16 13:41:40 -07:00
|
|
|
|
2023-11-03 23:10:40 -05:00
|
|
|
/*----------------------------------------------------------.
|
|
|
|
|
| yyreturnlab -- parsing is finished, clean up and return. |
|
|
|
|
|
`----------------------------------------------------------*/
|
|
|
|
|
yyreturnlab:
|
2023-10-16 13:41:40 -07:00
|
|
|
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, result);
|
|
|
|
|
}
|
|
|
|
|
/* 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)
|
|
|
|
|
{
|
2023-11-03 23:10:40 -05:00
|
|
|
yydestruct("Cleanup: popping", YY_ACCESSING_SYMBOL(+*yyssp), yyvsp, result);
|
2023-10-16 13:41:40 -07:00
|
|
|
YYPOPSTACK(1);
|
|
|
|
|
}
|
|
|
|
|
#ifndef yyoverflow
|
|
|
|
|
if(yyss != yyssa) YYSTACK_FREE(yyss);
|
|
|
|
|
#endif
|
2023-11-03 23:10:40 -05:00
|
|
|
|
2023-10-16 13:41:40 -07:00
|
|
|
return yyresult;
|
|
|
|
|
}
|
|
|
|
|
|
2023-11-03 23:10:40 -05:00
|
|
|
#line 103 "parser.y"
|