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

4562 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/AstNode.h"
#include "Aql/CollectNode.h"
#include "Aql/Function.h"
#include "Aql/Parser.h"
#include "Aql/Quantifier.h"
#include "Basics/conversions.h"
#include "Basics/tri-strings.h"
#line 82 "Aql/grammar.cpp" /* yacc.c:339 */
# ifndef YY_NULLPTR
# if defined __cplusplus && 201103L <= __cplusplus
# define YY_NULLPTR nullptr
# else
# define YY_NULLPTR 0
# endif
# endif
/* Enabling verbose error messages. */
#ifdef YYERROR_VERBOSE
# undef YYERROR_VERBOSE
# define YYERROR_VERBOSE 1
#else
# define YYERROR_VERBOSE 1
#endif
/* In a future release of Bison, this section will be replaced
by #include "grammar.hpp". */
#ifndef YY_AQL_AQL_GRAMMAR_HPP_INCLUDED
# define YY_AQL_AQL_GRAMMAR_HPP_INCLUDED
/* Debug traces. */
#ifndef YYDEBUG
# define YYDEBUG 0
#endif
#if YYDEBUG
extern int Aqldebug;
#endif
/* Token type. */
#ifndef YYTOKENTYPE
# define YYTOKENTYPE
enum yytokentype
{
T_END = 0,
T_FOR = 258,
T_LET = 259,
T_FILTER = 260,
T_RETURN = 261,
T_COLLECT = 262,
T_SORT = 263,
T_LIMIT = 264,
T_ASC = 265,
T_DESC = 266,
T_IN = 267,
T_WITH = 268,
T_INTO = 269,
T_AGGREGATE = 270,
T_GRAPH = 271,
T_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 19 "Aql/grammar.y" /* yacc.c:355 */
arangodb::aql::AstNode* node;
struct {
char* value;
size_t length;
} strval;
bool boolval;
int64_t intval;
#line 206 "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 29 "Aql/grammar.y" /* yacc.c:358 */
using namespace arangodb::aql;
////////////////////////////////////////////////////////////////////////////////
/// @brief shortcut macro for signaling out of memory
////////////////////////////////////////////////////////////////////////////////
#define ABORT_OOM \
parser->registerError(TRI_ERROR_OUT_OF_MEMORY); \
YYABORT;
#define scanner parser->scanner()
////////////////////////////////////////////////////////////////////////////////
/// @brief forward for lexer function defined in Aql/tokens.ll
////////////////////////////////////////////////////////////////////////////////
int Aqllex (YYSTYPE*,
YYLTYPE*,
void*);
////////////////////////////////////////////////////////////////////////////////
/// @brief register parse error
////////////////////////////////////////////////////////////////////////////////
void Aqlerror (YYLTYPE* locp,
arangodb::aql::Parser* parser,
char const* message) {
parser->registerParseError(TRI_ERROR_QUERY_PARSE, message, locp->first_line, locp->first_column);
}
////////////////////////////////////////////////////////////////////////////////
/// @brief check if any of the variables used in the INTO expression were
/// introduced by the COLLECT itself, in which case it would fail
////////////////////////////////////////////////////////////////////////////////
static Variable const* CheckIntoVariables(AstNode const* collectVars,
std::unordered_set<Variable const*> const& vars) {
if (collectVars == nullptr || collectVars->type != NODE_TYPE_ARRAY) {
return nullptr;
}
size_t const n = collectVars->numMembers();
for (size_t i = 0; i < n; ++i) {
auto member = collectVars->getMember(i);
if (member != nullptr) {
TRI_ASSERT(member->type == NODE_TYPE_ASSIGN);
auto v = static_cast<Variable*>(member->getMember(0)->getData());
if (vars.find(v) != vars.end()) {
return v;
}
}
}
return nullptr;
}
////////////////////////////////////////////////////////////////////////////////
/// @brief register variables in the scope
////////////////////////////////////////////////////////////////////////////////
static void RegisterAssignVariables(arangodb::aql::Scopes* scopes, AstNode const* vars) {
size_t const n = vars->numMembers();
for (size_t i = 0; i < n; ++i) {
auto member = vars->getMember(i);
if (member != nullptr) {
TRI_ASSERT(member->type == NODE_TYPE_ASSIGN);
auto v = static_cast<Variable*>(member->getMember(0)->getData());
scopes->addVariable(v);
}
}
}
////////////////////////////////////////////////////////////////////////////////
/// @brief validate the aggregate variables expressions
////////////////////////////////////////////////////////////////////////////////
static bool ValidateAggregates(Parser* parser, AstNode const* aggregates) {
size_t const n = aggregates->numMembers();
for (size_t i = 0; i < n; ++i) {
auto member = aggregates->getMember(i);
if (member != nullptr) {
TRI_ASSERT(member->type == NODE_TYPE_ASSIGN);
auto func = member->getMember(1);
bool isValid = true;
if (func->type != NODE_TYPE_FCALL) {
// aggregate expression must be a function call
isValid = false;
}
else {
auto f = static_cast<arangodb::aql::Function*>(func->getData());
if (! Aggregator::isSupported(f->externalName)) {
// aggregate expression must be a call to MIN|MAX|LENGTH...
isValid = false;
}
}
if (! isValid) {
parser->registerError(TRI_ERROR_QUERY_INVALID_AGGREGATE_EXPRESSION);
return false;
}
}
}
return true;
}
////////////////////////////////////////////////////////////////////////////////
/// @brief start a new scope for the collect
////////////////////////////////////////////////////////////////////////////////
static bool StartCollectScope(arangodb::aql::Scopes* scopes) {
// check if we are in the main scope
if (scopes->type() == arangodb::aql::AQL_SCOPE_MAIN) {
return false;
}
// end the active scopes
scopes->endNested();
// start a new scope
scopes->start(arangodb::aql::AQL_SCOPE_COLLECT);
return true;
}
////////////////////////////////////////////////////////////////////////////////
/// @brief get the INTO variable stored in a node (may not exist)
////////////////////////////////////////////////////////////////////////////////
static AstNode const* GetIntoVariable(Parser* parser, AstNode const* node) {
if (node == nullptr) {
return nullptr;
}
if (node->type == NODE_TYPE_VALUE) {
// node is a string containing the variable name
return parser->ast()->createNodeVariable(node->getStringValue(), node->getStringLength(), true);
}
// node is an array with the variable name as the first member
TRI_ASSERT(node->type == NODE_TYPE_ARRAY);
TRI_ASSERT(node->numMembers() == 2);
auto v = node->getMember(0);
TRI_ASSERT(v->type == NODE_TYPE_VALUE);
return parser->ast()->createNodeVariable(v->getStringValue(), v->getStringLength(), true);
}
////////////////////////////////////////////////////////////////////////////////
/// @brief get the INTO variable = expression stored in a node (may not exist)
////////////////////////////////////////////////////////////////////////////////
static AstNode const* GetIntoExpression(AstNode const* node) {
if (node == nullptr || node->type == NODE_TYPE_VALUE) {
return nullptr;
}
// node is an array with the expression as the second member
TRI_ASSERT(node->type == NODE_TYPE_ARRAY);
TRI_ASSERT(node->numMembers() == 2);
return node->getMember(1);
}
#line 406 "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 1363
/* YYNTOKENS -- Number of terminals. */
#define YYNTOKENS 74
/* YYNNTS -- Number of nonterminals. */
#define YYNNTS 92
/* YYNRULES -- Number of rules. */
#define YYNRULES 218
/* YYNSTATES -- Number of states. */
#define YYNSTATES 376
/* 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, 368, 368, 371, 382, 386, 390, 397, 399, 399,
410, 415, 420, 422, 425, 428, 431, 434, 440, 442,
447, 449, 451, 453, 455, 457, 459, 461, 463, 465,
467, 472, 478, 480, 485, 490, 495, 503, 511, 522,
530, 535, 537, 542, 549, 559, 559, 573, 582, 593,
623, 690, 715, 748, 750, 755, 762, 765, 768, 777,
791, 808, 808, 822, 822, 832, 832, 843, 846, 852,
858, 861, 864, 867, 873, 878, 885, 893, 896, 902,
912, 922, 930, 941, 946, 954, 965, 970, 973, 979,
979, 1030, 1033, 1036, 1042, 1042, 1052, 1058, 1061, 1064,
1067, 1070, 1073, 1079, 1082, 1098, 1098, 1107, 1107, 1117,
1120, 1123, 1129, 1132, 1135, 1138, 1141, 1144, 1147, 1150,
1153, 1156, 1159, 1162, 1165, 1168, 1171, 1174, 1180, 1186,
1193, 1196, 1199, 1202, 1205, 1208, 1211, 1214, 1220, 1226,
1228, 1233, 1236, 1236, 1252, 1255, 1261, 1264, 1270, 1270,
1279, 1281, 1286, 1289, 1295, 1298, 1312, 1312, 1321, 1323,
1328, 1330, 1335, 1349, 1353, 1362, 1369, 1372, 1378, 1381,
1387, 1390, 1393, 1399, 1402, 1408, 1411, 1419, 1423, 1434,
1438, 1445, 1450, 1450, 1458, 1467, 1476, 1479, 1482, 1488,
1491, 1497, 1529, 1532, 1535, 1542, 1552, 1552, 1565, 1580,
1594, 1608, 1608, 1651, 1654, 1660, 1667, 1677, 1680, 1683,
1686, 1689, 1695, 1698, 1701, 1711, 1717, 1720, 1725
};
#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 -340
#define yypact_value_is_default(Yystate) \
(!!((Yystate) == (-340)))
#define YYTABLE_NINF -217
#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[] =
{
-1, -340, -340, 16, 8, -340, 267, -340, -340, -340,
-340, 73, -340, 15, 15, 1279, 96, 125, -340, 306,
1279, 1279, 1279, 1279, -340, -340, -340, -340, -340, -340,
144, -340, -340, -340, -340, 19, 20, 23, 30, 56,
8, -340, -340, -340, -340, -3, 2, -340, 49, -340,
-340, -340, -42, -340, -340, -340, 1279, 13, 1279, 1279,
1279, -340, -340, 1059, 59, -340, -340, -340, -340, -340,
-340, -340, -22, -340, -340, -340, -340, -340, 1059, 61,
-340, 66, 15, 91, 1279, 76, -340, -340, 698, 698,
-340, 528, -340, 571, 1279, 15, 66, 118, 91, -340,
1181, 15, 15, 1279, -340, -340, -340, -340, 738, -340,
-10, 1279, 1279, 1279, 1279, 1279, 1279, 1279, 1279, 1279,
1279, 1279, 1279, 1279, 1279, 1279, 1279, 1279, 1279, 1279,
1279, 1279, -340, -340, -340, 355, 119, -340, 1205, 10,
1279, 135, 15, 93, -340, 100, -340, 128, 66, 134,
-340, 445, 306, 1303, 27, 66, 66, 1279, 66, 1279,
66, 778, 160, -340, 93, 66, -340, 66, -340, -340,
-340, 611, 184, 1279, -2, -340, 1059, 1242, -340, 145,
152, -340, 153, 1279, 147, 161, -340, 156, 1059, 168,
162, 178, 1138, 1099, 178, 303, 303, 303, 303, 206,
206, 206, 206, 303, 137, 137, -340, -340, -340, 818,
326, 1279, 1279, 1279, 1279, 1279, 1279, 1279, 1279, -340,
1242, -340, 859, 186, -340, -340, 1059, 15, 100, -340,
15, 1279, -340, 1279, -340, -340, -340, -340, -340, 191,
40, 411, -340, -340, -340, -340, -340, -340, -340, 698,
-340, 698, -340, 1279, 1279, 15, -340, -340, 400, -340,
1279, 485, 1181, 15, 1059, 179, -340, -340, 180, -340,
1279, 899, -340, -10, 1279, -340, 1279, 1279, 178, 178,
303, 303, 206, 206, 206, 206, 182, -340, -340, 232,
-340, -340, 1059, -340, 66, 66, 657, 1059, 187, -340,
939, 102, -340, 190, 66, 37, -340, 611, 224, 1279,
237, -340, -340, 1279, 1059, 198, -340, 1059, 1059, 1059,
-340, 1279, 249, -340, -340, -340, -340, 1279, 15, 1279,
-340, -340, -340, -340, -340, -340, 1279, 485, 1181, -340,
1279, 1059, 1279, 253, 698, -340, 485, 55, 979, 66,
-340, 1279, 1059, 1019, 1279, 217, 66, 66, -340, 225,
1279, -340, 485, 1279, 1059, -340, -340, -340, 55, 485,
66, 1059, -340, 66, -340, -340
};
/* 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, 215,
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, 218, 32, 33, 0, 40, 41, 0, 209,
210, 211, 191, 207, 205, 206, 0, 0, 0, 0,
196, 156, 148, 39, 0, 194, 97, 98, 99, 192,
146, 147, 101, 208, 100, 193, 94, 76, 96, 0,
63, 154, 0, 56, 0, 74, 203, 204, 0, 0,
83, 0, 86, 0, 0, 0, 154, 154, 56, 5,
0, 0, 0, 0, 111, 107, 109, 110, 0, 18,
158, 150, 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, 154, 66,
67, 70, 0, 0, 0, 154, 154, 0, 154, 0,
154, 0, 57, 48, 61, 154, 51, 154, 186, 187,
188, 31, 189, 0, 0, 42, 43, 142, 195, 0,
162, 217, 0, 0, 0, 159, 160, 0, 152, 0,
151, 125, 113, 112, 126, 128, 129, 119, 120, 121,
122, 123, 124, 127, 114, 115, 116, 117, 118, 0,
102, 0, 0, 0, 0, 0, 0, 0, 0, 104,
142, 166, 0, 201, 198, 199, 95, 0, 64, 155,
0, 0, 49, 0, 71, 72, 69, 73, 75, 191,
207, 215, 77, 212, 213, 214, 78, 79, 80, 0,
81, 0, 84, 0, 0, 0, 52, 50, 188, 190,
0, 0, 0, 0, 141, 0, 144, 18, 140, 197,
0, 0, 157, 0, 0, 149, 0, 0, 136, 137,
130, 131, 132, 133, 134, 135, 0, 200, 167, 168,
44, 54, 55, 68, 154, 154, 0, 58, 62, 59,
0, 0, 175, 181, 154, 0, 176, 0, 189, 0,
0, 108, 143, 142, 164, 0, 161, 163, 153, 138,
106, 0, 170, 82, 85, 87, 88, 0, 0, 0,
185, 184, 182, 34, 177, 178, 0, 0, 0, 145,
0, 169, 0, 173, 0, 60, 0, 0, 0, 154,
189, 0, 165, 171, 0, 0, 154, 154, 179, 183,
0, 35, 0, 0, 174, 202, 90, 37, 0, 0,
154, 172, 180, 154, 36, 38
};
/* YYPGOTO[NTERM-NUM]. */
static const yytype_int16 yypgoto[] =
{
-340, -6, -340, -340, -340, -340, -84, -340, -340, -340,
-340, -340, -340, -340, -340, -340, 177, 252, -340, -340,
-340, 142, 64, -70, -340, -340, -340, 261, -340, -340,
-340, -340, 62, -340, -340, -340, -67, -340, -340, -340,
-340, -340, -340, -340, -340, -340, -340, -340, -340, 50,
-340, -340, -340, -340, -340, -340, -340, 78, -17, -340,
-340, -340, -340, -340, -340, -340, -64, -137, -340, -340,
-340, 26, -340, -340, -340, -340, -339, -340, -230, -340,
-69, -259, -340, -340, -340, -53, -340, -15, 146, -4,
-340, -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, 298, 165, 255, 83, 142, 32,
84, 149, 150, 236, 33, 34, 155, 35, 36, 90,
37, 92, 38, 327, 39, 94, 135, 77, 140, 264,
64, 65, 220, 177, 66, 67, 68, 265, 266, 267,
268, 69, 70, 111, 189, 190, 144, 71, 110, 184,
185, 186, 223, 322, 343, 355, 303, 359, 304, 347,
305, 173, 72, 109, 289, 85, 73, 74, 242, 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, 309, 86, 41, 229, 12, 358, 100,
262, -103, 1, 148, -103, 87, 7, 180, 181, -13,
-14, 182, 156, -15, 158, 179, 160, 229, 167, 372,
-16, 172, 163, 166, 99, 8, 12, 224, 138, 9,
-213, 9, 42, -213, -213, -213, -213, -213, -213, -213,
183, 139, 101, 263, 243, 244, -17, 102, 245, -213,
-213, -213, -213, -213, 334, 63, 78, -213, 9, 105,
88, 89, 91, 93, -13, -14, -13, -14, -15, 351,
-15, 103, 302, 162, 232, -16, 9, -16, 141, 174,
48, 247, 248, 143, 250, -213, 252, -213, 237, 238,
8, 256, 259, 257, 9, 95, 104, 349, 106, 107,
108, -17, 136, -17, 76, 137, 357, 168, 169, 170,
49, 50, 51, 52, 53, 54, 55, 9, 40, 56,
330, 152, 370, 9, 151, 225, 86, 86, 79, 373,
80, 57, 58, 59, 161, 164, 219, 87, 87, 227,
171, 61, 60, 176, 61, 230, 62, 79, 95, 80,
231, 188, 191, 192, 193, 194, 195, 196, 197, 198,
199, 200, 201, 202, 203, 204, 205, 206, 207, 208,
209, 210, 294, 312, 295, 127, 128, 129, 222, 233,
226, -212, 254, 308, -212, -212, -212, -212, -212, -212,
-212, 260, 269, 191, -216, 270, 272, 249, 274, 251,
-212, -212, -212, -212, -212, 290, 273, 276, -212, 120,
121, 122, 123, 261, 125, 126, 127, 128, 129, 275,
323, 324, 131, 271, 288, 313, 311, 321, 259, 320,
333, 336, 328, 299, -103, 332, -212, -103, -212, 338,
340, 310, 125, 126, 127, 128, 129, 306, 342, 354,
131, 278, 279, 280, 281, 282, 283, 284, 285, 350,
13, 14, 15, 16, 17, 18, 19, 356, 365, 175,
368, 292, 96, 151, 228, 361, 20, 21, 22, 23,
24, 98, 366, 367, 291, 293, 339, 331, 286, 316,
246, 335, 0, 296, 297, 0, 374, 0, 0, 375,
300, 0, 307, 0, 0, 112, 345, 0, 0, 0,
314, 0, 0, 0, 317, 0, 318, 319, 0, 0,
49, 50, 51, 306, 53, 54, 55, 9, 0, 115,
0, 0, 306, 306, 120, 121, 122, 123, 0, 125,
126, 127, 128, 129, 0, 0, 0, 131, 306, 337,
0, 0, 0, 0, 306, 306, 0, 211, 0, 0,
0, 341, 125, 126, 127, 128, 129, 344, 0, 346,
0, 0, 0, 0, 0, 0, 348, 0, 307, 0,
352, 212, 353, 0, 213, 214, 215, 216, 217, 218,
0, 362, 0, 0, 364, 0, 0, 0, 0, 0,
369, -214, -92, 371, -214, -214, -214, -214, -214, -214,
-214, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-214, -214, -214, -214, -214, 0, -92, 0, -214, -92,
-92, -92, -92, -92, -92, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 234, 235, 112, 0, 0,
0, 0, 0, 0, 0, 0, -214, 0, -214, 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, 301, 0, 0, 0, 0, 0, 0, 0, 132,
133, 134, 302, 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, 258,
133, 134, 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, 0, 131, 153, 159, 154, 0, 0, 0, 0,
0, 0, 132, 133, 134, 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, 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, 0, 0, 131, 0, 0, 0, 112,
0, 0, 0, 168, 169, 258, 133, 134, 325, 326,
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, 253, 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,
277, 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,
287, 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,
315, 0, 0, 132, 133, 134, 329, 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, 360, 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, 363, 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, 0,
0, 0, 131, 0, 0, 0, 0, 0, 0, 0,
0, 0, 132, 133, 134, 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, 52, 53, 54, 55, 9, 60, 56, 61,
0, 62, 0, 168, 169, 170, 0, 0, 0, 0,
57, 58, 59, 221, 0, 0, 0, 0, 0, 0,
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, -139,
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,
239, 240, 54, 55, 241, 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, 262, 19, 11, 143, 11, 347, 12,
12, 53, 13, 83, 56, 19, 0, 27, 28, 0,
0, 31, 89, 0, 91, 109, 93, 164, 98, 368,
0, 100, 96, 97, 40, 27, 40, 27, 60, 31,
0, 31, 27, 3, 4, 5, 6, 7, 8, 9,
60, 73, 55, 55, 27, 28, 0, 55, 31, 19,
20, 21, 22, 23, 27, 15, 16, 27, 31, 56,
20, 21, 22, 23, 55, 55, 57, 57, 55, 338,
57, 32, 27, 95, 148, 55, 31, 57, 27, 101,
102, 155, 156, 27, 158, 55, 160, 57, 151, 152,
27, 165, 171, 167, 31, 14, 56, 337, 58, 59,
60, 55, 53, 57, 18, 56, 346, 62, 63, 64,
24, 25, 26, 27, 28, 29, 30, 31, 55, 33,
28, 55, 362, 31, 84, 139, 151, 152, 13, 369,
15, 45, 46, 47, 94, 27, 27, 151, 152, 14,
100, 58, 56, 103, 58, 55, 60, 13, 14, 15,
32, 111, 112, 113, 114, 115, 116, 117, 118, 119,
120, 121, 122, 123, 124, 125, 126, 127, 128, 129,
130, 131, 249, 267, 251, 48, 49, 50, 138, 55,
140, 0, 32, 262, 3, 4, 5, 6, 7, 8,
9, 17, 57, 153, 52, 52, 59, 157, 52, 159,
19, 20, 21, 22, 23, 227, 55, 55, 27, 41,
42, 43, 44, 173, 46, 47, 48, 49, 50, 61,
294, 295, 54, 183, 48, 55, 57, 5, 307, 57,
304, 17, 55, 255, 53, 55, 55, 56, 57, 12,
52, 263, 46, 47, 48, 49, 50, 261, 9, 6,
54, 211, 212, 213, 214, 215, 216, 217, 218, 338,
3, 4, 5, 6, 7, 8, 9, 344, 61, 102,
55, 231, 30, 233, 142, 349, 19, 20, 21, 22,
23, 30, 356, 357, 230, 233, 313, 301, 220, 273,
154, 305, -1, 253, 254, -1, 370, -1, -1, 373,
260, -1, 262, -1, -1, 12, 328, -1, -1, -1,
270, -1, -1, -1, 274, -1, 276, 277, -1, -1,
24, 25, 26, 337, 28, 29, 30, 31, -1, 36,
-1, -1, 346, 347, 41, 42, 43, 44, -1, 46,
47, 48, 49, 50, -1, -1, -1, 54, 362, 309,
-1, -1, -1, -1, 368, 369, -1, 12, -1, -1,
-1, 321, 46, 47, 48, 49, 50, 327, -1, 329,
-1, -1, -1, -1, -1, -1, 336, -1, 338, -1,
340, 36, 342, -1, 39, 40, 41, 42, 43, 44,
-1, 351, -1, -1, 354, -1, -1, -1, -1, -1,
360, 0, 12, 363, 3, 4, 5, 6, 7, 8,
9, -1, -1, -1, -1, -1, -1, -1, -1, -1,
19, 20, 21, 22, 23, -1, 36, -1, 27, 39,
40, 41, 42, 43, 44, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, 10, 11, 12, -1, -1,
-1, -1, -1, -1, -1, -1, 55, -1, 57, 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, -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, -1, 54, 12, 13, 14, -1, -1, -1, -1,
-1, -1, 64, 65, 66, -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, 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, -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, -1,
-1, -1, 54, -1, -1, -1, -1, -1, -1, -1,
-1, -1, 64, 65, 66, 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, 62, 63, 64, -1, -1, -1, -1,
45, 46, 47, 48, -1, -1, -1, -1, -1, -1,
-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, 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, 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, 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, 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 368 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeValueString((yyvsp[0].strval).value, (yyvsp[0].strval).length);
}
#line 2098 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 3:
#line 371 "Aql/grammar.y" /* yacc.c:1661 */
{
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 2111 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 4:
#line 382 "Aql/grammar.y" /* yacc.c:1661 */
{
auto node = static_cast<AstNode*>(parser->peekStack());
node->addMember((yyvsp[0].node));
}
#line 2120 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 5:
#line 386 "Aql/grammar.y" /* yacc.c:1661 */
{
auto node = static_cast<AstNode*>(parser->peekStack());
node->addMember((yyvsp[0].node));
}
#line 2129 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 6:
#line 390 "Aql/grammar.y" /* yacc.c:1661 */
{
auto node = static_cast<AstNode*>(parser->peekStack());
node->addMember((yyvsp[0].node));
}
#line 2138 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 7:
#line 397 "Aql/grammar.y" /* yacc.c:1661 */
{
}
#line 2145 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 8:
#line 399 "Aql/grammar.y" /* yacc.c:1661 */
{
auto node = parser->ast()->createNodeArray();
parser->pushStack(node);
}
#line 2154 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 9:
#line 402 "Aql/grammar.y" /* yacc.c:1661 */
{
auto node = static_cast<AstNode*>(parser->popStack());
auto withNode = parser->ast()->createNodeWithCollections(node);
parser->ast()->addOperation(withNode);
}
#line 2164 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 10:
#line 410 "Aql/grammar.y" /* yacc.c:1661 */
{
}
#line 2171 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 11:
#line 415 "Aql/grammar.y" /* yacc.c:1661 */
{
}
#line 2178 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 12:
#line 420 "Aql/grammar.y" /* yacc.c:1661 */
{
}
#line 2185 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 13:
#line 422 "Aql/grammar.y" /* yacc.c:1661 */
{
parser->ast()->scopes()->endNested();
}
#line 2193 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 14:
#line 425 "Aql/grammar.y" /* yacc.c:1661 */
{
parser->ast()->scopes()->endNested();
}
#line 2201 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 15:
#line 428 "Aql/grammar.y" /* yacc.c:1661 */
{
parser->ast()->scopes()->endNested();
}
#line 2209 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 16:
#line 431 "Aql/grammar.y" /* yacc.c:1661 */
{
parser->ast()->scopes()->endNested();
}
#line 2217 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 17:
#line 434 "Aql/grammar.y" /* yacc.c:1661 */
{
parser->ast()->scopes()->endNested();
}
#line 2225 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 18:
#line 440 "Aql/grammar.y" /* yacc.c:1661 */
{
}
#line 2232 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 19:
#line 442 "Aql/grammar.y" /* yacc.c:1661 */
{
}
#line 2239 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 20:
#line 447 "Aql/grammar.y" /* yacc.c:1661 */
{
}
#line 2246 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 21:
#line 449 "Aql/grammar.y" /* yacc.c:1661 */
{
}
#line 2253 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 22:
#line 451 "Aql/grammar.y" /* yacc.c:1661 */
{
}
#line 2260 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 23:
#line 453 "Aql/grammar.y" /* yacc.c:1661 */
{
}
#line 2267 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 24:
#line 455 "Aql/grammar.y" /* yacc.c:1661 */
{
}
#line 2274 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 25:
#line 457 "Aql/grammar.y" /* yacc.c:1661 */
{
}
#line 2281 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 26:
#line 459 "Aql/grammar.y" /* yacc.c:1661 */
{
}
#line 2288 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 27:
#line 461 "Aql/grammar.y" /* yacc.c:1661 */
{
}
#line 2295 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 28:
#line 463 "Aql/grammar.y" /* yacc.c:1661 */
{
}
#line 2302 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 29:
#line 465 "Aql/grammar.y" /* yacc.c:1661 */
{
}
#line 2309 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 30:
#line 467 "Aql/grammar.y" /* yacc.c:1661 */
{
}
#line 2316 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 31:
#line 472 "Aql/grammar.y" /* yacc.c:1661 */
{
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 2327 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 32:
#line 478 "Aql/grammar.y" /* yacc.c:1661 */
{
}
#line 2334 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 33:
#line 480 "Aql/grammar.y" /* yacc.c:1661 */
{
}
#line 2341 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 34:
#line 485 "Aql/grammar.y" /* yacc.c:1661 */
{
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 2351 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 35:
#line 490 "Aql/grammar.y" /* yacc.c:1661 */
{
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 2361 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 36:
#line 495 "Aql/grammar.y" /* yacc.c:1661 */
{
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 2371 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 37:
#line 503 "Aql/grammar.y" /* yacc.c:1661 */
{
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 2384 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 38:
#line 511 "Aql/grammar.y" /* yacc.c:1661 */
{
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 2397 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 39:
#line 522 "Aql/grammar.y" /* yacc.c:1661 */
{
// operand is a reference. can use it directly
auto node = parser->ast()->createNodeFilter((yyvsp[0].node));
parser->ast()->addOperation(node);
}
#line 2407 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 40:
#line 530 "Aql/grammar.y" /* yacc.c:1661 */
{
}
#line 2414 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 41:
#line 535 "Aql/grammar.y" /* yacc.c:1661 */
{
}
#line 2421 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 42:
#line 537 "Aql/grammar.y" /* yacc.c:1661 */
{
}
#line 2428 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 43:
#line 542 "Aql/grammar.y" /* yacc.c:1661 */
{
auto node = parser->ast()->createNodeLet((yyvsp[-2].strval).value, (yyvsp[-2].strval).length, (yyvsp[0].node), true);
parser->ast()->addOperation(node);
}
#line 2437 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 44:
#line 549 "Aql/grammar.y" /* yacc.c:1661 */
{
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 2449 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 45:
#line 559 "Aql/grammar.y" /* yacc.c:1661 */
{
auto node = parser->ast()->createNodeArray();
parser->pushStack(node);
}
#line 2458 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 46:
#line 562 "Aql/grammar.y" /* yacc.c:1661 */
{
auto list = static_cast<AstNode*>(parser->popStack());
if (list == nullptr) {
ABORT_OOM
}
(yyval.node) = list;
}
#line 2471 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 47:
#line 573 "Aql/grammar.y" /* yacc.c:1661 */
{
/* 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 2485 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 48:
#line 582 "Aql/grammar.y" /* yacc.c:1661 */
{
/* 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 2501 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 49:
#line 593 "Aql/grammar.y" /* yacc.c:1661 */
{
/* 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 2536 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 50:
#line 623 "Aql/grammar.y" /* yacc.c:1661 */
{
/* 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 2608 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 51:
#line 690 "Aql/grammar.y" /* yacc.c:1661 */
{
/* 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 2638 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 52:
#line 715 "Aql/grammar.y" /* yacc.c:1661 */
{
/* 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 2673 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 53:
#line 748 "Aql/grammar.y" /* yacc.c:1661 */
{
}
#line 2680 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 54:
#line 750 "Aql/grammar.y" /* yacc.c:1661 */
{
}
#line 2687 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 55:
#line 755 "Aql/grammar.y" /* yacc.c:1661 */
{
auto node = parser->ast()->createNodeAssign((yyvsp[-2].strval).value, (yyvsp[-2].strval).length, (yyvsp[0].node));
parser->pushArrayElement(node);
}
#line 2696 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 56:
#line 762 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = nullptr;
}
#line 2704 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 57:
#line 765 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeValueString((yyvsp[0].strval).value, (yyvsp[0].strval).length);
}
#line 2712 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 58:
#line 768 "Aql/grammar.y" /* yacc.c:1661 */
{
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 2723 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 59:
#line 777 "Aql/grammar.y" /* yacc.c:1661 */
{
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 2742 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 60:
#line 791 "Aql/grammar.y" /* yacc.c:1661 */
{
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 2761 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 61:
#line 808 "Aql/grammar.y" /* yacc.c:1661 */
{
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 2774 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 62:
#line 815 "Aql/grammar.y" /* yacc.c:1661 */
{
auto list = static_cast<AstNode*>(parser->popStack());
(yyval.node) = list;
}
#line 2783 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 63:
#line 822 "Aql/grammar.y" /* yacc.c:1661 */
{
auto node = parser->ast()->createNodeArray();
parser->pushStack(node);
}
#line 2792 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 64:
#line 825 "Aql/grammar.y" /* yacc.c:1661 */
{
auto list = static_cast<AstNode*>(parser->popStack());
(yyval.node) = list;
}
#line 2801 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 65:
#line 832 "Aql/grammar.y" /* yacc.c:1661 */
{
auto node = parser->ast()->createNodeArray();
parser->pushStack(node);
}
#line 2810 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 66:
#line 835 "Aql/grammar.y" /* yacc.c:1661 */
{
auto list = static_cast<AstNode const*>(parser->popStack());
auto node = parser->ast()->createNodeSort(list);
parser->ast()->addOperation(node);
}
#line 2820 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 67:
#line 843 "Aql/grammar.y" /* yacc.c:1661 */
{
parser->pushArrayElement((yyvsp[0].node));
}
#line 2828 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 68:
#line 846 "Aql/grammar.y" /* yacc.c:1661 */
{
parser->pushArrayElement((yyvsp[0].node));
}
#line 2836 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 69:
#line 852 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeSortElement((yyvsp[-1].node), (yyvsp[0].node));
}
#line 2844 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 70:
#line 858 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeValueBool(true);
}
#line 2852 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 71:
#line 861 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeValueBool(true);
}
#line 2860 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 72:
#line 864 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeValueBool(false);
}
#line 2868 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 73:
#line 867 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 2876 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 74:
#line 873 "Aql/grammar.y" /* yacc.c:1661 */
{
auto offset = parser->ast()->createNodeValueInt(0);
auto node = parser->ast()->createNodeLimit(offset, (yyvsp[0].node));
parser->ast()->addOperation(node);
}
#line 2886 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 75:
#line 878 "Aql/grammar.y" /* yacc.c:1661 */
{
auto node = parser->ast()->createNodeLimit((yyvsp[-2].node), (yyvsp[0].node));
parser->ast()->addOperation(node);
}
#line 2895 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 76:
#line 885 "Aql/grammar.y" /* yacc.c:1661 */
{
auto node = parser->ast()->createNodeReturn((yyvsp[0].node));
parser->ast()->addOperation(node);
parser->ast()->scopes()->endNested();
}
#line 2905 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 77:
#line 893 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 2913 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 78:
#line 896 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 2921 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 79:
#line 902 "Aql/grammar.y" /* yacc.c:1661 */
{
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 2933 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 80:
#line 912 "Aql/grammar.y" /* yacc.c:1661 */
{
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 2945 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 81:
#line 922 "Aql/grammar.y" /* yacc.c:1661 */
{
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 2958 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 82:
#line 930 "Aql/grammar.y" /* yacc.c:1661 */
{
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 2971 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 83:
#line 941 "Aql/grammar.y" /* yacc.c:1661 */
{
}
#line 2978 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 84:
#line 946 "Aql/grammar.y" /* yacc.c:1661 */
{
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 2991 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 85:
#line 954 "Aql/grammar.y" /* yacc.c:1661 */
{
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 3004 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 86:
#line 965 "Aql/grammar.y" /* yacc.c:1661 */
{
}
#line 3011 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 87:
#line 970 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.intval) = static_cast<int64_t>(NODE_TYPE_UPDATE);
}
#line 3019 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 88:
#line 973 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.intval) = static_cast<int64_t>(NODE_TYPE_REPLACE);
}
#line 3027 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 89:
#line 979 "Aql/grammar.y" /* yacc.c:1661 */
{
// 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 3037 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 90:
#line 983 "Aql/grammar.y" /* yacc.c:1661 */
{
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 3086 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 91:
#line 1030 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeQuantifier(Quantifier::ALL);
}
#line 3094 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 92:
#line 1033 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeQuantifier(Quantifier::ANY);
}
#line 3102 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 93:
#line 1036 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeQuantifier(Quantifier::NONE);
}
#line 3110 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 94:
#line 1042 "Aql/grammar.y" /* yacc.c:1661 */
{
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 3123 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 95:
#line 1049 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeDistinct((yyvsp[0].node));
}
#line 3131 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 96:
#line 1052 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 3139 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 97:
#line 1058 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 3147 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 98:
#line 1061 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 3155 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 99:
#line 1064 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 3163 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 100:
#line 1067 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 3171 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 101:
#line 1070 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 3179 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 102:
#line 1073 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeRange((yyvsp[-2].node), (yyvsp[0].node));
}
#line 3187 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 103:
#line 1079 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.strval) = (yyvsp[0].strval);
}
#line 3195 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 104:
#line 1082 "Aql/grammar.y" /* yacc.c:1661 */
{
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 3213 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 105:
#line 1098 "Aql/grammar.y" /* yacc.c:1661 */
{
parser->pushStack((yyvsp[-1].strval).value);
auto node = parser->ast()->createNodeArray();
parser->pushStack(node);
}
#line 3224 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 106:
#line 1103 "Aql/grammar.y" /* yacc.c:1661 */
{
auto list = static_cast<AstNode const*>(parser->popStack());
(yyval.node) = parser->ast()->createNodeFunctionCall(static_cast<char const*>(parser->popStack()), list);
}
#line 3233 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 107:
#line 1107 "Aql/grammar.y" /* yacc.c:1661 */
{
auto node = parser->ast()->createNodeArray();
parser->pushStack(node);
}
#line 3242 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 108:
#line 1110 "Aql/grammar.y" /* yacc.c:1661 */
{
auto list = static_cast<AstNode const*>(parser->popStack());
(yyval.node) = parser->ast()->createNodeFunctionCall("LIKE", list);
}
#line 3251 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 109:
#line 1117 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeUnaryOperator(NODE_TYPE_OPERATOR_UNARY_PLUS, (yyvsp[0].node));
}
#line 3259 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 110:
#line 1120 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeUnaryOperator(NODE_TYPE_OPERATOR_UNARY_MINUS, (yyvsp[0].node));
}
#line 3267 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 111:
#line 1123 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeUnaryOperator(NODE_TYPE_OPERATOR_UNARY_NOT, (yyvsp[0].node));
}
#line 3275 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 112:
#line 1129 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_OR, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3283 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 113:
#line 1132 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_AND, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3291 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 114:
#line 1135 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_PLUS, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3299 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 115:
#line 1138 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_MINUS, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3307 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 116:
#line 1141 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_TIMES, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3315 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 117:
#line 1144 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_DIV, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3323 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 118:
#line 1147 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_MOD, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3331 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 119:
#line 1150 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_EQ, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3339 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 120:
#line 1153 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_NE, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3347 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 121:
#line 1156 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_LT, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3355 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 122:
#line 1159 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_GT, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3363 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 123:
#line 1162 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_LE, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3371 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 124:
#line 1165 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_GE, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3379 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 125:
#line 1168 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_IN, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3387 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 126:
#line 1171 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeBinaryOperator(NODE_TYPE_OPERATOR_BINARY_NIN, (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3395 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 127:
#line 1174 "Aql/grammar.y" /* yacc.c:1661 */
{
AstNode* arguments = parser->ast()->createNodeArray(2);
arguments->addMember((yyvsp[-2].node));
arguments->addMember((yyvsp[0].node));
(yyval.node) = parser->ast()->createNodeFunctionCall("LIKE", arguments);
}
#line 3406 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 128:
#line 1180 "Aql/grammar.y" /* yacc.c:1661 */
{
AstNode* arguments = parser->ast()->createNodeArray(2);
arguments->addMember((yyvsp[-2].node));
arguments->addMember((yyvsp[0].node));
(yyval.node) = parser->ast()->createNodeFunctionCall("REGEX_TEST", arguments);
}
#line 3417 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 129:
#line 1186 "Aql/grammar.y" /* yacc.c:1661 */
{
AstNode* arguments = parser->ast()->createNodeArray(2);
arguments->addMember((yyvsp[-2].node));
arguments->addMember((yyvsp[0].node));
AstNode* node = parser->ast()->createNodeFunctionCall("REGEX_TEST", arguments);
(yyval.node) = parser->ast()->createNodeUnaryOperator(NODE_TYPE_OPERATOR_UNARY_NOT, node);
}
#line 3429 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 130:
#line 1193 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeBinaryArrayOperator(NODE_TYPE_OPERATOR_BINARY_ARRAY_EQ, (yyvsp[-3].node), (yyvsp[0].node), (yyvsp[-2].node));
}
#line 3437 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 131:
#line 1196 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeBinaryArrayOperator(NODE_TYPE_OPERATOR_BINARY_ARRAY_NE, (yyvsp[-3].node), (yyvsp[0].node), (yyvsp[-2].node));
}
#line 3445 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 132:
#line 1199 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeBinaryArrayOperator(NODE_TYPE_OPERATOR_BINARY_ARRAY_LT, (yyvsp[-3].node), (yyvsp[0].node), (yyvsp[-2].node));
}
#line 3453 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 133:
#line 1202 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeBinaryArrayOperator(NODE_TYPE_OPERATOR_BINARY_ARRAY_GT, (yyvsp[-3].node), (yyvsp[0].node), (yyvsp[-2].node));
}
#line 3461 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 134:
#line 1205 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeBinaryArrayOperator(NODE_TYPE_OPERATOR_BINARY_ARRAY_LE, (yyvsp[-3].node), (yyvsp[0].node), (yyvsp[-2].node));
}
#line 3469 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 135:
#line 1208 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeBinaryArrayOperator(NODE_TYPE_OPERATOR_BINARY_ARRAY_GE, (yyvsp[-3].node), (yyvsp[0].node), (yyvsp[-2].node));
}
#line 3477 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 136:
#line 1211 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeBinaryArrayOperator(NODE_TYPE_OPERATOR_BINARY_ARRAY_IN, (yyvsp[-3].node), (yyvsp[0].node), (yyvsp[-2].node));
}
#line 3485 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 137:
#line 1214 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeBinaryArrayOperator(NODE_TYPE_OPERATOR_BINARY_ARRAY_NIN, (yyvsp[-3].node), (yyvsp[0].node), (yyvsp[-2].node));
}
#line 3493 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 138:
#line 1220 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeTernaryOperator((yyvsp[-4].node), (yyvsp[-2].node), (yyvsp[0].node));
}
#line 3501 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 139:
#line 1226 "Aql/grammar.y" /* yacc.c:1661 */
{
}
#line 3508 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 140:
#line 1228 "Aql/grammar.y" /* yacc.c:1661 */
{
}
#line 3515 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 141:
#line 1233 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 3523 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 142:
#line 1236 "Aql/grammar.y" /* yacc.c:1661 */
{
parser->ast()->scopes()->start(arangodb::aql::AQL_SCOPE_SUBQUERY);
parser->ast()->startSubQuery();
}
#line 3532 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 143:
#line 1239 "Aql/grammar.y" /* yacc.c:1661 */
{
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 3547 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 144:
#line 1252 "Aql/grammar.y" /* yacc.c:1661 */
{
parser->pushArrayElement((yyvsp[0].node));
}
#line 3555 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 145:
#line 1255 "Aql/grammar.y" /* yacc.c:1661 */
{
parser->pushArrayElement((yyvsp[0].node));
}
#line 3563 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 146:
#line 1261 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 3571 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 147:
#line 1264 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 3579 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 148:
#line 1270 "Aql/grammar.y" /* yacc.c:1661 */
{
auto node = parser->ast()->createNodeArray();
parser->pushStack(node);
}
#line 3588 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 149:
#line 1273 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = static_cast<AstNode*>(parser->popStack());
}
#line 3596 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 150:
#line 1279 "Aql/grammar.y" /* yacc.c:1661 */
{
}
#line 3603 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 151:
#line 1281 "Aql/grammar.y" /* yacc.c:1661 */
{
}
#line 3610 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 152:
#line 1286 "Aql/grammar.y" /* yacc.c:1661 */
{
parser->pushArrayElement((yyvsp[0].node));
}
#line 3618 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 153:
#line 1289 "Aql/grammar.y" /* yacc.c:1661 */
{
parser->pushArrayElement((yyvsp[0].node));
}
#line 3626 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 154:
#line 1295 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = nullptr;
}
#line 3634 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 155:
#line 1298 "Aql/grammar.y" /* yacc.c:1661 */
{
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 3650 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 156:
#line 1312 "Aql/grammar.y" /* yacc.c:1661 */
{
auto node = parser->ast()->createNodeObject();
parser->pushStack(node);
}
#line 3659 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 157:
#line 1315 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = static_cast<AstNode*>(parser->popStack());
}
#line 3667 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 158:
#line 1321 "Aql/grammar.y" /* yacc.c:1661 */
{
}
#line 3674 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 159:
#line 1323 "Aql/grammar.y" /* yacc.c:1661 */
{
}
#line 3681 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 160:
#line 1328 "Aql/grammar.y" /* yacc.c:1661 */
{
}
#line 3688 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 161:
#line 1330 "Aql/grammar.y" /* yacc.c:1661 */
{
}
#line 3695 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 162:
#line 1335 "Aql/grammar.y" /* yacc.c:1661 */
{
// 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 3714 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 163:
#line 1349 "Aql/grammar.y" /* yacc.c:1661 */
{
// attribute-name : attribute-value
parser->pushObjectElement((yyvsp[-2].strval).value, (yyvsp[-2].strval).length, (yyvsp[0].node));
}
#line 3723 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 164:
#line 1353 "Aql/grammar.y" /* yacc.c:1661 */
{
// 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 3737 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 165:
#line 1362 "Aql/grammar.y" /* yacc.c:1661 */
{
// [ attribute-name-expression ] : attribute-value
parser->pushObjectElement((yyvsp[-3].node), (yyvsp[0].node));
}
#line 3746 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 166:
#line 1369 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.intval) = 1;
}
#line 3754 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 167:
#line 1372 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.intval) = (yyvsp[-1].intval) + 1;
}
#line 3762 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 168:
#line 1378 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = nullptr;
}
#line 3770 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 169:
#line 1381 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 3778 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 170:
#line 1387 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = nullptr;
}
#line 3786 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 171:
#line 1390 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeArrayLimit(nullptr, (yyvsp[0].node));
}
#line 3794 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 172:
#line 1393 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeArrayLimit((yyvsp[-2].node), (yyvsp[0].node));
}
#line 3802 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 173:
#line 1399 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = nullptr;
}
#line 3810 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 174:
#line 1402 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 3818 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 175:
#line 1408 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeValueString((yyvsp[0].strval).value, (yyvsp[0].strval).length);
}
#line 3826 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 176:
#line 1411 "Aql/grammar.y" /* yacc.c:1661 */
{
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 3839 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 177:
#line 1419 "Aql/grammar.y" /* yacc.c:1661 */
{
auto tmp = parser->ast()->createNodeValueString((yyvsp[0].strval).value, (yyvsp[0].strval).length);
(yyval.node) = parser->ast()->createNodeCollectionDirection((yyvsp[-1].intval), tmp);
}
#line 3848 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 178:
#line 1423 "Aql/grammar.y" /* yacc.c:1661 */
{
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 3861 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 179:
#line 1434 "Aql/grammar.y" /* yacc.c:1661 */
{
auto node = static_cast<AstNode*>(parser->peekStack());
node->addMember((yyvsp[0].node));
}
#line 3870 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 180:
#line 1438 "Aql/grammar.y" /* yacc.c:1661 */
{
auto node = static_cast<AstNode*>(parser->peekStack());
node->addMember((yyvsp[0].node));
}
#line 3879 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 181:
#line 1445 "Aql/grammar.y" /* yacc.c:1661 */
{
auto node = parser->ast()->createNodeArray();
node->addMember((yyvsp[0].node));
(yyval.node) = parser->ast()->createNodeCollectionList(node);
}
#line 3889 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 182:
#line 1450 "Aql/grammar.y" /* yacc.c:1661 */
{
auto node = parser->ast()->createNodeArray();
parser->pushStack(node);
node->addMember((yyvsp[-1].node));
}
#line 3899 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 183:
#line 1454 "Aql/grammar.y" /* yacc.c:1661 */
{
auto node = static_cast<AstNode*>(parser->popStack());
(yyval.node) = parser->ast()->createNodeCollectionList(node);
}
#line 3908 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 184:
#line 1458 "Aql/grammar.y" /* yacc.c:1661 */
{
// 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 3922 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 185:
#line 1467 "Aql/grammar.y" /* yacc.c:1661 */
{
// graph name
(yyval.node) = parser->ast()->createNodeValueString((yyvsp[0].strval).value, (yyvsp[0].strval).length);
}
#line 3931 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 186:
#line 1476 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.intval) = 2;
}
#line 3939 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 187:
#line 1479 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.intval) = 1;
}
#line 3947 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 188:
#line 1482 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.intval) = 0;
}
#line 3955 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 189:
#line 1488 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeDirection((yyvsp[0].intval), 1);
}
#line 3963 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 190:
#line 1491 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeDirection((yyvsp[0].intval), (yyvsp[-1].node));
}
#line 3971 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 191:
#line 1497 "Aql/grammar.y" /* yacc.c:1661 */
{
// variable or collection
auto ast = parser->ast();
AstNode* node = nullptr;
auto variable = ast->scopes()->getVariable((yyvsp[0].strval).value, (yyvsp[0].strval).length, true);
if (variable == nullptr) {
// variable does not exist
// now try special variables
if (ast->scopes()->canUseCurrentVariable() && strcmp((yyvsp[0].strval).value, "CURRENT") == 0) {
variable = ast->scopes()->getCurrentVariable();
}
else if (strcmp((yyvsp[0].strval).value, Variable::NAME_CURRENT) == 0) {
variable = ast->scopes()->getCurrentVariable();
}
}
if (variable != nullptr) {
// variable alias exists, now use it
node = ast->createNodeReference(variable);
}
if (node == nullptr) {
// variable not found. so it must have been a collection
node = ast->createNodeCollection((yyvsp[0].strval).value, TRI_TRANSACTION_READ);
}
TRI_ASSERT(node != nullptr);
(yyval.node) = node;
}
#line 4008 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 192:
#line 1529 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 4016 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 193:
#line 1532 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 4024 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 194:
#line 1535 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = (yyvsp[0].node);
if ((yyval.node) == nullptr) {
ABORT_OOM
}
}
#line 4036 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 195:
#line 1542 "Aql/grammar.y" /* yacc.c:1661 */
{
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 4051 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 196:
#line 1552 "Aql/grammar.y" /* yacc.c:1661 */
{
parser->ast()->scopes()->start(arangodb::aql::AQL_SCOPE_SUBQUERY);
parser->ast()->startSubQuery();
}
#line 4060 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 197:
#line 1555 "Aql/grammar.y" /* yacc.c:1661 */
{
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 4075 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 198:
#line 1565 "Aql/grammar.y" /* yacc.c:1661 */
{
// 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 4095 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 199:
#line 1580 "Aql/grammar.y" /* yacc.c:1661 */
{
// 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 4114 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 200:
#line 1594 "Aql/grammar.y" /* yacc.c:1661 */
{
// 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 4133 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 201:
#line 1608 "Aql/grammar.y" /* yacc.c:1661 */
{
// 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 4161 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 202:
#line 1630 "Aql/grammar.y" /* yacc.c:1661 */
{
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 4184 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 203:
#line 1651 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 4192 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 204:
#line 1654 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 4200 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 205:
#line 1660 "Aql/grammar.y" /* yacc.c:1661 */
{
if ((yyvsp[0].node) == nullptr) {
ABORT_OOM
}
(yyval.node) = (yyvsp[0].node);
}
#line 4212 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 206:
#line 1667 "Aql/grammar.y" /* yacc.c:1661 */
{
if ((yyvsp[0].node) == nullptr) {
ABORT_OOM
}
(yyval.node) = (yyvsp[0].node);
}
#line 4224 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 207:
#line 1677 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeValueString((yyvsp[0].strval).value, (yyvsp[0].strval).length);
}
#line 4232 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 208:
#line 1680 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = (yyvsp[0].node);
}
#line 4240 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 209:
#line 1683 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeValueNull();
}
#line 4248 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 210:
#line 1686 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeValueBool(true);
}
#line 4256 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 211:
#line 1689 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeValueBool(false);
}
#line 4264 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 212:
#line 1695 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeCollection((yyvsp[0].strval).value, TRI_TRANSACTION_WRITE);
}
#line 4272 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 213:
#line 1698 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeCollection((yyvsp[0].strval).value, TRI_TRANSACTION_WRITE);
}
#line 4280 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 214:
#line 1701 "Aql/grammar.y" /* yacc.c:1661 */
{
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 4292 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 215:
#line 1711 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.node) = parser->ast()->createNodeParameter((yyvsp[0].strval).value, (yyvsp[0].strval).length);
}
#line 4300 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 216:
#line 1717 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.strval) = (yyvsp[0].strval);
}
#line 4308 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 217:
#line 1720 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.strval) = (yyvsp[0].strval);
}
#line 4316 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
case 218:
#line 1725 "Aql/grammar.y" /* yacc.c:1661 */
{
(yyval.strval) = (yyvsp[0].strval);
}
#line 4324 "Aql/grammar.cpp" /* yacc.c:1661 */
break;
#line 4328 "Aql/grammar.cpp" /* yacc.c:1661 */
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