Hawkin
/
arangodb
mirror of https://gitee.com/bigwinds/arangodb
1
0
Fork 0
Code Issues Projects Releases Wiki Activity
arangodb/arangod/Aql/grammar.cpp

3149 lines
102 KiB
C++
Raw Blame History

/* A Bison parser, made by GNU Bison 3.0.2. */
/* Bison implementation for Yacc-like parsers in C
Copyright (C) 1984, 1989-1990, 2000-2013 Free Software Foundation, Inc.
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>. */
/* As a special exception, you may create a larger work that contains
part or all of the Bison parser skeleton and distribute that work
under terms of your choice, so long as that work isn't itself a
parser generator using the skeleton or a modified version thereof
as a parser skeleton. Alternatively, if you modify or redistribute
the parser skeleton itself, you may (at your option) remove this
special exception, which will cause the skeleton and the resulting
Bison output files to be licensed under the GNU General Public
License without this special exception.
This special exception was added by the Free Software Foundation in
version 2.2 of Bison. */
/* C LALR(1) parser skeleton written by Richard Stallman, by
simplifying the original so-called "semantic" parser. */
/* All symbols defined below should begin with yy or YY, to avoid
infringing on user name space. This should be done even for local
variables, as they might otherwise be expanded by user macros.
There are some unavoidable exceptions within include files to
define necessary library symbols; they are noted "INFRINGES ON
USER NAME SPACE" below. */
/* Identify Bison output. */
#define YYBISON 1
/* Bison version. */
#define YYBISON_VERSION "3.0.2"
/* Skeleton name. */
#define YYSKELETON_NAME "yacc.c"
/* Pure parsers. */
#define YYPURE 1
/* Push parsers. */
#define YYPUSH 0
/* Pull parsers. */
#define YYPULL 1
/* Substitute the variable and function names. */
#define yyparse Aqlparse
#define yylex Aqllex
#define yyerror Aqlerror
#define yydebug Aqldebug
#define yynerrs Aqlnerrs
/* Copy the first part of user declarations. */
#line 10 "arangod/Aql/grammar.y" /* yacc.c:339 */
#include <stdio.h>
#include <stdlib.h>
#include <Basics/Common.h>
#include <Basics/conversions.h>
#include <Basics/tri-strings.h>
#include "Aql/AstNode.h"
#include "Aql/Parser.h"
#line 84 "arangod/Aql/grammar.cpp" /* yacc.c:339 */
# ifndef YY_NULLPTR
# if defined __cplusplus && 201103L <= __cplusplus
# define YY_NULLPTR nullptr
# else
# define YY_NULLPTR 0
# endif
# endif
/* Enabling verbose error messages. */
#ifdef YYERROR_VERBOSE
# undef YYERROR_VERBOSE
# define YYERROR_VERBOSE 1
#else
# define YYERROR_VERBOSE 1
#endif
/* In a future release of Bison, this section will be replaced
by #include "grammar.hpp". */
#ifndef YY_AQL_ARANGOD_AQL_GRAMMAR_HPP_INCLUDED
# define YY_AQL_ARANGOD_AQL_GRAMMAR_HPP_INCLUDED
/* Debug traces. */
#ifndef YYDEBUG
# define YYDEBUG 0
#endif
#if YYDEBUG
extern int Aqldebug;
#endif
/* Token type. */
#ifndef YYTOKENTYPE
# define YYTOKENTYPE
enum yytokentype
{
T_END = 0,
T_FOR = 258,
T_LET = 259,
T_FILTER = 260,
T_RETURN = 261,
T_COLLECT = 262,
T_SORT = 263,
T_LIMIT = 264,
T_ASC = 265,
T_DESC = 266,
T_IN = 267,
T_WITH = 268,
T_INTO = 269,
T_REMOVE = 270,
T_INSERT = 271,
T_UPDATE = 272,
T_REPLACE = 273,
T_NULL = 274,
T_TRUE = 275,
T_FALSE = 276,
T_STRING = 277,
T_QUOTED_STRING = 278,
T_INTEGER = 279,
T_DOUBLE = 280,
T_PARAMETER = 281,
T_ASSIGN = 282,
T_NOT = 283,
T_AND = 284,
T_OR = 285,
T_EQ = 286,
T_NE = 287,
T_LT = 288,
T_GT = 289,
T_LE = 290,
T_GE = 291,
T_PLUS = 292,
T_MINUS = 293,
T_TIMES = 294,
T_DIV = 295,
T_MOD = 296,
T_EXPAND = 297,
T_QUESTION = 298,
T_COLON = 299,
T_SCOPE = 300,
T_RANGE = 301,
T_COMMA = 302,
T_OPEN = 303,
T_CLOSE = 304,
T_DOC_OPEN = 305,
T_DOC_CLOSE = 306,
T_LIST_OPEN = 307,
T_LIST_CLOSE = 308,
UMINUS = 309,
UPLUS = 310,
FUNCCALL = 311,
REFERENCE = 312,
INDEXED = 313
};
#endif
/* Value type. */
#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
typedef union YYSTYPE YYSTYPE;
union YYSTYPE
{
#line 22 "arangod/Aql/grammar.y" /* yacc.c:355 */
triagens::aql::AstNode* node;
char* strval;
bool boolval;
int64_t intval;
#line 191 "arangod/Aql/grammar.cpp" /* yacc.c:355 */
};
# define YYSTYPE_IS_TRIVIAL 1
# define YYSTYPE_IS_DECLARED 1
#endif
/* Location type. */
#if ! defined YYLTYPE && ! defined YYLTYPE_IS_DECLARED
typedef struct YYLTYPE YYLTYPE;
struct YYLTYPE
{
int first_line;
int first_column;
int last_line;
int last_column;
};
# define YYLTYPE_IS_DECLARED 1
# define YYLTYPE_IS_TRIVIAL 1
#endif
int Aqlparse (triagens::aql::Parser* parser);
#endif /* !YY_AQL_ARANGOD_AQL_GRAMMAR_HPP_INCLUDED */
/* Copy the second part of user declarations. */
#line 29 "arangod/Aql/grammar.y" /* yacc.c:358 */
using namespace triagens::aql;
////////////////////////////////////////////////////////////////////////////////
/// @brief forward for lexer function defined in Aql/tokens.ll
////////////////////////////////////////////////////////////////////////////////
int Aqllex (YYSTYPE*,
YYLTYPE*,
void*);
////////////////////////////////////////////////////////////////////////////////
/// @brief register parse error
////////////////////////////////////////////////////////////////////////////////
void Aqlerror (YYLTYPE* locp,
triagens::aql::Parser* parser,
char const* message) {
parser->registerParseError(TRI_ERROR_QUERY_PARSE, message, locp->first_line, locp->first_column);
}
////////////////////////////////////////////////////////////////////////////////
/// @brief shortcut macro for signalling out of memory
////////////////////////////////////////////////////////////////////////////////
#define ABORT_OOM \
parser->registerError(TRI_ERROR_OUT_OF_MEMORY); \
YYABORT;
#define scanner parser->scanner()
#line 252 "arangod/Aql/grammar.cpp" /* yacc.c:358 */
#ifdef short
# undef short
#endif
#ifdef YYTYPE_UINT8
typedef YYTYPE_UINT8 yytype_uint8;
#else
typedef unsigned char yytype_uint8;
#endif
#ifdef YYTYPE_INT8
typedef YYTYPE_INT8 yytype_int8;
#else
typedef signed char yytype_int8;
#endif
#ifdef YYTYPE_UINT16
typedef YYTYPE_UINT16 yytype_uint16;
#else
typedef unsigned short int yytype_uint16;
#endif
#ifdef YYTYPE_INT16
typedef YYTYPE_INT16 yytype_int16;
#else
typedef short int yytype_int16;
#endif
#ifndef YYSIZE_T
# ifdef __SIZE_TYPE__
# define YYSIZE_T __SIZE_TYPE__
# elif defined size_t
# define YYSIZE_T size_t
# elif ! defined YYSIZE_T
# include <stddef.h> /* INFRINGES ON USER NAME SPACE */
# define YYSIZE_T size_t
# else
# define YYSIZE_T unsigned int
# endif
#endif
#define YYSIZE_MAXIMUM ((YYSIZE_T) -1)
#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
# if (defined __GNUC__ \
&& (2 < __GNUC__ || (__GNUC__ == 2 && 96 <= __GNUC_MINOR__))) \
|| defined __SUNPRO_C && 0x5110 <= __SUNPRO_C
# define YY_ATTRIBUTE(Spec) __attribute__(Spec)
# else
# define YY_ATTRIBUTE(Spec) /* empty */
# endif
#endif
#ifndef YY_ATTRIBUTE_PURE
# define YY_ATTRIBUTE_PURE YY_ATTRIBUTE ((__pure__))
#endif
#ifndef YY_ATTRIBUTE_UNUSED
# define YY_ATTRIBUTE_UNUSED YY_ATTRIBUTE ((__unused__))
#endif
#if !defined _Noreturn \
&& (!defined __STDC_VERSION__ || __STDC_VERSION__ < 201112)
# if defined _MSC_VER && 1200 <= _MSC_VER
# define _Noreturn __declspec (noreturn)
# else
# define _Noreturn YY_ATTRIBUTE ((__noreturn__))
# endif
#endif
/* Suppress unused-variable warnings by "using" E. */
#if ! defined lint || defined __GNUC__
# define YYUSE(E) ((void) (E))
#else
# define YYUSE(E) /* empty */
#endif
#if defined __GNUC__ && 407 <= __GNUC__ * 100 + __GNUC_MINOR__
/* Suppress an incorrect diagnostic about yylval being uninitialized. */
# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN \
_Pragma ("GCC diagnostic push") \
_Pragma ("GCC diagnostic ignored \"-Wuninitialized\"")\
_Pragma ("GCC diagnostic ignored \"-Wmaybe-uninitialized\"")
# define YY_IGNORE_MAYBE_UNINITIALIZED_END \
_Pragma ("GCC diagnostic pop")
#else
# define YY_INITIAL_VALUE(Value) Value
#endif
#ifndef YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
# define YY_IGNORE_MAYBE_UNINITIALIZED_END
#endif
#ifndef YY_INITIAL_VALUE
# define YY_INITIAL_VALUE(Value) /* Nothing. */
#endif
#if ! defined yyoverflow || YYERROR_VERBOSE
/* The parser invokes alloca or malloc; define the necessary symbols. */
# ifdef YYSTACK_USE_ALLOCA
# if YYSTACK_USE_ALLOCA
# ifdef __GNUC__
# define YYSTACK_ALLOC __builtin_alloca
# elif defined __BUILTIN_VA_ARG_INCR
# include <alloca.h> /* INFRINGES ON USER NAME SPACE */
# elif defined _AIX
# define YYSTACK_ALLOC __alloca
# elif defined _MSC_VER
# include <malloc.h> /* INFRINGES ON USER NAME SPACE */
# define alloca _alloca
# else
# define YYSTACK_ALLOC alloca
# if ! defined _ALLOCA_H && ! defined EXIT_SUCCESS
# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
/* Use EXIT_SUCCESS as a witness for stdlib.h. */
# ifndef EXIT_SUCCESS
# define EXIT_SUCCESS 0
# endif
# endif
# endif
# endif
# endif
# ifdef YYSTACK_ALLOC
/* Pacify GCC's 'empty if-body' warning. */
# define YYSTACK_FREE(Ptr) do { /* empty */; } while (0)
# ifndef YYSTACK_ALLOC_MAXIMUM
/* The OS might guarantee only one guard page at the bottom of the stack,
and a page size can be as small as 4096 bytes. So we cannot safely
invoke alloca (N) if N exceeds 4096. Use a slightly smaller number
to allow for a few compiler-allocated temporary stack slots. */
# define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2006 */
# endif
# else
# define YYSTACK_ALLOC YYMALLOC
# define YYSTACK_FREE YYFREE
# ifndef YYSTACK_ALLOC_MAXIMUM
# define YYSTACK_ALLOC_MAXIMUM YYSIZE_MAXIMUM
# endif
# if (defined __cplusplus && ! defined EXIT_SUCCESS \
&& ! ((defined YYMALLOC || defined malloc) \
&& (defined YYFREE || defined free)))
# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
# ifndef EXIT_SUCCESS
# define EXIT_SUCCESS 0
# endif
# endif
# ifndef YYMALLOC
# define YYMALLOC malloc
# if ! defined malloc && ! defined EXIT_SUCCESS
void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */
# endif
# endif
# ifndef YYFREE
# define YYFREE free
# if ! defined free && ! defined EXIT_SUCCESS
void free (void *); /* INFRINGES ON USER NAME SPACE */
# endif
# endif
# endif
#endif /* ! defined yyoverflow || YYERROR_VERBOSE */
#if (! defined yyoverflow \
&& (! defined __cplusplus \
|| (defined YYLTYPE_IS_TRIVIAL && YYLTYPE_IS_TRIVIAL \
&& defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL)))
/* A type that is properly aligned for any stack member. */
union yyalloc
{
yytype_int16 yyss_alloc;
YYSTYPE yyvs_alloc;
YYLTYPE yyls_alloc;
};
/* The size of the maximum gap between one aligned stack and the next. */
# define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1)
/* The size of an array large to enough to hold all stacks, each with
N elements. */
# define YYSTACK_BYTES(N) \
((N) * (sizeof (yytype_int16) + sizeof (YYSTYPE) + sizeof (YYLTYPE)) \
+ 2 * 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 \
{ \
YYSIZE_T yynewbytes; \
YYCOPY (&yyptr->Stack_alloc, Stack, yysize); \
Stack = &yyptr->Stack_alloc; \
yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \
yyptr += yynewbytes / sizeof (*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, (Count) * sizeof (*(Src)))
# else
# define YYCOPY(Dst, Src, Count) \
do \
{ \
YYSIZE_T yyi; \
for (yyi = 0; yyi < (Count); yyi++) \
(Dst)[yyi] = (Src)[yyi]; \
} \
while (0)
# endif
# endif
#endif /* !YYCOPY_NEEDED */
/* YYFINAL -- State number of the termination state. */
#define YYFINAL 3
/* YYLAST -- Last index in YYTABLE. */
#define YYLAST 593
/* YYNTOKENS -- Number of terminals. */
#define YYNTOKENS 60
/* YYNNTS -- Number of nonterminals. */
#define YYNNTS 59
/* YYNRULES -- Number of rules. */
#define YYNRULES 131
/* YYNSTATES -- Number of states. */
#define YYNSTATES 219
/* YYTRANSLATE[YYX] -- Symbol number corresponding to YYX as returned
by yylex, with out-of-bounds checking. */
#define YYUNDEFTOK 2
#define YYMAXUTOK 313
#define YYTRANSLATE(YYX) \
((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK)
/* YYTRANSLATE[TOKEN-NUM] -- Symbol number corresponding to TOKEN-NUM
as returned by yylex, without out-of-bounds checking. */
static const yytype_uint8 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, 59, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 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, 38, 39, 40, 41, 42, 43, 44,
45, 46, 47, 48, 49, 50, 51, 52, 53, 54,
55, 56, 57, 58
};
#if YYDEBUG
/* YYRLINE[YYN] -- Source line where rule number YYN was defined. */
static const yytype_uint16 yyrline[] =
{
0, 195, 195, 197, 199, 201, 203, 208, 210, 215,
217, 219, 221, 223, 225, 230, 239, 247, 252, 254,
259, 266, 266, 305, 307, 312, 319, 322, 328, 328,
339, 342, 348, 354, 357, 360, 366, 371, 378, 386,
389, 395, 406, 417, 425, 436, 444, 455, 458, 458,
471, 474, 477, 480, 483, 486, 489, 495, 502, 519,
519, 531, 534, 537, 543, 546, 549, 552, 555, 558,
561, 564, 567, 570, 573, 576, 579, 582, 585, 591,
597, 599, 604, 607, 613, 616, 622, 622, 631, 633,
638, 641, 647, 650, 664, 664, 673, 675, 680, 682,
687, 693, 697, 697, 725, 738, 745, 749, 753, 760,
765, 770, 775, 779, 783, 790, 793, 799, 802, 819,
822, 825, 828, 831, 837, 844, 851, 865, 871, 878,
887, 893
};
#endif
#if YYDEBUG || YYERROR_VERBOSE || 1
/* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.
First, the terminals, then, starting at YYNTOKENS, nonterminals. */
static const char *const yytname[] =
{
"\"end of query string\"", "error", "$undefined", "\"FOR declaration\"",
"\"LET declaration\"", "\"FILTER declaration\"",
"\"RETURN declaration\"", "\"COLLECT declaration\"",
"\"SORT declaration\"", "\"LIMIT declaration\"", "\"ASC keyword\"",
"\"DESC keyword\"", "\"IN keyword\"", "\"WITH keyword\"",
"\"INTO keyword\"", "\"REMOVE command\"", "\"INSERT command\"",
"\"UPDATE command\"", "\"REPLACE command\"", "\"null\"", "\"true\"",
"\"false\"", "\"identifier\"", "\"quoted string\"", "\"integer number\"",
"\"number\"", "\"bind parameter\"", "\"assignment\"", "\"not operator\"",
"\"and operator\"", "\"or operator\"", "\"== operator\"",
"\"!= operator\"", "\"< operator\"", "\"> operator\"", "\"<= operator\"",
"\">= operator\"", "\"+ operator\"", "\"- operator\"", "\"* operator\"",
"\"/ operator\"", "\"% operator\"", "\"[*] operator\"", "\"?\"", "\":\"",
"\"::\"", "\"..\"", "\",\"", "\"(\"", "\")\"", "\"{\"", "\"}\"", "\"[\"",
"\"]\"", "UMINUS", "UPLUS", "FUNCCALL", "REFERENCE", "INDEXED", "'.'",
"$accept", "query", "optional_statement_block_statements",
"statement_block_statement", "for_statement", "filter_statement",
"let_statement", "let_list", "let_element", "collect_statement", "$@1",
"collect_list", "collect_element", "optional_into", "sort_statement",
"$@2", "sort_list", "sort_element", "sort_direction", "limit_statement",
"return_statement", "in_or_into_collection", "remove_statement",
"insert_statement", "update_statement", "replace_statement",
"expression", "$@3", "function_name", "function_call", "$@4",
"operator_unary", "operator_binary", "operator_ternary",
"optional_function_call_arguments", "function_arguments_list",
"compound_type", "list", "$@5", "optional_list_elements",
"list_elements_list", "query_options", "array", "$@6",
"optional_array_elements", "array_elements_list", "array_element",
"reference", "$@7", "single_reference", "expansion", "atomic_value",
"numeric_value", "value_literal", "collection_name", "bind_parameter",
"array_element_name", "variable_name", "integer_value", YY_NULLPTR
};
#endif
# ifdef YYPRINT
/* YYTOKNUM[NUM] -- (External) token number corresponding to the
(internal) symbol number NUM (which must be that of a token). */
static const yytype_uint16 yytoknum[] =
{
0, 256, 257, 258, 259, 260, 261, 262, 263, 264,
265, 266, 267, 268, 269, 270, 271, 272, 273, 274,
275, 276, 277, 278, 279, 280, 281, 282, 283, 284,
285, 286, 287, 288, 289, 290, 291, 292, 293, 294,
295, 296, 297, 298, 299, 300, 301, 302, 303, 304,
305, 306, 307, 308, 309, 310, 311, 312, 313, 46
};
# endif
#define YYPACT_NINF -100
#define yypact_value_is_default(Yystate) \
(!!((Yystate) == (-100)))
#define YYTABLE_NINF -127
#define yytable_value_is_error(Yytable_value) \
0
/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
STATE-NUM. */
static const yytype_int16 yypact[] =
{
-100, 22, 490, -100, 1, 1, 143, 143, -100, -100,
207, 143, 143, 143, 143, -100, -100, -100, -100, -100,
-100, -100, -100, -100, -100, -100, -100, -100, 13, -5,
-100, 30, -100, -100, -100, -24, -100, -100, -100, -100,
143, 143, 143, 143, -100, -100, 436, 15, -100, -100,
-100, -100, -100, -100, -100, 27, -32, -100, -100, -100,
-100, -100, 436, 1, 143, 23, 376, 376, 311, 346,
143, 1, 143, 43, 43, 43, 236, -100, 40, 143,
143, 63, 143, 143, 143, 143, 143, 143, 143, 143,
143, 143, 143, 143, 143, 143, 143, 69, 45, 53,
143, 17, 0, -100, 70, 49, -100, 276, 207, 464,
33, 76, 76, 143, 76, 143, 76, 436, -100, 436,
-100, 52, -100, -100, 51, 57, -100, 61, 436, 55,
59, 256, 143, 535, 521, 552, 552, -9, -9, -9,
-9, 5, 5, 43, 43, 43, 406, 491, -100, 143,
-11, 101, -100, -100, 1, 1, -100, 143, 143, -100,
-100, -100, -100, 4, 16, 18, -100, -100, -100, -100,
-100, 64, -100, -100, 376, -100, 376, -100, -100, -100,
40, 143, -100, 143, 256, 143, 436, 62, 68, 143,
28, -1, -100, -100, -100, 436, -100, -100, 76, 76,
-100, 436, 436, 491, -100, 143, 176, -100, -100, 143,
46, -100, -100, 436, -100, 206, -100, -100, -100
};
/* YYDEFACT[STATE-NUM] -- Default reduction number in state STATE-NUM.
Performed when YYTABLE does not specify something else to do. Zero
means the default is an error. */
static const yytype_uint8 yydefact[] =
{
7, 0, 0, 1, 0, 0, 0, 0, 21, 28,
0, 0, 0, 0, 0, 8, 9, 11, 10, 12,
13, 14, 2, 3, 4, 5, 6, 130, 0, 17,
18, 0, 121, 122, 123, 104, 119, 131, 118, 127,
0, 0, 0, 48, 94, 86, 16, 59, 105, 50,
51, 52, 53, 84, 85, 55, 101, 54, 120, 115,
116, 117, 38, 0, 0, 36, 0, 0, 0, 0,
0, 0, 0, 63, 61, 62, 0, 7, 96, 88,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 26, 23, 0, 29, 30, 33, 0, 0,
0, 92, 92, 0, 92, 0, 92, 15, 19, 20,
47, 0, 128, 129, 0, 97, 98, 0, 90, 0,
89, 77, 0, 65, 64, 71, 72, 73, 74, 75,
76, 66, 67, 68, 69, 70, 0, 56, 58, 80,
0, 0, 106, 107, 0, 0, 22, 0, 0, 34,
35, 32, 37, 104, 119, 127, 39, 124, 125, 126,
40, 0, 41, 42, 0, 43, 0, 45, 49, 95,
0, 0, 87, 0, 78, 0, 82, 0, 81, 0,
0, 103, 108, 27, 24, 25, 31, 93, 92, 92,
99, 100, 91, 79, 60, 0, 0, 109, 110, 0,
0, 44, 46, 83, 111, 0, 112, 113, 114
};
/* YYPGOTO[NTERM-NUM]. */
static const yytype_int8 yypgoto[] =
{
-100, 42, -100, -100, -100, -100, -100, -100, 50, -100,
-100, -100, -38, -100, -100, -100, -100, -36, -100, -100,
-100, -58, -100, -100, -100, -100, -6, -100, -100, -100,
-100, -100, -100, -100, -100, -100, -100, -100, -100, -100,
-100, -99, -51, -100, -100, -100, -57, -100, -100, -100,
-100, 2, -100, -100, 14, -98, -100, -2, -100
};
/* YYDEFGOTO[NTERM-NUM]. */
static const yytype_int16 yydefgoto[] =
{
-1, 1, 2, 15, 16, 17, 18, 29, 30, 19,
63, 102, 103, 156, 20, 64, 105, 106, 161, 21,
22, 111, 23, 24, 25, 26, 107, 77, 47, 48,
98, 49, 50, 51, 187, 188, 52, 53, 79, 129,
130, 172, 54, 78, 124, 125, 126, 55, 99, 56,
191, 57, 58, 59, 166, 60, 127, 31, 61
};
/* YYTABLE[YYPACT[STATE-NUM]] -- What to do in state STATE-NUM. If
positive, shift that token. If negative, reduce the rule whose
number is the opposite. If YYTABLE_NINF, syntax error. */
static const yytype_int16 yytable[] =
{
46, 62, 28, 153, -124, 66, 67, 68, 69, 112,
114, 116, 65, 173, 154, 175, -125, 177, -126, 81,
100, -57, 3, 27, -57, 70, -124, 101, 90, 91,
92, 93, 94, 81, 73, 74, 75, 76, -125, 152,
-126, 189, 71, 39, 92, 93, 94, 155, 190, -57,
207, 209, -57, -124, 39, 167, 168, 72, 210, 169,
97, 104, 122, 123, 117, -125, 119, -126, 216, -102,
108, 81, 39, 128, 131, 132, 133, 134, 135, 136,
137, 138, 139, 140, 141, 142, 143, 144, 145, 146,
147, 148, 208, 149, 151, 150, 158, 157, 171, 211,
212, 178, 179, 131, 180, 181, 183, 174, 182, 176,
162, 204, 217, 80, 44, 205, 198, 194, 199, 121,
197, 118, 196, 200, 170, 0, 184, 0, 0, 81,
82, 83, 84, 85, 86, 87, 88, 89, 90, 91,
92, 93, 94, 186, 95, 0, 0, 96, 0, 0,
0, 195, 193, 104, 192, 0, 0, 0, 0, 0,
0, 0, 32, 33, 34, 35, 36, 37, 38, 39,
0, 40, 0, 0, 0, 201, 0, 202, 0, 203,
41, 42, 0, 206, 0, 0, 0, 0, 80, 0,
0, 43, 0, 44, 0, 45, 0, 0, 0, 213,
0, 0, 0, 215, 81, 82, 83, 84, 85, 86,
87, 88, 89, 90, 91, 92, 93, 94, 80, 95,
0, 0, 96, 0, 0, 0, 32, 33, 34, 214,
36, 37, 38, 39, 81, 82, 83, 84, 85, 86,
87, 88, 89, 90, 91, 92, 93, 94, 80, 95,
0, 0, 96, 0, 0, 0, 0, 0, 0, 218,
0, 0, 0, 0, 81, 82, 83, 84, 85, 86,
87, 88, 89, 90, 91, 92, 93, 94, 0, 95,
0, 0, 96, 0, 81, 120, 159, 160, 80, 86,
87, 88, 89, 90, 91, 92, 93, 94, 0, 0,
0, 0, 0, 0, 81, 82, 83, 84, 85, 86,
87, 88, 89, 90, 91, 92, 93, 94, 0, 95,
0, 0, 96, 109, 113, 110, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 81,
82, 83, 84, 85, 86, 87, 88, 89, 90, 91,
92, 93, 94, 0, 95, 0, 0, 96, 109, 115,
110, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 81, 82, 83, 84, 85, 86,
87, 88, 89, 90, 91, 92, 93, 94, 109, 95,
110, 0, 96, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 81, 82, 83, 84, 85, 86,
87, 88, 89, 90, 91, 92, 93, 94, 80, 95,
0, 0, 96, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 81, 82, 83, 84, 85, 86,
87, 88, 89, 90, 91, 92, 93, 94, 80, 95,
185, 0, 96, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 81, 82, 83, 84, 85, 86,
87, 88, 89, 90, 91, 92, 93, 94, 0, 95,
0, 0, 96, 32, 33, 34, 163, 164, 37, 38,
165, 0, 40, 4, 5, 6, 7, 8, 9, 10,
0, 41, 42, 80, 0, 11, 12, 13, 14, 0,
0, 0, 43, 0, 44, 0, 45, 0, 0, 81,
82, 83, 84, 85, 86, 87, 88, 89, 90, 91,
92, 93, 94, 80, 95, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 80, 0, 81,
82, 0, 84, 85, 86, 87, 88, 89, 90, 91,
92, 93, 94, 81, 80, 0, 84, 85, 86, 87,
88, 89, 90, 91, 92, 93, 94, 0, 0, 0,
81, 0, 0, 0, 0, 86, 87, 88, 89, 90,
91, 92, 93, 94
};
static const yytype_int16 yycheck[] =
{
6, 7, 4, 101, 0, 11, 12, 13, 14, 67,
68, 69, 10, 112, 14, 114, 0, 116, 0, 28,
52, 45, 0, 22, 48, 12, 22, 59, 37, 38,
39, 40, 41, 28, 40, 41, 42, 43, 22, 22,
22, 52, 47, 26, 39, 40, 41, 47, 59, 45,
22, 52, 48, 49, 26, 22, 23, 27, 59, 26,
45, 63, 22, 23, 70, 49, 72, 49, 22, 42,
47, 28, 26, 79, 80, 12, 82, 83, 84, 85,
86, 87, 88, 89, 90, 91, 92, 93, 94, 95,
96, 22, 190, 48, 100, 42, 47, 27, 22, 198,
199, 49, 51, 109, 47, 44, 47, 113, 53, 115,
108, 49, 210, 12, 50, 47, 174, 155, 176, 77,
171, 71, 158, 180, 110, -1, 132, -1, -1, 28,
29, 30, 31, 32, 33, 34, 35, 36, 37, 38,
39, 40, 41, 149, 43, -1, -1, 46, -1, -1,
-1, 157, 154, 155, 53, -1, -1, -1, -1, -1,
-1, -1, 19, 20, 21, 22, 23, 24, 25, 26,
-1, 28, -1, -1, -1, 181, -1, 183, -1, 185,
37, 38, -1, 189, -1, -1, -1, -1, 12, -1,
-1, 48, -1, 50, -1, 52, -1, -1, -1, 205,
-1, -1, -1, 209, 28, 29, 30, 31, 32, 33,
34, 35, 36, 37, 38, 39, 40, 41, 12, 43,
-1, -1, 46, -1, -1, -1, 19, 20, 21, 53,
23, 24, 25, 26, 28, 29, 30, 31, 32, 33,
34, 35, 36, 37, 38, 39, 40, 41, 12, 43,
-1, -1, 46, -1, -1, -1, -1, -1, -1, 53,
-1, -1, -1, -1, 28, 29, 30, 31, 32, 33,
34, 35, 36, 37, 38, 39, 40, 41, -1, 43,
-1, -1, 46, -1, 28, 49, 10, 11, 12, 33,
34, 35, 36, 37, 38, 39, 40, 41, -1, -1,
-1, -1, -1, -1, 28, 29, 30, 31, 32, 33,
34, 35, 36, 37, 38, 39, 40, 41, -1, 43,
-1, -1, 46, 12, 13, 14, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, 28,
29, 30, 31, 32, 33, 34, 35, 36, 37, 38,
39, 40, 41, -1, 43, -1, -1, 46, 12, 13,
14, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, 28, 29, 30, 31, 32, 33,
34, 35, 36, 37, 38, 39, 40, 41, 12, 43,
14, -1, 46, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, 28, 29, 30, 31, 32, 33,
34, 35, 36, 37, 38, 39, 40, 41, 12, 43,
-1, -1, 46, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, 28, 29, 30, 31, 32, 33,
34, 35, 36, 37, 38, 39, 40, 41, 12, 43,
44, -1, 46, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, 28, 29, 30, 31, 32, 33,
34, 35, 36, 37, 38, 39, 40, 41, -1, 43,
-1, -1, 46, 19, 20, 21, 22, 23, 24, 25,
26, -1, 28, 3, 4, 5, 6, 7, 8, 9,
-1, 37, 38, 12, -1, 15, 16, 17, 18, -1,
-1, -1, 48, -1, 50, -1, 52, -1, -1, 28,
29, 30, 31, 32, 33, 34, 35, 36, 37, 38,
39, 40, 41, 12, 43, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, 12, -1, 28,
29, -1, 31, 32, 33, 34, 35, 36, 37, 38,
39, 40, 41, 28, 12, -1, 31, 32, 33, 34,
35, 36, 37, 38, 39, 40, 41, -1, -1, -1,
28, -1, -1, -1, -1, 33, 34, 35, 36, 37,
38, 39, 40, 41
};
/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
symbol of state STATE-NUM. */
static const yytype_uint8 yystos[] =
{
0, 61, 62, 0, 3, 4, 5, 6, 7, 8,
9, 15, 16, 17, 18, 63, 64, 65, 66, 69,
74, 79, 80, 82, 83, 84, 85, 22, 117, 67,
68, 117, 19, 20, 21, 22, 23, 24, 25, 26,
28, 37, 38, 48, 50, 52, 86, 88, 89, 91,
92, 93, 96, 97, 102, 107, 109, 111, 112, 113,
115, 118, 86, 70, 75, 111, 86, 86, 86, 86,
12, 47, 27, 86, 86, 86, 86, 87, 103, 98,
12, 28, 29, 30, 31, 32, 33, 34, 35, 36,
37, 38, 39, 40, 41, 43, 46, 45, 90, 108,
52, 59, 71, 72, 117, 76, 77, 86, 47, 12,
14, 81, 81, 13, 81, 13, 81, 86, 68, 86,
49, 61, 22, 23, 104, 105, 106, 116, 86, 99,
100, 86, 12, 86, 86, 86, 86, 86, 86, 86,
86, 86, 86, 86, 86, 86, 86, 86, 22, 48,
42, 86, 22, 115, 14, 47, 73, 27, 47, 10,
11, 78, 111, 22, 23, 26, 114, 22, 23, 26,
114, 22, 101, 101, 86, 101, 86, 101, 49, 51,
47, 44, 53, 47, 86, 44, 86, 94, 95, 52,
59, 110, 53, 117, 72, 86, 77, 102, 81, 81,
106, 86, 86, 86, 49, 47, 86, 22, 115, 52,
59, 101, 101, 86, 53, 86, 22, 115, 53
};
/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */
static const yytype_uint8 yyr1[] =
{
0, 60, 61, 61, 61, 61, 61, 62, 62, 63,
63, 63, 63, 63, 63, 64, 65, 66, 67, 67,
68, 70, 69, 71, 71, 72, 73, 73, 75, 74,
76, 76, 77, 78, 78, 78, 79, 79, 80, 81,
81, 82, 83, 84, 84, 85, 85, 86, 87, 86,
86, 86, 86, 86, 86, 86, 86, 88, 88, 90,
89, 91, 91, 91, 92, 92, 92, 92, 92, 92,
92, 92, 92, 92, 92, 92, 92, 92, 92, 93,
94, 94, 95, 95, 96, 96, 98, 97, 99, 99,
100, 100, 101, 101, 103, 102, 104, 104, 105, 105,
106, 107, 108, 107, 109, 109, 109, 109, 109, 110,
110, 110, 110, 110, 110, 111, 111, 112, 112, 113,
113, 113, 113, 113, 114, 114, 114, 115, 116, 116,
117, 118
};
/* YYR2[YYN] -- Number of symbols on the right hand side of rule YYN. */
static const yytype_uint8 yyr2[] =
{
0, 2, 2, 2, 2, 2, 2, 0, 2, 1,
1, 1, 1, 1, 1, 4, 2, 2, 1, 3,
3, 0, 4, 1, 3, 3, 0, 2, 0, 3,
1, 3, 2, 0, 1, 1, 2, 4, 2, 2,
2, 4, 4, 4, 6, 4, 6, 3, 0, 4,
1, 1, 1, 1, 1, 1, 3, 1, 3, 0,
5, 2, 2, 2, 3, 3, 3, 3, 3, 3,
3, 3, 3, 3, 3, 3, 3, 3, 4, 5,
0, 1, 1, 3, 1, 1, 0, 4, 0, 1,
1, 3, 0, 2, 0, 4, 0, 1, 1, 3,
3, 1, 0, 4, 1, 1, 3, 3, 4, 2,
2, 3, 3, 3, 4, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1
};
#define yyerrok (yyerrstatus = 0)
#define yyclearin (yychar = YYEMPTY)
#define YYEMPTY (-2)
#define YYEOF 0
#define YYACCEPT goto yyacceptlab
#define YYABORT goto yyabortlab
#define YYERROR goto yyerrorlab
#define YYRECOVERING() (!!yyerrstatus)
#define YYBACKUP(Token, Value) \
do \
if (yychar == YYEMPTY) \
{ \
yychar = (Token); \
yylval = (Value); \
YYPOPSTACK (yylen); \
yystate = *yyssp; \
goto yybackup; \
} \
else \
{ \
yyerror (&yylloc, parser, YY_("syntax error: cannot back up")); \
YYERROR; \
} \
while (0)
/* Error token number */
#define YYTERROR 1
#define YYERRCODE 256
/* YYLLOC_DEFAULT -- Set CURRENT to span from RHS[1] to RHS[N].
If N is 0, then set CURRENT to the empty location which ends
the previous symbol: RHS[0] (always defined). */
#ifndef YYLLOC_DEFAULT
# define YYLLOC_DEFAULT(Current, Rhs, N) \
do \
if (N) \
{ \
(Current).first_line = YYRHSLOC (Rhs, 1).first_line; \
(Current).first_column = YYRHSLOC (Rhs, 1).first_column; \
(Current).last_line = YYRHSLOC (Rhs, N).last_line; \
(Current).last_column = YYRHSLOC (Rhs, N).last_column; \
} \
else \
{ \
(Current).first_line = (Current).last_line = \
YYRHSLOC (Rhs, 0).last_line; \
(Current).first_column = (Current).last_column = \
YYRHSLOC (Rhs, 0).last_column; \
} \
while (0)
#endif
#define YYRHSLOC(Rhs, K) ((Rhs)[K])
/* 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)
/* YY_LOCATION_PRINT -- Print the location on the stream.
This macro was not mandated originally: define only if we know
we won't break user code: when these are the locations we know. */
#ifndef YY_LOCATION_PRINT
# if defined YYLTYPE_IS_TRIVIAL && YYLTYPE_IS_TRIVIAL
/* Print *YYLOCP on YYO. Private, do not rely on its existence. */
YY_ATTRIBUTE_UNUSED
static unsigned
yy_location_print_ (FILE *yyo, YYLTYPE const * const yylocp)
{
unsigned res = 0;
int end_col = 0 != yylocp->last_column ? yylocp->last_column - 1 : 0;
if (0 <= yylocp->first_line)
{
res += YYFPRINTF (yyo, "%d", yylocp->first_line);
if (0 <= yylocp->first_column)
res += YYFPRINTF (yyo, ".%d", yylocp->first_column);
}
if (0 <= yylocp->last_line)
{
if (yylocp->first_line < yylocp->last_line)
{
res += YYFPRINTF (yyo, "-%d", yylocp->last_line);
if (0 <= end_col)
res += YYFPRINTF (yyo, ".%d", end_col);
}
else if (0 <= end_col && yylocp->first_column < end_col)
res += YYFPRINTF (yyo, "-%d", end_col);
}
return res;
}
# define YY_LOCATION_PRINT(File, Loc) \
yy_location_print_ (File, &(Loc))
# else
# define YY_LOCATION_PRINT(File, Loc) ((void) 0)
# endif
#endif
# define YY_SYMBOL_PRINT(Title, Type, Value, Location) \
do { \
if (yydebug) \
{ \
YYFPRINTF (stderr, "%s ", Title); \
yy_symbol_print (stderr, \
Type, Value, Location, parser); \
YYFPRINTF (stderr, "\n"); \
} \
} while (0)
/*----------------------------------------.
| Print this symbol's value on YYOUTPUT. |
`----------------------------------------*/
static void
yy_symbol_value_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep, YYLTYPE const * const yylocationp, triagens::aql::Parser* parser)
{
FILE *yyo = yyoutput;
YYUSE (yyo);
YYUSE (yylocationp);
YYUSE (parser);
if (!yyvaluep)
return;
# ifdef YYPRINT
if (yytype < YYNTOKENS)
YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep);
# endif
YYUSE (yytype);
}
/*--------------------------------.
| Print this symbol on YYOUTPUT. |
`--------------------------------*/
static void
yy_symbol_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep, YYLTYPE const * const yylocationp, triagens::aql::Parser* parser)
{
YYFPRINTF (yyoutput, "%s %s (",
yytype < YYNTOKENS ? "token" : "nterm", yytname[yytype]);
YY_LOCATION_PRINT (yyoutput, *yylocationp);
YYFPRINTF (yyoutput, ": ");
yy_symbol_value_print (yyoutput, yytype, yyvaluep, yylocationp, parser);
YYFPRINTF (yyoutput, ")");
}
/*------------------------------------------------------------------.
| yy_stack_print -- Print the state stack from its BOTTOM up to its |
| TOP (included). |
`------------------------------------------------------------------*/
static void
yy_stack_print (yytype_int16 *yybottom, yytype_int16 *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 (yytype_int16 *yyssp, YYSTYPE *yyvsp, YYLTYPE *yylsp, int yyrule, triagens::aql::Parser* parser)
{
unsigned long int yylno = yyrline[yyrule];
int yynrhs = yyr2[yyrule];
int yyi;
YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n",
yyrule - 1, yylno);
/* The symbols being reduced. */
for (yyi = 0; yyi < yynrhs; yyi++)
{
YYFPRINTF (stderr, " $%d = ", yyi + 1);
yy_symbol_print (stderr,
yystos[yyssp[yyi + 1 - yynrhs]],
&(yyvsp[(yyi + 1) - (yynrhs)])
, &(yylsp[(yyi + 1) - (yynrhs)]) , parser);
YYFPRINTF (stderr, "\n");
}
}
# define YY_REDUCE_PRINT(Rule) \
do { \
if (yydebug) \
yy_reduce_print (yyssp, yyvsp, yylsp, Rule, parser); \
} while (0)
/* Nonzero means print parse trace. It is left uninitialized so that
multiple parsers can coexist. */
int yydebug;
#else /* !YYDEBUG */
# define YYDPRINTF(Args)
# define YY_SYMBOL_PRINT(Title, Type, Value, Location)
# define YY_STACK_PRINT(Bottom, Top)
# define YY_REDUCE_PRINT(Rule)
#endif /* !YYDEBUG */
/* YYINITDEPTH -- initial size of the parser's stacks. */
#ifndef YYINITDEPTH
# define YYINITDEPTH 200
#endif
/* YYMAXDEPTH -- maximum size the stacks can grow to (effective only
if the built-in stack extension method is used).
Do not make this value too large; the results are undefined if
YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH)
evaluated with infinite-precision integer arithmetic. */
#ifndef YYMAXDEPTH
# define YYMAXDEPTH 10000
#endif
#if YYERROR_VERBOSE
# ifndef yystrlen
# if defined __GLIBC__ && defined _STRING_H
# define yystrlen strlen
# else
/* Return the length of YYSTR. */
static YYSIZE_T
yystrlen (const char *yystr)
{
YYSIZE_T yylen;
for (yylen = 0; yystr[yylen]; yylen++)
continue;
return yylen;
}
# endif
# endif
# ifndef yystpcpy
# if defined __GLIBC__ && defined _STRING_H && defined _GNU_SOURCE
# define yystpcpy stpcpy
# else
/* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in
YYDEST. */
static char *
yystpcpy (char *yydest, const char *yysrc)
{
char *yyd = yydest;
const char *yys = yysrc;
while ((*yyd++ = *yys++) != '\0')
continue;
return yyd - 1;
}
# endif
# endif
# ifndef yytnamerr
/* Copy to YYRES the contents of YYSTR after stripping away unnecessary
quotes and backslashes, so that it's suitable for yyerror. The
heuristic is that double-quoting is unnecessary unless the string
contains an apostrophe, a comma, or backslash (other than
backslash-backslash). YYSTR is taken from yytname. If YYRES is
null, do not copy; instead, return the length of what the result
would have been. */
static YYSIZE_T
yytnamerr (char *yyres, const char *yystr)
{
if (*yystr == '"')
{
YYSIZE_T yyn = 0;
char const *yyp = yystr;
for (;;)
switch (*++yyp)
{
case '\'':
case ',':
goto do_not_strip_quotes;
case '\\':
if (*++yyp != '\\')
goto do_not_strip_quotes;
/* Fall through. */
default:
if (yyres)
yyres[yyn] = *yyp;
yyn++;
break;
case '"':
if (yyres)
yyres[yyn] = '\0';
return yyn;
}
do_not_strip_quotes: ;
}
if (! yyres)
return yystrlen (yystr);
return yystpcpy (yyres, yystr) - yyres;
}
# endif
/* Copy into *YYMSG, which is of size *YYMSG_ALLOC, an error message
about the unexpected token YYTOKEN for the state stack whose top is
YYSSP.
Return 0 if *YYMSG was successfully written. Return 1 if *YYMSG is
not large enough to hold the message. In that case, also set
*YYMSG_ALLOC to the required number of bytes. Return 2 if the
required number of bytes is too large to store. */
static int
yysyntax_error (YYSIZE_T *yymsg_alloc, char **yymsg,
yytype_int16 *yyssp, int yytoken)
{
YYSIZE_T yysize0 = yytnamerr (YY_NULLPTR, yytname[yytoken]);
YYSIZE_T yysize = yysize0;
enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 };
/* Internationalized format string. */
const char *yyformat = YY_NULLPTR;
/* Arguments of yyformat. */
char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM];
/* Number of reported tokens (one for the "unexpected", one per
"expected"). */
int yycount = 0;
/* There are many possibilities here to consider:
- If this state is a consistent state with a default action, then
the only way this function was invoked is if the default action
is an error action. In that case, don't check for expected
tokens because there are none.
- The only way there can be no lookahead present (in yychar) is if
this state is a consistent state with a default action. Thus,
detecting the absence of a lookahead is sufficient to determine
that there is no unexpected or expected token to report. In that
case, just report a simple "syntax error".
- Don't assume there isn't a lookahead just because this state is a
consistent state with a default action. There might have been a
previous inconsistent state, consistent state with a non-default
action, or user semantic action that manipulated yychar.
- Of course, the expected token list depends on states to have
correct lookahead information, and it depends on the parser not
to perform extra reductions after fetching a lookahead from the
scanner and before detecting a syntax error. Thus, state merging
(from LALR or IELR) and default reductions corrupt the expected
token list. However, the list is correct for canonical LR with
one exception: it will still contain any token that will not be
accepted due to an error action in a later state.
*/
if (yytoken != YYEMPTY)
{
int yyn = yypact[*yyssp];
yyarg[yycount++] = yytname[yytoken];
if (!yypact_value_is_default (yyn))
{
/* Start YYX at -YYN if negative to avoid negative indexes in
YYCHECK. In other words, skip the first -YYN actions for
this state because they are default actions. */
int yyxbegin = yyn < 0 ? -yyn : 0;
/* Stay within bounds of both yycheck and yytname. */
int yychecklim = YYLAST - yyn + 1;
int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS;
int yyx;
for (yyx = yyxbegin; yyx < yyxend; ++yyx)
if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR
&& !yytable_value_is_error (yytable[yyx + yyn]))
{
if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM)
{
yycount = 1;
yysize = yysize0;
break;
}
yyarg[yycount++] = yytname[yyx];
{
YYSIZE_T yysize1 = yysize + yytnamerr (YY_NULLPTR, yytname[yyx]);
if (! (yysize <= yysize1
&& yysize1 <= YYSTACK_ALLOC_MAXIMUM))
return 2;
yysize = yysize1;
}
}
}
}
switch (yycount)
{
# define YYCASE_(N, S) \
case N: \
yyformat = S; \
break
YYCASE_(0, YY_("syntax error"));
YYCASE_(1, YY_("syntax error, unexpected %s"));
YYCASE_(2, YY_("syntax error, unexpected %s, expecting %s"));
YYCASE_(3, YY_("syntax error, unexpected %s, expecting %s or %s"));
YYCASE_(4, YY_("syntax error, unexpected %s, expecting %s or %s or %s"));
YYCASE_(5, YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s"));
# undef YYCASE_
}
{
YYSIZE_T yysize1 = yysize + yystrlen (yyformat);
if (! (yysize <= yysize1 && yysize1 <= YYSTACK_ALLOC_MAXIMUM))
return 2;
yysize = yysize1;
}
if (*yymsg_alloc < yysize)
{
*yymsg_alloc = 2 * yysize;
if (! (yysize <= *yymsg_alloc
&& *yymsg_alloc <= YYSTACK_ALLOC_MAXIMUM))
*yymsg_alloc = YYSTACK_ALLOC_MAXIMUM;
return 1;
}
/* Avoid sprintf, as that infringes on the user's name space.
Don't have undefined behavior even if the translation
produced a string with the wrong number of "%s"s. */
{
char *yyp = *yymsg;
int yyi = 0;
while ((*yyp = *yyformat) != '\0')
if (*yyp == '%' && yyformat[1] == 's' && yyi < yycount)
{
yyp += yytnamerr (yyp, yyarg[yyi++]);
yyformat += 2;
}
else
{
yyp++;
yyformat++;
}
}
return 0;
}
#endif /* YYERROR_VERBOSE */
/*-----------------------------------------------.
| Release the memory associated to this symbol. |
`-----------------------------------------------*/
static void
yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep, YYLTYPE *yylocationp, triagens::aql::Parser* parser)
{
YYUSE (yyvaluep);
YYUSE (yylocationp);
YYUSE (parser);
if (!yymsg)
yymsg = "Deleting";
YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp);
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
YYUSE (yytype);
YY_IGNORE_MAYBE_UNINITIALIZED_END
}
/*----------.
| yyparse. |
`----------*/
int
yyparse (triagens::aql::Parser* parser)
{
/* The lookahead symbol. */
int yychar;
/* The semantic value of the lookahead symbol. */
/* Default value used for initialization, for pacifying older GCCs
or non-GCC compilers. */
YY_INITIAL_VALUE (static YYSTYPE yyval_default;)
YYSTYPE yylval YY_INITIAL_VALUE (= yyval_default);
/* Location data for the lookahead symbol. */
static YYLTYPE yyloc_default
# if defined YYLTYPE_IS_TRIVIAL && YYLTYPE_IS_TRIVIAL
= { 1, 1, 1, 1 }
# endif
;
YYLTYPE yylloc = yyloc_default;
/* Number of syntax errors so far. */
int yynerrs;
int yystate;
/* Number of tokens to shift before error messages enabled. */
int yyerrstatus;
/* The stacks and their tools:
'yyss': related to states.
'yyvs': related to semantic values.
'yyls': related to locations.
Refer to the stacks through separate pointers, to allow yyoverflow
to reallocate them elsewhere. */
/* The state stack. */
yytype_int16 yyssa[YYINITDEPTH];
yytype_int16 *yyss;
yytype_int16 *yyssp;
/* The semantic value stack. */
YYSTYPE yyvsa[YYINITDEPTH];
YYSTYPE *yyvs;
YYSTYPE *yyvsp;
/* The location stack. */
YYLTYPE yylsa[YYINITDEPTH];
YYLTYPE *yyls;
YYLTYPE *yylsp;
/* The locations where the error started and ended. */
YYLTYPE yyerror_range[3];
YYSIZE_T yystacksize;
int yyn;
int yyresult;
/* Lookahead token as an internal (translated) token number. */
int yytoken = 0;
/* The variables used to return semantic value and location from the
action routines. */
YYSTYPE yyval;
YYLTYPE yyloc;
#if YYERROR_VERBOSE
/* Buffer for error messages, and its allocated size. */
char yymsgbuf[128];
char *yymsg = yymsgbuf;
YYSIZE_T yymsg_alloc = sizeof yymsgbuf;
#endif
#define YYPOPSTACK(N) (yyvsp -= (N), yyssp -= (N), yylsp -= (N))
/* The number of symbols on the RHS of the reduced rule.
Keep to zero when no symbol should be popped. */
int yylen = 0;
yyssp = yyss = yyssa;
yyvsp = yyvs = yyvsa;
yylsp = yyls = yylsa;
yystacksize = YYINITDEPTH;
YYDPRINTF ((stderr, "Starting parse\n"));
yystate = 0;
yyerrstatus = 0;
yynerrs = 0;
yychar = YYEMPTY; /* Cause a token to be read. */
yylsp[0] = yylloc;
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:
*yyssp = yystate;
if (yyss + yystacksize - 1 <= yyssp)
{
/* Get the current used size of the three stacks, in elements. */
YYSIZE_T yysize = yyssp - yyss + 1;
#ifdef 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. */
YYSTYPE *yyvs1 = yyvs;
yytype_int16 *yyss1 = yyss;
YYLTYPE *yyls1 = yyls;
/* 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 * sizeof (*yyssp),
&yyvs1, yysize * sizeof (*yyvsp),
&yyls1, yysize * sizeof (*yylsp),
&yystacksize);
yyls = yyls1;
yyss = yyss1;
yyvs = yyvs1;
}
#else /* no yyoverflow */
# ifndef YYSTACK_RELOCATE
goto yyexhaustedlab;
# else
/* Extend the stack our own way. */
if (YYMAXDEPTH <= yystacksize)
goto yyexhaustedlab;
yystacksize *= 2;
if (YYMAXDEPTH < yystacksize)
yystacksize = YYMAXDEPTH;
{
yytype_int16 *yyss1 = yyss;
union yyalloc *yyptr =
(union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize));
if (! yyptr)
goto yyexhaustedlab;
YYSTACK_RELOCATE (yyss_alloc, yyss);
YYSTACK_RELOCATE (yyvs_alloc, yyvs);
YYSTACK_RELOCATE (yyls_alloc, yyls);
# undef YYSTACK_RELOCATE
if (yyss1 != yyssa)
YYSTACK_FREE (yyss1);
}
# endif
#endif /* no yyoverflow */
yyssp = yyss + yysize - 1;
yyvsp = yyvs + yysize - 1;
yylsp = yyls + yysize - 1;
YYDPRINTF ((stderr, "Stack size increased to %lu\n",
(unsigned long int) yystacksize));
if (yyss + yystacksize - 1 <= yyssp)
YYABORT;
}
YYDPRINTF ((stderr, "Entering state %d\n", yystate));
if (yystate == YYFINAL)
YYACCEPT;
goto yybackup;
/*-----------.
| yybackup. |
`-----------*/
yybackup:
/* Do appropriate processing given the current state. Read a
lookahead token if we need one and don't already have one. */
/* First try to decide what to do without reference to lookahead token. */
yyn = yypact[yystate];
if (yypact_value_is_default (yyn))
goto yydefault;
/* Not known => get a lookahead token if don't already have one. */
/* YYCHAR is either YYEMPTY or YYEOF or a valid lookahead symbol. */
if (yychar == YYEMPTY)
{
YYDPRINTF ((stderr, "Reading a token: "));
yychar = yylex (&yylval, &yylloc, scanner);
}
if (yychar <= YYEOF)
{
yychar = yytoken = YYEOF;
YYDPRINTF ((stderr, "Now at end of input.\n"));
}
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);
/* Discard the shifted token. */
yychar = YYEMPTY;
yystate = yyn;
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
*++yyvsp = yylval;
YY_IGNORE_MAYBE_UNINITIALIZED_END
*++yylsp = yylloc;
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];
/* Default location. */
YYLLOC_DEFAULT (yyloc, (yylsp - yylen), yylen);
YY_REDUCE_PRINT (yyn);
switch (yyn)
{
case 2:
#line 195 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 1691 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 3:
#line 197 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 1698 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 4:
#line 199 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 1705 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 5:
#line 201 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 1712 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 6:
#line 203 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 1719 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 7:
#line 208 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 1726 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 8:
#line 210 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 1733 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 9:
#line 215 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 1740 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 10:
#line 217 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 1747 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 11:
#line 219 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 1754 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 12:
#line 221 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 1761 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 13:
#line 223 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 1768 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 14:
#line 225 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 1775 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 15:
#line 230 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
parser->ast()->scopes()->start(triagens::aql::AQL_SCOPE_FOR);
auto node = parser->ast()->createNodeFor((yyvsp[-2].strval), (yyvsp[0].node));
parser->ast()->addOperation(node);
}
#line 1786 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 16:
#line 239 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
// operand is a reference. can use it directly
auto node = parser->ast()->createNodeFilter((yyvsp[0].node));
parser->ast()->addOperation(node);
}
#line 1796 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 17:
#line 247 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 1803 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 18:
#line 252 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 1810 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 19:
#line 254 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 1817 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 20:
#line 259 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
auto node = parser->ast()->createNodeLet((yyvsp[-2].strval), (yyvsp[0].node), true);
parser->ast()->addOperation(node);
}
#line 1826 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 21:
#line 266 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
auto node = parser->ast()->createNodeList();
parser->pushStack(node);
}
#line 1835 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 22:
#line 269 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
auto list = static_cast<AstNode const*>(parser->popStack());
if (list == nullptr) {
ABORT_OOM
}
auto scopes = parser->ast()->scopes();
// check if we are in the main scope
bool reRegisterVariables = (scopes->type() != triagens::aql::AQL_SCOPE_MAIN);
if (reRegisterVariables) {
// end the active scopes
scopes->endNested();
// start a new scope
scopes->start(triagens::aql::AQL_SCOPE_COLLECT);
size_t const n = list->numMembers();
for (size_t i = 0; i < n; ++i) {
auto member = list->getMember(i);
if (member != nullptr) {
TRI_ASSERT(member->type == NODE_TYPE_ASSIGN);
auto v = static_cast<Variable*>(member->getMember(0)->getData());
scopes->addVariable(v);
}
}
}
auto node = parser->ast()->createNodeCollect(list, (yyvsp[0].strval));
parser->ast()->addOperation(node);
}
#line 1873 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 23:
#line 305 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 1880 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 24:
#line 307 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 1887 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 25:
#line 312 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
auto node = parser->ast()->createNodeAssign((yyvsp[-2].strval), (yyvsp[0].node));
parser->pushList(node);
}
#line 1896 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 26:
#line 319 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.strval) = nullptr;
}
#line 1904 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 27:
#line 322 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.strval) = (yyvsp[0].strval);
}
#line 1912 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 28:
#line 328 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
auto node = parser->ast()->createNodeList();
parser->pushStack(node);
}
#line 1921 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 29:
#line 331 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
auto list = static_cast<AstNode const*>(parser->popStack());
auto node = parser->ast()->createNodeSort(list);
parser->ast()->addOperation(node);
}
#line 1931 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 30:
#line 339 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
parser->pushList((yyvsp[0].node));
}
#line 1939 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 31:
#line 342 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
parser->pushList((yyvsp[0].node));
}
#line 1947 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 32:
#line 348 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeSortElement((yyvsp[-1].node), (yyvsp[0].boolval));
}
#line 1955 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 33:
#line 354 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.boolval) = true;
}
#line 1963 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 34:
#line 357 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.boolval) = true;
}
#line 1971 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 35:
#line 360 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.boolval) = false;
}
#line 1979 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 36:
#line 366 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
auto offset = parser->ast()->createNodeValueInt(0);
auto node = parser->ast()->createNodeLimit(offset, (yyvsp[0].node));
parser->ast()->addOperation(node);
}
#line 1989 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 37:
#line 371 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
auto node = parser->ast()->createNodeLimit((yyvsp[-2].node), (yyvsp[0].node));
parser->ast()->addOperation(node);
}
#line 1998 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 38:
#line 378 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
auto node = parser->ast()->createNodeReturn((yyvsp[0].node));
parser->ast()->addOperation(node);
parser->ast()->scopes()->endNested();
}
#line 2008 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 39:
#line 386 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 2016 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 40:
#line 389 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 2024 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 41:
#line 395 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
if (! parser->configureWriteQuery(AQL_QUERY_REMOVE, (yyvsp[-1].node), (yyvsp[0].node))) {
YYABORT;
}
auto node = parser->ast()->createNodeRemove((yyvsp[-2].node), (yyvsp[-1].node), (yyvsp[0].node));
parser->ast()->addOperation(node);
parser->ast()->scopes()->endNested();
}
#line 2037 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 42:
#line 406 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
if (! parser->configureWriteQuery(AQL_QUERY_INSERT, (yyvsp[-1].node), (yyvsp[0].node))) {
YYABORT;
}
auto node = parser->ast()->createNodeInsert((yyvsp[-2].node), (yyvsp[-1].node), (yyvsp[0].node));
parser->ast()->addOperation(node);
parser->ast()->scopes()->endNested();
}
#line 2050 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 43:
#line 417 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
if (! parser->configureWriteQuery(AQL_QUERY_UPDATE, (yyvsp[-1].node), (yyvsp[0].node))) {
YYABORT;
}
auto node = parser->ast()->createNodeUpdate(nullptr, (yyvsp[-2].node), (yyvsp[-1].node), (yyvsp[0].node));
parser->ast()->addOperation(node);
parser->ast()->scopes()->endNested();
}
#line 2063 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 44:
#line 425 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
if (! parser->configureWriteQuery(AQL_QUERY_UPDATE, (yyvsp[-1].node), (yyvsp[0].node))) {
YYABORT;
}
auto node = parser->ast()->createNodeUpdate((yyvsp[-4].node), (yyvsp[-2].node), (yyvsp[-1].node), (yyvsp[0].node));
parser->ast()->addOperation(node);
parser->ast()->scopes()->endNested();
}
#line 2076 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 45:
#line 436 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
if (! parser->configureWriteQuery(AQL_QUERY_REPLACE, (yyvsp[-1].node), (yyvsp[0].node))) {
YYABORT;
}
auto node = parser->ast()->createNodeReplace(nullptr, (yyvsp[-2].node), (yyvsp[-1].node), (yyvsp[0].node));
parser->ast()->addOperation(node);
parser->ast()->scopes()->endNested();
}
#line 2089 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 46:
#line 444 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
if (! parser->configureWriteQuery(AQL_QUERY_REPLACE, (yyvsp[-1].node), (yyvsp[0].node))) {
YYABORT;
}
auto node = parser->ast()->createNodeReplace((yyvsp[-4].node), (yyvsp[-2].node), (yyvsp[-1].node), (yyvsp[0].node));
parser->ast()->addOperation(node);
parser->ast()->scopes()->endNested();
}
#line 2102 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 47:
#line 455 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[-1].node);
}
#line 2110 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 48:
#line 458 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
parser->ast()->scopes()->start(triagens::aql::AQL_SCOPE_SUBQUERY);
parser->ast()->startSubQuery();
}
#line 2119 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 49:
#line 461 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
AstNode* node = parser->ast()->endSubQuery();
parser->ast()->scopes()->endCurrent();
std::string const variableName = parser->ast()->variables()->nextName();
auto subQuery = parser->ast()->createNodeLet(variableName.c_str(), node, false);
parser->ast()->addOperation(subQuery);
(yyval.node) = parser->ast()->createNodeReference(variableName.c_str());
}
#line 2134 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 50:
#line 471 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 2142 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 51:
#line 474 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 2150 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 52:
#line 477 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 2158 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 53:
#line 480 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 2166 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 54:
#line 483 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 2174 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 55:
#line 486 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 2182 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 56:
#line 489 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeRange((yyvsp[-2].node), (yyvsp[0].node));
}
#line 2190 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 57:
#line 495 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.strval) = (yyvsp[0].strval);
if ((yyval.strval) == nullptr) {
ABORT_OOM
}
}
#line 2202 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 58:
#line 502 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
if ((yyvsp[-2].strval) == nullptr || (yyvsp[0].strval) == nullptr) {
ABORT_OOM
}
std::string temp((yyvsp[-2].strval));
temp.append("::");
temp.append((yyvsp[0].strval));
(yyval.strval) = parser->query()->registerString(temp.c_str(), temp.size(), false);
if ((yyval.strval) == nullptr) {
ABORT_OOM
}
}
#line 2221 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 59:
#line 519 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
parser->pushStack((yyvsp[0].strval));
auto node = parser->ast()->createNodeList();
parser->pushStack(node);
}
#line 2232 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 60:
#line 524 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
auto list = static_cast<AstNode const*>(parser->popStack());
(yyval.node) = parser->ast()->createNodeFunctionCall(static_cast<char const*>(parser->popStack()), list);
}
#line 2241 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 61:
#line 531 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeUnaryOperator(NODE_TYPE_OPERATOR_UNARY_PLUS, (yyvsp[0].node));
}
#line 2249 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 62:
#line 534 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeUnaryOperator(NODE_TYPE_OPERATOR_UNARY_MINUS, (yyvsp[0].node));
}
#line 2257 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 63:
#line 537 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeUnaryOperator(NODE_TYPE_OPERATOR_UNARY_NOT, (yyvsp[0].node));
}
#line 2265 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 64:
#line 543 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_OR, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 2273 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 65:
#line 546 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_AND, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 2281 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 66:
#line 549 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_PLUS, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 2289 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 67:
#line 552 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_MINUS, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 2297 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 68:
#line 555 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_TIMES, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 2305 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 69:
#line 558 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_DIV, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 2313 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 70:
#line 561 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_MOD, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 2321 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 71:
#line 564 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_EQ, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 2329 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 72:
#line 567 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_NE, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 2337 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 73:
#line 570 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_LT, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 2345 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 74:
#line 573 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_GT, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 2353 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 75:
#line 576 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_LE, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 2361 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 76:
#line 579 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_GE, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 2369 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 77:
#line 582 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_IN, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 2377 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 78:
#line 585 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_NIN, (yyvsp[-3].node), (yyvsp[0].node));
}
#line 2385 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 79:
#line 591 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeTernaryOperator((yyvsp[-4].node), (yyvsp[-2].node), (yyvsp[0].node));
}
#line 2393 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 80:
#line 597 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2400 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 81:
#line 599 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2407 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 82:
#line 604 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
parser->pushList((yyvsp[0].node));
}
#line 2415 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 83:
#line 607 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
parser->pushList((yyvsp[0].node));
}
#line 2423 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 84:
#line 613 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 2431 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 85:
#line 616 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 2439 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 86:
#line 622 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
auto node = parser->ast()->createNodeList();
parser->pushStack(node);
}
#line 2448 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 87:
#line 625 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = static_cast<AstNode*>(parser->popStack());
}
#line 2456 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 88:
#line 631 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2463 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 89:
#line 633 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2470 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 90:
#line 638 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
parser->pushList((yyvsp[0].node));
}
#line 2478 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 91:
#line 641 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
parser->pushList((yyvsp[0].node));
}
#line 2486 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 92:
#line 647 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = nullptr;
}
#line 2494 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 93:
#line 650 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
if ((yyvsp[-1].strval) == nullptr || (yyvsp[0].node) == nullptr) {
ABORT_OOM
}
if (! TRI_CaseEqualString((yyvsp[-1].strval), "OPTIONS")) {
parser->registerParseError(TRI_ERROR_QUERY_PARSE, "unexpected qualifier '%s', expecting 'OPTIONS'", (yyvsp[-1].strval), yylloc.first_line, yylloc.first_column);
}
(yyval.node) = (yyvsp[0].node);
}
#line 2510 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 94:
#line 664 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
auto node = parser->ast()->createNodeArray();
parser->pushStack(node);
}
#line 2519 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 95:
#line 667 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = static_cast<AstNode*>(parser->popStack());
}
#line 2527 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 96:
#line 673 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2534 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 97:
#line 675 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2541 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 98:
#line 680 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2548 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 99:
#line 682 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2555 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 100:
#line 687 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
parser->pushArray((yyvsp[-2].strval), (yyvsp[0].node));
}
#line 2563 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 101:
#line 693 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
// start of reference (collection or variable name)
(yyval.node) = (yyvsp[0].node);
}
#line 2572 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 102:
#line 697 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
// expanded variable access, e.g. variable[*]
// create a temporary iterator variable
std::string const nextName = parser->ast()->variables()->nextName() + "_";
char const* iteratorName = nextName.c_str();
auto iterator = parser->ast()->createNodeIterator(iteratorName, (yyvsp[0].node));
parser->pushStack(iterator);
parser->pushStack(parser->ast()->createNodeReference(iteratorName));
}
#line 2588 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 103:
#line 707 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
// return from the "expansion" subrule
// push the expand node into the statement list
auto iterator = static_cast<AstNode*>(parser->popStack());
auto expand = parser->ast()->createNodeExpand(iterator, (yyvsp[0].node));
std::string const nextName = parser->ast()->variables()->nextName();
char const* variableName = nextName.c_str();
auto let = parser->ast()->createNodeLet(variableName, expand, false);
parser->ast()->addOperation(let);
// return a reference only
(yyval.node) = parser->ast()->createNodeReference(variableName);
}
#line 2608 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 104:
#line 725 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
// variable or collection
AstNode* node;
if (parser->ast()->scopes()->existsVariable((yyvsp[0].strval))) {
node = parser->ast()->createNodeReference((yyvsp[0].strval));
}
else {
node = parser->ast()->createNodeCollection((yyvsp[0].strval));
}
(yyval.node) = node;
}
#line 2626 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 105:
#line 738 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
if ((yyval.node) == nullptr) {
ABORT_OOM
}
}
#line 2638 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 106:
#line 745 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
// named variable access, e.g. variable.reference
(yyval.node) = parser->ast()->createNodeAttributeAccess((yyvsp[-2].node), (yyvsp[0].strval));
}
#line 2647 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 107:
#line 749 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
// named variable access, e.g. variable.@reference
(yyval.node) = parser->ast()->createNodeBoundAttributeAccess((yyvsp[-2].node), (yyvsp[0].node));
}
#line 2656 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 108:
#line 753 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
// indexed variable access, e.g. variable[index]
(yyval.node) = parser->ast()->createNodeIndexedAccess((yyvsp[-3].node), (yyvsp[-1].node));
}
#line 2665 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 109:
#line 760 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
// named variable access, continuation from * expansion, e.g. [*].variable.reference
auto node = static_cast<AstNode*>(parser->popStack());
(yyval.node) = parser->ast()->createNodeAttributeAccess(node, (yyvsp[0].strval));
}
#line 2675 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 110:
#line 765 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
// named variable access w/ bind parameter, continuation from * expansion, e.g. [*].variable.@reference
auto node = static_cast<AstNode*>(parser->popStack());
(yyval.node) = parser->ast()->createNodeBoundAttributeAccess(node, (yyvsp[0].node));
}
#line 2685 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 111:
#line 770 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
// indexed variable access, continuation from * expansion, e.g. [*].variable[index]
auto node = static_cast<AstNode*>(parser->popStack());
(yyval.node) = parser->ast()->createNodeIndexedAccess(node, (yyvsp[-1].node));
}
#line 2695 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 112:
#line 775 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
// named variable access, continuation from * expansion, e.g. [*].variable.xx.reference
(yyval.node) = parser->ast()->createNodeAttributeAccess((yyvsp[-2].node), (yyvsp[0].strval));
}
#line 2704 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 113:
#line 779 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
// named variable access w/ bind parameter, continuation from * expansion, e.g. [*].variable.xx.@reference
(yyval.node) = parser->ast()->createNodeBoundAttributeAccess((yyvsp[-2].node), (yyvsp[0].node));
}
#line 2713 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 114:
#line 783 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
// indexed variable access, continuation from * expansion, e.g. [*].variable.xx.[index]
(yyval.node) = parser->ast()->createNodeIndexedAccess((yyvsp[-3].node), (yyvsp[-1].node));
}
#line 2722 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 115:
#line 790 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 2730 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 116:
#line 793 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 2738 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 117:
#line 799 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 2746 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 118:
#line 802 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
if ((yyvsp[0].strval) == nullptr) {
ABORT_OOM
}
double value = TRI_DoubleString((yyvsp[0].strval));
if (TRI_errno() != TRI_ERROR_NO_ERROR) {
parser->registerWarning(TRI_ERROR_QUERY_NUMBER_OUT_OF_RANGE, TRI_errno_string(TRI_ERROR_QUERY_NUMBER_OUT_OF_RANGE), yylloc.first_line, yylloc.first_column);
(yyval.node) = parser->ast()->createNodeValueNull();
}
else {
(yyval.node) = parser->ast()->createNodeValueDouble(value);
}
}
#line 2766 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 119:
#line 819 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeValueString((yyvsp[0].strval));
}
#line 2774 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 120:
#line 822 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 2782 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 121:
#line 825 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeValueNull();
}
#line 2790 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 122:
#line 828 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeValueBool(true);
}
#line 2798 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 123:
#line 831 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeValueBool(false);
}
#line 2806 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 124:
#line 837 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
if ((yyvsp[0].strval) == nullptr) {
ABORT_OOM
}
(yyval.node) = parser->ast()->createNodeCollection((yyvsp[0].strval));
}
#line 2818 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 125:
#line 844 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
if ((yyvsp[0].strval) == nullptr) {
ABORT_OOM
}
(yyval.node) = parser->ast()->createNodeCollection((yyvsp[0].strval));
}
#line 2830 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 126:
#line 851 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
if ((yyvsp[0].strval) == nullptr) {
ABORT_OOM
}
if (strlen((yyvsp[0].strval)) < 2 || (yyvsp[0].strval)[0] != '@') {
parser->registerParseError(TRI_ERROR_QUERY_BIND_PARAMETER_TYPE, TRI_errno_string(TRI_ERROR_QUERY_BIND_PARAMETER_TYPE), (yyvsp[0].strval), yylloc.first_line, yylloc.first_column);
}
(yyval.node) = parser->ast()->createNodeParameter((yyvsp[0].strval));
}
#line 2846 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 127:
#line 865 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeParameter((yyvsp[0].strval));
}
#line 2854 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 128:
#line 871 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
if ((yyvsp[0].strval) == nullptr) {
ABORT_OOM
}
(yyval.strval) = (yyvsp[0].strval);
}
#line 2866 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 129:
#line 878 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
if ((yyvsp[0].strval) == nullptr) {
ABORT_OOM
}
(yyval.strval) = (yyvsp[0].strval);
}
#line 2878 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 130:
#line 887 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.strval) = (yyvsp[0].strval);
}
#line 2886 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 131:
#line 893 "arangod/Aql/grammar.y" /* yacc.c:1646 */
{
if ((yyvsp[0].strval) == nullptr) {
ABORT_OOM
}
int64_t value = TRI_Int64String((yyvsp[0].strval));
if (TRI_errno() == TRI_ERROR_NO_ERROR) {
(yyval.node) = parser->ast()->createNodeValueInt(value);
}
else {
double value2 = TRI_DoubleString((yyvsp[0].strval));
if (TRI_errno() == TRI_ERROR_NO_ERROR) {
(yyval.node) = parser->ast()->createNodeValueDouble(value2);
}
else {
parser->registerWarning(TRI_ERROR_QUERY_NUMBER_OUT_OF_RANGE, TRI_errno_string(TRI_ERROR_QUERY_NUMBER_OUT_OF_RANGE), yylloc.first_line, yylloc.first_column);
(yyval.node) = parser->ast()->createNodeValueNull();
}
}
}
#line 2911 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
break;
#line 2915 "arangod/Aql/grammar.cpp" /* yacc.c:1646 */
default: break;
}
/* User semantic actions sometimes alter yychar, and that requires
that yytoken be updated with the new translation. We take the
approach of translating immediately before every use of yytoken.
One alternative is translating here after every semantic action,
but that translation would be missed if the semantic action invokes
YYABORT, YYACCEPT, or YYERROR immediately after altering yychar or
if it invokes YYBACKUP. In the case of YYABORT or YYACCEPT, an
incorrect destructor might then be invoked immediately. In the
case of YYERROR or YYBACKUP, subsequent parser actions might lead
to an incorrect destructor call or verbose syntax error message
before the lookahead is translated. */
YY_SYMBOL_PRINT ("-> $$ =", yyr1[yyn], &yyval, &yyloc);
YYPOPSTACK (yylen);
yylen = 0;
YY_STACK_PRINT (yyss, yyssp);
*++yyvsp = yyval;
*++yylsp = yyloc;
/* 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 - YYNTOKENS] + *yyssp;
if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp)
yystate = yytable[yystate];
else
yystate = yydefgoto[yyn - YYNTOKENS];
goto yynewstate;
/*--------------------------------------.
| yyerrlab -- here on detecting error. |
`--------------------------------------*/
yyerrlab:
/* Make sure we have latest lookahead translation. See comments at
user semantic actions for why this is necessary. */
yytoken = yychar == YYEMPTY ? YYEMPTY : YYTRANSLATE (yychar);
/* If not already recovering from an error, report this error. */
if (!yyerrstatus)
{
++yynerrs;
#if ! YYERROR_VERBOSE
yyerror (&yylloc, parser, YY_("syntax error"));
#else
# define YYSYNTAX_ERROR yysyntax_error (&yymsg_alloc, &yymsg, \
yyssp, yytoken)
{
char const *yymsgp = YY_("syntax error");
int yysyntax_error_status;
yysyntax_error_status = YYSYNTAX_ERROR;
if (yysyntax_error_status == 0)
yymsgp = yymsg;
else if (yysyntax_error_status == 1)
{
if (yymsg != yymsgbuf)
YYSTACK_FREE (yymsg);
yymsg = (char *) YYSTACK_ALLOC (yymsg_alloc);
if (!yymsg)
{
yymsg = yymsgbuf;
yymsg_alloc = sizeof yymsgbuf;
yysyntax_error_status = 2;
}
else
{
yysyntax_error_status = YYSYNTAX_ERROR;
yymsgp = yymsg;
}
}
yyerror (&yylloc, parser, yymsgp);
if (yysyntax_error_status == 2)
goto yyexhaustedlab;
}
# undef YYSYNTAX_ERROR
#endif
}
yyerror_range[1] = yylloc;
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, &yylloc, parser);
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 like GCC when the user code never invokes
YYERROR and the label yyerrorlab therefore never appears in user
code. */
if (/*CONSTCOND*/ 0)
goto yyerrorlab;
yyerror_range[1] = yylsp[1-yylen];
/* 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. */
for (;;)
{
yyn = yypact[yystate];
if (!yypact_value_is_default (yyn))
{
yyn += YYTERROR;
if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR)
{
yyn = yytable[yyn];
if (0 < yyn)
break;
}
}
/* Pop the current state because it cannot handle the error token. */
if (yyssp == yyss)
YYABORT;
yyerror_range[1] = *yylsp;
yydestruct ("Error: popping",
yystos[yystate], yyvsp, yylsp, parser);
YYPOPSTACK (1);
yystate = *yyssp;
YY_STACK_PRINT (yyss, yyssp);
}
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
*++yyvsp = yylval;
YY_IGNORE_MAYBE_UNINITIALIZED_END
yyerror_range[2] = yylloc;
/* Using YYLLOC is tempting, but would change the location of
the lookahead. YYLOC is available though. */
YYLLOC_DEFAULT (yyloc, yyerror_range, 2);
*++yylsp = yyloc;
/* Shift the error token. */
YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp);
yystate = yyn;
goto yynewstate;
/*-------------------------------------.
| yyacceptlab -- YYACCEPT comes here. |
`-------------------------------------*/
yyacceptlab:
yyresult = 0;
goto yyreturn;
/*-----------------------------------.
| yyabortlab -- YYABORT comes here. |
`-----------------------------------*/
yyabortlab:
yyresult = 1;
goto yyreturn;
#if !defined yyoverflow || YYERROR_VERBOSE
/*-------------------------------------------------.
| yyexhaustedlab -- memory exhaustion comes here. |
`-------------------------------------------------*/
yyexhaustedlab:
yyerror (&yylloc, parser, YY_("memory exhausted"));
yyresult = 2;
/* Fall through. */
#endif
yyreturn:
if (yychar != YYEMPTY)
{
/* Make sure we have latest lookahead translation. See comments at
user semantic actions for why this is necessary. */
yytoken = YYTRANSLATE (yychar);
yydestruct ("Cleanup: discarding lookahead",
yytoken, &yylval, &yylloc, parser);
}
/* Do not reclaim the symbols of the rule whose action triggered
this YYABORT or YYACCEPT. */
YYPOPSTACK (yylen);
YY_STACK_PRINT (yyss, yyssp);
while (yyssp != yyss)
{
yydestruct ("Cleanup: popping",
yystos[*yyssp], yyvsp, yylsp, parser);
YYPOPSTACK (1);
}
#ifndef yyoverflow
if (yyss != yyssa)
YYSTACK_FREE (yyss);
#endif
#if YYERROR_VERBOSE
if (yymsg != yymsgbuf)
YYSTACK_FREE (yymsg);
#endif
return yyresult;
}
Reference in New Issue View Git Blame Copy Permalink