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

4446 lines
151 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 9 "Aql/grammar.y" /* yacc.c:339 */
#include "Aql/AstNode.h"
#include "Aql/CollectNode.h"
#include "Aql/Function.h"
#include "Aql/Parser.h"
#include "Aql/Quantifier.h"
#include "Basics/conversions.h"
#include "Basics/tri-strings.h"
#line 82 "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_AQL_GRAMMAR_HPP_INCLUDED
# define YY_AQL_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_AGGREGATE = 270,
T_GRAPH = 271,
T_DISTINCT = 272,
T_REMOVE = 273,
T_INSERT = 274,
T_UPDATE = 275,
T_REPLACE = 276,
T_UPSERT = 277,
T_NULL = 278,
T_TRUE = 279,
T_FALSE = 280,
T_STRING = 281,
T_QUOTED_STRING = 282,
T_INTEGER = 283,
T_DOUBLE = 284,
T_PARAMETER = 285,
T_ASSIGN = 286,
T_NOT = 287,
T_AND = 288,
T_OR = 289,
T_NIN = 290,
T_EQ = 291,
T_NE = 292,
T_LT = 293,
T_GT = 294,
T_LE = 295,
T_GE = 296,
T_LIKE = 297,
T_PLUS = 298,
T_MINUS = 299,
T_TIMES = 300,
T_DIV = 301,
T_MOD = 302,
T_QUESTION = 303,
T_COLON = 304,
T_SCOPE = 305,
T_RANGE = 306,
T_COMMA = 307,
T_OPEN = 308,
T_CLOSE = 309,
T_OBJECT_OPEN = 310,
T_OBJECT_CLOSE = 311,
T_ARRAY_OPEN = 312,
T_ARRAY_CLOSE = 313,
T_OUTBOUND = 314,
T_INBOUND = 315,
T_ANY = 316,
T_ALL = 317,
T_NONE = 318,
UMINUS = 319,
UPLUS = 320,
FUNCCALL = 321,
REFERENCE = 322,
INDEXED = 323,
EXPANSION = 324
};
#endif
/* Value type. */
#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
typedef union YYSTYPE YYSTYPE;
union YYSTYPE
{
#line 19 "Aql/grammar.y" /* yacc.c:355 */
arangodb::aql::AstNode* node;
struct {
char* value;
size_t length;
} strval;
bool boolval;
int64_t intval;
#line 203 "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 (arangodb::aql::Parser* parser);
#endif /* !YY_AQL_AQL_GRAMMAR_HPP_INCLUDED */
/* Copy the second part of user declarations. */
#line 29 "Aql/grammar.y" /* yacc.c:358 */
using namespace arangodb::aql;
////////////////////////////////////////////////////////////////////////////////
/// @brief shortcut macro for signaling out of memory
////////////////////////////////////////////////////////////////////////////////
#define ABORT_OOM \
parser->registerError(TRI_ERROR_OUT_OF_MEMORY); \
YYABORT;
#define scanner parser->scanner()
////////////////////////////////////////////////////////////////////////////////
/// @brief forward for lexer function defined in Aql/tokens.ll
////////////////////////////////////////////////////////////////////////////////
int Aqllex (YYSTYPE*,
YYLTYPE*,
void*);
////////////////////////////////////////////////////////////////////////////////
/// @brief register parse error
////////////////////////////////////////////////////////////////////////////////
void Aqlerror (YYLTYPE* locp,
arangodb::aql::Parser* parser,
char const* message) {
parser->registerParseError(TRI_ERROR_QUERY_PARSE, message, locp->first_line, locp->first_column);
}
////////////////////////////////////////////////////////////////////////////////
/// @brief check if any of the variables used in the INTO expression were
/// introduced by the COLLECT itself, in which case it would fail
////////////////////////////////////////////////////////////////////////////////
static Variable const* CheckIntoVariables(AstNode const* collectVars,
std::unordered_set<Variable const*> const& vars) {
if (collectVars == nullptr || collectVars->type != NODE_TYPE_ARRAY) {
return nullptr;
}
size_t const n = collectVars->numMembers();
for (size_t i = 0; i < n; ++i) {
auto member = collectVars->getMember(i);
if (member != nullptr) {
TRI_ASSERT(member->type == NODE_TYPE_ASSIGN);
auto v = static_cast<Variable*>(member->getMember(0)->getData());
if (vars.find(v) != vars.end()) {
return v;
}
}
}
return nullptr;
}
////////////////////////////////////////////////////////////////////////////////
/// @brief register variables in the scope
////////////////////////////////////////////////////////////////////////////////
static void RegisterAssignVariables(arangodb::aql::Scopes* scopes, AstNode const* vars) {
size_t const n = vars->numMembers();
for (size_t i = 0; i < n; ++i) {
auto member = vars->getMember(i);
if (member != nullptr) {
TRI_ASSERT(member->type == NODE_TYPE_ASSIGN);
auto v = static_cast<Variable*>(member->getMember(0)->getData());
scopes->addVariable(v);
}
}
}
////////////////////////////////////////////////////////////////////////////////
/// @brief validate the aggregate variables expressions
////////////////////////////////////////////////////////////////////////////////
static bool ValidateAggregates(Parser* parser, AstNode const* aggregates) {
size_t const n = aggregates->numMembers();
for (size_t i = 0; i < n; ++i) {
auto member = aggregates->getMember(i);
if (member != nullptr) {
TRI_ASSERT(member->type == NODE_TYPE_ASSIGN);
auto func = member->getMember(1);
bool isValid = true;
if (func->type != NODE_TYPE_FCALL) {
// aggregate expression must be a function call
isValid = false;
}
else {
auto f = static_cast<arangodb::aql::Function*>(func->getData());
if (! Aggregator::isSupported(f->externalName)) {
// aggregate expression must be a call to MIN|MAX|LENGTH...
isValid = false;
}
}
if (! isValid) {
parser->registerError(TRI_ERROR_QUERY_INVALID_AGGREGATE_EXPRESSION);
return false;
}
}
}
return true;
}
////////////////////////////////////////////////////////////////////////////////
/// @brief start a new scope for the collect
////////////////////////////////////////////////////////////////////////////////
static bool StartCollectScope(arangodb::aql::Scopes* scopes) {
// check if we are in the main scope
if (scopes->type() == arangodb::aql::AQL_SCOPE_MAIN) {
return false;
}
// end the active scopes
scopes->endNested();
// start a new scope
scopes->start(arangodb::aql::AQL_SCOPE_COLLECT);
return true;
}
////////////////////////////////////////////////////////////////////////////////
/// @brief get the INTO variable stored in a node (may not exist)
////////////////////////////////////////////////////////////////////////////////
static AstNode const* GetIntoVariable(Parser* parser, AstNode const* node) {
if (node == nullptr) {
return nullptr;
}
if (node->type == NODE_TYPE_VALUE) {
// node is a string containing the variable name
return parser->ast()->createNodeVariable(node->getStringValue(), node->getStringLength(), true);
}
// node is an array with the variable name as the first member
TRI_ASSERT(node->type == NODE_TYPE_ARRAY);
TRI_ASSERT(node->numMembers() == 2);
auto v = node->getMember(0);
TRI_ASSERT(v->type == NODE_TYPE_VALUE);
return parser->ast()->createNodeVariable(v->getStringValue(), v->getStringLength(), true);
}
////////////////////////////////////////////////////////////////////////////////
/// @brief get the INTO variable = expression stored in a node (may not exist)
////////////////////////////////////////////////////////////////////////////////
static AstNode const* GetIntoExpression(AstNode const* node) {
if (node == nullptr || node->type == NODE_TYPE_VALUE) {
return nullptr;
}
// node is an array with the expression as the second member
TRI_ASSERT(node->type == NODE_TYPE_ARRAY);
TRI_ASSERT(node->numMembers() == 2);
return node->getMember(1);
}
#line 401 "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 7
/* YYLAST -- Last index in YYTABLE. */
#define YYLAST 1176
/* YYNTOKENS -- Number of terminals. */
#define YYNTOKENS 71
/* YYNNTS -- Number of nonterminals. */
#define YYNNTS 90
/* YYNRULES -- Number of rules. */
#define YYNRULES 212
/* YYNSTATES -- Number of states. */
#define YYNSTATES 353
/* YYTRANSLATE[YYX] -- Symbol number corresponding to YYX as returned
by yylex, with out-of-bounds checking. */
#define YYUNDEFTOK 2
#define YYMAXUTOK 324
#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, 70, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 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, 59, 60, 61, 62, 63, 64,
65, 66, 67, 68, 69
};
#if YYDEBUG
/* YYRLINE[YYN] -- Source line where rule number YYN was defined. */
static const yytype_uint16 yyrline[] =
{
0, 364, 364, 367, 378, 382, 386, 393, 395, 395,
406, 411, 416, 418, 421, 424, 427, 430, 436, 438,
443, 445, 447, 449, 451, 453, 455, 457, 459, 461,
463, 468, 474, 479, 484, 492, 500, 505, 507, 512,
519, 529, 529, 543, 552, 563, 593, 660, 685, 718,
720, 725, 732, 735, 738, 747, 761, 778, 778, 792,
792, 802, 802, 813, 816, 822, 828, 831, 834, 837,
843, 848, 855, 863, 866, 872, 882, 892, 900, 911,
916, 924, 935, 940, 943, 949, 949, 1000, 1003, 1006,
1012, 1012, 1022, 1028, 1031, 1034, 1037, 1040, 1043, 1049,
1052, 1068, 1068, 1077, 1077, 1087, 1090, 1093, 1099, 1102,
1105, 1108, 1111, 1114, 1117, 1120, 1123, 1126, 1129, 1132,
1135, 1138, 1141, 1144, 1150, 1153, 1156, 1159, 1162, 1165,
1168, 1171, 1177, 1183, 1185, 1190, 1193, 1193, 1209, 1212,
1218, 1221, 1227, 1227, 1236, 1238, 1243, 1246, 1252, 1255,
1269, 1269, 1278, 1280, 1285, 1287, 1292, 1306, 1310, 1319,
1326, 1329, 1335, 1338, 1344, 1347, 1350, 1356, 1359, 1365,
1368, 1376, 1380, 1391, 1395, 1402, 1407, 1407, 1415, 1424,
1433, 1436, 1439, 1445, 1448, 1454, 1486, 1489, 1492, 1499,
1509, 1509, 1522, 1537, 1551, 1565, 1565, 1608, 1611, 1617,
1624, 1634, 1637, 1640, 1643, 1646, 1652, 1655, 1658, 1668,
1674, 1677, 1682
};
#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\"", "\"AGGREGATE keyword\"", "\"GRAPH keyword\"",
"\"DISTINCT modifier\"", "\"REMOVE command\"", "\"INSERT command\"",
"\"UPDATE command\"", "\"REPLACE command\"", "\"UPSERT command\"",
"\"null\"", "\"true\"", "\"false\"", "\"identifier\"",
"\"quoted string\"", "\"integer number\"", "\"number\"",
"\"bind parameter\"", "\"assignment\"", "\"not operator\"",
"\"and operator\"", "\"or operator\"", "\"not in operator\"",
"\"== operator\"", "\"!= operator\"", "\"< operator\"", "\"> operator\"",
"\"<= operator\"", "\">= operator\"", "\"like operator\"",
"\"+ operator\"", "\"- operator\"", "\"* operator\"", "\"/ operator\"",
"\"% operator\"", "\"?\"", "\":\"", "\"::\"", "\"..\"", "\",\"", "\"(\"",
"\")\"", "\"{\"", "\"}\"", "\"[\"", "\"]\"", "\"outbound modifier\"",
"\"inbound modifier\"", "\"any modifier\"", "\"all modifier\"",
"\"none modifier\"", "UMINUS", "UPLUS", "FUNCCALL", "REFERENCE",
"INDEXED", "EXPANSION", "'.'", "$accept", "with_collection",
"with_collection_list", "optional_with", "$@1", "queryStart", "query",
"final_statement", "optional_statement_block_statements",
"statement_block_statement", "for_statement", "filter_statement",
"let_statement", "let_list", "let_element", "count_into",
"collect_variable_list", "$@2", "collect_statement", "collect_list",
"collect_element", "collect_optional_into", "variable_list", "keep",
"$@3", "aggregate", "$@4", "sort_statement", "$@5", "sort_list",
"sort_element", "sort_direction", "limit_statement", "return_statement",
"in_or_into_collection", "remove_statement", "insert_statement",
"update_parameters", "update_statement", "replace_parameters",
"replace_statement", "update_or_replace", "upsert_statement", "$@6",
"quantifier", "distinct_expression", "$@7", "expression",
"function_name", "function_call", "$@8", "$@9", "operator_unary",
"operator_binary", "operator_ternary",
"optional_function_call_arguments", "expression_or_query", "$@10",
"function_arguments_list", "compound_value", "array", "$@11",
"optional_array_elements", "array_elements_list", "options", "object",
"$@12", "optional_object_elements", "object_elements_list",
"object_element", "array_filter_operator", "optional_array_filter",
"optional_array_limit", "optional_array_return", "graph_collection",
"graph_collection_list", "graph_subject", "$@13", "graph_direction",
"graph_direction_steps", "reference", "$@14", "$@15", "simple_value",
"numeric_value", "value_literal", "collection_name", "bind_parameter",
"object_element_name", "variable_name", 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, 314,
315, 316, 317, 318, 319, 320, 321, 322, 323, 324,
46
};
# endif
#define YYPACT_NINF -303
#define yypact_value_is_default(Yystate) \
(!!((Yystate) == (-303)))
#define YYTABLE_NINF -211
#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[] =
{
-10, -303, -303, 53, 5, -303, 396, -303, -303, -303,
-303, -14, -303, 52, 52, 1083, 132, 24, -303, 290,
1083, 1083, 1083, 1083, -303, -303, -303, -303, -303, -303,
185, -303, -303, -303, -303, 17, 22, 27, 30, 34,
5, -303, -303, -1, 42, -303, 26, -303, -303, -303,
50, -303, -303, -303, 1083, 73, 1083, 1083, 1083, -303,
-303, 853, 113, -303, -303, -303, -303, -303, -303, -303,
70, -303, -303, -303, -303, -303, 853, 79, -303, 102,
52, 134, 1083, 94, -303, -303, 593, 593, -303, 441,
-303, 481, 1083, 52, 102, 124, 134, -303, 991, 52,
52, 1083, -303, -303, -303, -303, 630, -303, 115, 1083,
1083, 1083, 1083, 1083, 1083, 1083, 1083, 1083, 1083, 1083,
1083, 1083, 1083, 1083, 1083, 1083, 1083, 1083, -303, -303,
-303, 156, 126, -303, 1013, 57, 1083, 151, 52, 114,
-303, 119, -303, 150, 102, 131, -303, 401, 290, 1105,
103, 102, 102, 1083, 102, 1083, 102, 667, 153, -303,
114, 102, -303, 102, -303, -303, -303, 518, -303, 1083,
20, -303, 853, 1048, -303, 136, 139, -303, 163, 1083,
168, 175, -303, 177, 853, 170, 179, 1125, 926, 890,
1125, 962, 962, 171, 171, 171, 171, 962, 174, 174,
-303, -303, -303, 704, 261, 1083, 1083, 1083, 1083, 1083,
1083, 1083, 1083, -303, 1048, -303, 742, 184, -303, -303,
853, 52, 119, -303, 52, 1083, -303, 1083, -303, -303,
-303, -303, -303, 344, 41, 369, -303, -303, -303, -303,
-303, -303, -303, 593, -303, 593, -303, 1083, 1083, 52,
-303, -303, 199, -303, 240, 991, 52, 853, 178, -303,
-303, 181, -303, 1083, 779, -303, 115, 1083, -303, 1083,
1083, 1125, 1125, 962, 962, 171, 171, 171, 171, 188,
-303, -303, 238, -303, -303, 853, -303, 102, 102, 555,
853, 192, -303, 143, -303, 195, -303, 71, -303, 518,
1083, 237, -303, -303, 1083, 853, 202, -303, 853, 853,
853, -303, 1083, 245, -303, -303, -303, -303, 1083, 52,
-303, -303, -303, -303, -303, 240, 991, -303, 1083, 853,
1083, 252, 593, -303, 76, -303, 1083, 853, 816, 1083,
201, 102, -303, 208, 240, 1083, 853, -303, -303, 76,
-303, 853, -303
};
/* 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, 8, 18, 0, 0, 10, 0, 1, 2, 209,
4, 9, 3, 0, 0, 0, 0, 41, 61, 0,
0, 0, 0, 0, 85, 11, 19, 20, 22, 21,
52, 23, 24, 25, 12, 26, 27, 28, 29, 30,
0, 6, 212, 0, 36, 37, 0, 203, 204, 205,
185, 201, 199, 200, 0, 0, 0, 0, 190, 150,
142, 35, 0, 188, 93, 94, 95, 186, 140, 141,
97, 202, 96, 187, 90, 72, 92, 0, 59, 148,
0, 52, 0, 70, 197, 198, 0, 0, 79, 0,
82, 0, 0, 0, 148, 148, 52, 5, 0, 0,
0, 0, 107, 103, 105, 106, 0, 18, 152, 144,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 88, 87,
89, 0, 0, 101, 0, 0, 0, 0, 0, 0,
43, 42, 49, 0, 148, 62, 63, 66, 0, 0,
0, 148, 148, 0, 148, 0, 148, 0, 53, 44,
57, 148, 47, 148, 180, 181, 182, 31, 183, 0,
0, 38, 39, 136, 189, 0, 156, 211, 0, 0,
0, 153, 154, 0, 146, 0, 145, 121, 109, 108,
122, 115, 116, 117, 118, 119, 120, 123, 110, 111,
112, 113, 114, 0, 98, 0, 0, 0, 0, 0,
0, 0, 0, 100, 136, 160, 0, 195, 192, 193,
91, 0, 60, 149, 0, 0, 45, 0, 67, 68,
65, 69, 71, 185, 201, 209, 73, 206, 207, 208,
74, 75, 76, 0, 77, 0, 80, 0, 0, 0,
48, 46, 182, 184, 0, 0, 0, 135, 0, 138,
18, 134, 191, 0, 0, 151, 0, 0, 143, 0,
0, 130, 131, 124, 125, 126, 127, 128, 129, 0,
194, 161, 162, 40, 50, 51, 64, 148, 148, 0,
54, 58, 55, 0, 169, 175, 32, 0, 170, 0,
0, 0, 104, 137, 136, 158, 0, 155, 157, 147,
132, 102, 0, 164, 78, 81, 83, 84, 0, 0,
179, 178, 176, 171, 172, 0, 0, 139, 0, 163,
0, 167, 0, 56, 0, 33, 0, 159, 165, 0,
0, 148, 173, 177, 0, 0, 168, 196, 86, 0,
34, 166, 174
};
/* YYPGOTO[NTERM-NUM]. */
static const yytype_int16 yypgoto[] =
{
-303, -7, -303, -303, -303, -303, -106, -303, -303, -303,
-303, -303, -303, -303, 162, 233, -303, -303, -303, 133,
40, -56, -303, -303, -303, 242, -303, -303, -303, -303,
63, -303, -303, -303, -63, -303, -303, -303, -303, -303,
-303, -303, -303, -303, -303, -303, -303, -2, -303, -303,
-303, -303, -303, -303, -303, 78, 8, -303, -303, -303,
-303, -303, -303, -303, -86, -96, -303, -303, -303, 28,
-303, -303, -303, -303, -245, -303, -302, -303, -69, -253,
-303, -303, -303, 31, -303, -9, 145, -4, -303, -8
};
/* YYDEFGOTO[NTERM-NUM]. */
static const yytype_int16 yydefgoto[] =
{
-1, 10, 11, 2, 4, 3, 5, 25, 6, 26,
27, 28, 29, 44, 45, 79, 30, 80, 31, 141,
142, 95, 291, 161, 249, 81, 138, 32, 82, 145,
146, 230, 33, 34, 151, 35, 36, 88, 37, 90,
38, 318, 39, 92, 131, 75, 136, 257, 62, 63,
214, 173, 64, 65, 66, 258, 259, 260, 261, 67,
68, 109, 185, 186, 140, 69, 108, 180, 181, 182,
217, 313, 331, 340, 295, 343, 296, 334, 297, 169,
70, 107, 282, 83, 71, 72, 236, 73, 183, 143
};
/* 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[] =
{
12, 175, 300, 1, 41, 43, 46, 12, 159, 162,
84, 98, 8, 61, 76, 85, 9, -13, 86, 87,
89, 91, -14, 335, 152, 144, 154, -15, 156, 168,
-16, 8, 255, 97, -17, 9, 12, 77, 40, 78,
163, -207, 350, 223, -207, -207, -207, -207, -207, -207,
-207, 99, 102, 7, 104, 105, 106, 101, 226, -207,
-207, -207, -207, -207, 223, 241, 242, -207, 244, -13,
246, -13, 256, 336, -14, 250, -14, 251, 42, -15,
147, -15, -16, 218, -16, 158, -17, 9, -17, 342,
157, 170, 46, -207, 100, -207, 167, 323, 253, 172,
-99, 9, 294, -99, 352, 137, 9, 184, 187, 188,
189, 190, 191, 192, 193, 194, 195, 196, 197, 198,
199, 200, 201, 202, 203, 204, 103, 134, 139, 237,
238, 219, 216, 239, 220, 164, 165, 166, 84, 84,
135, 176, 177, 85, 85, 178, 148, 187, 93, 74,
160, 243, 213, 245, 303, 47, 48, 49, 50, 51,
52, 53, 9, 132, 54, 221, 133, 254, 205, 59,
320, 224, 179, 9, 55, 56, 57, 264, 231, 232,
287, 225, 288, 227, 248, 58, 168, 59, -210, 60,
262, 206, 207, 208, 209, 210, 211, 212, 77, 93,
78, 314, 315, 271, 272, 273, 274, 275, 276, 277,
278, -88, 263, 283, 121, 122, 123, 124, 125, 123,
124, 125, 127, 285, 265, 147, 267, 266, 268, 281,
253, 269, 302, 304, -88, -88, -88, -88, -88, -88,
-88, 292, 311, 312, 319, 289, 290, 322, 301, 326,
298, 328, 110, 299, 330, 348, 293, 168, 339, 347,
349, 305, 171, 94, 284, 308, 294, 309, 310, 341,
9, 222, 96, 111, 112, 113, 114, 115, 116, 117,
118, 119, 120, 121, 122, 123, 124, 125, 126, 321,
286, 127, 279, 324, 307, 240, 0, 0, 325, 164,
165, 252, 129, 130, 121, 122, 123, 124, 125, 0,
329, 333, 327, 47, 48, 49, 332, 51, 52, 53,
9, 298, 0, 0, 299, 0, 337, 0, 338, 0,
298, 0, 0, 0, 344, 0, 0, 346, 0, 0,
298, 0, 0, 351, -206, 298, 0, -206, -206, -206,
-206, -206, -206, -206, 0, 0, 0, 0, 0, 0,
0, 0, -206, -206, -206, -206, -206, 0, 0, -208,
-206, 0, -208, -208, -208, -208, -208, -208, -208, 0,
0, 0, 0, 0, 0, 0, 0, -208, -208, -208,
-208, -208, 0, 0, -99, -208, -206, -99, -206, 13,
14, 15, 16, 17, 18, 19, 0, 0, 0, 0,
0, 228, 229, 110, 20, 21, 22, 23, 24, 0,
0, -208, 0, -208, 47, 48, 49, 0, 51, 52,
53, 9, 0, 0, 111, 112, 113, 114, 115, 116,
117, 118, 119, 120, 121, 122, 123, 124, 125, 126,
0, 0, 127, 149, 153, 150, 0, 0, 0, 0,
0, 0, 128, 129, 130, 0, 0, 0, 0, 0,
0, 0, 0, 0, 111, 112, 113, 114, 115, 116,
117, 118, 119, 120, 121, 122, 123, 124, 125, 126,
0, 0, 127, 149, 155, 150, 0, 0, 0, 0,
0, 0, 128, 129, 130, 0, 0, 0, 0, 0,
0, 0, 0, 0, 111, 112, 113, 114, 115, 116,
117, 118, 119, 120, 121, 122, 123, 124, 125, 126,
110, 0, 127, 0, 0, 0, 0, 0, 0, 0,
0, 0, 128, 129, 130, 0, 0, 0, 0, 0,
0, 111, 112, 113, 114, 115, 116, 117, 118, 119,
120, 121, 122, 123, 124, 125, 126, 110, 0, 127,
0, 0, 0, 0, 0, 316, 317, 164, 165, 252,
129, 130, 0, 0, 0, 0, 0, 0, 111, 112,
113, 114, 115, 116, 117, 118, 119, 120, 121, 122,
123, 124, 125, 126, 0, 149, 127, 150, 0, 0,
0, 0, 0, 0, 0, 0, 128, 129, 130, 0,
0, 0, 0, 0, 0, 0, 111, 112, 113, 114,
115, 116, 117, 118, 119, 120, 121, 122, 123, 124,
125, 126, 110, 0, 127, 0, 0, 0, 0, 0,
0, 0, 0, 0, 128, 129, 130, 0, 0, 0,
0, 0, 0, 111, 112, 113, 114, 115, 116, 117,
118, 119, 120, 121, 122, 123, 124, 125, 126, 110,
0, 127, 0, 0, 174, 0, 247, 0, 0, 0,
0, 128, 129, 130, 0, 0, 0, 0, 0, 0,
111, 112, 113, 114, 115, 116, 117, 118, 119, 120,
121, 122, 123, 124, 125, 126, 110, 0, 127, 0,
0, 0, 0, 0, 0, 0, 0, 0, 128, 129,
130, 0, 0, 0, 0, 0, 0, 111, 112, 113,
114, 115, 116, 117, 118, 119, 120, 121, 122, 123,
124, 125, 126, 270, 110, 127, 0, 0, 0, 0,
0, 0, 0, 0, 0, 128, 129, 130, 0, 0,
0, 0, 0, 0, 0, 111, 112, 113, 114, 115,
116, 117, 118, 119, 120, 121, 122, 123, 124, 125,
126, 110, 0, 127, 0, 0, 0, 0, 0, 0,
280, 0, 0, 128, 129, 130, 0, 0, 0, 0,
0, 0, 111, 112, 113, 114, 115, 116, 117, 118,
119, 120, 121, 122, 123, 124, 125, 126, 110, 0,
127, 0, 0, 0, 0, 0, 0, 306, 0, 0,
128, 129, 130, 0, 0, 0, 0, 0, 0, 111,
112, 113, 114, 115, 116, 117, 118, 119, 120, 121,
122, 123, 124, 125, 126, 110, 0, 127, 345, 0,
0, 0, 0, 0, 0, 0, 0, 128, 129, 130,
0, 0, 0, 0, 0, 0, 111, 112, 113, 114,
115, 116, 117, 118, 119, 120, 121, 122, 123, 124,
125, 126, 110, 0, 127, 0, 0, 0, 0, 0,
0, 0, 0, 0, 128, 129, 130, 0, 0, 0,
0, 0, 0, 111, 0, 113, 114, 115, 116, 117,
118, 119, 120, 121, 122, 123, 124, 125, 110, 0,
0, 127, 0, 0, 0, 0, 0, 0, 0, 0,
0, 128, 129, 130, 0, 0, 0, 0, 0, 0,
0, 113, 114, 115, 116, 117, 118, 119, 120, 121,
122, 123, 124, 125, 110, 0, 0, 127, 0, 0,
0, 0, 0, 0, 0, 0, 0, 128, 129, 130,
0, 0, 0, 0, 0, 0, 0, 113, 0, 0,
116, 117, 118, 119, 0, 121, 122, 123, 124, 125,
0, 0, 0, 127, 47, 48, 49, 50, 51, 52,
53, 9, 0, 54, 0, 0, 0, 0, 0, 0,
0, 0, 0, 55, 56, 57, 47, 48, 49, 50,
51, 52, 53, 9, 58, 54, 59, 0, 60, 0,
164, 165, 166, 0, 0, 55, 56, 57, 215, 0,
0, 0, 0, 0, 0, 0, 58, 0, 59, 0,
60, 47, 48, 49, 50, 51, 52, 53, 9, 0,
54, 0, 0, 0, 0, 0, 0, 0, 0, 0,
55, 56, 57, 0, 0, 0, 0, 0, 0, 0,
0, 58, -133, 59, 0, 60, 47, 48, 49, 50,
51, 52, 53, 9, 0, 54, 0, 0, 0, 0,
0, 0, 0, 0, 0, 55, 56, 57, 47, 48,
49, 233, 234, 52, 53, 235, 58, 54, 59, 0,
60, 0, 0, 0, 0, 0, 0, 55, 56, 57,
0, 0, 0, 0, 0, 0, 0, 0, 58, 0,
59, 0, 60, 116, 117, 118, 119, 0, 121, 122,
123, 124, 125, 0, 0, 0, 127
};
static const yytype_int16 yycheck[] =
{
4, 107, 255, 13, 11, 13, 14, 11, 94, 95,
19, 12, 26, 15, 16, 19, 30, 0, 20, 21,
22, 23, 0, 325, 87, 81, 89, 0, 91, 98,
0, 26, 12, 40, 0, 30, 40, 13, 52, 15,
96, 0, 344, 139, 3, 4, 5, 6, 7, 8,
9, 52, 54, 0, 56, 57, 58, 31, 144, 18,
19, 20, 21, 22, 160, 151, 152, 26, 154, 52,
156, 54, 52, 326, 52, 161, 54, 163, 26, 52,
82, 54, 52, 26, 54, 93, 52, 30, 54, 334,
92, 99, 100, 52, 52, 54, 98, 26, 167, 101,
50, 30, 26, 53, 349, 26, 30, 109, 110, 111,
112, 113, 114, 115, 116, 117, 118, 119, 120, 121,
122, 123, 124, 125, 126, 127, 53, 57, 26, 26,
27, 135, 134, 30, 136, 59, 60, 61, 147, 148,
70, 26, 27, 147, 148, 30, 52, 149, 14, 17,
26, 153, 26, 155, 260, 23, 24, 25, 26, 27,
28, 29, 30, 50, 32, 14, 53, 169, 12, 55,
27, 52, 57, 30, 42, 43, 44, 179, 147, 148,
243, 31, 245, 52, 31, 53, 255, 55, 49, 57,
54, 35, 36, 37, 38, 39, 40, 41, 13, 14,
15, 287, 288, 205, 206, 207, 208, 209, 210, 211,
212, 12, 49, 221, 43, 44, 45, 46, 47, 45,
46, 47, 51, 225, 56, 227, 49, 52, 58, 45,
299, 52, 54, 52, 35, 36, 37, 38, 39, 40,
41, 249, 54, 5, 52, 247, 248, 52, 256, 12,
254, 49, 12, 255, 9, 341, 16, 326, 6, 58,
52, 263, 100, 30, 224, 267, 26, 269, 270, 332,
30, 138, 30, 33, 34, 35, 36, 37, 38, 39,
40, 41, 42, 43, 44, 45, 46, 47, 48, 293,
227, 51, 214, 297, 266, 150, -1, -1, 300, 59,
60, 61, 62, 63, 43, 44, 45, 46, 47, -1,
312, 319, 304, 23, 24, 25, 318, 27, 28, 29,
30, 325, -1, -1, 326, -1, 328, -1, 330, -1,
334, -1, -1, -1, 336, -1, -1, 339, -1, -1,
344, -1, -1, 345, 0, 349, -1, 3, 4, 5,
6, 7, 8, 9, -1, -1, -1, -1, -1, -1,
-1, -1, 18, 19, 20, 21, 22, -1, -1, 0,
26, -1, 3, 4, 5, 6, 7, 8, 9, -1,
-1, -1, -1, -1, -1, -1, -1, 18, 19, 20,
21, 22, -1, -1, 50, 26, 52, 53, 54, 3,
4, 5, 6, 7, 8, 9, -1, -1, -1, -1,
-1, 10, 11, 12, 18, 19, 20, 21, 22, -1,
-1, 52, -1, 54, 23, 24, 25, -1, 27, 28,
29, 30, -1, -1, 33, 34, 35, 36, 37, 38,
39, 40, 41, 42, 43, 44, 45, 46, 47, 48,
-1, -1, 51, 12, 13, 14, -1, -1, -1, -1,
-1, -1, 61, 62, 63, -1, -1, -1, -1, -1,
-1, -1, -1, -1, 33, 34, 35, 36, 37, 38,
39, 40, 41, 42, 43, 44, 45, 46, 47, 48,
-1, -1, 51, 12, 13, 14, -1, -1, -1, -1,
-1, -1, 61, 62, 63, -1, -1, -1, -1, -1,
-1, -1, -1, -1, 33, 34, 35, 36, 37, 38,
39, 40, 41, 42, 43, 44, 45, 46, 47, 48,
12, -1, 51, -1, -1, -1, -1, -1, -1, -1,
-1, -1, 61, 62, 63, -1, -1, -1, -1, -1,
-1, 33, 34, 35, 36, 37, 38, 39, 40, 41,
42, 43, 44, 45, 46, 47, 48, 12, -1, 51,
-1, -1, -1, -1, -1, 20, 21, 59, 60, 61,
62, 63, -1, -1, -1, -1, -1, -1, 33, 34,
35, 36, 37, 38, 39, 40, 41, 42, 43, 44,
45, 46, 47, 48, -1, 12, 51, 14, -1, -1,
-1, -1, -1, -1, -1, -1, 61, 62, 63, -1,
-1, -1, -1, -1, -1, -1, 33, 34, 35, 36,
37, 38, 39, 40, 41, 42, 43, 44, 45, 46,
47, 48, 12, -1, 51, -1, -1, -1, -1, -1,
-1, -1, -1, -1, 61, 62, 63, -1, -1, -1,
-1, -1, -1, 33, 34, 35, 36, 37, 38, 39,
40, 41, 42, 43, 44, 45, 46, 47, 48, 12,
-1, 51, -1, -1, 54, -1, 19, -1, -1, -1,
-1, 61, 62, 63, -1, -1, -1, -1, -1, -1,
33, 34, 35, 36, 37, 38, 39, 40, 41, 42,
43, 44, 45, 46, 47, 48, 12, -1, 51, -1,
-1, -1, -1, -1, -1, -1, -1, -1, 61, 62,
63, -1, -1, -1, -1, -1, -1, 33, 34, 35,
36, 37, 38, 39, 40, 41, 42, 43, 44, 45,
46, 47, 48, 49, 12, 51, -1, -1, -1, -1,
-1, -1, -1, -1, -1, 61, 62, 63, -1, -1,
-1, -1, -1, -1, -1, 33, 34, 35, 36, 37,
38, 39, 40, 41, 42, 43, 44, 45, 46, 47,
48, 12, -1, 51, -1, -1, -1, -1, -1, -1,
58, -1, -1, 61, 62, 63, -1, -1, -1, -1,
-1, -1, 33, 34, 35, 36, 37, 38, 39, 40,
41, 42, 43, 44, 45, 46, 47, 48, 12, -1,
51, -1, -1, -1, -1, -1, -1, 58, -1, -1,
61, 62, 63, -1, -1, -1, -1, -1, -1, 33,
34, 35, 36, 37, 38, 39, 40, 41, 42, 43,
44, 45, 46, 47, 48, 12, -1, 51, 52, -1,
-1, -1, -1, -1, -1, -1, -1, 61, 62, 63,
-1, -1, -1, -1, -1, -1, 33, 34, 35, 36,
37, 38, 39, 40, 41, 42, 43, 44, 45, 46,
47, 48, 12, -1, 51, -1, -1, -1, -1, -1,
-1, -1, -1, -1, 61, 62, 63, -1, -1, -1,
-1, -1, -1, 33, -1, 35, 36, 37, 38, 39,
40, 41, 42, 43, 44, 45, 46, 47, 12, -1,
-1, 51, -1, -1, -1, -1, -1, -1, -1, -1,
-1, 61, 62, 63, -1, -1, -1, -1, -1, -1,
-1, 35, 36, 37, 38, 39, 40, 41, 42, 43,
44, 45, 46, 47, 12, -1, -1, 51, -1, -1,
-1, -1, -1, -1, -1, -1, -1, 61, 62, 63,
-1, -1, -1, -1, -1, -1, -1, 35, -1, -1,
38, 39, 40, 41, -1, 43, 44, 45, 46, 47,
-1, -1, -1, 51, 23, 24, 25, 26, 27, 28,
29, 30, -1, 32, -1, -1, -1, -1, -1, -1,
-1, -1, -1, 42, 43, 44, 23, 24, 25, 26,
27, 28, 29, 30, 53, 32, 55, -1, 57, -1,
59, 60, 61, -1, -1, 42, 43, 44, 45, -1,
-1, -1, -1, -1, -1, -1, 53, -1, 55, -1,
57, 23, 24, 25, 26, 27, 28, 29, 30, -1,
32, -1, -1, -1, -1, -1, -1, -1, -1, -1,
42, 43, 44, -1, -1, -1, -1, -1, -1, -1,
-1, 53, 54, 55, -1, 57, 23, 24, 25, 26,
27, 28, 29, 30, -1, 32, -1, -1, -1, -1,
-1, -1, -1, -1, -1, 42, 43, 44, 23, 24,
25, 26, 27, 28, 29, 30, 53, 32, 55, -1,
57, -1, -1, -1, -1, -1, -1, 42, 43, 44,
-1, -1, -1, -1, -1, -1, -1, -1, 53, -1,
55, -1, 57, 38, 39, 40, 41, -1, 43, 44,
45, 46, 47, -1, -1, -1, 51
};
/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
symbol of state STATE-NUM. */
static const yytype_uint8 yystos[] =
{
0, 13, 74, 76, 75, 77, 79, 0, 26, 30,
72, 73, 158, 3, 4, 5, 6, 7, 8, 9,
18, 19, 20, 21, 22, 78, 80, 81, 82, 83,
87, 89, 98, 103, 104, 106, 107, 109, 111, 113,
52, 72, 26, 160, 84, 85, 160, 23, 24, 25,
26, 27, 28, 29, 32, 42, 43, 44, 53, 55,
57, 118, 119, 120, 123, 124, 125, 130, 131, 136,
151, 155, 156, 158, 17, 116, 118, 13, 15, 86,
88, 96, 99, 154, 156, 158, 118, 118, 108, 118,
110, 118, 114, 14, 86, 92, 96, 72, 12, 52,
52, 31, 118, 53, 118, 118, 118, 152, 137, 132,
12, 33, 34, 35, 36, 37, 38, 39, 40, 41,
42, 43, 44, 45, 46, 47, 48, 51, 61, 62,
63, 115, 50, 53, 57, 70, 117, 26, 97, 26,
135, 90, 91, 160, 92, 100, 101, 118, 52, 12,
14, 105, 105, 13, 105, 13, 105, 118, 160, 135,
26, 94, 135, 92, 59, 60, 61, 118, 149, 150,
160, 85, 118, 122, 54, 77, 26, 27, 30, 57,
138, 139, 140, 159, 118, 133, 134, 118, 118, 118,
118, 118, 118, 118, 118, 118, 118, 118, 118, 118,
118, 118, 118, 118, 118, 12, 35, 36, 37, 38,
39, 40, 41, 26, 121, 45, 118, 141, 26, 158,
118, 14, 90, 136, 52, 31, 135, 52, 10, 11,
102, 154, 154, 26, 27, 30, 157, 26, 27, 30,
157, 135, 135, 118, 135, 118, 135, 19, 31, 95,
135, 135, 61, 149, 118, 12, 52, 118, 126, 127,
128, 129, 54, 49, 118, 56, 52, 49, 58, 52,
49, 118, 118, 118, 118, 118, 118, 118, 118, 126,
58, 45, 153, 160, 91, 118, 101, 105, 105, 118,
118, 93, 160, 16, 26, 145, 147, 149, 158, 118,
150, 160, 54, 77, 52, 118, 58, 140, 118, 118,
118, 54, 5, 142, 135, 135, 20, 21, 112, 52,
27, 158, 52, 26, 158, 118, 12, 127, 49, 118,
9, 143, 118, 160, 148, 147, 150, 118, 118, 6,
144, 105, 145, 146, 118, 52, 118, 58, 135, 52,
147, 118, 145
};
/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */
static const yytype_uint8 yyr1[] =
{
0, 71, 72, 72, 73, 73, 73, 74, 75, 74,
76, 77, 78, 78, 78, 78, 78, 78, 79, 79,
80, 80, 80, 80, 80, 80, 80, 80, 80, 80,
80, 81, 81, 81, 81, 82, 83, 84, 84, 85,
86, 88, 87, 89, 89, 89, 89, 89, 89, 90,
90, 91, 92, 92, 92, 93, 93, 95, 94, 97,
96, 99, 98, 100, 100, 101, 102, 102, 102, 102,
103, 103, 104, 105, 105, 106, 107, 108, 108, 109,
110, 110, 111, 112, 112, 114, 113, 115, 115, 115,
117, 116, 116, 118, 118, 118, 118, 118, 118, 119,
119, 121, 120, 122, 120, 123, 123, 123, 124, 124,
124, 124, 124, 124, 124, 124, 124, 124, 124, 124,
124, 124, 124, 124, 124, 124, 124, 124, 124, 124,
124, 124, 125, 126, 126, 127, 128, 127, 129, 129,
130, 130, 132, 131, 133, 133, 134, 134, 135, 135,
137, 136, 138, 138, 139, 139, 140, 140, 140, 140,
141, 141, 142, 142, 143, 143, 143, 144, 144, 145,
145, 145, 145, 146, 146, 147, 148, 147, 147, 147,
149, 149, 149, 150, 150, 151, 151, 151, 151, 151,
152, 151, 151, 151, 151, 153, 151, 154, 154, 155,
155, 156, 156, 156, 156, 156, 157, 157, 157, 158,
159, 159, 160
};
/* YYR2[YYN] -- Number of symbols on the right hand side of rule YYN. */
static const yytype_uint8 yyr2[] =
{
0, 2, 1, 1, 1, 3, 2, 0, 0, 3,
2, 2, 1, 1, 1, 1, 1, 1, 0, 2,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 4, 6, 8, 10, 2, 2, 1, 3, 3,
4, 0, 3, 3, 3, 4, 4, 3, 4, 1,
3, 3, 0, 2, 4, 1, 3, 0, 3, 0,
3, 0, 3, 1, 3, 2, 0, 1, 1, 1,
2, 4, 2, 2, 2, 4, 4, 3, 5, 2,
3, 5, 2, 1, 1, 0, 9, 1, 1, 1,
0, 3, 1, 1, 1, 1, 1, 1, 3, 1,
3, 0, 5, 0, 5, 2, 2, 2, 3, 3,
3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
3, 3, 3, 3, 4, 4, 4, 4, 4, 4,
4, 4, 5, 0, 1, 1, 0, 2, 1, 3,
1, 1, 0, 4, 0, 1, 1, 3, 0, 2,
0, 4, 0, 1, 1, 3, 1, 3, 3, 5,
1, 2, 0, 2, 0, 2, 4, 0, 2, 1,
1, 2, 2, 1, 3, 1, 0, 4, 2, 2,
1, 1, 1, 1, 2, 1, 1, 1, 1, 3,
0, 4, 3, 3, 4, 0, 8, 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, arangodb::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, arangodb::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, arangodb::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, arangodb::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 (arangodb::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 364 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeValueString((yyvsp[0].strval).value, (yyvsp[0].strval).length);
}
#line 2045 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 3:
#line 367 "Aql/grammar.y" /* yacc.c:1646 */
{
char const* p = (yyvsp[0].node)->getStringValue();
size_t const len = (yyvsp[0].node)->getStringLength();
if (len < 1 || *p != '@') {
parser->registerParseError(TRI_ERROR_QUERY_BIND_PARAMETER_TYPE, TRI_errno_string(TRI_ERROR_QUERY_BIND_PARAMETER_TYPE), p, yylloc.first_line, yylloc.first_column);
}
(yyval.node) = (yyvsp[0].node);
}
#line 2058 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 4:
#line 378 "Aql/grammar.y" /* yacc.c:1646 */
{
auto node = static_cast<AstNode*>(parser->peekStack());
node->addMember((yyvsp[0].node));
}
#line 2067 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 5:
#line 382 "Aql/grammar.y" /* yacc.c:1646 */
{
auto node = static_cast<AstNode*>(parser->peekStack());
node->addMember((yyvsp[0].node));
}
#line 2076 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 6:
#line 386 "Aql/grammar.y" /* yacc.c:1646 */
{
auto node = static_cast<AstNode*>(parser->peekStack());
node->addMember((yyvsp[0].node));
}
#line 2085 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 7:
#line 393 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2092 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 8:
#line 395 "Aql/grammar.y" /* yacc.c:1646 */
{
auto node = parser->ast()->createNodeArray();
parser->pushStack(node);
}
#line 2101 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 9:
#line 398 "Aql/grammar.y" /* yacc.c:1646 */
{
auto node = static_cast<AstNode*>(parser->popStack());
auto withNode = parser->ast()->createNodeWithCollections(node);
parser->ast()->addOperation(withNode);
}
#line 2111 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 10:
#line 406 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2118 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 11:
#line 411 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2125 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 12:
#line 416 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2132 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 13:
#line 418 "Aql/grammar.y" /* yacc.c:1646 */
{
parser->ast()->scopes()->endNested();
}
#line 2140 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 14:
#line 421 "Aql/grammar.y" /* yacc.c:1646 */
{
parser->ast()->scopes()->endNested();
}
#line 2148 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 15:
#line 424 "Aql/grammar.y" /* yacc.c:1646 */
{
parser->ast()->scopes()->endNested();
}
#line 2156 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 16:
#line 427 "Aql/grammar.y" /* yacc.c:1646 */
{
parser->ast()->scopes()->endNested();
}
#line 2164 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 17:
#line 430 "Aql/grammar.y" /* yacc.c:1646 */
{
parser->ast()->scopes()->endNested();
}
#line 2172 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 18:
#line 436 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2179 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 19:
#line 438 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2186 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 20:
#line 443 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2193 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 21:
#line 445 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2200 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 22:
#line 447 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2207 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 23:
#line 449 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2214 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 24:
#line 451 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2221 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 25:
#line 453 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2228 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 26:
#line 455 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2235 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 27:
#line 457 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2242 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 28:
#line 459 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2249 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 29:
#line 461 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2256 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 30:
#line 463 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2263 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 31:
#line 468 "Aql/grammar.y" /* yacc.c:1646 */
{
parser->ast()->scopes()->start(arangodb::aql::AQL_SCOPE_FOR);
auto node = parser->ast()->createNodeFor((yyvsp[-2].strval).value, (yyvsp[-2].strval).length, (yyvsp[0].node), true);
parser->ast()->addOperation(node);
}
#line 2274 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 32:
#line 474 "Aql/grammar.y" /* yacc.c:1646 */
{
parser->ast()->scopes()->start(arangodb::aql::AQL_SCOPE_FOR);
auto node = parser->ast()->createNodeTraversal((yyvsp[-4].strval).value, (yyvsp[-4].strval).length, (yyvsp[-2].node), (yyvsp[-1].node), (yyvsp[0].node));
parser->ast()->addOperation(node);
}
#line 2284 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 33:
#line 479 "Aql/grammar.y" /* yacc.c:1646 */
{
parser->ast()->scopes()->start(arangodb::aql::AQL_SCOPE_FOR);
auto node = parser->ast()->createNodeTraversal((yyvsp[-6].strval).value, (yyvsp[-6].strval).length, (yyvsp[-4].strval).value, (yyvsp[-4].strval).length, (yyvsp[-2].node), (yyvsp[-1].node), (yyvsp[0].node));
parser->ast()->addOperation(node);
}
#line 2294 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 34:
#line 484 "Aql/grammar.y" /* yacc.c:1646 */
{
parser->ast()->scopes()->start(arangodb::aql::AQL_SCOPE_FOR);
auto node = parser->ast()->createNodeTraversal((yyvsp[-8].strval).value, (yyvsp[-8].strval).length, (yyvsp[-6].strval).value, (yyvsp[-6].strval).length, (yyvsp[-4].strval).value, (yyvsp[-4].strval).length, (yyvsp[-2].node), (yyvsp[-1].node), (yyvsp[0].node));
parser->ast()->addOperation(node);
}
#line 2304 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 35:
#line 492 "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 2314 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 36:
#line 500 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2321 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 37:
#line 505 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2328 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 38:
#line 507 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2335 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 39:
#line 512 "Aql/grammar.y" /* yacc.c:1646 */
{
auto node = parser->ast()->createNodeLet((yyvsp[-2].strval).value, (yyvsp[-2].strval).length, (yyvsp[0].node), true);
parser->ast()->addOperation(node);
}
#line 2344 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 40:
#line 519 "Aql/grammar.y" /* yacc.c:1646 */
{
if (! TRI_CaseEqualString((yyvsp[-2].strval).value, "COUNT")) {
parser->registerParseError(TRI_ERROR_QUERY_PARSE, "unexpected qualifier '%s', expecting 'COUNT'", (yyvsp[-2].strval).value, yylloc.first_line, yylloc.first_column);
}
(yyval.strval) = (yyvsp[0].strval);
}
#line 2356 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 41:
#line 529 "Aql/grammar.y" /* yacc.c:1646 */
{
auto node = parser->ast()->createNodeArray();
parser->pushStack(node);
}
#line 2365 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 42:
#line 532 "Aql/grammar.y" /* yacc.c:1646 */
{
auto list = static_cast<AstNode*>(parser->popStack());
if (list == nullptr) {
ABORT_OOM
}
(yyval.node) = list;
}
#line 2378 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 43:
#line 543 "Aql/grammar.y" /* yacc.c:1646 */
{
/* COLLECT WITH COUNT INTO var OPTIONS ... */
auto scopes = parser->ast()->scopes();
StartCollectScope(scopes);
auto node = parser->ast()->createNodeCollectCount(parser->ast()->createNodeArray(), (yyvsp[-1].strval).value, (yyvsp[-1].strval).length, (yyvsp[0].node));
parser->ast()->addOperation(node);
}
#line 2392 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 44:
#line 552 "Aql/grammar.y" /* yacc.c:1646 */
{
/* COLLECT var = expr WITH COUNT INTO var OPTIONS ... */
auto scopes = parser->ast()->scopes();
if (StartCollectScope(scopes)) {
RegisterAssignVariables(scopes, (yyvsp[-2].node));
}
auto node = parser->ast()->createNodeCollectCount((yyvsp[-2].node), (yyvsp[-1].strval).value, (yyvsp[-1].strval).length, (yyvsp[0].node));
parser->ast()->addOperation(node);
}
#line 2408 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 45:
#line 563 "Aql/grammar.y" /* yacc.c:1646 */
{
/* AGGREGATE var = expr OPTIONS ... */
auto scopes = parser->ast()->scopes();
if (StartCollectScope(scopes)) {
RegisterAssignVariables(scopes, (yyvsp[-2].node));
}
// validate aggregates
if (! ValidateAggregates(parser, (yyvsp[-2].node))) {
YYABORT;
}
if ((yyvsp[-1].node) != nullptr && (yyvsp[-1].node)->type == NODE_TYPE_ARRAY) {
std::unordered_set<Variable const*> vars;
Ast::getReferencedVariables((yyvsp[-1].node)->getMember(1), vars);
Variable const* used = CheckIntoVariables((yyvsp[-2].node), vars);
if (used != nullptr) {
std::string msg("use of COLLECT variable '" + used->name + "' IN INTO expression");
parser->registerParseError(TRI_ERROR_QUERY_PARSE, msg.c_str(), yylloc.first_line, yylloc.first_column);
}
}
AstNode const* into = GetIntoVariable(parser, (yyvsp[-1].node));
AstNode const* intoExpression = GetIntoExpression((yyvsp[-1].node));
auto node = parser->ast()->createNodeCollect(parser->ast()->createNodeArray(), (yyvsp[-2].node), into, intoExpression, nullptr, (yyvsp[-1].node));
parser->ast()->addOperation(node);
}
#line 2443 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 46:
#line 593 "Aql/grammar.y" /* yacc.c:1646 */
{
/* COLLECT var = expr AGGREGATE var = expr OPTIONS ... */
auto scopes = parser->ast()->scopes();
if (StartCollectScope(scopes)) {
RegisterAssignVariables(scopes, (yyvsp[-3].node));
RegisterAssignVariables(scopes, (yyvsp[-2].node));
}
if (! ValidateAggregates(parser, (yyvsp[-2].node))) {
YYABORT;
}
if ((yyvsp[-1].node) != nullptr && (yyvsp[-1].node)->type == NODE_TYPE_ARRAY) {
std::unordered_set<Variable const*> vars;
Ast::getReferencedVariables((yyvsp[-1].node)->getMember(1), vars);
Variable const* used = CheckIntoVariables((yyvsp[-3].node), vars);
if (used != nullptr) {
std::string msg("use of COLLECT variable '" + used->name + "' IN INTO expression");
parser->registerParseError(TRI_ERROR_QUERY_PARSE, msg.c_str(), yylloc.first_line, yylloc.first_column);
}
used = CheckIntoVariables((yyvsp[-2].node), vars);
if (used != nullptr) {
std::string msg("use of COLLECT variable '" + used->name + "' IN INTO expression");
parser->registerParseError(TRI_ERROR_QUERY_PARSE, msg.c_str(), yylloc.first_line, yylloc.first_column);
}
}
// note all group variables
std::unordered_set<Variable const*> groupVars;
size_t n = (yyvsp[-3].node)->numMembers();
for (size_t i = 0; i < n; ++i) {
auto member = (yyvsp[-3].node)->getMember(i);
if (member != nullptr) {
TRI_ASSERT(member->type == NODE_TYPE_ASSIGN);
groupVars.emplace(static_cast<Variable const*>(member->getMember(0)->getData()));
}
}
// now validate if any aggregate refers to one of the group variables
n = (yyvsp[-2].node)->numMembers();
for (size_t i = 0; i < n; ++i) {
auto member = (yyvsp[-2].node)->getMember(i);
if (member != nullptr) {
TRI_ASSERT(member->type == NODE_TYPE_ASSIGN);
std::unordered_set<Variable const*> variablesUsed;
Ast::getReferencedVariables(member->getMember(1), variablesUsed);
for (auto& it : groupVars) {
if (variablesUsed.find(it) != variablesUsed.end()) {
parser->registerParseError(TRI_ERROR_QUERY_VARIABLE_NAME_UNKNOWN,
"use of unknown variable '%s' in aggregate expression", it->name.c_str(), yylloc.first_line, yylloc.first_column);
break;
}
}
}
}
AstNode const* into = GetIntoVariable(parser, (yyvsp[-1].node));
AstNode const* intoExpression = GetIntoExpression((yyvsp[-1].node));
auto node = parser->ast()->createNodeCollect((yyvsp[-3].node), (yyvsp[-2].node), into, intoExpression, nullptr, (yyvsp[0].node));
parser->ast()->addOperation(node);
}
#line 2515 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 47:
#line 660 "Aql/grammar.y" /* yacc.c:1646 */
{
/* COLLECT var = expr INTO var OPTIONS ... */
auto scopes = parser->ast()->scopes();
if (StartCollectScope(scopes)) {
RegisterAssignVariables(scopes, (yyvsp[-2].node));
}
if ((yyvsp[-1].node) != nullptr && (yyvsp[-1].node)->type == NODE_TYPE_ARRAY) {
std::unordered_set<Variable const*> vars;
Ast::getReferencedVariables((yyvsp[-1].node)->getMember(1), vars);
Variable const* used = CheckIntoVariables((yyvsp[-2].node), vars);
if (used != nullptr) {
std::string msg("use of COLLECT variable '" + used->name + "' IN INTO expression");
parser->registerParseError(TRI_ERROR_QUERY_PARSE, msg.c_str(), yylloc.first_line, yylloc.first_column);
}
}
AstNode const* into = GetIntoVariable(parser, (yyvsp[-1].node));
AstNode const* intoExpression = GetIntoExpression((yyvsp[-1].node));
auto node = parser->ast()->createNodeCollect((yyvsp[-2].node), parser->ast()->createNodeArray(), into, intoExpression, nullptr, (yyvsp[0].node));
parser->ast()->addOperation(node);
}
#line 2545 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 48:
#line 685 "Aql/grammar.y" /* yacc.c:1646 */
{
/* COLLECT var = expr INTO var KEEP ... OPTIONS ... */
auto scopes = parser->ast()->scopes();
if (StartCollectScope(scopes)) {
RegisterAssignVariables(scopes, (yyvsp[-3].node));
}
if ((yyvsp[-2].node) == nullptr &&
(yyvsp[-1].node) != nullptr) {
parser->registerParseError(TRI_ERROR_QUERY_PARSE, "use of 'KEEP' without 'INTO'", yylloc.first_line, yylloc.first_column);
}
if ((yyvsp[-2].node) != nullptr && (yyvsp[-2].node)->type == NODE_TYPE_ARRAY) {
std::unordered_set<Variable const*> vars;
Ast::getReferencedVariables((yyvsp[-2].node)->getMember(1), vars);
Variable const* used = CheckIntoVariables((yyvsp[-3].node), vars);
if (used != nullptr) {
std::string msg("use of COLLECT variable '" + used->name + "' IN INTO expression");
parser->registerParseError(TRI_ERROR_QUERY_PARSE, msg.c_str(), yylloc.first_line, yylloc.first_column);
}
}
AstNode const* into = GetIntoVariable(parser, (yyvsp[-2].node));
AstNode const* intoExpression = GetIntoExpression((yyvsp[-2].node));
auto node = parser->ast()->createNodeCollect((yyvsp[-3].node), parser->ast()->createNodeArray(), into, intoExpression, (yyvsp[-1].node), (yyvsp[0].node));
parser->ast()->addOperation(node);
}
#line 2580 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 49:
#line 718 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2587 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 50:
#line 720 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2594 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 51:
#line 725 "Aql/grammar.y" /* yacc.c:1646 */
{
auto node = parser->ast()->createNodeAssign((yyvsp[-2].strval).value, (yyvsp[-2].strval).length, (yyvsp[0].node));
parser->pushArrayElement(node);
}
#line 2603 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 52:
#line 732 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = nullptr;
}
#line 2611 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 53:
#line 735 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeValueString((yyvsp[0].strval).value, (yyvsp[0].strval).length);
}
#line 2619 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 54:
#line 738 "Aql/grammar.y" /* yacc.c:1646 */
{
auto node = parser->ast()->createNodeArray();
node->addMember(parser->ast()->createNodeValueString((yyvsp[-2].strval).value, (yyvsp[-2].strval).length));
node->addMember((yyvsp[0].node));
(yyval.node) = node;
}
#line 2630 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 55:
#line 747 "Aql/grammar.y" /* yacc.c:1646 */
{
if (! parser->ast()->scopes()->existsVariable((yyvsp[0].strval).value, (yyvsp[0].strval).length)) {
parser->registerParseError(TRI_ERROR_QUERY_PARSE, "use of unknown variable '%s' for KEEP", (yyvsp[0].strval).value, yylloc.first_line, yylloc.first_column);
}
auto node = parser->ast()->createNodeReference((yyvsp[0].strval).value, (yyvsp[0].strval).length);
if (node == nullptr) {
ABORT_OOM
}
// indicate the this node is a reference to the variable name, not the variable value
node->setFlag(FLAG_KEEP_VARIABLENAME);
parser->pushArrayElement(node);
}
#line 2649 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 56:
#line 761 "Aql/grammar.y" /* yacc.c:1646 */
{
if (! parser->ast()->scopes()->existsVariable((yyvsp[0].strval).value, (yyvsp[0].strval).length)) {
parser->registerParseError(TRI_ERROR_QUERY_PARSE, "use of unknown variable '%s' for KEEP", (yyvsp[0].strval).value, yylloc.first_line, yylloc.first_column);
}
auto node = parser->ast()->createNodeReference((yyvsp[0].strval).value, (yyvsp[0].strval).length);
if (node == nullptr) {
ABORT_OOM
}
// indicate the this node is a reference to the variable name, not the variable value
node->setFlag(FLAG_KEEP_VARIABLENAME);
parser->pushArrayElement(node);
}
#line 2668 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 57:
#line 778 "Aql/grammar.y" /* yacc.c:1646 */
{
if (! TRI_CaseEqualString((yyvsp[0].strval).value, "KEEP")) {
parser->registerParseError(TRI_ERROR_QUERY_PARSE, "unexpected qualifier '%s', expecting 'KEEP'", (yyvsp[0].strval).value, yylloc.first_line, yylloc.first_column);
}
auto node = parser->ast()->createNodeArray();
parser->pushStack(node);
}
#line 2681 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 58:
#line 785 "Aql/grammar.y" /* yacc.c:1646 */
{
auto list = static_cast<AstNode*>(parser->popStack());
(yyval.node) = list;
}
#line 2690 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 59:
#line 792 "Aql/grammar.y" /* yacc.c:1646 */
{
auto node = parser->ast()->createNodeArray();
parser->pushStack(node);
}
#line 2699 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 60:
#line 795 "Aql/grammar.y" /* yacc.c:1646 */
{
auto list = static_cast<AstNode*>(parser->popStack());
(yyval.node) = list;
}
#line 2708 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 61:
#line 802 "Aql/grammar.y" /* yacc.c:1646 */
{
auto node = parser->ast()->createNodeArray();
parser->pushStack(node);
}
#line 2717 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 62:
#line 805 "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 2727 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 63:
#line 813 "Aql/grammar.y" /* yacc.c:1646 */
{
parser->pushArrayElement((yyvsp[0].node));
}
#line 2735 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 64:
#line 816 "Aql/grammar.y" /* yacc.c:1646 */
{
parser->pushArrayElement((yyvsp[0].node));
}
#line 2743 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 65:
#line 822 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeSortElement((yyvsp[-1].node), (yyvsp[0].node));
}
#line 2751 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 66:
#line 828 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeValueBool(true);
}
#line 2759 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 67:
#line 831 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeValueBool(true);
}
#line 2767 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 68:
#line 834 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeValueBool(false);
}
#line 2775 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 69:
#line 837 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 2783 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 70:
#line 843 "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 2793 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 71:
#line 848 "Aql/grammar.y" /* yacc.c:1646 */
{
auto node = parser->ast()->createNodeLimit((yyvsp[-2].node), (yyvsp[0].node));
parser->ast()->addOperation(node);
}
#line 2802 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 72:
#line 855 "Aql/grammar.y" /* yacc.c:1646 */
{
auto node = parser->ast()->createNodeReturn((yyvsp[0].node));
parser->ast()->addOperation(node);
parser->ast()->scopes()->endNested();
}
#line 2812 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 73:
#line 863 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 2820 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 74:
#line 866 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 2828 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 75:
#line 872 "Aql/grammar.y" /* yacc.c:1646 */
{
if (! parser->configureWriteQuery((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);
}
#line 2840 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 76:
#line 882 "Aql/grammar.y" /* yacc.c:1646 */
{
if (! parser->configureWriteQuery((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);
}
#line 2852 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 77:
#line 892 "Aql/grammar.y" /* yacc.c:1646 */
{
if (! parser->configureWriteQuery((yyvsp[-1].node), (yyvsp[0].node))) {
YYABORT;
}
AstNode* node = parser->ast()->createNodeUpdate(nullptr, (yyvsp[-2].node), (yyvsp[-1].node), (yyvsp[0].node));
parser->ast()->addOperation(node);
}
#line 2865 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 78:
#line 900 "Aql/grammar.y" /* yacc.c:1646 */
{
if (! parser->configureWriteQuery((yyvsp[-1].node), (yyvsp[0].node))) {
YYABORT;
}
AstNode* node = parser->ast()->createNodeUpdate((yyvsp[-4].node), (yyvsp[-2].node), (yyvsp[-1].node), (yyvsp[0].node));
parser->ast()->addOperation(node);
}
#line 2878 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 79:
#line 911 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2885 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 80:
#line 916 "Aql/grammar.y" /* yacc.c:1646 */
{
if (! parser->configureWriteQuery((yyvsp[-1].node), (yyvsp[0].node))) {
YYABORT;
}
AstNode* node = parser->ast()->createNodeReplace(nullptr, (yyvsp[-2].node), (yyvsp[-1].node), (yyvsp[0].node));
parser->ast()->addOperation(node);
}
#line 2898 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 81:
#line 924 "Aql/grammar.y" /* yacc.c:1646 */
{
if (! parser->configureWriteQuery((yyvsp[-1].node), (yyvsp[0].node))) {
YYABORT;
}
AstNode* node = parser->ast()->createNodeReplace((yyvsp[-4].node), (yyvsp[-2].node), (yyvsp[-1].node), (yyvsp[0].node));
parser->ast()->addOperation(node);
}
#line 2911 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 82:
#line 935 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2918 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 83:
#line 940 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.intval) = static_cast<int64_t>(NODE_TYPE_UPDATE);
}
#line 2926 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 84:
#line 943 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.intval) = static_cast<int64_t>(NODE_TYPE_REPLACE);
}
#line 2934 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 85:
#line 949 "Aql/grammar.y" /* yacc.c:1646 */
{
// reserve a variable named "$OLD", we might need it in the update expression
// and in a later return thing
parser->pushStack(parser->ast()->createNodeVariable(TRI_CHAR_LENGTH_PAIR(Variable::NAME_OLD), true));
}
#line 2944 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 86:
#line 953 "Aql/grammar.y" /* yacc.c:1646 */
{
if (! parser->configureWriteQuery((yyvsp[-1].node), (yyvsp[0].node))) {
YYABORT;
}
AstNode* variableNode = static_cast<AstNode*>(parser->popStack());
auto scopes = parser->ast()->scopes();
scopes->start(arangodb::aql::AQL_SCOPE_SUBQUERY);
parser->ast()->startSubQuery();
scopes->start(arangodb::aql::AQL_SCOPE_FOR);
std::string const variableName = parser->ast()->variables()->nextName();
auto forNode = parser->ast()->createNodeFor(variableName.c_str(), variableName.size(), (yyvsp[-1].node), false);
parser->ast()->addOperation(forNode);
auto filterNode = parser->ast()->createNodeUpsertFilter(parser->ast()->createNodeReference(variableName), (yyvsp[-6].node));
parser->ast()->addOperation(filterNode);
auto offsetValue = parser->ast()->createNodeValueInt(0);
auto limitValue = parser->ast()->createNodeValueInt(1);
auto limitNode = parser->ast()->createNodeLimit(offsetValue, limitValue);
parser->ast()->addOperation(limitNode);
auto refNode = parser->ast()->createNodeReference(variableName);
auto returnNode = parser->ast()->createNodeReturn(refNode);
parser->ast()->addOperation(returnNode);
scopes->endNested();
AstNode* subqueryNode = parser->ast()->endSubQuery();
scopes->endCurrent();
std::string const subqueryName = parser->ast()->variables()->nextName();
auto subQuery = parser->ast()->createNodeLet(subqueryName.c_str(), subqueryName.size(), subqueryNode, false);
parser->ast()->addOperation(subQuery);
auto index = parser->ast()->createNodeValueInt(0);
auto firstDoc = parser->ast()->createNodeLet(variableNode, parser->ast()->createNodeIndexedAccess(parser->ast()->createNodeReference(subqueryName), index));
parser->ast()->addOperation(firstDoc);
auto node = parser->ast()->createNodeUpsert(static_cast<AstNodeType>((yyvsp[-3].intval)), parser->ast()->createNodeReference(TRI_CHAR_LENGTH_PAIR(Variable::NAME_OLD)), (yyvsp[-4].node), (yyvsp[-2].node), (yyvsp[-1].node), (yyvsp[0].node));
parser->ast()->addOperation(node);
}
#line 2993 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 87:
#line 1000 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeQuantifier(Quantifier::ALL);
}
#line 3001 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 88:
#line 1003 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeQuantifier(Quantifier::ANY);
}
#line 3009 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 89:
#line 1006 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeQuantifier(Quantifier::NONE);
}
#line 3017 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 90:
#line 1012 "Aql/grammar.y" /* yacc.c:1646 */
{
auto const scopeType = parser->ast()->scopes()->type();
if (scopeType == AQL_SCOPE_MAIN ||
scopeType == AQL_SCOPE_SUBQUERY) {
parser->registerParseError(TRI_ERROR_QUERY_PARSE, "cannot use DISTINCT modifier on top-level query element", yylloc.first_line, yylloc.first_column);
}
}
#line 3030 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 91:
#line 1019 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeDistinct((yyvsp[0].node));
}
#line 3038 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 92:
#line 1022 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 3046 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 93:
#line 1028 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 3054 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 94:
#line 1031 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 3062 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 95:
#line 1034 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 3070 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 96:
#line 1037 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 3078 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 97:
#line 1040 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 3086 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 98:
#line 1043 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeRange((yyvsp[-2].node), (yyvsp[0].node));
}
#line 3094 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 99:
#line 1049 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.strval) = (yyvsp[0].strval);
}
#line 3102 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 100:
#line 1052 "Aql/grammar.y" /* yacc.c:1646 */
{
std::string temp((yyvsp[-2].strval).value, (yyvsp[-2].strval).length);
temp.append("::");
temp.append((yyvsp[0].strval).value, (yyvsp[0].strval).length);
auto p = parser->query()->registerString(temp);
if (p == nullptr) {
ABORT_OOM
}
(yyval.strval).value = p;
(yyval.strval).length = temp.size();
}
#line 3120 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 101:
#line 1068 "Aql/grammar.y" /* yacc.c:1646 */
{
parser->pushStack((yyvsp[-1].strval).value);
auto node = parser->ast()->createNodeArray();
parser->pushStack(node);
}
#line 3131 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 102:
#line 1073 "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 3140 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 103:
#line 1077 "Aql/grammar.y" /* yacc.c:1646 */
{
auto node = parser->ast()->createNodeArray();
parser->pushStack(node);
}
#line 3149 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 104:
#line 1080 "Aql/grammar.y" /* yacc.c:1646 */
{
auto list = static_cast<AstNode const*>(parser->popStack());
(yyval.node) = parser->ast()->createNodeFunctionCall("LIKE", list);
}
#line 3158 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 105:
#line 1087 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeUnaryOperator(NODE_TYPE_OPERATOR_UNARY_PLUS, (yyvsp[0].node));
}
#line 3166 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 106:
#line 1090 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeUnaryOperator(NODE_TYPE_OPERATOR_UNARY_MINUS, (yyvsp[0].node));
}
#line 3174 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 107:
#line 1093 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeUnaryOperator(NODE_TYPE_OPERATOR_UNARY_NOT, (yyvsp[0].node));
}
#line 3182 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 108:
#line 1099 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_OR, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3190 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 109:
#line 1102 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_AND, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3198 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 110:
#line 1105 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_PLUS, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3206 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 111:
#line 1108 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_MINUS, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3214 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 112:
#line 1111 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_TIMES, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3222 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 113:
#line 1114 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_DIV, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3230 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 114:
#line 1117 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_MOD, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3238 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 115:
#line 1120 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_EQ, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3246 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 116:
#line 1123 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_NE, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3254 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 117:
#line 1126 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_LT, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3262 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 118:
#line 1129 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_GT, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3270 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 119:
#line 1132 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_LE, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3278 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 120:
#line 1135 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_GE, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3286 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 121:
#line 1138 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_IN, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3294 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 122:
#line 1141 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_NIN, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3302 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 123:
#line 1144 "Aql/grammar.y" /* yacc.c:1646 */
{
AstNode* arguments = parser->ast()->createNodeArray(2);
arguments->addMember((yyvsp[-2].node));
arguments->addMember((yyvsp[0].node));
(yyval.node) = parser->ast()->createNodeFunctionCall("LIKE", arguments);
}
#line 3313 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 124:
#line 1150 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryArrayOperator(NODE_TYPE_OPERATOR_BINARY_ARRAY_EQ, (yyvsp[-3].node), (yyvsp[0].node), (yyvsp[-2].node));
}
#line 3321 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 125:
#line 1153 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryArrayOperator(NODE_TYPE_OPERATOR_BINARY_ARRAY_NE, (yyvsp[-3].node), (yyvsp[0].node), (yyvsp[-2].node));
}
#line 3329 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 126:
#line 1156 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryArrayOperator(NODE_TYPE_OPERATOR_BINARY_ARRAY_LT, (yyvsp[-3].node), (yyvsp[0].node), (yyvsp[-2].node));
}
#line 3337 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 127:
#line 1159 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryArrayOperator(NODE_TYPE_OPERATOR_BINARY_ARRAY_GT, (yyvsp[-3].node), (yyvsp[0].node), (yyvsp[-2].node));
}
#line 3345 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 128:
#line 1162 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryArrayOperator(NODE_TYPE_OPERATOR_BINARY_ARRAY_LE, (yyvsp[-3].node), (yyvsp[0].node), (yyvsp[-2].node));
}
#line 3353 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 129:
#line 1165 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryArrayOperator(NODE_TYPE_OPERATOR_BINARY_ARRAY_GE, (yyvsp[-3].node), (yyvsp[0].node), (yyvsp[-2].node));
}
#line 3361 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 130:
#line 1168 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryArrayOperator(NODE_TYPE_OPERATOR_BINARY_ARRAY_IN, (yyvsp[-3].node), (yyvsp[0].node), (yyvsp[-2].node));
}
#line 3369 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 131:
#line 1171 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryArrayOperator(NODE_TYPE_OPERATOR_BINARY_ARRAY_NIN, (yyvsp[-3].node), (yyvsp[0].node), (yyvsp[-2].node));
}
#line 3377 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 132:
#line 1177 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeTernaryOperator((yyvsp[-4].node), (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3385 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 133:
#line 1183 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 3392 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 134:
#line 1185 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 3399 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 135:
#line 1190 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 3407 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 136:
#line 1193 "Aql/grammar.y" /* yacc.c:1646 */
{
parser->ast()->scopes()->start(arangodb::aql::AQL_SCOPE_SUBQUERY);
parser->ast()->startSubQuery();
}
#line 3416 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 137:
#line 1196 "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(), variableName.size(), node, false);
parser->ast()->addOperation(subQuery);
(yyval.node) = parser->ast()->createNodeReference(variableName);
}
#line 3431 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 138:
#line 1209 "Aql/grammar.y" /* yacc.c:1646 */
{
parser->pushArrayElement((yyvsp[0].node));
}
#line 3439 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 139:
#line 1212 "Aql/grammar.y" /* yacc.c:1646 */
{
parser->pushArrayElement((yyvsp[0].node));
}
#line 3447 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 140:
#line 1218 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 3455 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 141:
#line 1221 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 3463 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 142:
#line 1227 "Aql/grammar.y" /* yacc.c:1646 */
{
auto node = parser->ast()->createNodeArray();
parser->pushStack(node);
}
#line 3472 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 143:
#line 1230 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = static_cast<AstNode*>(parser->popStack());
}
#line 3480 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 144:
#line 1236 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 3487 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 145:
#line 1238 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 3494 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 146:
#line 1243 "Aql/grammar.y" /* yacc.c:1646 */
{
parser->pushArrayElement((yyvsp[0].node));
}
#line 3502 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 147:
#line 1246 "Aql/grammar.y" /* yacc.c:1646 */
{
parser->pushArrayElement((yyvsp[0].node));
}
#line 3510 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 148:
#line 1252 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = nullptr;
}
#line 3518 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 149:
#line 1255 "Aql/grammar.y" /* yacc.c:1646 */
{
if ((yyvsp[0].node) == nullptr) {
ABORT_OOM
}
if (! TRI_CaseEqualString((yyvsp[-1].strval).value, "OPTIONS")) {
parser->registerParseError(TRI_ERROR_QUERY_PARSE, "unexpected qualifier '%s', expecting 'OPTIONS'", (yyvsp[-1].strval).value, yylloc.first_line, yylloc.first_column);
}
(yyval.node) = (yyvsp[0].node);
}
#line 3534 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 150:
#line 1269 "Aql/grammar.y" /* yacc.c:1646 */
{
auto node = parser->ast()->createNodeObject();
parser->pushStack(node);
}
#line 3543 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 151:
#line 1272 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = static_cast<AstNode*>(parser->popStack());
}
#line 3551 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 152:
#line 1278 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 3558 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 153:
#line 1280 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 3565 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 154:
#line 1285 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 3572 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 155:
#line 1287 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 3579 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 156:
#line 1292 "Aql/grammar.y" /* yacc.c:1646 */
{
// attribute-name-only (comparable to JS enhanced object literals, e.g. { foo, bar })
auto ast = parser->ast();
auto variable = ast->scopes()->getVariable((yyvsp[0].strval).value, (yyvsp[0].strval).length, true);
if (variable == nullptr) {
// variable does not exist
parser->registerParseError(TRI_ERROR_QUERY_VARIABLE_NAME_UNKNOWN, "use of unknown variable '%s' in object literal", (yyvsp[0].strval).value, yylloc.first_line, yylloc.first_column);
}
// create a reference to the variable
auto node = ast->createNodeReference(variable);
parser->pushObjectElement((yyvsp[0].strval).value, (yyvsp[0].strval).length, node);
}
#line 3598 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 157:
#line 1306 "Aql/grammar.y" /* yacc.c:1646 */
{
// attribute-name : attribute-value
parser->pushObjectElement((yyvsp[-2].strval).value, (yyvsp[-2].strval).length, (yyvsp[0].node));
}
#line 3607 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 158:
#line 1310 "Aql/grammar.y" /* yacc.c:1646 */
{
// bind-parameter : attribute-value
if ((yyvsp[-2].strval).length < 1 || (yyvsp[-2].strval).value[0] == '@') {
parser->registerParseError(TRI_ERROR_QUERY_BIND_PARAMETER_TYPE, TRI_errno_string(TRI_ERROR_QUERY_BIND_PARAMETER_TYPE), (yyvsp[-2].strval).value, yylloc.first_line, yylloc.first_column);
}
auto param = parser->ast()->createNodeParameter((yyvsp[-2].strval).value, (yyvsp[-2].strval).length);
parser->pushObjectElement(param, (yyvsp[0].node));
}
#line 3621 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 159:
#line 1319 "Aql/grammar.y" /* yacc.c:1646 */
{
// [ attribute-name-expression ] : attribute-value
parser->pushObjectElement((yyvsp[-3].node), (yyvsp[0].node));
}
#line 3630 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 160:
#line 1326 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.intval) = 1;
}
#line 3638 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 161:
#line 1329 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.intval) = (yyvsp[-1].intval) + 1;
}
#line 3646 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 162:
#line 1335 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = nullptr;
}
#line 3654 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 163:
#line 1338 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 3662 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 164:
#line 1344 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = nullptr;
}
#line 3670 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 165:
#line 1347 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeArrayLimit(nullptr, (yyvsp[0].node));
}
#line 3678 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 166:
#line 1350 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeArrayLimit((yyvsp[-2].node), (yyvsp[0].node));
}
#line 3686 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 167:
#line 1356 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = nullptr;
}
#line 3694 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 168:
#line 1359 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 3702 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 169:
#line 1365 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeValueString((yyvsp[0].strval).value, (yyvsp[0].strval).length);
}
#line 3710 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 170:
#line 1368 "Aql/grammar.y" /* yacc.c:1646 */
{
char const* p = (yyvsp[0].node)->getStringValue();
size_t const len = (yyvsp[0].node)->getStringLength();
if (len < 1 || *p != '@') {
parser->registerParseError(TRI_ERROR_QUERY_BIND_PARAMETER_TYPE, TRI_errno_string(TRI_ERROR_QUERY_BIND_PARAMETER_TYPE), p, yylloc.first_line, yylloc.first_column);
}
(yyval.node) = (yyvsp[0].node);
}
#line 3723 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 171:
#line 1376 "Aql/grammar.y" /* yacc.c:1646 */
{
auto tmp = parser->ast()->createNodeValueString((yyvsp[0].strval).value, (yyvsp[0].strval).length);
(yyval.node) = parser->ast()->createNodeCollectionDirection((yyvsp[-1].intval), tmp);
}
#line 3732 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 172:
#line 1380 "Aql/grammar.y" /* yacc.c:1646 */
{
char const* p = (yyvsp[0].node)->getStringValue();
size_t const len = (yyvsp[0].node)->getStringLength();
if (len < 1 || *p != '@') {
parser->registerParseError(TRI_ERROR_QUERY_BIND_PARAMETER_TYPE, TRI_errno_string(TRI_ERROR_QUERY_BIND_PARAMETER_TYPE), p, yylloc.first_line, yylloc.first_column);
}
(yyval.node) = parser->ast()->createNodeCollectionDirection((yyvsp[-1].intval), (yyvsp[0].node));
}
#line 3745 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 173:
#line 1391 "Aql/grammar.y" /* yacc.c:1646 */
{
auto node = static_cast<AstNode*>(parser->peekStack());
node->addMember((yyvsp[0].node));
}
#line 3754 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 174:
#line 1395 "Aql/grammar.y" /* yacc.c:1646 */
{
auto node = static_cast<AstNode*>(parser->peekStack());
node->addMember((yyvsp[0].node));
}
#line 3763 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 175:
#line 1402 "Aql/grammar.y" /* yacc.c:1646 */
{
auto node = parser->ast()->createNodeArray();
node->addMember((yyvsp[0].node));
(yyval.node) = parser->ast()->createNodeCollectionList(node);
}
#line 3773 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 176:
#line 1407 "Aql/grammar.y" /* yacc.c:1646 */
{
auto node = parser->ast()->createNodeArray();
parser->pushStack(node);
node->addMember((yyvsp[-1].node));
}
#line 3783 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 177:
#line 1411 "Aql/grammar.y" /* yacc.c:1646 */
{
auto node = static_cast<AstNode*>(parser->popStack());
(yyval.node) = parser->ast()->createNodeCollectionList(node);
}
#line 3792 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 178:
#line 1415 "Aql/grammar.y" /* yacc.c:1646 */
{
// graph name
char const* p = (yyvsp[0].node)->getStringValue();
size_t const len = (yyvsp[0].node)->getStringLength();
if (len < 1 || *p == '@') {
parser->registerParseError(TRI_ERROR_QUERY_BIND_PARAMETER_TYPE, TRI_errno_string(TRI_ERROR_QUERY_BIND_PARAMETER_TYPE), p, yylloc.first_line, yylloc.first_column);
}
(yyval.node) = (yyvsp[0].node);
}
#line 3806 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 179:
#line 1424 "Aql/grammar.y" /* yacc.c:1646 */
{
// graph name
(yyval.node) = parser->ast()->createNodeValueString((yyvsp[0].strval).value, (yyvsp[0].strval).length);
}
#line 3815 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 180:
#line 1433 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.intval) = 2;
}
#line 3823 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 181:
#line 1436 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.intval) = 1;
}
#line 3831 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 182:
#line 1439 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.intval) = 0;
}
#line 3839 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 183:
#line 1445 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeDirection((yyvsp[0].intval), 1);
}
#line 3847 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 184:
#line 1448 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeDirection((yyvsp[0].intval), (yyvsp[-1].node));
}
#line 3855 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 185:
#line 1454 "Aql/grammar.y" /* yacc.c:1646 */
{
// variable or collection
auto ast = parser->ast();
AstNode* node = nullptr;
auto variable = ast->scopes()->getVariable((yyvsp[0].strval).value, (yyvsp[0].strval).length, true);
if (variable == nullptr) {
// variable does not exist
// now try special variables
if (ast->scopes()->canUseCurrentVariable() && strcmp((yyvsp[0].strval).value, "CURRENT") == 0) {
variable = ast->scopes()->getCurrentVariable();
}
else if (strcmp((yyvsp[0].strval).value, Variable::NAME_CURRENT) == 0) {
variable = ast->scopes()->getCurrentVariable();
}
}
if (variable != nullptr) {
// variable alias exists, now use it
node = ast->createNodeReference(variable);
}
if (node == nullptr) {
// variable not found. so it must have been a collection
node = ast->createNodeCollection((yyvsp[0].strval).value, TRI_TRANSACTION_READ);
}
TRI_ASSERT(node != nullptr);
(yyval.node) = node;
}
#line 3892 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 186:
#line 1486 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 3900 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 187:
#line 1489 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 3908 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 188:
#line 1492 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
if ((yyval.node) == nullptr) {
ABORT_OOM
}
}
#line 3920 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 189:
#line 1499 "Aql/grammar.y" /* yacc.c:1646 */
{
if ((yyvsp[-1].node)->type == NODE_TYPE_EXPANSION) {
// create a dummy passthru node that reduces and evaluates the expansion first
// and the expansion on top of the stack won't be chained with any other expansions
(yyval.node) = parser->ast()->createNodePassthru((yyvsp[-1].node));
}
else {
(yyval.node) = (yyvsp[-1].node);
}
}
#line 3935 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 190:
#line 1509 "Aql/grammar.y" /* yacc.c:1646 */
{
parser->ast()->scopes()->start(arangodb::aql::AQL_SCOPE_SUBQUERY);
parser->ast()->startSubQuery();
}
#line 3944 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 191:
#line 1512 "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(), variableName.size(), node, false);
parser->ast()->addOperation(subQuery);
(yyval.node) = parser->ast()->createNodeReference(variableName);
}
#line 3959 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 192:
#line 1522 "Aql/grammar.y" /* yacc.c:1646 */
{
// named variable access, e.g. variable.reference
if ((yyvsp[-2].node)->type == NODE_TYPE_EXPANSION) {
// if left operand is an expansion already...
// dive into the expansion's right-hand child nodes for further expansion and
// patch the bottom-most one
auto current = const_cast<AstNode*>(parser->ast()->findExpansionSubNode((yyvsp[-2].node)));
TRI_ASSERT(current->type == NODE_TYPE_EXPANSION);
current->changeMember(1, parser->ast()->createNodeAttributeAccess(current->getMember(1), (yyvsp[0].strval).value, (yyvsp[0].strval).length));
(yyval.node) = (yyvsp[-2].node);
}
else {
(yyval.node) = parser->ast()->createNodeAttributeAccess((yyvsp[-2].node), (yyvsp[0].strval).value, (yyvsp[0].strval).length);
}
}
#line 3979 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 193:
#line 1537 "Aql/grammar.y" /* yacc.c:1646 */
{
// named variable access, e.g. variable.@reference
if ((yyvsp[-2].node)->type == NODE_TYPE_EXPANSION) {
// if left operand is an expansion already...
// patch the existing expansion
auto current = const_cast<AstNode*>(parser->ast()->findExpansionSubNode((yyvsp[-2].node)));
TRI_ASSERT(current->type == NODE_TYPE_EXPANSION);
current->changeMember(1, parser->ast()->createNodeBoundAttributeAccess(current->getMember(1), (yyvsp[0].node)));
(yyval.node) = (yyvsp[-2].node);
}
else {
(yyval.node) = parser->ast()->createNodeBoundAttributeAccess((yyvsp[-2].node), (yyvsp[0].node));
}
}
#line 3998 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 194:
#line 1551 "Aql/grammar.y" /* yacc.c:1646 */
{
// indexed variable access, e.g. variable[index]
if ((yyvsp[-3].node)->type == NODE_TYPE_EXPANSION) {
// if left operand is an expansion already...
// patch the existing expansion
auto current = const_cast<AstNode*>(parser->ast()->findExpansionSubNode((yyvsp[-3].node)));
TRI_ASSERT(current->type == NODE_TYPE_EXPANSION);
current->changeMember(1, parser->ast()->createNodeIndexedAccess(current->getMember(1), (yyvsp[-1].node)));
(yyval.node) = (yyvsp[-3].node);
}
else {
(yyval.node) = parser->ast()->createNodeIndexedAccess((yyvsp[-3].node), (yyvsp[-1].node));
}
}
#line 4017 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 195:
#line 1565 "Aql/grammar.y" /* yacc.c:1646 */
{
// variable expansion, e.g. variable[*], with optional FILTER, LIMIT and RETURN clauses
if ((yyvsp[0].intval) > 1 && (yyvsp[-2].node)->type == NODE_TYPE_EXPANSION) {
// create a dummy passthru node that reduces and evaluates the expansion first
// and the expansion on top of the stack won't be chained with any other expansions
(yyvsp[-2].node) = parser->ast()->createNodePassthru((yyvsp[-2].node));
}
// create a temporary iterator variable
std::string const nextName = parser->ast()->variables()->nextName() + "_";
if ((yyvsp[-2].node)->type == NODE_TYPE_EXPANSION) {
auto iterator = parser->ast()->createNodeIterator(nextName.c_str(), nextName.size(), (yyvsp[-2].node)->getMember(1));
parser->pushStack(iterator);
}
else {
auto iterator = parser->ast()->createNodeIterator(nextName.c_str(), nextName.size(), (yyvsp[-2].node));
parser->pushStack(iterator);
}
auto scopes = parser->ast()->scopes();
scopes->stackCurrentVariable(scopes->getVariable(nextName));
}
#line 4045 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 196:
#line 1587 "Aql/grammar.y" /* yacc.c:1646 */
{
auto scopes = parser->ast()->scopes();
scopes->unstackCurrentVariable();
auto iterator = static_cast<AstNode const*>(parser->popStack());
auto variableNode = iterator->getMember(0);
TRI_ASSERT(variableNode->type == NODE_TYPE_VARIABLE);
auto variable = static_cast<Variable const*>(variableNode->getData());
if ((yyvsp[-7].node)->type == NODE_TYPE_EXPANSION) {
auto expand = parser->ast()->createNodeExpansion((yyvsp[-5].intval), iterator, parser->ast()->createNodeReference(variable->name), (yyvsp[-3].node), (yyvsp[-2].node), (yyvsp[-1].node));
(yyvsp[-7].node)->changeMember(1, expand);
(yyval.node) = (yyvsp[-7].node);
}
else {
(yyval.node) = parser->ast()->createNodeExpansion((yyvsp[-5].intval), iterator, parser->ast()->createNodeReference(variable->name), (yyvsp[-3].node), (yyvsp[-2].node), (yyvsp[-1].node));
}
}
#line 4068 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 197:
#line 1608 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 4076 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 198:
#line 1611 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 4084 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 199:
#line 1617 "Aql/grammar.y" /* yacc.c:1646 */
{
if ((yyvsp[0].node) == nullptr) {
ABORT_OOM
}
(yyval.node) = (yyvsp[0].node);
}
#line 4096 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 200:
#line 1624 "Aql/grammar.y" /* yacc.c:1646 */
{
if ((yyvsp[0].node) == nullptr) {
ABORT_OOM
}
(yyval.node) = (yyvsp[0].node);
}
#line 4108 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 201:
#line 1634 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeValueString((yyvsp[0].strval).value, (yyvsp[0].strval).length);
}
#line 4116 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 202:
#line 1637 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 4124 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 203:
#line 1640 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeValueNull();
}
#line 4132 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 204:
#line 1643 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeValueBool(true);
}
#line 4140 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 205:
#line 1646 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeValueBool(false);
}
#line 4148 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 206:
#line 1652 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeCollection((yyvsp[0].strval).value, TRI_TRANSACTION_WRITE);
}
#line 4156 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 207:
#line 1655 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeCollection((yyvsp[0].strval).value, TRI_TRANSACTION_WRITE);
}
#line 4164 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 208:
#line 1658 "Aql/grammar.y" /* yacc.c:1646 */
{
if ((yyvsp[0].strval).length < 2 || (yyvsp[0].strval).value[0] != '@') {
parser->registerParseError(TRI_ERROR_QUERY_BIND_PARAMETER_TYPE, TRI_errno_string(TRI_ERROR_QUERY_BIND_PARAMETER_TYPE), (yyvsp[0].strval).value, yylloc.first_line, yylloc.first_column);
}
(yyval.node) = parser->ast()->createNodeParameter((yyvsp[0].strval).value, (yyvsp[0].strval).length);
}
#line 4176 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 209:
#line 1668 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeParameter((yyvsp[0].strval).value, (yyvsp[0].strval).length);
}
#line 4184 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 210:
#line 1674 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.strval) = (yyvsp[0].strval);
}
#line 4192 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 211:
#line 1677 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.strval) = (yyvsp[0].strval);
}
#line 4200 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 212:
#line 1682 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.strval) = (yyvsp[0].strval);
}
#line 4208 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
#line 4212 "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