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

4569 lines
157 KiB
C++
Raw Blame History

/* A Bison parser, made by GNU Bison 3.0.4. */
/* Bison implementation for Yacc-like parsers in C
Copyright (C) 1984, 1989-1990, 2000-2015 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.4"
/* 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/Aggregator.h"
#include "Aql/AstNode.h"
#include "Aql/Function.h"
#include "Aql/Parser.h"
#include "Aql/Quantifier.h"
#include "Basics/conversions.h"
#include "Basics/tri-strings.h"
#include "VocBase/AccessMode.h"
#line 83 "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_SHORTEST_PATH = 272,
T_DISTINCT = 273,
T_REMOVE = 274,
T_INSERT = 275,
T_UPDATE = 276,
T_REPLACE = 277,
T_UPSERT = 278,
T_NULL = 279,
T_TRUE = 280,
T_FALSE = 281,
T_STRING = 282,
T_QUOTED_STRING = 283,
T_INTEGER = 284,
T_DOUBLE = 285,
T_PARAMETER = 286,
T_ASSIGN = 287,
T_NOT = 288,
T_AND = 289,
T_OR = 290,
T_NIN = 291,
T_REGEX_MATCH = 292,
T_REGEX_NON_MATCH = 293,
T_EQ = 294,
T_NE = 295,
T_LT = 296,
T_GT = 297,
T_LE = 298,
T_GE = 299,
T_LIKE = 300,
T_PLUS = 301,
T_MINUS = 302,
T_TIMES = 303,
T_DIV = 304,
T_MOD = 305,
T_QUESTION = 306,
T_COLON = 307,
T_SCOPE = 308,
T_RANGE = 309,
T_COMMA = 310,
T_OPEN = 311,
T_CLOSE = 312,
T_OBJECT_OPEN = 313,
T_OBJECT_CLOSE = 314,
T_ARRAY_OPEN = 315,
T_ARRAY_CLOSE = 316,
T_OUTBOUND = 317,
T_INBOUND = 318,
T_ANY = 319,
T_ALL = 320,
T_NONE = 321,
UMINUS = 322,
UPLUS = 323,
FUNCCALL = 324,
REFERENCE = 325,
INDEXED = 326,
EXPANSION = 327
};
#endif
/* Value type. */
#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
union YYSTYPE
{
#line 20 "Aql/grammar.y" /* yacc.c:355 */
arangodb::aql::AstNode* node;
struct {
char* value;
size_t length;
} strval;
bool boolval;
int64_t intval;
#line 207 "Aql/grammar.cpp" /* yacc.c:355 */
};
typedef union YYSTYPE YYSTYPE;
# 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 30 "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->name)) {
// 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 407 "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 1355
/* YYNTOKENS -- Number of terminals. */
#define YYNTOKENS 74
/* YYNNTS -- Number of nonterminals. */
#define YYNNTS 92
/* YYNRULES -- Number of rules. */
#define YYNRULES 219
/* YYNSTATES -- Number of states. */
#define YYNSTATES 378
/* YYTRANSLATE[YYX] -- Symbol number corresponding to YYX as returned
by yylex, with out-of-bounds checking. */
#define YYUNDEFTOK 2
#define YYMAXUTOK 327
#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, 73, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 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, 70, 71, 72
};
#if YYDEBUG
/* YYRLINE[YYN] -- Source line where rule number YYN was defined. */
static const yytype_uint16 yyrline[] =
{
0, 369, 369, 372, 383, 387, 391, 398, 400, 400,
411, 416, 421, 423, 426, 429, 432, 435, 441, 443,
448, 450, 452, 454, 456, 458, 460, 462, 464, 466,
468, 473, 479, 481, 486, 491, 496, 504, 512, 523,
531, 536, 538, 543, 550, 560, 560, 574, 583, 594,
624, 691, 716, 749, 751, 756, 763, 766, 769, 778,
792, 809, 809, 823, 823, 833, 833, 844, 847, 853,
859, 862, 865, 868, 874, 879, 886, 894, 897, 903,
913, 923, 931, 942, 947, 955, 966, 971, 974, 980,
980, 1031, 1034, 1037, 1043, 1043, 1053, 1059, 1062, 1065,
1068, 1071, 1074, 1080, 1083, 1099, 1099, 1108, 1108, 1118,
1121, 1124, 1130, 1133, 1136, 1139, 1142, 1145, 1148, 1151,
1154, 1157, 1160, 1163, 1166, 1169, 1172, 1175, 1181, 1187,
1194, 1197, 1200, 1203, 1206, 1209, 1212, 1215, 1221, 1224,
1230, 1232, 1237, 1240, 1240, 1256, 1259, 1265, 1268, 1274,
1274, 1283, 1285, 1290, 1293, 1299, 1302, 1316, 1316, 1325,
1327, 1332, 1334, 1339, 1353, 1357, 1366, 1373, 1376, 1382,
1385, 1391, 1394, 1397, 1403, 1406, 1412, 1415, 1423, 1427,
1438, 1442, 1449, 1454, 1454, 1462, 1471, 1480, 1483, 1486,
1492, 1495, 1501, 1533, 1536, 1539, 1546, 1556, 1556, 1569,
1584, 1598, 1612, 1612, 1655, 1658, 1664, 1671, 1681, 1684,
1687, 1690, 1693, 1699, 1702, 1705, 1715, 1721, 1724, 1729
};
#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\"",
"\"SHORTEST_PATH 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\"", "\"<= 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", "traversal_statement",
"shortest_path_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,
325, 326, 327, 46
};
# endif
#define YYPACT_NINF -338
#define yypact_value_is_default(Yystate) \
(!!((Yystate) == (-338)))
#define YYTABLE_NINF -218
#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[] =
{
3, -338, -338, 41, 24, -338, 1228, -338, -338, -338,
-338, 23, -338, 31, 31, 1271, 324, 9, -338, 481,
1271, 1271, 1271, 1271, -338, -338, -338, -338, -338, -338,
103, -338, -338, -338, -338, 27, 30, 37, 56, 57,
24, -338, -338, -338, -338, -3, 13, -338, 72, -338,
-338, -338, -42, -338, -338, -338, 1271, 49, 1271, 1271,
1271, -338, -338, 1011, 77, -338, -338, -338, -338, -338,
-338, -338, -54, -338, -338, -338, -338, -338, 1011, 104,
-338, 124, 31, 131, 1271, 100, -338, -338, 650, 650,
-338, 480, -338, 523, 1271, 31, 124, 130, 131, -338,
96, 31, 31, 1271, -338, -338, -338, -338, 690, -338,
4, 1271, 1271, 1271, 1271, 1271, 1271, 1271, 1271, 1271,
1271, 1271, 1271, 1271, 1271, 1271, 1271, 1271, 1271, 1271,
1160, 1271, -338, -338, -338, 297, 159, -338, 1197, 88,
1271, 173, 31, 133, -338, 134, -338, 161, 124, 139,
-338, 397, 481, 1295, 11, 124, 124, 1271, 124, 1271,
124, 730, 170, -338, 133, 124, -338, 124, -338, -338,
-338, 563, 191, 1271, -2, -338, 1011, 1234, -338, 153,
168, -338, 169, 1271, 163, 171, -338, 172, 1011, 164,
175, 1154, 1090, 1051, 1154, 1129, 1129, 1129, 1129, 350,
350, 350, 350, 1129, 156, 156, -338, -338, -338, 1271,
770, 52, 1271, 1271, 1271, 1271, 1271, 1271, 1271, 1271,
-338, 1234, -338, 811, 180, -338, -338, 1011, 31, 134,
-338, 31, 1271, -338, 1271, -338, -338, -338, -338, -338,
40, 192, 234, -338, -338, -338, -338, -338, -338, -338,
650, -338, 650, -338, 1271, 1271, 31, -338, -338, 540,
-338, 1271, 437, 96, 31, 1011, 174, -338, -338, 177,
-338, 1271, 851, -338, 4, 1271, -338, 1271, 1011, 1271,
1154, 1154, 1129, 1129, 350, 350, 350, 350, 178, -338,
-338, 231, -338, -338, 1011, -338, 124, 124, 609, 1011,
190, -338, 891, 118, -338, 193, 124, 101, -338, 563,
229, 1271, 238, -338, -338, 1271, 1011, 199, -338, 1011,
1011, 1011, -338, 1271, 261, -338, -338, -338, -338, 1271,
31, 1271, -338, -338, -338, -338, -338, -338, 1271, 437,
96, -338, 1271, 1011, 1271, 265, 650, -338, 437, 76,
931, 124, -338, 1271, 1011, 971, 1271, 212, 124, 124,
-338, 219, 1271, -338, 437, 1271, 1011, -338, -338, -338,
76, 437, 124, 1011, -338, 124, -338, -338
};
/* 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, 216,
4, 9, 3, 0, 0, 0, 0, 45, 65, 0,
0, 0, 0, 0, 89, 11, 19, 20, 22, 21,
56, 23, 24, 25, 12, 26, 27, 28, 29, 30,
0, 6, 219, 32, 33, 0, 40, 41, 0, 210,
211, 212, 192, 208, 206, 207, 0, 0, 0, 0,
197, 157, 149, 39, 0, 195, 97, 98, 99, 193,
147, 148, 101, 209, 100, 194, 94, 76, 96, 0,
63, 155, 0, 56, 0, 74, 204, 205, 0, 0,
83, 0, 86, 0, 0, 0, 155, 155, 56, 5,
0, 0, 0, 0, 111, 107, 109, 110, 0, 18,
159, 151, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 92, 91, 93, 0, 0, 105, 0, 0,
0, 0, 0, 0, 47, 46, 53, 0, 155, 66,
67, 70, 0, 0, 0, 155, 155, 0, 155, 0,
155, 0, 57, 48, 61, 155, 51, 155, 187, 188,
189, 31, 190, 0, 0, 42, 43, 143, 196, 0,
163, 218, 0, 0, 0, 160, 161, 0, 153, 0,
152, 125, 113, 112, 126, 128, 129, 119, 120, 121,
122, 123, 124, 127, 114, 115, 116, 117, 118, 0,
0, 102, 0, 0, 0, 0, 0, 0, 0, 0,
104, 143, 167, 0, 202, 199, 200, 95, 0, 64,
156, 0, 0, 49, 0, 71, 72, 69, 73, 75,
192, 208, 216, 77, 213, 214, 215, 78, 79, 80,
0, 81, 0, 84, 0, 0, 0, 52, 50, 189,
191, 0, 0, 0, 0, 142, 0, 145, 18, 141,
198, 0, 0, 158, 0, 0, 150, 0, 139, 0,
136, 137, 130, 131, 132, 133, 134, 135, 0, 201,
168, 169, 44, 54, 55, 68, 155, 155, 0, 58,
62, 59, 0, 0, 176, 182, 155, 0, 177, 0,
190, 0, 0, 108, 144, 143, 165, 0, 162, 164,
154, 138, 106, 0, 171, 82, 85, 87, 88, 0,
0, 0, 186, 185, 183, 34, 178, 179, 0, 0,
0, 146, 0, 170, 0, 174, 0, 60, 0, 0,
0, 155, 190, 0, 166, 172, 0, 0, 155, 155,
180, 184, 0, 35, 0, 0, 175, 203, 90, 37,
0, 0, 155, 173, 181, 155, 36, 38
};
/* YYPGOTO[NTERM-NUM]. */
static const yytype_int16 yypgoto[] =
{
-338, -6, -338, -338, -338, -338, -83, -338, -338, -338,
-338, -338, -338, -338, -338, -338, 179, 245, -338, -338,
-338, 135, 55, -70, -338, -338, -338, 253, -338, -338,
-338, -338, 53, -338, -338, -338, -68, -338, -338, -338,
-338, -338, -338, -338, -338, -338, -338, -338, -338, 50,
-338, -338, -338, -338, -338, -338, -338, 67, -25, -338,
-338, -338, -338, -338, -338, -338, -79, -135, -338, -338,
-338, 18, -338, -338, -338, -338, -337, -338, -63, -338,
-80, -260, -338, -338, -338, -77, -338, -15, 140, -4,
-338, -12
};
/* YYDEFGOTO[NTERM-NUM]. */
static const yytype_int16 yydefgoto[] =
{
-1, 10, 11, 2, 4, 3, 5, 25, 6, 26,
27, 43, 44, 28, 29, 46, 47, 81, 30, 82,
31, 145, 146, 97, 300, 165, 256, 83, 142, 32,
84, 149, 150, 237, 33, 34, 155, 35, 36, 90,
37, 92, 38, 329, 39, 94, 135, 77, 140, 265,
64, 65, 221, 177, 66, 67, 68, 266, 267, 268,
269, 69, 70, 111, 189, 190, 144, 71, 110, 184,
185, 186, 224, 324, 345, 357, 305, 361, 306, 349,
307, 173, 72, 109, 291, 85, 73, 74, 243, 75,
187, 147
};
/* 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, 45, 48, 311, 86, 41, 138, 12, 230, 100,
263, -103, 360, 148, -103, 87, 1, 163, 166, 139,
172, 156, 79, 158, 80, 160, 179, -13, 167, 230,
-14, 180, 181, 374, 99, 182, 12, -15, 244, 245,
-213, 7, 246, -213, -213, -213, -213, -213, -213, -213,
8, 8, 101, 264, 9, 9, -16, -17, 42, -213,
-213, -213, -213, -213, 183, 63, 78, -213, 102, 233,
88, 89, 91, 93, 238, 239, 248, 249, 40, 251,
353, 253, -13, 162, -13, -14, 257, -14, 258, 174,
48, 260, -15, -103, -15, -213, -103, -213, 125, 126,
127, 128, 129, 304, 103, 105, 104, 9, 106, 107,
108, -16, -17, -16, -17, 225, 79, 95, 80, 9,
49, 50, 51, 52, 53, 54, 55, 9, 336, 56,
136, 141, 9, 137, 151, 226, 86, 86, 168, 169,
170, 57, 58, 59, 161, 95, 332, 87, 87, 9,
171, 143, 60, 176, 61, 152, 62, 164, 168, 169,
170, 188, 191, 192, 193, 194, 195, 196, 197, 198,
199, 200, 201, 202, 203, 204, 205, 206, 207, 208,
210, 211, 296, 310, 297, 314, 220, 228, 223, 231,
227, 61, -214, 232, 234, -214, -214, -214, -214, -214,
-214, -214, 255, 191, 127, 128, 129, 250, 261, 252,
270, -214, -214, -214, -214, -214, 292, 325, 326, -214,
-217, 271, 273, 262, 275, 276, 274, 335, 290, 260,
277, 313, 315, 272, -215, 322, 323, -215, -215, -215,
-215, -215, -215, -215, 301, 330, 338, -214, 334, -214,
340, 342, 312, -215, -215, -215, -215, -215, 308, 278,
352, -215, 280, 281, 282, 283, 284, 285, 286, 287,
344, 356, 363, 367, 370, 96, 351, 229, 358, 368,
369, 175, 294, 98, 151, 359, 293, 295, 288, -215,
341, -215, 318, 376, 247, 0, 377, 0, 0, 333,
0, 372, 0, 337, 298, 299, 0, 0, 375, 212,
0, 302, 0, 309, 0, 0, 0, 0, 347, 0,
0, 316, 0, 0, 0, 319, 0, 320, 0, 321,
0, 0, 0, 213, 0, 308, 214, 215, 216, 217,
218, 219, 76, 0, 308, 308, 0, 0, 49, 50,
51, 52, 53, 54, 55, 9, 0, 56, 0, 0,
308, 339, 0, 0, 0, 0, 308, 308, 0, 57,
58, 59, 0, 343, 0, 0, 0, 0, 0, 346,
60, 348, 61, 0, 62, 0, 0, 0, 350, 0,
309, 0, 354, 0, 355, 0, 125, 126, 127, 128,
129, 0, 0, 364, 131, 0, 366, 235, 236, 112,
0, 0, 371, 0, 0, 373, 0, 0, 0, 0,
0, 49, 50, 51, 0, 53, 54, 55, 9, 0,
0, 113, 114, 115, 116, 117, 118, 119, 120, 121,
122, 123, 124, 125, 126, 127, 128, 129, 130, 112,
0, 131, 0, 303, 0, 0, 0, 0, 0, 0,
0, 132, 133, 134, 304, 0, 0, 0, 9, 0,
0, 113, 114, 115, 116, 117, 118, 119, 120, 121,
122, 123, 124, 125, 126, 127, 128, 129, 130, 0,
0, 131, 153, 157, 154, 0, 0, 0, 0, 168,
169, 259, 133, 134, 0, 49, 50, 51, 0, 53,
54, 55, 9, 0, 113, 114, 115, 116, 117, 118,
119, 120, 121, 122, 123, 124, 125, 126, 127, 128,
129, 130, 0, 0, 131, 153, 159, 154, 0, 0,
0, 0, 0, 0, 132, 133, 134, 0, 0, 0,
0, 0, -92, 0, 0, 0, 0, 113, 114, 115,
116, 117, 118, 119, 120, 121, 122, 123, 124, 125,
126, 127, 128, 129, 130, 112, -92, 131, 0, -92,
-92, -92, -92, -92, -92, 0, 0, 132, 133, 134,
0, 0, 0, 0, 0, 0, 0, 113, 114, 115,
116, 117, 118, 119, 120, 121, 122, 123, 124, 125,
126, 127, 128, 129, 130, 0, 0, 131, 0, 0,
0, 112, 0, 0, 0, 168, 169, 259, 133, 134,
327, 328, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 113, 114, 115, 116, 117, 118, 119,
120, 121, 122, 123, 124, 125, 126, 127, 128, 129,
130, 0, 153, 131, 154, 0, 0, 0, 0, 0,
0, 0, 0, 132, 133, 134, 0, 0, 0, 0,
0, 0, 0, 0, 113, 114, 115, 116, 117, 118,
119, 120, 121, 122, 123, 124, 125, 126, 127, 128,
129, 130, 112, 0, 131, 0, 0, 0, 0, 0,
0, 0, 0, 0, 132, 133, 134, 0, 0, 0,
0, 0, 0, 0, 113, 114, 115, 116, 117, 118,
119, 120, 121, 122, 123, 124, 125, 126, 127, 128,
129, 130, 112, 0, 131, 0, 0, 178, 0, 0,
254, 0, 0, 0, 132, 133, 134, 0, 0, 0,
0, 0, 0, 0, 113, 114, 115, 116, 117, 118,
119, 120, 121, 122, 123, 124, 125, 126, 127, 128,
129, 130, 112, 0, 131, 0, 0, 0, 0, 0,
0, 0, 0, 0, 132, 133, 134, 0, 0, 0,
0, 0, 0, 0, 113, 114, 115, 116, 117, 118,
119, 120, 121, 122, 123, 124, 125, 126, 127, 128,
129, 130, 279, 112, 131, 0, 0, 0, 0, 0,
0, 0, 0, 0, 132, 133, 134, 0, 0, 0,
0, 0, 0, 0, 0, 113, 114, 115, 116, 117,
118, 119, 120, 121, 122, 123, 124, 125, 126, 127,
128, 129, 130, 112, 0, 131, 0, 0, 0, 0,
0, 0, 289, 0, 0, 132, 133, 134, 0, 0,
0, 0, 0, 0, 0, 113, 114, 115, 116, 117,
118, 119, 120, 121, 122, 123, 124, 125, 126, 127,
128, 129, 130, 112, 0, 131, 0, 0, 0, 0,
0, 0, 317, 0, 0, 132, 133, 134, 331, 0,
0, 0, 0, 0, 0, 113, 114, 115, 116, 117,
118, 119, 120, 121, 122, 123, 124, 125, 126, 127,
128, 129, 130, 112, 0, 131, 0, 0, 0, 0,
0, 0, 0, 0, 0, 132, 133, 134, 362, 0,
0, 0, 0, 0, 0, 113, 114, 115, 116, 117,
118, 119, 120, 121, 122, 123, 124, 125, 126, 127,
128, 129, 130, 112, 0, 131, 0, 0, 0, 0,
0, 0, 0, 0, 0, 132, 133, 134, 0, 0,
0, 0, 0, 0, 0, 113, 114, 115, 116, 117,
118, 119, 120, 121, 122, 123, 124, 125, 126, 127,
128, 129, 130, 112, 0, 131, 365, 0, 0, 0,
0, 0, 0, 0, 0, 132, 133, 134, 0, 0,
0, 0, 0, 0, 0, 113, 114, 115, 116, 117,
118, 119, 120, 121, 122, 123, 124, 125, 126, 127,
128, 129, 130, 112, 0, 131, 0, 0, 0, 0,
0, 0, 0, 0, 0, 132, 133, 134, 0, 0,
0, 0, 0, 0, 0, 113, 0, 115, 116, 117,
118, 119, 120, 121, 122, 123, 124, 125, 126, 127,
128, 129, 112, 0, 0, 131, 0, 0, 0, 0,
0, 0, 0, 0, 0, 132, 133, 134, 0, 0,
0, 0, 0, 0, 0, 0, 115, 116, 117, 118,
119, 120, 121, 122, 123, 124, 125, 126, 127, 128,
129, 112, 0, 0, 131, 0, 0, 0, 0, 0,
0, 0, 0, 0, 132, 133, 134, 0, 0, 0,
0, 0, 0, 0, 0, 115, 0, 0, 0, 0,
120, 121, 122, 123, 0, 125, 126, 127, 128, 129,
0, 0, 0, 131, 49, 50, 51, 52, 53, 54,
55, 9, 0, 56, 0, 120, 121, 122, 123, 0,
125, 126, 127, 128, 129, 57, 58, 59, 131, 0,
0, 0, 209, 0, 0, 0, 60, 0, 61, 0,
62, 49, 50, 51, 52, 53, 54, 55, 9, 0,
56, 13, 14, 15, 16, 17, 18, 19, 0, 0,
0, 0, 57, 58, 59, 222, 0, 20, 21, 22,
23, 24, 0, 60, 0, 61, 0, 62, 49, 50,
51, 52, 53, 54, 55, 9, 0, 56, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 57,
58, 59, 0, 0, 0, 0, 0, 0, 0, 0,
60, -140, 61, 0, 62, 49, 50, 51, 52, 53,
54, 55, 9, 0, 56, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 57, 58, 59, 49,
50, 51, 240, 241, 54, 55, 242, 60, 56, 61,
0, 62, 0, 0, 0, 0, 0, 0, 0, 0,
57, 58, 59, 0, 0, 0, 0, 0, 0, 0,
0, 60, 0, 61, 0, 62
};
static const yytype_int16 yycheck[] =
{
4, 13, 14, 263, 19, 11, 60, 11, 143, 12,
12, 53, 349, 83, 56, 19, 13, 96, 97, 73,
100, 89, 13, 91, 15, 93, 109, 0, 98, 164,
0, 27, 28, 370, 40, 31, 40, 0, 27, 28,
0, 0, 31, 3, 4, 5, 6, 7, 8, 9,
27, 27, 55, 55, 31, 31, 0, 0, 27, 19,
20, 21, 22, 23, 60, 15, 16, 27, 55, 148,
20, 21, 22, 23, 151, 152, 155, 156, 55, 158,
340, 160, 55, 95, 57, 55, 165, 57, 167, 101,
102, 171, 55, 53, 57, 55, 56, 57, 46, 47,
48, 49, 50, 27, 32, 56, 56, 31, 58, 59,
60, 55, 55, 57, 57, 27, 13, 14, 15, 31,
24, 25, 26, 27, 28, 29, 30, 31, 27, 33,
53, 27, 31, 56, 84, 139, 151, 152, 62, 63,
64, 45, 46, 47, 94, 14, 28, 151, 152, 31,
100, 27, 56, 103, 58, 55, 60, 27, 62, 63,
64, 111, 112, 113, 114, 115, 116, 117, 118, 119,
120, 121, 122, 123, 124, 125, 126, 127, 128, 129,
130, 131, 250, 263, 252, 268, 27, 14, 138, 55,
140, 58, 0, 32, 55, 3, 4, 5, 6, 7,
8, 9, 32, 153, 48, 49, 50, 157, 17, 159,
57, 19, 20, 21, 22, 23, 228, 296, 297, 27,
52, 52, 59, 173, 52, 61, 55, 306, 48, 309,
55, 57, 55, 183, 0, 57, 5, 3, 4, 5,
6, 7, 8, 9, 256, 55, 17, 55, 55, 57,
12, 52, 264, 19, 20, 21, 22, 23, 262, 209,
340, 27, 212, 213, 214, 215, 216, 217, 218, 219,
9, 6, 351, 61, 55, 30, 339, 142, 346, 358,
359, 102, 232, 30, 234, 348, 231, 234, 221, 55,
315, 57, 274, 372, 154, -1, 375, -1, -1, 303,
-1, 364, -1, 307, 254, 255, -1, -1, 371, 12,
-1, 261, -1, 263, -1, -1, -1, -1, 330, -1,
-1, 271, -1, -1, -1, 275, -1, 277, -1, 279,
-1, -1, -1, 36, -1, 339, 39, 40, 41, 42,
43, 44, 18, -1, 348, 349, -1, -1, 24, 25,
26, 27, 28, 29, 30, 31, -1, 33, -1, -1,
364, 311, -1, -1, -1, -1, 370, 371, -1, 45,
46, 47, -1, 323, -1, -1, -1, -1, -1, 329,
56, 331, 58, -1, 60, -1, -1, -1, 338, -1,
340, -1, 342, -1, 344, -1, 46, 47, 48, 49,
50, -1, -1, 353, 54, -1, 356, 10, 11, 12,
-1, -1, 362, -1, -1, 365, -1, -1, -1, -1,
-1, 24, 25, 26, -1, 28, 29, 30, 31, -1,
-1, 34, 35, 36, 37, 38, 39, 40, 41, 42,
43, 44, 45, 46, 47, 48, 49, 50, 51, 12,
-1, 54, -1, 16, -1, -1, -1, -1, -1, -1,
-1, 64, 65, 66, 27, -1, -1, -1, 31, -1,
-1, 34, 35, 36, 37, 38, 39, 40, 41, 42,
43, 44, 45, 46, 47, 48, 49, 50, 51, -1,
-1, 54, 12, 13, 14, -1, -1, -1, -1, 62,
63, 64, 65, 66, -1, 24, 25, 26, -1, 28,
29, 30, 31, -1, 34, 35, 36, 37, 38, 39,
40, 41, 42, 43, 44, 45, 46, 47, 48, 49,
50, 51, -1, -1, 54, 12, 13, 14, -1, -1,
-1, -1, -1, -1, 64, 65, 66, -1, -1, -1,
-1, -1, 12, -1, -1, -1, -1, 34, 35, 36,
37, 38, 39, 40, 41, 42, 43, 44, 45, 46,
47, 48, 49, 50, 51, 12, 36, 54, -1, 39,
40, 41, 42, 43, 44, -1, -1, 64, 65, 66,
-1, -1, -1, -1, -1, -1, -1, 34, 35, 36,
37, 38, 39, 40, 41, 42, 43, 44, 45, 46,
47, 48, 49, 50, 51, -1, -1, 54, -1, -1,
-1, 12, -1, -1, -1, 62, 63, 64, 65, 66,
21, 22, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, 34, 35, 36, 37, 38, 39, 40,
41, 42, 43, 44, 45, 46, 47, 48, 49, 50,
51, -1, 12, 54, 14, -1, -1, -1, -1, -1,
-1, -1, -1, 64, 65, 66, -1, -1, -1, -1,
-1, -1, -1, -1, 34, 35, 36, 37, 38, 39,
40, 41, 42, 43, 44, 45, 46, 47, 48, 49,
50, 51, 12, -1, 54, -1, -1, -1, -1, -1,
-1, -1, -1, -1, 64, 65, 66, -1, -1, -1,
-1, -1, -1, -1, 34, 35, 36, 37, 38, 39,
40, 41, 42, 43, 44, 45, 46, 47, 48, 49,
50, 51, 12, -1, 54, -1, -1, 57, -1, -1,
20, -1, -1, -1, 64, 65, 66, -1, -1, -1,
-1, -1, -1, -1, 34, 35, 36, 37, 38, 39,
40, 41, 42, 43, 44, 45, 46, 47, 48, 49,
50, 51, 12, -1, 54, -1, -1, -1, -1, -1,
-1, -1, -1, -1, 64, 65, 66, -1, -1, -1,
-1, -1, -1, -1, 34, 35, 36, 37, 38, 39,
40, 41, 42, 43, 44, 45, 46, 47, 48, 49,
50, 51, 52, 12, 54, -1, -1, -1, -1, -1,
-1, -1, -1, -1, 64, 65, 66, -1, -1, -1,
-1, -1, -1, -1, -1, 34, 35, 36, 37, 38,
39, 40, 41, 42, 43, 44, 45, 46, 47, 48,
49, 50, 51, 12, -1, 54, -1, -1, -1, -1,
-1, -1, 61, -1, -1, 64, 65, 66, -1, -1,
-1, -1, -1, -1, -1, 34, 35, 36, 37, 38,
39, 40, 41, 42, 43, 44, 45, 46, 47, 48,
49, 50, 51, 12, -1, 54, -1, -1, -1, -1,
-1, -1, 61, -1, -1, 64, 65, 66, 27, -1,
-1, -1, -1, -1, -1, 34, 35, 36, 37, 38,
39, 40, 41, 42, 43, 44, 45, 46, 47, 48,
49, 50, 51, 12, -1, 54, -1, -1, -1, -1,
-1, -1, -1, -1, -1, 64, 65, 66, 27, -1,
-1, -1, -1, -1, -1, 34, 35, 36, 37, 38,
39, 40, 41, 42, 43, 44, 45, 46, 47, 48,
49, 50, 51, 12, -1, 54, -1, -1, -1, -1,
-1, -1, -1, -1, -1, 64, 65, 66, -1, -1,
-1, -1, -1, -1, -1, 34, 35, 36, 37, 38,
39, 40, 41, 42, 43, 44, 45, 46, 47, 48,
49, 50, 51, 12, -1, 54, 55, -1, -1, -1,
-1, -1, -1, -1, -1, 64, 65, 66, -1, -1,
-1, -1, -1, -1, -1, 34, 35, 36, 37, 38,
39, 40, 41, 42, 43, 44, 45, 46, 47, 48,
49, 50, 51, 12, -1, 54, -1, -1, -1, -1,
-1, -1, -1, -1, -1, 64, 65, 66, -1, -1,
-1, -1, -1, -1, -1, 34, -1, 36, 37, 38,
39, 40, 41, 42, 43, 44, 45, 46, 47, 48,
49, 50, 12, -1, -1, 54, -1, -1, -1, -1,
-1, -1, -1, -1, -1, 64, 65, 66, -1, -1,
-1, -1, -1, -1, -1, -1, 36, 37, 38, 39,
40, 41, 42, 43, 44, 45, 46, 47, 48, 49,
50, 12, -1, -1, 54, -1, -1, -1, -1, -1,
-1, -1, -1, -1, 64, 65, 66, -1, -1, -1,
-1, -1, -1, -1, -1, 36, -1, -1, -1, -1,
41, 42, 43, 44, -1, 46, 47, 48, 49, 50,
-1, -1, -1, 54, 24, 25, 26, 27, 28, 29,
30, 31, -1, 33, -1, 41, 42, 43, 44, -1,
46, 47, 48, 49, 50, 45, 46, 47, 54, -1,
-1, -1, 52, -1, -1, -1, 56, -1, 58, -1,
60, 24, 25, 26, 27, 28, 29, 30, 31, -1,
33, 3, 4, 5, 6, 7, 8, 9, -1, -1,
-1, -1, 45, 46, 47, 48, -1, 19, 20, 21,
22, 23, -1, 56, -1, 58, -1, 60, 24, 25,
26, 27, 28, 29, 30, 31, -1, 33, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, 45,
46, 47, -1, -1, -1, -1, -1, -1, -1, -1,
56, 57, 58, -1, 60, 24, 25, 26, 27, 28,
29, 30, 31, -1, 33, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, 45, 46, 47, 24,
25, 26, 27, 28, 29, 30, 31, 56, 33, 58,
-1, 60, -1, -1, -1, -1, -1, -1, -1, -1,
45, 46, 47, -1, -1, -1, -1, -1, -1, -1,
-1, 56, -1, 58, -1, 60
};
/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
symbol of state STATE-NUM. */
static const yytype_uint8 yystos[] =
{
0, 13, 77, 79, 78, 80, 82, 0, 27, 31,
75, 76, 163, 3, 4, 5, 6, 7, 8, 9,
19, 20, 21, 22, 23, 81, 83, 84, 87, 88,
92, 94, 103, 108, 109, 111, 112, 114, 116, 118,
55, 75, 27, 85, 86, 165, 89, 90, 165, 24,
25, 26, 27, 28, 29, 30, 33, 45, 46, 47,
56, 58, 60, 123, 124, 125, 128, 129, 130, 135,
136, 141, 156, 160, 161, 163, 18, 121, 123, 13,
15, 91, 93, 101, 104, 159, 161, 163, 123, 123,
113, 123, 115, 123, 119, 14, 91, 97, 101, 75,
12, 55, 55, 32, 123, 56, 123, 123, 123, 157,
142, 137, 12, 34, 35, 36, 37, 38, 39, 40,
41, 42, 43, 44, 45, 46, 47, 48, 49, 50,
51, 54, 64, 65, 66, 120, 53, 56, 60, 73,
122, 27, 102, 27, 140, 95, 96, 165, 97, 105,
106, 123, 55, 12, 14, 110, 110, 13, 110, 13,
110, 123, 165, 140, 27, 99, 140, 97, 62, 63,
64, 123, 154, 155, 165, 90, 123, 127, 57, 80,
27, 28, 31, 60, 143, 144, 145, 164, 123, 138,
139, 123, 123, 123, 123, 123, 123, 123, 123, 123,
123, 123, 123, 123, 123, 123, 123, 123, 123, 52,
123, 123, 12, 36, 39, 40, 41, 42, 43, 44,
27, 126, 48, 123, 146, 27, 163, 123, 14, 95,
141, 55, 32, 140, 55, 10, 11, 107, 159, 159,
27, 28, 31, 162, 27, 28, 31, 162, 140, 140,
123, 140, 123, 140, 20, 32, 100, 140, 140, 64,
154, 17, 123, 12, 55, 123, 131, 132, 133, 134,
57, 52, 123, 59, 55, 52, 61, 55, 123, 52,
123, 123, 123, 123, 123, 123, 123, 123, 131, 61,
48, 158, 165, 96, 123, 106, 110, 110, 123, 123,
98, 165, 123, 16, 27, 150, 152, 154, 163, 123,
154, 155, 165, 57, 80, 55, 123, 61, 145, 123,
123, 123, 57, 5, 147, 140, 140, 21, 22, 117,
55, 27, 28, 163, 55, 140, 27, 163, 17, 123,
12, 132, 52, 123, 9, 148, 123, 165, 123, 153,
123, 152, 154, 155, 123, 123, 6, 149, 110, 152,
150, 151, 27, 140, 123, 55, 123, 61, 140, 140,
55, 123, 152, 123, 150, 152, 140, 140
};
/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */
static const yytype_uint8 yyr1[] =
{
0, 74, 75, 75, 76, 76, 76, 77, 78, 77,
79, 80, 81, 81, 81, 81, 81, 81, 82, 82,
83, 83, 83, 83, 83, 83, 83, 83, 83, 83,
83, 84, 84, 84, 85, 85, 85, 86, 86, 87,
88, 89, 89, 90, 91, 93, 92, 94, 94, 94,
94, 94, 94, 95, 95, 96, 97, 97, 97, 98,
98, 100, 99, 102, 101, 104, 103, 105, 105, 106,
107, 107, 107, 107, 108, 108, 109, 110, 110, 111,
112, 113, 113, 114, 115, 115, 116, 117, 117, 119,
118, 120, 120, 120, 122, 121, 121, 123, 123, 123,
123, 123, 123, 124, 124, 126, 125, 127, 125, 128,
128, 128, 129, 129, 129, 129, 129, 129, 129, 129,
129, 129, 129, 129, 129, 129, 129, 129, 129, 129,
129, 129, 129, 129, 129, 129, 129, 129, 130, 130,
131, 131, 132, 133, 132, 134, 134, 135, 135, 137,
136, 138, 138, 139, 139, 140, 140, 142, 141, 143,
143, 144, 144, 145, 145, 145, 145, 146, 146, 147,
147, 148, 148, 148, 149, 149, 150, 150, 150, 150,
151, 151, 152, 153, 152, 152, 152, 154, 154, 154,
155, 155, 156, 156, 156, 156, 156, 157, 156, 156,
156, 156, 158, 156, 159, 159, 160, 160, 161, 161,
161, 161, 161, 162, 162, 162, 163, 164, 164, 165
};
/* 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, 2, 2, 6, 8, 10, 9, 11, 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, 3, 3,
4, 4, 4, 4, 4, 4, 4, 4, 5, 4,
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 369 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeValueString((yyvsp[0].strval).value, (yyvsp[0].strval).length);
}
#line 2097 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 3:
#line 372 "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 2110 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 4:
#line 383 "Aql/grammar.y" /* yacc.c:1646 */
{
auto node = static_cast<AstNode*>(parser->peekStack());
node->addMember((yyvsp[0].node));
}
#line 2119 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 5:
#line 387 "Aql/grammar.y" /* yacc.c:1646 */
{
auto node = static_cast<AstNode*>(parser->peekStack());
node->addMember((yyvsp[0].node));
}
#line 2128 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 6:
#line 391 "Aql/grammar.y" /* yacc.c:1646 */
{
auto node = static_cast<AstNode*>(parser->peekStack());
node->addMember((yyvsp[0].node));
}
#line 2137 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 7:
#line 398 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2144 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 8:
#line 400 "Aql/grammar.y" /* yacc.c:1646 */
{
auto node = parser->ast()->createNodeArray();
parser->pushStack(node);
}
#line 2153 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 9:
#line 403 "Aql/grammar.y" /* yacc.c:1646 */
{
auto node = static_cast<AstNode*>(parser->popStack());
auto withNode = parser->ast()->createNodeWithCollections(node);
parser->ast()->addOperation(withNode);
}
#line 2163 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 10:
#line 411 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2170 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 11:
#line 416 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2177 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 12:
#line 421 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2184 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 13:
#line 423 "Aql/grammar.y" /* yacc.c:1646 */
{
parser->ast()->scopes()->endNested();
}
#line 2192 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 14:
#line 426 "Aql/grammar.y" /* yacc.c:1646 */
{
parser->ast()->scopes()->endNested();
}
#line 2200 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 15:
#line 429 "Aql/grammar.y" /* yacc.c:1646 */
{
parser->ast()->scopes()->endNested();
}
#line 2208 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 16:
#line 432 "Aql/grammar.y" /* yacc.c:1646 */
{
parser->ast()->scopes()->endNested();
}
#line 2216 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 17:
#line 435 "Aql/grammar.y" /* yacc.c:1646 */
{
parser->ast()->scopes()->endNested();
}
#line 2224 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 18:
#line 441 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2231 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 19:
#line 443 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2238 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 20:
#line 448 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2245 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 21:
#line 450 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2252 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 22:
#line 452 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2259 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 23:
#line 454 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2266 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 24:
#line 456 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2273 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 25:
#line 458 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2280 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 26:
#line 460 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2287 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 27:
#line 462 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2294 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 28:
#line 464 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2301 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 29:
#line 466 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2308 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 30:
#line 468 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2315 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 31:
#line 473 "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 2326 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 32:
#line 479 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2333 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 33:
#line 481 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2340 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 34:
#line 486 "Aql/grammar.y" /* yacc.c:1646 */
{
parser->ast()->scopes()->start(arangodb::aql::AQL_SCOPE_FOR);
auto node = parser->ast()->createNodeTraversal((yyvsp[-5].strval).value, (yyvsp[-5].strval).length, (yyvsp[-3].node), (yyvsp[-2].node), (yyvsp[-1].node), (yyvsp[0].node));
parser->ast()->addOperation(node);
}
#line 2350 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 35:
#line 491 "Aql/grammar.y" /* yacc.c:1646 */
{
parser->ast()->scopes()->start(arangodb::aql::AQL_SCOPE_FOR);
auto node = parser->ast()->createNodeTraversal((yyvsp[-7].strval).value, (yyvsp[-7].strval).length, (yyvsp[-5].strval).value, (yyvsp[-5].strval).length, (yyvsp[-3].node), (yyvsp[-2].node), (yyvsp[-1].node), (yyvsp[0].node));
parser->ast()->addOperation(node);
}
#line 2360 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 36:
#line 496 "Aql/grammar.y" /* yacc.c:1646 */
{
parser->ast()->scopes()->start(arangodb::aql::AQL_SCOPE_FOR);
auto node = parser->ast()->createNodeTraversal((yyvsp[-9].strval).value, (yyvsp[-9].strval).length, (yyvsp[-7].strval).value, (yyvsp[-7].strval).length, (yyvsp[-5].strval).value, (yyvsp[-5].strval).length, (yyvsp[-3].node), (yyvsp[-2].node), (yyvsp[-1].node), (yyvsp[0].node));
parser->ast()->addOperation(node);
}
#line 2370 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 37:
#line 504 "Aql/grammar.y" /* yacc.c:1646 */
{
if (!TRI_CaseEqualString((yyvsp[-3].strval).value, "TO")) {
parser->registerParseError(TRI_ERROR_QUERY_PARSE, "unexpected qualifier '%s', expecting 'TO'", (yyvsp[-3].strval).value, yylloc.first_line, yylloc.first_column);
}
parser->ast()->scopes()->start(arangodb::aql::AQL_SCOPE_FOR);
auto node = parser->ast()->createNodeShortestPath((yyvsp[-8].strval).value, (yyvsp[-8].strval).length, (yyvsp[-6].intval), (yyvsp[-4].node), (yyvsp[-2].node), (yyvsp[-1].node), (yyvsp[0].node));
parser->ast()->addOperation(node);
}
#line 2383 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 38:
#line 512 "Aql/grammar.y" /* yacc.c:1646 */
{
if (!TRI_CaseEqualString((yyvsp[-3].strval).value, "TO")) {
parser->registerParseError(TRI_ERROR_QUERY_PARSE, "unexpected qualifier '%s', expecting 'TO'", (yyvsp[-3].strval).value, yylloc.first_line, yylloc.first_column);
}
parser->ast()->scopes()->start(arangodb::aql::AQL_SCOPE_FOR);
auto node = parser->ast()->createNodeShortestPath((yyvsp[-10].strval).value, (yyvsp[-10].strval).length, (yyvsp[-8].strval).value, (yyvsp[-8].strval).length, (yyvsp[-6].intval), (yyvsp[-4].node), (yyvsp[-2].node), (yyvsp[-1].node), (yyvsp[0].node));
parser->ast()->addOperation(node);
}
#line 2396 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 39:
#line 523 "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 2406 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 40:
#line 531 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2413 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 41:
#line 536 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2420 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 42:
#line 538 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2427 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 43:
#line 543 "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 2436 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 44:
#line 550 "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 2448 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 45:
#line 560 "Aql/grammar.y" /* yacc.c:1646 */
{
auto node = parser->ast()->createNodeArray();
parser->pushStack(node);
}
#line 2457 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 46:
#line 563 "Aql/grammar.y" /* yacc.c:1646 */
{
auto list = static_cast<AstNode*>(parser->popStack());
if (list == nullptr) {
ABORT_OOM
}
(yyval.node) = list;
}
#line 2470 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 47:
#line 574 "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 2484 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 48:
#line 583 "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 2500 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 49:
#line 594 "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 2535 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 50:
#line 624 "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 2607 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 51:
#line 691 "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 2637 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 52:
#line 716 "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 2672 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 53:
#line 749 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2679 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 54:
#line 751 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2686 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 55:
#line 756 "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 2695 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 56:
#line 763 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = nullptr;
}
#line 2703 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 57:
#line 766 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeValueString((yyvsp[0].strval).value, (yyvsp[0].strval).length);
}
#line 2711 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 58:
#line 769 "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 2722 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 59:
#line 778 "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 2741 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 60:
#line 792 "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 2760 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 61:
#line 809 "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 2773 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 62:
#line 816 "Aql/grammar.y" /* yacc.c:1646 */
{
auto list = static_cast<AstNode*>(parser->popStack());
(yyval.node) = list;
}
#line 2782 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 63:
#line 823 "Aql/grammar.y" /* yacc.c:1646 */
{
auto node = parser->ast()->createNodeArray();
parser->pushStack(node);
}
#line 2791 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 64:
#line 826 "Aql/grammar.y" /* yacc.c:1646 */
{
auto list = static_cast<AstNode*>(parser->popStack());
(yyval.node) = list;
}
#line 2800 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 65:
#line 833 "Aql/grammar.y" /* yacc.c:1646 */
{
auto node = parser->ast()->createNodeArray();
parser->pushStack(node);
}
#line 2809 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 66:
#line 836 "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 2819 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 67:
#line 844 "Aql/grammar.y" /* yacc.c:1646 */
{
parser->pushArrayElement((yyvsp[0].node));
}
#line 2827 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 68:
#line 847 "Aql/grammar.y" /* yacc.c:1646 */
{
parser->pushArrayElement((yyvsp[0].node));
}
#line 2835 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 69:
#line 853 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeSortElement((yyvsp[-1].node), (yyvsp[0].node));
}
#line 2843 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 70:
#line 859 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeValueBool(true);
}
#line 2851 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 71:
#line 862 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeValueBool(true);
}
#line 2859 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 72:
#line 865 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeValueBool(false);
}
#line 2867 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 73:
#line 868 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 2875 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 74:
#line 874 "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 2885 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 75:
#line 879 "Aql/grammar.y" /* yacc.c:1646 */
{
auto node = parser->ast()->createNodeLimit((yyvsp[-2].node), (yyvsp[0].node));
parser->ast()->addOperation(node);
}
#line 2894 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 76:
#line 886 "Aql/grammar.y" /* yacc.c:1646 */
{
auto node = parser->ast()->createNodeReturn((yyvsp[0].node));
parser->ast()->addOperation(node);
parser->ast()->scopes()->endNested();
}
#line 2904 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 77:
#line 894 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 2912 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 78:
#line 897 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 2920 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 79:
#line 903 "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 2932 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 80:
#line 913 "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 2944 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 81:
#line 923 "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 2957 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 82:
#line 931 "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 2970 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 83:
#line 942 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 2977 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 84:
#line 947 "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 2990 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 85:
#line 955 "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 3003 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 86:
#line 966 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 3010 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 87:
#line 971 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.intval) = static_cast<int64_t>(NODE_TYPE_UPDATE);
}
#line 3018 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 88:
#line 974 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.intval) = static_cast<int64_t>(NODE_TYPE_REPLACE);
}
#line 3026 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 89:
#line 980 "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 3036 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 90:
#line 984 "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 3085 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 91:
#line 1031 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeQuantifier(Quantifier::ALL);
}
#line 3093 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 92:
#line 1034 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeQuantifier(Quantifier::ANY);
}
#line 3101 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 93:
#line 1037 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeQuantifier(Quantifier::NONE);
}
#line 3109 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 94:
#line 1043 "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 3122 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 95:
#line 1050 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeDistinct((yyvsp[0].node));
}
#line 3130 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 96:
#line 1053 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 3138 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 97:
#line 1059 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 3146 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 98:
#line 1062 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 3154 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 99:
#line 1065 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 3162 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 100:
#line 1068 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 3170 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 101:
#line 1071 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 3178 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 102:
#line 1074 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeRange((yyvsp[-2].node), (yyvsp[0].node));
}
#line 3186 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 103:
#line 1080 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.strval) = (yyvsp[0].strval);
}
#line 3194 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 104:
#line 1083 "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 3212 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 105:
#line 1099 "Aql/grammar.y" /* yacc.c:1646 */
{
parser->pushStack((yyvsp[-1].strval).value);
auto node = parser->ast()->createNodeArray();
parser->pushStack(node);
}
#line 3223 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 106:
#line 1104 "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 3232 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 107:
#line 1108 "Aql/grammar.y" /* yacc.c:1646 */
{
auto node = parser->ast()->createNodeArray();
parser->pushStack(node);
}
#line 3241 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 108:
#line 1111 "Aql/grammar.y" /* yacc.c:1646 */
{
auto list = static_cast<AstNode const*>(parser->popStack());
(yyval.node) = parser->ast()->createNodeFunctionCall(TRI_CHAR_LENGTH_PAIR("LIKE"), list);
}
#line 3250 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 109:
#line 1118 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeUnaryOperator(NODE_TYPE_OPERATOR_UNARY_PLUS, (yyvsp[0].node));
}
#line 3258 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 110:
#line 1121 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeUnaryOperator(NODE_TYPE_OPERATOR_UNARY_MINUS, (yyvsp[0].node));
}
#line 3266 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 111:
#line 1124 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeUnaryOperator(NODE_TYPE_OPERATOR_UNARY_NOT, (yyvsp[0].node));
}
#line 3274 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 112:
#line 1130 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_OR, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3282 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 113:
#line 1133 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_AND, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3290 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 114:
#line 1136 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_PLUS, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3298 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 115:
#line 1139 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_MINUS, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3306 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 116:
#line 1142 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_TIMES, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3314 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 117:
#line 1145 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_DIV, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3322 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 118:
#line 1148 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_MOD, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3330 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 119:
#line 1151 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_EQ, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3338 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 120:
#line 1154 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_NE, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3346 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 121:
#line 1157 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_LT, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3354 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 122:
#line 1160 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_GT, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3362 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 123:
#line 1163 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_LE, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3370 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 124:
#line 1166 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_GE, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3378 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 125:
#line 1169 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_IN, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3386 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 126:
#line 1172 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_NIN, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3394 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 127:
#line 1175 "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(TRI_CHAR_LENGTH_PAIR("LIKE"), arguments);
}
#line 3405 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 128:
#line 1181 "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(TRI_CHAR_LENGTH_PAIR("REGEX_TEST"), arguments);
}
#line 3416 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 129:
#line 1187 "Aql/grammar.y" /* yacc.c:1646 */
{
AstNode* arguments = parser->ast()->createNodeArray(2);
arguments->addMember((yyvsp[-2].node));
arguments->addMember((yyvsp[0].node));
AstNode* node = parser->ast()->createNodeFunctionCall(TRI_CHAR_LENGTH_PAIR("REGEX_TEST"), arguments);
(yyval.node) = parser->ast()->createNodeUnaryOperator(NODE_TYPE_OPERATOR_UNARY_NOT, node);
}
#line 3428 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 130:
#line 1194 "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 3436 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 131:
#line 1197 "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 3444 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 132:
#line 1200 "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 3452 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 133:
#line 1203 "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 3460 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 134:
#line 1206 "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 3468 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 135:
#line 1209 "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 3476 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 136:
#line 1212 "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 3484 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 137:
#line 1215 "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 3492 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 138:
#line 1221 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeTernaryOperator((yyvsp[-4].node), (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3500 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 139:
#line 1224 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeTernaryOperator((yyvsp[-3].node), (yyvsp[-3].node), (yyvsp[0].node));
}
#line 3508 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 140:
#line 1230 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 3515 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 141:
#line 1232 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 3522 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 142:
#line 1237 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 3530 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 143:
#line 1240 "Aql/grammar.y" /* yacc.c:1646 */
{
parser->ast()->scopes()->start(arangodb::aql::AQL_SCOPE_SUBQUERY);
parser->ast()->startSubQuery();
}
#line 3539 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 144:
#line 1243 "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 3554 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 145:
#line 1256 "Aql/grammar.y" /* yacc.c:1646 */
{
parser->pushArrayElement((yyvsp[0].node));
}
#line 3562 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 146:
#line 1259 "Aql/grammar.y" /* yacc.c:1646 */
{
parser->pushArrayElement((yyvsp[0].node));
}
#line 3570 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 147:
#line 1265 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 3578 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 148:
#line 1268 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 3586 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 149:
#line 1274 "Aql/grammar.y" /* yacc.c:1646 */
{
auto node = parser->ast()->createNodeArray();
parser->pushStack(node);
}
#line 3595 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 150:
#line 1277 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = static_cast<AstNode*>(parser->popStack());
}
#line 3603 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 151:
#line 1283 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 3610 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 152:
#line 1285 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 3617 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 153:
#line 1290 "Aql/grammar.y" /* yacc.c:1646 */
{
parser->pushArrayElement((yyvsp[0].node));
}
#line 3625 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 154:
#line 1293 "Aql/grammar.y" /* yacc.c:1646 */
{
parser->pushArrayElement((yyvsp[0].node));
}
#line 3633 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 155:
#line 1299 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = nullptr;
}
#line 3641 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 156:
#line 1302 "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 3657 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 157:
#line 1316 "Aql/grammar.y" /* yacc.c:1646 */
{
auto node = parser->ast()->createNodeObject();
parser->pushStack(node);
}
#line 3666 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 158:
#line 1319 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = static_cast<AstNode*>(parser->popStack());
}
#line 3674 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 159:
#line 1325 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 3681 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 160:
#line 1327 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 3688 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 161:
#line 1332 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 3695 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 162:
#line 1334 "Aql/grammar.y" /* yacc.c:1646 */
{
}
#line 3702 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 163:
#line 1339 "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 3721 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 164:
#line 1353 "Aql/grammar.y" /* yacc.c:1646 */
{
// attribute-name : attribute-value
parser->pushObjectElement((yyvsp[-2].strval).value, (yyvsp[-2].strval).length, (yyvsp[0].node));
}
#line 3730 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 165:
#line 1357 "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 3744 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 166:
#line 1366 "Aql/grammar.y" /* yacc.c:1646 */
{
// [ attribute-name-expression ] : attribute-value
parser->pushObjectElement((yyvsp[-3].node), (yyvsp[0].node));
}
#line 3753 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 167:
#line 1373 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.intval) = 1;
}
#line 3761 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 168:
#line 1376 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.intval) = (yyvsp[-1].intval) + 1;
}
#line 3769 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 169:
#line 1382 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = nullptr;
}
#line 3777 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 170:
#line 1385 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 3785 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 171:
#line 1391 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = nullptr;
}
#line 3793 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 172:
#line 1394 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeArrayLimit(nullptr, (yyvsp[0].node));
}
#line 3801 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 173:
#line 1397 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeArrayLimit((yyvsp[-2].node), (yyvsp[0].node));
}
#line 3809 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 174:
#line 1403 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = nullptr;
}
#line 3817 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 175:
#line 1406 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 3825 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 176:
#line 1412 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeValueString((yyvsp[0].strval).value, (yyvsp[0].strval).length);
}
#line 3833 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 177:
#line 1415 "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 3846 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 178:
#line 1423 "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 3855 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 179:
#line 1427 "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 3868 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 180:
#line 1438 "Aql/grammar.y" /* yacc.c:1646 */
{
auto node = static_cast<AstNode*>(parser->peekStack());
node->addMember((yyvsp[0].node));
}
#line 3877 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 181:
#line 1442 "Aql/grammar.y" /* yacc.c:1646 */
{
auto node = static_cast<AstNode*>(parser->peekStack());
node->addMember((yyvsp[0].node));
}
#line 3886 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 182:
#line 1449 "Aql/grammar.y" /* yacc.c:1646 */
{
auto node = parser->ast()->createNodeArray();
node->addMember((yyvsp[0].node));
(yyval.node) = parser->ast()->createNodeCollectionList(node);
}
#line 3896 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 183:
#line 1454 "Aql/grammar.y" /* yacc.c:1646 */
{
auto node = parser->ast()->createNodeArray();
parser->pushStack(node);
node->addMember((yyvsp[-1].node));
}
#line 3906 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 184:
#line 1458 "Aql/grammar.y" /* yacc.c:1646 */
{
auto node = static_cast<AstNode*>(parser->popStack());
(yyval.node) = parser->ast()->createNodeCollectionList(node);
}
#line 3915 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 185:
#line 1462 "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 3929 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 186:
#line 1471 "Aql/grammar.y" /* yacc.c:1646 */
{
// graph name
(yyval.node) = parser->ast()->createNodeValueString((yyvsp[0].strval).value, (yyvsp[0].strval).length);
}
#line 3938 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 187:
#line 1480 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.intval) = 2;
}
#line 3946 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 188:
#line 1483 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.intval) = 1;
}
#line 3954 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 189:
#line 1486 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.intval) = 0;
}
#line 3962 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 190:
#line 1492 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeDirection((yyvsp[0].intval), 1);
}
#line 3970 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 191:
#line 1495 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeDirection((yyvsp[0].intval), (yyvsp[-1].node));
}
#line 3978 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 192:
#line 1501 "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, arangodb::AccessMode::Type::READ);
}
TRI_ASSERT(node != nullptr);
(yyval.node) = node;
}
#line 4015 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 193:
#line 1533 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 4023 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 194:
#line 1536 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 4031 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 195:
#line 1539 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
if ((yyval.node) == nullptr) {
ABORT_OOM
}
}
#line 4043 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 196:
#line 1546 "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 4058 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 197:
#line 1556 "Aql/grammar.y" /* yacc.c:1646 */
{
parser->ast()->scopes()->start(arangodb::aql::AQL_SCOPE_SUBQUERY);
parser->ast()->startSubQuery();
}
#line 4067 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 198:
#line 1559 "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 4082 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 199:
#line 1569 "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 4102 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 200:
#line 1584 "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 4121 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 201:
#line 1598 "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 4140 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 202:
#line 1612 "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 4168 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 203:
#line 1634 "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 4191 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 204:
#line 1655 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 4199 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 205:
#line 1658 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 4207 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 206:
#line 1664 "Aql/grammar.y" /* yacc.c:1646 */
{
if ((yyvsp[0].node) == nullptr) {
ABORT_OOM
}
(yyval.node) = (yyvsp[0].node);
}
#line 4219 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 207:
#line 1671 "Aql/grammar.y" /* yacc.c:1646 */
{
if ((yyvsp[0].node) == nullptr) {
ABORT_OOM
}
(yyval.node) = (yyvsp[0].node);
}
#line 4231 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 208:
#line 1681 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeValueString((yyvsp[0].strval).value, (yyvsp[0].strval).length);
}
#line 4239 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 209:
#line 1684 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 4247 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 210:
#line 1687 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeValueNull();
}
#line 4255 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 211:
#line 1690 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeValueBool(true);
}
#line 4263 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 212:
#line 1693 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeValueBool(false);
}
#line 4271 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 213:
#line 1699 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeCollection((yyvsp[0].strval).value, arangodb::AccessMode::Type::WRITE);
}
#line 4279 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 214:
#line 1702 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeCollection((yyvsp[0].strval).value, arangodb::AccessMode::Type::WRITE);
}
#line 4287 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 215:
#line 1705 "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 4299 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 216:
#line 1715 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.node) = parser->ast()->createNodeParameter((yyvsp[0].strval).value, (yyvsp[0].strval).length);
}
#line 4307 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 217:
#line 1721 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.strval) = (yyvsp[0].strval);
}
#line 4315 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 218:
#line 1724 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.strval) = (yyvsp[0].strval);
}
#line 4323 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
case 219:
#line 1729 "Aql/grammar.y" /* yacc.c:1646 */
{
(yyval.strval) = (yyvsp[0].strval);
}
#line 4331 "Aql/grammar.cpp" /* yacc.c:1646 */
break;
#line 4335 "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