diff options
Diffstat (limited to 'gprofng/src/QLParser.tab.hh')
-rw-r--r-- | gprofng/src/QLParser.tab.hh | 2038 |
1 files changed, 2038 insertions, 0 deletions
diff --git a/gprofng/src/QLParser.tab.hh b/gprofng/src/QLParser.tab.hh new file mode 100644 index 0000000..eaf2cb5 --- /dev/null +++ b/gprofng/src/QLParser.tab.hh @@ -0,0 +1,2038 @@ +// A Bison parser, made by GNU Bison 3.7.5. + +// Skeleton interface for Bison LALR(1) parsers in C++ + +// Copyright (C) 2002-2015, 2018-2021 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. + + +/** + ** \file QLParser.tab.hh + ** Define the QL::parser class. + */ + +// C++ LALR(1) parser skeleton written by Akim Demaille. + +// DO NOT RELY ON FEATURES THAT ARE NOT DOCUMENTED in the manual, +// especially those whose name start with YY_ or yy_. They are +// private implementation details that can be changed or removed. + +#ifndef YY_YY_QLPARSER_TAB_HH_INCLUDED +# define YY_YY_QLPARSER_TAB_HH_INCLUDED +// "%code requires" blocks. +#line 33 "QLParser.yy" + +#include "QLParser.h" +#include "DbeSession.h" +#include "Expression.h" +#include "Table.h" +#include "i18n.h" + +#line 57 "QLParser.tab.hh" + +# include <cassert> +# include <cstdlib> // std::abort +# include <iostream> +# include <stdexcept> +# include <string> +# include <vector> + +#if defined __cplusplus +# define YY_CPLUSPLUS __cplusplus +#else +# define YY_CPLUSPLUS 199711L +#endif + +// Support move semantics when possible. +#if 201103L <= YY_CPLUSPLUS +# define YY_MOVE std::move +# define YY_MOVE_OR_COPY move +# define YY_MOVE_REF(Type) Type&& +# define YY_RVREF(Type) Type&& +# define YY_COPY(Type) Type +#else +# define YY_MOVE +# define YY_MOVE_OR_COPY copy +# define YY_MOVE_REF(Type) Type& +# define YY_RVREF(Type) const Type& +# define YY_COPY(Type) const Type& +#endif + +// Support noexcept when possible. +#if 201103L <= YY_CPLUSPLUS +# define YY_NOEXCEPT noexcept +# define YY_NOTHROW +#else +# define YY_NOEXCEPT +# define YY_NOTHROW throw () +#endif + +// Support constexpr when possible. +#if 201703 <= YY_CPLUSPLUS +# define YY_CONSTEXPR constexpr +#else +# define YY_CONSTEXPR +#endif + +#include <typeinfo> +#ifndef YY_ASSERT +# include <cassert> +# define YY_ASSERT assert +#endif + + +#ifndef YY_ATTRIBUTE_PURE +# if defined __GNUC__ && 2 < __GNUC__ + (96 <= __GNUC_MINOR__) +# define YY_ATTRIBUTE_PURE __attribute__ ((__pure__)) +# else +# define YY_ATTRIBUTE_PURE +# endif +#endif + +#ifndef YY_ATTRIBUTE_UNUSED +# if defined __GNUC__ && 2 < __GNUC__ + (7 <= __GNUC_MINOR__) +# define YY_ATTRIBUTE_UNUSED __attribute__ ((__unused__)) +# else +# define YY_ATTRIBUTE_UNUSED +# endif +#endif + +/* Suppress unused-variable warnings by "using" E. */ +#if ! defined lint || defined __GNUC__ +# define YY_USE(E) ((void) (E)) +#else +# define YY_USE(E) /* empty */ +#endif + +#if defined __GNUC__ && ! defined __ICC && 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 __cplusplus && defined __GNUC__ && ! defined __ICC && 6 <= __GNUC__ +# define YY_IGNORE_USELESS_CAST_BEGIN \ + _Pragma ("GCC diagnostic push") \ + _Pragma ("GCC diagnostic ignored \"-Wuseless-cast\"") +# define YY_IGNORE_USELESS_CAST_END \ + _Pragma ("GCC diagnostic pop") +#endif +#ifndef YY_IGNORE_USELESS_CAST_BEGIN +# define YY_IGNORE_USELESS_CAST_BEGIN +# define YY_IGNORE_USELESS_CAST_END +#endif + +# ifndef YY_CAST +# ifdef __cplusplus +# define YY_CAST(Type, Val) static_cast<Type> (Val) +# define YY_REINTERPRET_CAST(Type, Val) reinterpret_cast<Type> (Val) +# else +# define YY_CAST(Type, Val) ((Type) (Val)) +# define YY_REINTERPRET_CAST(Type, Val) ((Type) (Val)) +# endif +# endif +# ifndef YY_NULLPTR +# if defined __cplusplus +# if 201103L <= __cplusplus +# define YY_NULLPTR nullptr +# else +# define YY_NULLPTR 0 +# endif +# else +# define YY_NULLPTR ((void*)0) +# endif +# endif + +/* Debug traces. */ +#ifndef YYDEBUG +# define YYDEBUG 0 +#endif + +#line 50 "QLParser.yy" +namespace QL { +#line 192 "QLParser.tab.hh" + + + + + /// A Bison parser. + class Parser + { + public: +#ifndef YYSTYPE + /// A buffer to store and retrieve objects. + /// + /// Sort of a variant, but does not keep track of the nature + /// of the stored data, since that knowledge is available + /// via the current parser state. + class semantic_type + { + public: + /// Type of *this. + typedef semantic_type self_type; + + /// Empty construction. + semantic_type () YY_NOEXCEPT + : yybuffer_ () + , yytypeid_ (YY_NULLPTR) + {} + + /// Construct and fill. + template <typename T> + semantic_type (YY_RVREF (T) t) + : yytypeid_ (&typeid (T)) + { + YY_ASSERT (sizeof (T) <= size); + new (yyas_<T> ()) T (YY_MOVE (t)); + } + +#if 201103L <= YY_CPLUSPLUS + /// Non copyable. + semantic_type (const self_type&) = delete; + /// Non copyable. + self_type& operator= (const self_type&) = delete; +#endif + + /// Destruction, allowed only if empty. + ~semantic_type () YY_NOEXCEPT + { + YY_ASSERT (!yytypeid_); + } + +# if 201103L <= YY_CPLUSPLUS + /// Instantiate a \a T in here from \a t. + template <typename T, typename... U> + T& + emplace (U&&... u) + { + YY_ASSERT (!yytypeid_); + YY_ASSERT (sizeof (T) <= size); + yytypeid_ = & typeid (T); + return *new (yyas_<T> ()) T (std::forward <U>(u)...); + } +# else + /// Instantiate an empty \a T in here. + template <typename T> + T& + emplace () + { + YY_ASSERT (!yytypeid_); + YY_ASSERT (sizeof (T) <= size); + yytypeid_ = & typeid (T); + return *new (yyas_<T> ()) T (); + } + + /// Instantiate a \a T in here from \a t. + template <typename T> + T& + emplace (const T& t) + { + YY_ASSERT (!yytypeid_); + YY_ASSERT (sizeof (T) <= size); + yytypeid_ = & typeid (T); + return *new (yyas_<T> ()) T (t); + } +# endif + + /// Instantiate an empty \a T in here. + /// Obsolete, use emplace. + template <typename T> + T& + build () + { + return emplace<T> (); + } + + /// Instantiate a \a T in here from \a t. + /// Obsolete, use emplace. + template <typename T> + T& + build (const T& t) + { + return emplace<T> (t); + } + + /// Accessor to a built \a T. + template <typename T> + T& + as () YY_NOEXCEPT + { + YY_ASSERT (yytypeid_); + YY_ASSERT (*yytypeid_ == typeid (T)); + YY_ASSERT (sizeof (T) <= size); + return *yyas_<T> (); + } + + /// Const accessor to a built \a T (for %printer). + template <typename T> + const T& + as () const YY_NOEXCEPT + { + YY_ASSERT (yytypeid_); + YY_ASSERT (*yytypeid_ == typeid (T)); + YY_ASSERT (sizeof (T) <= size); + return *yyas_<T> (); + } + + /// Swap the content with \a that, of same type. + /// + /// Both variants must be built beforehand, because swapping the actual + /// data requires reading it (with as()), and this is not possible on + /// unconstructed variants: it would require some dynamic testing, which + /// should not be the variant's responsibility. + /// Swapping between built and (possibly) non-built is done with + /// self_type::move (). + template <typename T> + void + swap (self_type& that) YY_NOEXCEPT + { + YY_ASSERT (yytypeid_); + YY_ASSERT (*yytypeid_ == *that.yytypeid_); + std::swap (as<T> (), that.as<T> ()); + } + + /// Move the content of \a that to this. + /// + /// Destroys \a that. + template <typename T> + void + move (self_type& that) + { +# if 201103L <= YY_CPLUSPLUS + emplace<T> (std::move (that.as<T> ())); +# else + emplace<T> (); + swap<T> (that); +# endif + that.destroy<T> (); + } + +# if 201103L <= YY_CPLUSPLUS + /// Move the content of \a that to this. + template <typename T> + void + move (self_type&& that) + { + emplace<T> (std::move (that.as<T> ())); + that.destroy<T> (); + } +#endif + + /// Copy the content of \a that to this. + template <typename T> + void + copy (const self_type& that) + { + emplace<T> (that.as<T> ()); + } + + /// Destroy the stored \a T. + template <typename T> + void + destroy () + { + as<T> ().~T (); + yytypeid_ = YY_NULLPTR; + } + + private: +#if YY_CPLUSPLUS < 201103L + /// Non copyable. + semantic_type (const self_type&); + /// Non copyable. + self_type& operator= (const self_type&); +#endif + + /// Accessor to raw memory as \a T. + template <typename T> + T* + yyas_ () YY_NOEXCEPT + { + void *yyp = yybuffer_.yyraw; + return static_cast<T*> (yyp); + } + + /// Const accessor to raw memory as \a T. + template <typename T> + const T* + yyas_ () const YY_NOEXCEPT + { + const void *yyp = yybuffer_.yyraw; + return static_cast<const T*> (yyp); + } + + /// An auxiliary type to compute the largest semantic type. + union union_type + { + // "number" + // "name" + // FNAME + // JGROUP + // JPARENT + // QSTR + // FILEIOVFD + // exp + // term + char dummy1[sizeof (Expression *)]; + }; + + /// The size of the largest semantic type. + enum { size = sizeof (union_type) }; + + /// A buffer to store semantic values. + union + { + /// Strongest alignment constraints. + long double yyalign_me; + /// A buffer large enough to store any of the semantic values. + char yyraw[size]; + } yybuffer_; + + /// Whether the content is built: if defined, the name of the stored type. + const std::type_info *yytypeid_; + }; + +#else + typedef YYSTYPE semantic_type; +#endif + + /// Syntax errors thrown from user actions. + struct syntax_error : std::runtime_error + { + syntax_error (const std::string& m) + : std::runtime_error (m) + {} + + syntax_error (const syntax_error& s) + : std::runtime_error (s.what ()) + {} + + ~syntax_error () YY_NOEXCEPT YY_NOTHROW; + }; + + /// Token kinds. + struct token + { + enum token_kind_type + { + L_YYEMPTY = -2, + L_YYEOF = 0, // "end of file" + L_YYerror = 256, // error + L_YYUNDEF = 257, // "invalid token" + L_LPAR = 258, // "(" + L_RPAR = 259, // ")" + L_NUM = 260, // "number" + L_NAME = 261, // "name" + L_FNAME = 262, // FNAME + L_HASPROP = 263, // HASPROP + L_JGROUP = 264, // JGROUP + L_JPARENT = 265, // JPARENT + L_QSTR = 266, // QSTR + L_FILEIOVFD = 267, // FILEIOVFD + L_IN = 268, // IN + L_SOME = 269, // SOME + L_ORDR = 270, // ORDR + L_COMMA = 271, // COMMA + L_QWE = 273, // QWE + L_COLON = 275, // COLON + L_AND = 277, // AND + L_OR = 279, // OR + L_EQV = 281, // EQV + L_NEQV = 282, // NEQV + L_BITAND = 283, // BITAND + L_BITOR = 284, // BITOR + L_BITXOR = 285, // BITXOR + L_EQ = 287, // EQ + L_NE = 289, // NE + L_LT = 291, // LT + L_GT = 293, // GT + L_LE = 295, // LE + L_GE = 297, // GE + L_LS = 299, // LS + L_RS = 301, // RS + L_ADD = 303, // ADD + L_MINUS = 305, // MINUS + L_MUL = 307, // MUL + L_DIV = 309, // DIV + L_REM = 311, // REM + L_DEG = 313, // DEG + L_NOT = 314, // NOT + L_BITNOT = 316 // BITNOT + }; + /// Backward compatibility alias (Bison 3.6). + typedef token_kind_type yytokentype; + }; + + /// Token kind, as returned by yylex. + typedef token::yytokentype token_kind_type; + + /// Backward compatibility alias (Bison 3.6). + typedef token_kind_type token_type; + + /// Symbol kinds. + struct symbol_kind + { + enum symbol_kind_type + { + YYNTOKENS = 63, ///< Number of tokens. + S_YYEMPTY = -2, + S_YYEOF = 0, // "end of file" + S_YYerror = 1, // error + S_YYUNDEF = 2, // "invalid token" + S_LPAR = 3, // "(" + S_RPAR = 4, // ")" + S_NUM = 5, // "number" + S_NAME = 6, // "name" + S_FNAME = 7, // FNAME + S_HASPROP = 8, // HASPROP + S_JGROUP = 9, // JGROUP + S_JPARENT = 10, // JPARENT + S_QSTR = 11, // QSTR + S_FILEIOVFD = 12, // FILEIOVFD + S_IN = 13, // IN + S_SOME = 14, // SOME + S_ORDR = 15, // ORDR + S_COMMA = 16, // COMMA + S_17_ = 17, // "," + S_QWE = 18, // QWE + S_19_ = 19, // "?" + S_COLON = 20, // COLON + S_21_ = 21, // ":" + S_AND = 22, // AND + S_23_ = 23, // "&&" + S_OR = 24, // OR + S_25_ = 25, // "|" + S_EQV = 26, // EQV + S_NEQV = 27, // NEQV + S_BITAND = 28, // BITAND + S_BITOR = 29, // BITOR + S_BITXOR = 30, // BITXOR + S_31_ = 31, // "^" + S_EQ = 32, // EQ + S_33_ = 33, // "=" + S_NE = 34, // NE + S_35_ = 35, // "!=" + S_LT = 36, // LT + S_37_ = 37, // "<" + S_GT = 38, // GT + S_39_ = 39, // ">" + S_LE = 40, // LE + S_41_ = 41, // "<=" + S_GE = 42, // GE + S_43_ = 43, // ">=" + S_LS = 44, // LS + S_45_ = 45, // "<<" + S_RS = 46, // RS + S_47_ = 47, // ">>" + S_ADD = 48, // ADD + S_49_ = 49, // "+" + S_MINUS = 50, // MINUS + S_51_ = 51, // "-" + S_MUL = 52, // MUL + S_53_ = 53, // "*" + S_DIV = 54, // DIV + S_55_ = 55, // "/" + S_REM = 56, // REM + S_57_ = 57, // "%" + S_DEG = 58, // DEG + S_NOT = 59, // NOT + S_60_ = 60, // "!" + S_BITNOT = 61, // BITNOT + S_62_ = 62, // "~" + S_YYACCEPT = 63, // $accept + S_S = 64, // S + S_exp = 65, // exp + S_term = 66 // term + }; + }; + + /// (Internal) symbol kind. + typedef symbol_kind::symbol_kind_type symbol_kind_type; + + /// The number of tokens. + static const symbol_kind_type YYNTOKENS = symbol_kind::YYNTOKENS; + + /// A complete symbol. + /// + /// Expects its Base type to provide access to the symbol kind + /// via kind (). + /// + /// Provide access to semantic value. + template <typename Base> + struct basic_symbol : Base + { + /// Alias to Base. + typedef Base super_type; + + /// Default constructor. + basic_symbol () + : value () + {} + +#if 201103L <= YY_CPLUSPLUS + /// Move constructor. + basic_symbol (basic_symbol&& that) + : Base (std::move (that)) + , value () + { + switch (this->kind ()) + { + case symbol_kind::S_NUM: // "number" + case symbol_kind::S_NAME: // "name" + case symbol_kind::S_FNAME: // FNAME + case symbol_kind::S_JGROUP: // JGROUP + case symbol_kind::S_JPARENT: // JPARENT + case symbol_kind::S_QSTR: // QSTR + case symbol_kind::S_FILEIOVFD: // FILEIOVFD + case symbol_kind::S_exp: // exp + case symbol_kind::S_term: // term + value.move< Expression * > (std::move (that.value)); + break; + + default: + break; + } + + } +#endif + + /// Copy constructor. + basic_symbol (const basic_symbol& that); + + /// Constructors for typed symbols. +#if 201103L <= YY_CPLUSPLUS + basic_symbol (typename Base::kind_type t) + : Base (t) + {} +#else + basic_symbol (typename Base::kind_type t) + : Base (t) + {} +#endif + +#if 201103L <= YY_CPLUSPLUS + basic_symbol (typename Base::kind_type t, Expression *&& v) + : Base (t) + , value (std::move (v)) + {} +#else + basic_symbol (typename Base::kind_type t, const Expression *& v) + : Base (t) + , value (v) + {} +#endif + + /// Destroy the symbol. + ~basic_symbol () + { + clear (); + } + + /// Destroy contents, and record that is empty. + void clear () YY_NOEXCEPT + { + // User destructor. + symbol_kind_type yykind = this->kind (); + basic_symbol<Base>& yysym = *this; + (void) yysym; + switch (yykind) + { + case symbol_kind::S_NUM: // "number" +#line 100 "QLParser.yy" + { delete yysym.value.template as < Expression * > (); } +#line 682 "QLParser.tab.hh" + break; + + case symbol_kind::S_NAME: // "name" +#line 100 "QLParser.yy" + { delete yysym.value.template as < Expression * > (); } +#line 688 "QLParser.tab.hh" + break; + + case symbol_kind::S_FNAME: // FNAME +#line 100 "QLParser.yy" + { delete yysym.value.template as < Expression * > (); } +#line 694 "QLParser.tab.hh" + break; + + case symbol_kind::S_JGROUP: // JGROUP +#line 100 "QLParser.yy" + { delete yysym.value.template as < Expression * > (); } +#line 700 "QLParser.tab.hh" + break; + + case symbol_kind::S_JPARENT: // JPARENT +#line 100 "QLParser.yy" + { delete yysym.value.template as < Expression * > (); } +#line 706 "QLParser.tab.hh" + break; + + case symbol_kind::S_QSTR: // QSTR +#line 100 "QLParser.yy" + { delete yysym.value.template as < Expression * > (); } +#line 712 "QLParser.tab.hh" + break; + + case symbol_kind::S_FILEIOVFD: // FILEIOVFD +#line 100 "QLParser.yy" + { delete yysym.value.template as < Expression * > (); } +#line 718 "QLParser.tab.hh" + break; + + case symbol_kind::S_exp: // exp +#line 100 "QLParser.yy" + { delete yysym.value.template as < Expression * > (); } +#line 724 "QLParser.tab.hh" + break; + + case symbol_kind::S_term: // term +#line 100 "QLParser.yy" + { delete yysym.value.template as < Expression * > (); } +#line 730 "QLParser.tab.hh" + break; + + default: + break; + } + + // Value type destructor. +switch (yykind) + { + case symbol_kind::S_NUM: // "number" + case symbol_kind::S_NAME: // "name" + case symbol_kind::S_FNAME: // FNAME + case symbol_kind::S_JGROUP: // JGROUP + case symbol_kind::S_JPARENT: // JPARENT + case symbol_kind::S_QSTR: // QSTR + case symbol_kind::S_FILEIOVFD: // FILEIOVFD + case symbol_kind::S_exp: // exp + case symbol_kind::S_term: // term + value.template destroy< Expression * > (); + break; + + default: + break; + } + + Base::clear (); + } + +#if YYDEBUG || 0 + /// The user-facing name of this symbol. + const char *name () const YY_NOEXCEPT + { + return Parser::symbol_name (this->kind ()); + } +#endif // #if YYDEBUG || 0 + + + /// Backward compatibility (Bison 3.6). + symbol_kind_type type_get () const YY_NOEXCEPT; + + /// Whether empty. + bool empty () const YY_NOEXCEPT; + + /// Destructive move, \a s is emptied into this. + void move (basic_symbol& s); + + /// The semantic value. + semantic_type value; + + private: +#if YY_CPLUSPLUS < 201103L + /// Assignment operator. + basic_symbol& operator= (const basic_symbol& that); +#endif + }; + + /// Type access provider for token (enum) based symbols. + struct by_kind + { + /// Default constructor. + by_kind (); + +#if 201103L <= YY_CPLUSPLUS + /// Move constructor. + by_kind (by_kind&& that); +#endif + + /// Copy constructor. + by_kind (const by_kind& that); + + /// The symbol kind as needed by the constructor. + typedef token_kind_type kind_type; + + /// Constructor from (external) token numbers. + by_kind (kind_type t); + + /// Record that this symbol is empty. + void clear () YY_NOEXCEPT; + + /// Steal the symbol kind from \a that. + void move (by_kind& that); + + /// The (internal) type number (corresponding to \a type). + /// \a empty when empty. + symbol_kind_type kind () const YY_NOEXCEPT; + + /// Backward compatibility (Bison 3.6). + symbol_kind_type type_get () const YY_NOEXCEPT; + + /// The symbol kind. + /// \a S_YYEMPTY when empty. + symbol_kind_type kind_; + }; + + /// Backward compatibility for a private implementation detail (Bison 3.6). + typedef by_kind by_type; + + /// "External" symbols: returned by the scanner. + struct symbol_type : basic_symbol<by_kind> + { + /// Superclass. + typedef basic_symbol<by_kind> super_type; + + /// Empty symbol. + symbol_type () {} + + /// Constructor for valueless symbols, and symbols from each type. +#if 201103L <= YY_CPLUSPLUS + symbol_type (int tok) + : super_type(token_type (tok)) +#else + symbol_type (int tok) + : super_type(token_type (tok)) +#endif + { + YY_ASSERT (tok == token::L_YYEOF + || (token::L_YYerror <= tok && tok <= token::L_RPAR) + || tok == token::L_HASPROP + || (token::L_IN <= tok && tok <= 317)); + } +#if 201103L <= YY_CPLUSPLUS + symbol_type (int tok, Expression * v) + : super_type(token_type (tok), std::move (v)) +#else + symbol_type (int tok, const Expression *& v) + : super_type(token_type (tok), v) +#endif + { + YY_ASSERT ((token::L_NUM <= tok && tok <= token::L_FNAME) + || (token::L_JGROUP <= tok && tok <= token::L_FILEIOVFD)); + } + }; + + /// Build a parser object. + Parser (QL::Result &result_yyarg); + virtual ~Parser (); + +#if 201103L <= YY_CPLUSPLUS + /// Non copyable. + Parser (const Parser&) = delete; + /// Non copyable. + Parser& operator= (const Parser&) = delete; +#endif + + /// Parse. An alias for parse (). + /// \returns 0 iff parsing succeeded. + int operator() (); + + /// Parse. + /// \returns 0 iff parsing succeeded. + virtual int parse (); + +#if YYDEBUG + /// The current debugging stream. + std::ostream& debug_stream () const YY_ATTRIBUTE_PURE; + /// Set the current debugging stream. + void set_debug_stream (std::ostream &); + + /// Type for debugging levels. + typedef int debug_level_type; + /// The current debugging level. + debug_level_type debug_level () const YY_ATTRIBUTE_PURE; + /// Set the current debugging level. + void set_debug_level (debug_level_type l); +#endif + + /// Report a syntax error. + /// \param msg a description of the syntax error. + virtual void error (const std::string& msg); + + /// Report a syntax error. + void error (const syntax_error& err); + +#if YYDEBUG || 0 + /// The user-facing name of the symbol whose (internal) number is + /// YYSYMBOL. No bounds checking. + static const char *symbol_name (symbol_kind_type yysymbol); +#endif // #if YYDEBUG || 0 + + + // Implementation of make_symbol for each symbol type. +#if 201103L <= YY_CPLUSPLUS + static + symbol_type + make_YYEOF () + { + return symbol_type (token::L_YYEOF); + } +#else + static + symbol_type + make_YYEOF () + { + return symbol_type (token::L_YYEOF); + } +#endif +#if 201103L <= YY_CPLUSPLUS + static + symbol_type + make_YYerror () + { + return symbol_type (token::L_YYerror); + } +#else + static + symbol_type + make_YYerror () + { + return symbol_type (token::L_YYerror); + } +#endif +#if 201103L <= YY_CPLUSPLUS + static + symbol_type + make_YYUNDEF () + { + return symbol_type (token::L_YYUNDEF); + } +#else + static + symbol_type + make_YYUNDEF () + { + return symbol_type (token::L_YYUNDEF); + } +#endif +#if 201103L <= YY_CPLUSPLUS + static + symbol_type + make_LPAR () + { + return symbol_type (token::L_LPAR); + } +#else + static + symbol_type + make_LPAR () + { + return symbol_type (token::L_LPAR); + } +#endif +#if 201103L <= YY_CPLUSPLUS + static + symbol_type + make_RPAR () + { + return symbol_type (token::L_RPAR); + } +#else + static + symbol_type + make_RPAR () + { + return symbol_type (token::L_RPAR); + } +#endif +#if 201103L <= YY_CPLUSPLUS + static + symbol_type + make_NUM (Expression * v) + { + return symbol_type (token::L_NUM, std::move (v)); + } +#else + static + symbol_type + make_NUM (const Expression *& v) + { + return symbol_type (token::L_NUM, v); + } +#endif +#if 201103L <= YY_CPLUSPLUS + static + symbol_type + make_NAME (Expression * v) + { + return symbol_type (token::L_NAME, std::move (v)); + } +#else + static + symbol_type + make_NAME (const Expression *& v) + { + return symbol_type (token::L_NAME, v); + } +#endif +#if 201103L <= YY_CPLUSPLUS + static + symbol_type + make_FNAME (Expression * v) + { + return symbol_type (token::L_FNAME, std::move (v)); + } +#else + static + symbol_type + make_FNAME (const Expression *& v) + { + return symbol_type (token::L_FNAME, v); + } +#endif +#if 201103L <= YY_CPLUSPLUS + static + symbol_type + make_HASPROP () + { + return symbol_type (token::L_HASPROP); + } +#else + static + symbol_type + make_HASPROP () + { + return symbol_type (token::L_HASPROP); + } +#endif +#if 201103L <= YY_CPLUSPLUS + static + symbol_type + make_JGROUP (Expression * v) + { + return symbol_type (token::L_JGROUP, std::move (v)); + } +#else + static + symbol_type + make_JGROUP (const Expression *& v) + { + return symbol_type (token::L_JGROUP, v); + } +#endif +#if 201103L <= YY_CPLUSPLUS + static + symbol_type + make_JPARENT (Expression * v) + { + return symbol_type (token::L_JPARENT, std::move (v)); + } +#else + static + symbol_type + make_JPARENT (const Expression *& v) + { + return symbol_type (token::L_JPARENT, v); + } +#endif +#if 201103L <= YY_CPLUSPLUS + static + symbol_type + make_QSTR (Expression * v) + { + return symbol_type (token::L_QSTR, std::move (v)); + } +#else + static + symbol_type + make_QSTR (const Expression *& v) + { + return symbol_type (token::L_QSTR, v); + } +#endif +#if 201103L <= YY_CPLUSPLUS + static + symbol_type + make_FILEIOVFD (Expression * v) + { + return symbol_type (token::L_FILEIOVFD, std::move (v)); + } +#else + static + symbol_type + make_FILEIOVFD (const Expression *& v) + { + return symbol_type (token::L_FILEIOVFD, v); + } +#endif +#if 201103L <= YY_CPLUSPLUS + static + symbol_type + make_IN () + { + return symbol_type (token::L_IN); + } +#else + static + symbol_type + make_IN () + { + return symbol_type (token::L_IN); + } +#endif +#if 201103L <= YY_CPLUSPLUS + static + symbol_type + make_SOME () + { + return symbol_type (token::L_SOME); + } +#else + static + symbol_type + make_SOME () + { + return symbol_type (token::L_SOME); + } +#endif +#if 201103L <= YY_CPLUSPLUS + static + symbol_type + make_ORDR () + { + return symbol_type (token::L_ORDR); + } +#else + static + symbol_type + make_ORDR () + { + return symbol_type (token::L_ORDR); + } +#endif +#if 201103L <= YY_CPLUSPLUS + static + symbol_type + make_COMMA () + { + return symbol_type (token::L_COMMA); + } +#else + static + symbol_type + make_COMMA () + { + return symbol_type (token::L_COMMA); + } +#endif +#if 201103L <= YY_CPLUSPLUS + static + symbol_type + make_QWE () + { + return symbol_type (token::L_QWE); + } +#else + static + symbol_type + make_QWE () + { + return symbol_type (token::L_QWE); + } +#endif +#if 201103L <= YY_CPLUSPLUS + static + symbol_type + make_COLON () + { + return symbol_type (token::L_COLON); + } +#else + static + symbol_type + make_COLON () + { + return symbol_type (token::L_COLON); + } +#endif +#if 201103L <= YY_CPLUSPLUS + static + symbol_type + make_AND () + { + return symbol_type (token::L_AND); + } +#else + static + symbol_type + make_AND () + { + return symbol_type (token::L_AND); + } +#endif +#if 201103L <= YY_CPLUSPLUS + static + symbol_type + make_OR () + { + return symbol_type (token::L_OR); + } +#else + static + symbol_type + make_OR () + { + return symbol_type (token::L_OR); + } +#endif +#if 201103L <= YY_CPLUSPLUS + static + symbol_type + make_EQV () + { + return symbol_type (token::L_EQV); + } +#else + static + symbol_type + make_EQV () + { + return symbol_type (token::L_EQV); + } +#endif +#if 201103L <= YY_CPLUSPLUS + static + symbol_type + make_NEQV () + { + return symbol_type (token::L_NEQV); + } +#else + static + symbol_type + make_NEQV () + { + return symbol_type (token::L_NEQV); + } +#endif +#if 201103L <= YY_CPLUSPLUS + static + symbol_type + make_BITAND () + { + return symbol_type (token::L_BITAND); + } +#else + static + symbol_type + make_BITAND () + { + return symbol_type (token::L_BITAND); + } +#endif +#if 201103L <= YY_CPLUSPLUS + static + symbol_type + make_BITOR () + { + return symbol_type (token::L_BITOR); + } +#else + static + symbol_type + make_BITOR () + { + return symbol_type (token::L_BITOR); + } +#endif +#if 201103L <= YY_CPLUSPLUS + static + symbol_type + make_BITXOR () + { + return symbol_type (token::L_BITXOR); + } +#else + static + symbol_type + make_BITXOR () + { + return symbol_type (token::L_BITXOR); + } +#endif +#if 201103L <= YY_CPLUSPLUS + static + symbol_type + make_EQ () + { + return symbol_type (token::L_EQ); + } +#else + static + symbol_type + make_EQ () + { + return symbol_type (token::L_EQ); + } +#endif +#if 201103L <= YY_CPLUSPLUS + static + symbol_type + make_NE () + { + return symbol_type (token::L_NE); + } +#else + static + symbol_type + make_NE () + { + return symbol_type (token::L_NE); + } +#endif +#if 201103L <= YY_CPLUSPLUS + static + symbol_type + make_LT () + { + return symbol_type (token::L_LT); + } +#else + static + symbol_type + make_LT () + { + return symbol_type (token::L_LT); + } +#endif +#if 201103L <= YY_CPLUSPLUS + static + symbol_type + make_GT () + { + return symbol_type (token::L_GT); + } +#else + static + symbol_type + make_GT () + { + return symbol_type (token::L_GT); + } +#endif +#if 201103L <= YY_CPLUSPLUS + static + symbol_type + make_LE () + { + return symbol_type (token::L_LE); + } +#else + static + symbol_type + make_LE () + { + return symbol_type (token::L_LE); + } +#endif +#if 201103L <= YY_CPLUSPLUS + static + symbol_type + make_GE () + { + return symbol_type (token::L_GE); + } +#else + static + symbol_type + make_GE () + { + return symbol_type (token::L_GE); + } +#endif +#if 201103L <= YY_CPLUSPLUS + static + symbol_type + make_LS () + { + return symbol_type (token::L_LS); + } +#else + static + symbol_type + make_LS () + { + return symbol_type (token::L_LS); + } +#endif +#if 201103L <= YY_CPLUSPLUS + static + symbol_type + make_RS () + { + return symbol_type (token::L_RS); + } +#else + static + symbol_type + make_RS () + { + return symbol_type (token::L_RS); + } +#endif +#if 201103L <= YY_CPLUSPLUS + static + symbol_type + make_ADD () + { + return symbol_type (token::L_ADD); + } +#else + static + symbol_type + make_ADD () + { + return symbol_type (token::L_ADD); + } +#endif +#if 201103L <= YY_CPLUSPLUS + static + symbol_type + make_MINUS () + { + return symbol_type (token::L_MINUS); + } +#else + static + symbol_type + make_MINUS () + { + return symbol_type (token::L_MINUS); + } +#endif +#if 201103L <= YY_CPLUSPLUS + static + symbol_type + make_MUL () + { + return symbol_type (token::L_MUL); + } +#else + static + symbol_type + make_MUL () + { + return symbol_type (token::L_MUL); + } +#endif +#if 201103L <= YY_CPLUSPLUS + static + symbol_type + make_DIV () + { + return symbol_type (token::L_DIV); + } +#else + static + symbol_type + make_DIV () + { + return symbol_type (token::L_DIV); + } +#endif +#if 201103L <= YY_CPLUSPLUS + static + symbol_type + make_REM () + { + return symbol_type (token::L_REM); + } +#else + static + symbol_type + make_REM () + { + return symbol_type (token::L_REM); + } +#endif +#if 201103L <= YY_CPLUSPLUS + static + symbol_type + make_DEG () + { + return symbol_type (token::L_DEG); + } +#else + static + symbol_type + make_DEG () + { + return symbol_type (token::L_DEG); + } +#endif +#if 201103L <= YY_CPLUSPLUS + static + symbol_type + make_NOT () + { + return symbol_type (token::L_NOT); + } +#else + static + symbol_type + make_NOT () + { + return symbol_type (token::L_NOT); + } +#endif +#if 201103L <= YY_CPLUSPLUS + static + symbol_type + make_BITNOT () + { + return symbol_type (token::L_BITNOT); + } +#else + static + symbol_type + make_BITNOT () + { + return symbol_type (token::L_BITNOT); + } +#endif + + + private: +#if YY_CPLUSPLUS < 201103L + /// Non copyable. + Parser (const Parser&); + /// Non copyable. + Parser& operator= (const Parser&); +#endif + + + /// Stored state numbers (used for stacks). + typedef signed char state_type; + + /// Compute post-reduction state. + /// \param yystate the current state + /// \param yysym the nonterminal to push on the stack + static state_type yy_lr_goto_state_ (state_type yystate, int yysym); + + /// Whether the given \c yypact_ value indicates a defaulted state. + /// \param yyvalue the value to check + static bool yy_pact_value_is_default_ (int yyvalue); + + /// Whether the given \c yytable_ value indicates a syntax error. + /// \param yyvalue the value to check + static bool yy_table_value_is_error_ (int yyvalue); + + static const signed char yypact_ninf_; + static const signed char yytable_ninf_; + + /// Convert a scanner token kind \a t to a symbol kind. + /// In theory \a t should be a token_kind_type, but character literals + /// are valid, yet not members of the token_type enum. + static symbol_kind_type yytranslate_ (int t); + +#if YYDEBUG || 0 + /// For a symbol, its name in clear. + static const char* const yytname_[]; +#endif // #if YYDEBUG || 0 + + + // Tables. + // YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing + // STATE-NUM. + static const short yypact_[]; + + // 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 signed char yydefact_[]; + + // YYPGOTO[NTERM-NUM]. + static const signed char yypgoto_[]; + + // YYDEFGOTO[NTERM-NUM]. + static const signed char yydefgoto_[]; + + // 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 signed char yytable_[]; + + static const signed char yycheck_[]; + + // YYSTOS[STATE-NUM] -- The (internal number of the) accessing + // symbol of state STATE-NUM. + static const signed char yystos_[]; + + // YYR1[YYN] -- Symbol number of symbol that rule YYN derives. + static const signed char yyr1_[]; + + // YYR2[YYN] -- Number of symbols on the right hand side of rule YYN. + static const signed char yyr2_[]; + + +#if YYDEBUG + // YYRLINE[YYN] -- Source line where rule number YYN was defined. + static const unsigned char yyrline_[]; + /// Report on the debug stream that the rule \a r is going to be reduced. + virtual void yy_reduce_print_ (int r) const; + /// Print the state stack on the debug stream. + virtual void yy_stack_print_ () const; + + /// Debugging level. + int yydebug_; + /// Debug stream. + std::ostream* yycdebug_; + + /// \brief Display a symbol kind, value and location. + /// \param yyo The output stream. + /// \param yysym The symbol. + template <typename Base> + void yy_print_ (std::ostream& yyo, const basic_symbol<Base>& yysym) const; +#endif + + /// \brief Reclaim the memory associated to a symbol. + /// \param yymsg Why this token is reclaimed. + /// If null, print nothing. + /// \param yysym The symbol. + template <typename Base> + void yy_destroy_ (const char* yymsg, basic_symbol<Base>& yysym) const; + + private: + /// Type access provider for state based symbols. + struct by_state + { + /// Default constructor. + by_state () YY_NOEXCEPT; + + /// The symbol kind as needed by the constructor. + typedef state_type kind_type; + + /// Constructor. + by_state (kind_type s) YY_NOEXCEPT; + + /// Copy constructor. + by_state (const by_state& that) YY_NOEXCEPT; + + /// Record that this symbol is empty. + void clear () YY_NOEXCEPT; + + /// Steal the symbol kind from \a that. + void move (by_state& that); + + /// The symbol kind (corresponding to \a state). + /// \a symbol_kind::S_YYEMPTY when empty. + symbol_kind_type kind () const YY_NOEXCEPT; + + /// The state number used to denote an empty symbol. + /// We use the initial state, as it does not have a value. + enum { empty_state = 0 }; + + /// The state. + /// \a empty when empty. + state_type state; + }; + + /// "Internal" symbol: element of the stack. + struct stack_symbol_type : basic_symbol<by_state> + { + /// Superclass. + typedef basic_symbol<by_state> super_type; + /// Construct an empty symbol. + stack_symbol_type (); + /// Move or copy construction. + stack_symbol_type (YY_RVREF (stack_symbol_type) that); + /// Steal the contents from \a sym to build this. + stack_symbol_type (state_type s, YY_MOVE_REF (symbol_type) sym); +#if YY_CPLUSPLUS < 201103L + /// Assignment, needed by push_back by some old implementations. + /// Moves the contents of that. + stack_symbol_type& operator= (stack_symbol_type& that); + + /// Assignment, needed by push_back by other implementations. + /// Needed by some other old implementations. + stack_symbol_type& operator= (const stack_symbol_type& that); +#endif + }; + + /// A stack with random access from its top. + template <typename T, typename S = std::vector<T> > + class stack + { + public: + // Hide our reversed order. + typedef typename S::iterator iterator; + typedef typename S::const_iterator const_iterator; + typedef typename S::size_type size_type; + typedef typename std::ptrdiff_t index_type; + + stack (size_type n = 200) + : seq_ (n) + {} + +#if 201103L <= YY_CPLUSPLUS + /// Non copyable. + stack (const stack&) = delete; + /// Non copyable. + stack& operator= (const stack&) = delete; +#endif + + /// Random access. + /// + /// Index 0 returns the topmost element. + const T& + operator[] (index_type i) const + { + return seq_[size_type (size () - 1 - i)]; + } + + /// Random access. + /// + /// Index 0 returns the topmost element. + T& + operator[] (index_type i) + { + return seq_[size_type (size () - 1 - i)]; + } + + /// Steal the contents of \a t. + /// + /// Close to move-semantics. + void + push (YY_MOVE_REF (T) t) + { + seq_.push_back (T ()); + operator[] (0).move (t); + } + + /// Pop elements from the stack. + void + pop (std::ptrdiff_t n = 1) YY_NOEXCEPT + { + for (; 0 < n; --n) + seq_.pop_back (); + } + + /// Pop all elements from the stack. + void + clear () YY_NOEXCEPT + { + seq_.clear (); + } + + /// Number of elements on the stack. + index_type + size () const YY_NOEXCEPT + { + return index_type (seq_.size ()); + } + + /// Iterator on top of the stack (going downwards). + const_iterator + begin () const YY_NOEXCEPT + { + return seq_.begin (); + } + + /// Bottom of the stack. + const_iterator + end () const YY_NOEXCEPT + { + return seq_.end (); + } + + /// Present a slice of the top of a stack. + class slice + { + public: + slice (const stack& stack, index_type range) + : stack_ (stack) + , range_ (range) + {} + + const T& + operator[] (index_type i) const + { + return stack_[range_ - i]; + } + + private: + const stack& stack_; + index_type range_; + }; + + private: +#if YY_CPLUSPLUS < 201103L + /// Non copyable. + stack (const stack&); + /// Non copyable. + stack& operator= (const stack&); +#endif + /// The wrapped container. + S seq_; + }; + + + /// Stack type. + typedef stack<stack_symbol_type> stack_type; + + /// The stack. + stack_type yystack_; + + /// Push a new state on the stack. + /// \param m a debug message to display + /// if null, no trace is output. + /// \param sym the symbol + /// \warning the contents of \a s.value is stolen. + void yypush_ (const char* m, YY_MOVE_REF (stack_symbol_type) sym); + + /// Push a new look ahead token on the state on the stack. + /// \param m a debug message to display + /// if null, no trace is output. + /// \param s the state + /// \param sym the symbol (for its value and location). + /// \warning the contents of \a sym.value is stolen. + void yypush_ (const char* m, state_type s, YY_MOVE_REF (symbol_type) sym); + + /// Pop \a n symbols from the stack. + void yypop_ (int n = 1); + + /// Constants. + enum + { + yylast_ = 279, ///< Last index in yytable_. + yynnts_ = 4, ///< Number of nonterminal symbols. + yyfinal_ = 24 ///< Termination state number. + }; + + + // User arguments. + QL::Result &result; + + }; + + inline + Parser::symbol_kind_type + Parser::yytranslate_ (int t) + { + // YYTRANSLATE[TOKEN-NUM] -- Symbol number corresponding to + // TOKEN-NUM as returned by yylex. + static + const signed char + translate_table[] = + { + 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 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 + }; + // Last valid token kind. + const int code_max = 317; + + if (t <= 0) + return symbol_kind::S_YYEOF; + else if (t <= code_max) + return YY_CAST (symbol_kind_type, translate_table[t]); + else + return symbol_kind::S_YYUNDEF; + } + + // basic_symbol. + template <typename Base> + Parser::basic_symbol<Base>::basic_symbol (const basic_symbol& that) + : Base (that) + , value () + { + switch (this->kind ()) + { + case symbol_kind::S_NUM: // "number" + case symbol_kind::S_NAME: // "name" + case symbol_kind::S_FNAME: // FNAME + case symbol_kind::S_JGROUP: // JGROUP + case symbol_kind::S_JPARENT: // JPARENT + case symbol_kind::S_QSTR: // QSTR + case symbol_kind::S_FILEIOVFD: // FILEIOVFD + case symbol_kind::S_exp: // exp + case symbol_kind::S_term: // term + value.copy< Expression * > (YY_MOVE (that.value)); + break; + + default: + break; + } + + } + + + + template <typename Base> + Parser::symbol_kind_type + Parser::basic_symbol<Base>::type_get () const YY_NOEXCEPT + { + return this->kind (); + } + + template <typename Base> + bool + Parser::basic_symbol<Base>::empty () const YY_NOEXCEPT + { + return this->kind () == symbol_kind::S_YYEMPTY; + } + + template <typename Base> + void + Parser::basic_symbol<Base>::move (basic_symbol& s) + { + super_type::move (s); + switch (this->kind ()) + { + case symbol_kind::S_NUM: // "number" + case symbol_kind::S_NAME: // "name" + case symbol_kind::S_FNAME: // FNAME + case symbol_kind::S_JGROUP: // JGROUP + case symbol_kind::S_JPARENT: // JPARENT + case symbol_kind::S_QSTR: // QSTR + case symbol_kind::S_FILEIOVFD: // FILEIOVFD + case symbol_kind::S_exp: // exp + case symbol_kind::S_term: // term + value.move< Expression * > (YY_MOVE (s.value)); + break; + + default: + break; + } + + } + + // by_kind. + inline + Parser::by_kind::by_kind () + : kind_ (symbol_kind::S_YYEMPTY) + {} + +#if 201103L <= YY_CPLUSPLUS + inline + Parser::by_kind::by_kind (by_kind&& that) + : kind_ (that.kind_) + { + that.clear (); + } +#endif + + inline + Parser::by_kind::by_kind (const by_kind& that) + : kind_ (that.kind_) + {} + + inline + Parser::by_kind::by_kind (token_kind_type t) + : kind_ (yytranslate_ (t)) + {} + + inline + void + Parser::by_kind::clear () YY_NOEXCEPT + { + kind_ = symbol_kind::S_YYEMPTY; + } + + inline + void + Parser::by_kind::move (by_kind& that) + { + kind_ = that.kind_; + that.clear (); + } + + inline + Parser::symbol_kind_type + Parser::by_kind::kind () const YY_NOEXCEPT + { + return kind_; + } + + inline + Parser::symbol_kind_type + Parser::by_kind::type_get () const YY_NOEXCEPT + { + return this->kind (); + } + +#line 50 "QLParser.yy" +} // QL +#line 2034 "QLParser.tab.hh" + + + + +#endif // !YY_YY_QLPARSER_TAB_HH_INCLUDED |