// A Bison parser, made by GNU Bison 3.3.2. // Skeleton interface for Bison LALR(1) parsers in C++ // Copyright (C) 2002-2015, 2018-2019 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 . // 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 ../header/RSParserImpl.h ** Define the ccl::rslang::detail::parser class. */ // C++ LALR(1) parser skeleton written by Akim Demaille. // Undocumented macros, especially those whose name start with YY_, // are private implementation details. Do not rely on them. #ifndef YY_YY_HEADER_RSPARSERIMPL_H_INCLUDED # define YY_YY_HEADER_RSPARSERIMPL_H_INCLUDED // // "%code requires" blocks. #line 36 "RSParserImpl.y" // lalr1.cc:401 #include "ccl/rslang/SyntaxTree.h" #include "ccl/rslang/ParserState.hpp" namespace ccl::rslang::detail { #define YYSTYPE RawNode struct ParserState; RawNode AddNode(TokenID token, RawNode son); RawNode AddNode(TokenID token, RawNode son1, RawNode son2); RawNode BinaryOperation(RawNode op1, RawNode operation, RawNode op2); RawNode UnaryOperation(RawNode operation, RawNode operand); RawNode RemoveBrackets(RawNode br1, RawNode operand, RawNode br2); RawNode ReplaceBrackets(TokenID token, RawNode br1, RawNode argList, RawNode br2); RawNode Enumeration(TokenID token, RawNode el1, RawNode el2); RawNode Decartian(RawNode op1, RawNode decart, RawNode op2); RawNode Quantifier(RawNode quant, RawNode declaration, RawNode domain, RawNode predicate); RawNode FunctionDeclaration(RawNode start, RawNode argdecl, RawNode expr); RawNode FunctionCall(RawNode function, RawNode args, RawNode rs); RawNode FilterCall(RawNode filter, RawNode params, RawNode argument, RawNode rp); RawNode TextOperator(RawNode oper, RawNode args, RawNode rp); RawNode TermDeclaration(RawNode lc, RawNode declaration, RawNode domain, RawNode predicate, RawNode rc); RawNode FullRecursion(RawNode rec, RawNode localid, RawNode domain, RawNode condition, RawNode iteration, RawNode rc); RawNode ShortRecursion(RawNode rec, RawNode localid, RawNode domain, RawNode iteration, RawNode rc); RawNode Imperative(RawNode imp, RawNode value, RawNode actions, RawNode rc); int yylex(RawNode* yylval, ParserState* state); } // namespace ccl::rslang::detail #line 83 "../header/RSParserImpl.h" // lalr1.cc:401 # include # include // std::abort # include # include # include # include #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 #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 /* 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__ && ! 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 # 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 11 "RSParserImpl.y" // lalr1.cc:401 namespace ccl { namespace rslang { namespace detail { #line 194 "../header/RSParserImpl.h" // lalr1.cc:401 /// A Bison parser. class RSParserImpl { public: #ifndef YYSTYPE /// Symbol semantic values. typedef int semantic_type; #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; }; /// Tokens. struct token { enum yytokentype { RST_LOCAL = 258, RST_GLOBAL = 259, RST_FUNCTION = 260, RST_PREDICATE = 261, RST_RADICAL = 262, RST_INTEGER = 263, RST_INFINITY = 264, RST_EMPTYSET = 265, RST_PLUS = 266, RST_MINUS = 267, RST_MULTIPLY = 268, RST_GREATER = 269, RST_LESSER = 270, RST_GREATER_OR_EQ = 271, RST_LESSER_OR_EQ = 272, RST_EQUAL = 273, RST_NOTEQUAL = 274, RST_FORALL = 275, RST_EXISTS = 276, RST_NOT = 277, RST_EQUIVALENT = 278, RST_IMPLICATION = 279, RST_OR = 280, RST_AND = 281, RST_IN = 282, RST_NOTIN = 283, RST_SUBSET = 284, RST_SUBOR_EQ = 285, RST_NOTSUBSET = 286, RST_DECART = 287, RST_UNION = 288, RST_INTERSECTION = 289, RST_SET_MINUS = 290, RST_SYMMINUS = 291, RST_BOOLEAN = 292, RST_BIGPR = 293, RST_SMALLPR = 294, RST_FILTER = 295, RST_CARD = 296, RST_BOOL = 297, RST_DEBOOL = 298, RST_RED = 299, RST_DECLARATIVE = 300, RST_RECURSIVE = 301, RST_IMPERATIVE = 302, RST_DEFINE = 303, RST_STRUCT = 304, RST_ASSIGN = 305, RST_ITERATE = 306, RST_LP = 307, RST_RP = 308, RST_LC = 309, RST_RC = 310, RST_LS = 311, RST_RS = 312, RST_BAR = 313, RST_COMMA = 314, RST_SEMICOLON = 315 }; }; /// (External) token type, as returned by yylex. typedef token::yytokentype token_type; /// Symbol type: an internal symbol number. typedef int symbol_number_type; /// The symbol type number to denote an empty symbol. enum { empty_symbol = -2 }; /// Internal symbol number for tokens (subsumed by symbol_number_type). typedef unsigned char token_number_type; /// A complete symbol. /// /// Expects its Base type to provide access to the symbol type /// via type_get (). /// /// Provide access to semantic value. template 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); #endif /// Copy constructor. basic_symbol (const basic_symbol& that); /// Constructor for valueless symbols. basic_symbol (typename Base::kind_type t); /// Constructor for symbols with semantic value. basic_symbol (typename Base::kind_type t, YY_RVREF (semantic_type) v); /// Destroy the symbol. ~basic_symbol () { clear (); } /// Destroy contents, and record that is empty. void clear () { Base::clear (); } /// 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_type { /// Default constructor. by_type (); #if 201103L <= YY_CPLUSPLUS /// Move constructor. by_type (by_type&& that); #endif /// Copy constructor. by_type (const by_type& that); /// The symbol type as needed by the constructor. typedef token_type kind_type; /// Constructor from (external) token numbers. by_type (kind_type t); /// Record that this symbol is empty. void clear (); /// Steal the symbol type from \a that. void move (by_type& that); /// The (internal) type number (corresponding to \a type). /// \a empty when empty. symbol_number_type type_get () const YY_NOEXCEPT; /// The token. token_type token () const YY_NOEXCEPT; /// The symbol type. /// \a empty_symbol when empty. /// An int, not token_number_type, to be able to store empty_symbol. int type; }; /// "External" symbols: returned by the scanner. struct symbol_type : basic_symbol {}; /// Build a parser object. RSParserImpl (ParserState* state_yyarg); virtual ~RSParserImpl (); /// 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); private: /// This class is not copyable. RSParserImpl (const RSParserImpl&); RSParserImpl& operator= (const RSParserImpl&); /// State numbers. typedef int state_type; /// Generate an error message. /// \param yystate the state where the error occurred. /// \param yyla the lookahead token. virtual std::string yysyntax_error_ (state_type yystate, const symbol_type& yyla) const; /// Compute post-reduction state. /// \param yystate the current state /// \param yysym the nonterminal to push on the stack 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 number \a t to a symbol number. static token_number_type yytranslate_ (int t); // 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 unsigned char yydefact_[]; // YYPGOTO[NTERM-NUM]. static const short yypgoto_[]; // YYDEFGOTO[NTERM-NUM]. static const short 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 short yytable_[]; static const short yycheck_[]; // YYSTOS[STATE-NUM] -- The (internal number of the) accessing // symbol of state STATE-NUM. static const unsigned char yystos_[]; // YYR1[YYN] -- Symbol number of symbol that rule YYN derives. static const unsigned char yyr1_[]; // YYR2[YYN] -- Number of symbols on the right hand side of rule YYN. static const unsigned char yyr2_[]; /// Convert the symbol name \a n to a form suitable for a diagnostic. static std::string yytnamerr_ (const char *n); /// For a symbol, its name in clear. static const char* const yytname_[]; #if YYDEBUG // YYRLINE[YYN] -- Source line where rule number YYN was defined. static const unsigned short yyrline_[]; /// Report on the debug stream that the rule \a r is going to be reduced. virtual void yy_reduce_print_ (int r); /// Print the state stack on the debug stream. virtual void yystack_print_ (); /// Debugging level. int yydebug_; /// Debug stream. std::ostream* yycdebug_; /// \brief Display a symbol type, value and location. /// \param yyo The output stream. /// \param yysym The symbol. template void yy_print_ (std::ostream& yyo, const basic_symbol& 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 void yy_destroy_ (const char* yymsg, basic_symbol& yysym) const; private: /// Type access provider for state based symbols. struct by_state { /// Default constructor. by_state () YY_NOEXCEPT; /// The symbol type 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 type from \a that. void move (by_state& that); /// The (internal) type number (corresponding to \a state). /// \a empty_symbol when empty. symbol_number_type type_get () const YY_NOEXCEPT; /// The state number used to denote an empty symbol. enum { empty_state = -1 }; /// The state. /// \a empty when empty. state_type state; }; /// "Internal" symbol: element of the stack. struct stack_symbol_type : basic_symbol { /// Superclass. typedef basic_symbol 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); #endif }; /// A stack with random access from its top. template > class stack { public: // Hide our reversed order. typedef typename S::reverse_iterator iterator; typedef typename S::const_reverse_iterator const_iterator; typedef typename S::size_type size_type; stack (size_type n = 200) : seq_ (n) {} /// Random access. /// /// Index 0 returns the topmost element. T& operator[] (size_type i) { return seq_[size () - 1 - i]; } /// Random access. /// /// Index 0 returns the topmost element. T& operator[] (int i) { return operator[] (size_type (i)); } /// Random access. /// /// Index 0 returns the topmost element. const T& operator[] (size_type i) const { return seq_[size () - 1 - i]; } /// Random access. /// /// Index 0 returns the topmost element. const T& operator[] (int i) const { return operator[] (size_type (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 (int 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. size_type size () const YY_NOEXCEPT { return seq_.size (); } /// Iterator on top of the stack (going downwards). const_iterator begin () const YY_NOEXCEPT { return seq_.rbegin (); } /// Bottom of the stack. const_iterator end () const YY_NOEXCEPT { return seq_.rend (); } /// Present a slice of the top of a stack. class slice { public: slice (const stack& stack, int range) : stack_ (stack) , range_ (range) {} const T& operator[] (int i) const { return stack_[range_ - i]; } private: const stack& stack_; int range_; }; private: stack (const stack&); stack& operator= (const stack&); /// The wrapped container. S seq_; }; /// Stack type. typedef stack 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 { yyeof_ = 0, yylast_ = 589, ///< Last index in yytable_. yynnts_ = 41, ///< Number of nonterminal symbols. yyfinal_ = 85, ///< Termination state number. yyterror_ = 1, yyerrcode_ = 256, yyntokens_ = 61 ///< Number of tokens. }; // User arguments. ParserState* state; }; #line 11 "RSParserImpl.y" // lalr1.cc:401 } } } // ccl::rslang::detail #line 758 "../header/RSParserImpl.h" // lalr1.cc:401 #endif // !YY_YY_HEADER_RSPARSERIMPL_H_INCLUDED