binary_expression.hpp

Go to the documentation of this file.

/*
 * Copyright 2023 Blue Brain Project, EPFL.
 * See the top-level LICENSE file for details.
 *
 * SPDX-License-Identifier: Apache-2.0
 */
 
///
/// THIS FILE IS GENERATED AT BUILD TIME AND SHALL NOT BE EDITED.
///
 
#pragma once
 
/**
 * \dir
 * \brief Auto generated AST Implementations
 *
 * \file
 * \brief Auto generated AST classes declaration
 */
 
#include "ast/ast_decl.hpp"
#include "ast/binary_operator.hpp"
#include "ast/expression.hpp"
 
namespace nmodl::ast {
 
/**
 * \addtogroup ast_class
 * \ingroup ast
 * \{
 */
 
/**
 * \brief Represents binary expression in the NMODL
 *
 * Any binary expression in the mod file is represented by this node type.
  * For example, in below example, there are three binary expressions :
  * 
  * \code{.mod}
  *     BREAKPOINT {
  *         SOLVE states METHOD cnexp
  *         ina = gna*(v - ena)
  *     }
  * \endcode
  * 
  * Note that the statement itself is stored in another type ast::ExpressionStatement.
  * 
  * \sa ast::ExpressionStatement
  * 
*/
class BinaryExpression : public Expression {
  private:
    /// LHS of the binary expression
    std::shared_ptr<Expression> lhs;
    /// Operator
    BinaryOperator op;
    /// RHS of the binary expression
    std::shared_ptr<Expression> rhs;
    /// token with location information
    std::shared_ptr<ModToken> token;
 
  public:
  /// \name Ctor & dtor
  /// \{
    explicit BinaryExpression(Expression* lhs, const BinaryOperator& op, Expression* rhs);
    explicit BinaryExpression(std::shared_ptr<Expression> lhs, const BinaryOperator& op, std::shared_ptr<Expression> rhs);
    BinaryExpression(const BinaryExpression& obj);
    virtual ~BinaryExpression() = default;
  /// \}
  
  /**
   * \brief Check if the ast node is an instance of ast::BinaryExpression
   * \return true as object is of type ast::BinaryExpression
   */
  bool is_binary_expression () const noexcept override {
    return true;
  }
 
  /**
   * \brief Return a copy of the current node
   *
   * Recursively make a new copy/clone of the current node including
   * all members and return a pointer to the node. This is used for
   * passes like nmodl::visitor::InlineVisitor where nodes are cloned in the
   * ast.
   *
   * \return pointer to the clone/copy of the current node
   */
  // NOLINTBEGIN(clang-analyzer-cplusplus.NewDeleteLeaks)
   BinaryExpression* clone() const override {
    return new BinaryExpression(*this);
  }
  // NOLINTEND(clang-analyzer-cplusplus.NewDeleteLeaks)
 
  /// \name Getters
  /// \{
 
  /**
   * \brief Return type (ast::AstNodeType) of ast node
   *
   * Every node in the ast has a type defined in ast::AstNodeType and this
   * function is used to retrieve the same.
   *
   * \return ast node type i.e. ast::AstNodeType::BINARY_EXPRESSION
   *
   * \sa Ast::get_node_type_name
   */
   AstNodeType get_node_type() const noexcept override {
    return AstNodeType::BINARY_EXPRESSION;
  }
 
  /**
   * \brief Return type (ast::AstNodeType) of ast node as std::string
   *
   * Every node in the ast has a type defined in ast::AstNodeType.
   * This type name can be returned as a std::string for printing
   * node to text/json form.
   *
   * \return name of the node type as a string i.e. "BinaryExpression"
   *
   * \sa Ast::get_node_name
   */
   std::string get_node_type_name() const noexcept override {
    return "BinaryExpression";
  }
 
 
  /**
   * \brief Get std::shared_ptr from `this` pointer of the current ast node
   */
   std::shared_ptr<Ast> get_shared_ptr() override {
    return std::static_pointer_cast<BinaryExpression>(shared_from_this());
  }
 
  /**
   * \brief Get std::shared_ptr from `this` pointer of the current ast node
   */
   std::shared_ptr<const Ast> get_shared_ptr() const override {
    return std::static_pointer_cast<const BinaryExpression>(shared_from_this());
  }
 
  /**
   * \brief Return associated token for the current ast node
   *
   * Not all ast nodes have token information. For example, nmodl::visitor::NeuronSolveVisitor
   * can insert new nodes in the ast as a solution of ODEs. In this case, we return
   * nullptr to store in the nmodl::symtab::SymbolTable.
   *
   * \return pointer to token if exist otherwise nullptr
   */
  const ModToken* get_token() const noexcept override {
    return token.get();
  }
  
  
  
  /**
   * \brief Getter for member variable \ref BinaryExpression.lhs
   */
  std::shared_ptr<Expression> get_lhs() const noexcept  {
    return lhs;
  }
  
  
  
  /**
   * \brief Getter for member variable \ref BinaryExpression.op
   */
  const BinaryOperator& get_op() const noexcept  {
    return op;
  }
  
  
  
  /**
   * \brief Getter for member variable \ref BinaryExpression.rhs
   */
  std::shared_ptr<Expression> get_rhs() const noexcept  {
    return rhs;
  }
  /// \}
 
  /// \name Setters
  /// \{
  /**
   * \brief Set token for the current ast node
   */
  void set_token(const ModToken& tok) { token = std::make_shared<ModToken>(tok); }
  
  /**
   * \brief Setter for member variable \ref BinaryExpression.lhs (rvalue reference)
   */
  void set_lhs(std::shared_ptr<Expression>&& lhs);
 
  /**
   * \brief Setter for member variable \ref BinaryExpression.lhs
   */
  void set_lhs(const std::shared_ptr<Expression>& lhs);
 
  
  /**
   * \brief Setter for member variable \ref BinaryExpression.op (rvalue reference)
   */
  void set_op(BinaryOperator&& op);
 
  /**
   * \brief Setter for member variable \ref BinaryExpression.op
   */
  void set_op(const BinaryOperator& op);
 
  
  /**
   * \brief Setter for member variable \ref BinaryExpression.rhs (rvalue reference)
   */
  void set_rhs(std::shared_ptr<Expression>&& rhs);
 
  /**
   * \brief Setter for member variable \ref BinaryExpression.rhs
   */
  void set_rhs(const std::shared_ptr<Expression>& rhs);
 
  /// \}
 
  /// \name Visitor
  /// \{
  /**
   * \brief visit children i.e. member variables of current node using provided visitor
   *
   * Different nodes in the AST have different members (i.e. children). This method
   * recursively visits children using provided visitor.
   *
   * \param v Concrete visitor that will be used to recursively visit children
   *
   * \sa Ast::visit_children for example.
   */
   void visit_children(visitor::Visitor& v) override;
 
  /**
   * \brief visit children i.e. member variables of current node using provided visitor
   *
   * Different nodes in the AST have different members (i.e. children). This method
   * recursively visits children using provided visitor.
   *
   * \param v Concrete constant visitor that will be used to recursively visit children
   *
   * \sa Ast::visit_children for example.
   */
   void visit_children(visitor::ConstVisitor& v) const override;
 
  /**
   * \brief accept (or visit) the current AST node using provided visitor
   *
   * Instead of visiting children of AST node, like Ast::visit_children,
   * accept allows to visit the current node itself using provided concrete
   * visitor.
   *
   * \param v Concrete visitor that will be used to recursively visit node
   *
   * \sa Ast::accept for example.
   */
   void accept(visitor::Visitor& v) override;
 
  /**
   * \copydoc accept(visitor::Visitor&)
   */
   void accept(visitor::ConstVisitor& v) const override;
  /// \}
 
  private:
    /**
     * \brief Set this object as parent for all the children
     *
     * This should be called in every object (with children) constructor
     * to set parents. Since it is called only in the constructors it
     * should not be virtual to avoid ambiguities (issue #295).
     */
     void set_parent_in_children();
};
 
/** \} */  // end of ast_class
 
  
  
  
 
}  // namespace nmodl::ast