lyb-PW6/include/AST/SyntaxTree.h

#ifndef _SYSYF_SYNTAX_TREE_H_
#define _SYSYF_SYNTAX_TREE_H_

#include <vector>
#include <memory>
#include <string>

#include "location.hh"
#include "internal_types.h"

namespace SysYF 
{
namespace SyntaxTree
{

using Position = yy::location;

// Enumerations
enum class Type
{
    INT = 0,
    VOID,
    STRING,
    BOOL,
    FLOAT
};

enum class BinOp
{
    PLUS = 0,
    MINUS,
    MULTIPLY,
    DIVIDE,
    MODULO
};

enum class UnaryOp
{
    PLUS = 0,
    MINUS
};

enum class UnaryCondOp
{
    NOT = 0
};

enum class BinaryCondOp
{
    LT = 0,
    LTE,
    GT,
    GTE,
    EQ,
    NEQ,
    LAND,
    LOR
};

// Forward declaration
struct Node;
struct Assembly;
struct GlobalDef;
struct FuncDef;

struct Expr;
struct CondExpr;
struct AddExpr;
struct BinaryExpr;
struct BinaryCondExpr;
struct UnaryCondExpr;
struct UnaryExpr;
struct LVal;
struct Literal;

struct Stmt;
struct VarDef;
struct AssignStmt;
struct FuncCallStmt;
struct ReturnStmt;
struct BlockStmt;
struct EmptyStmt;
struct ExprStmt;

struct FuncParam;
struct FuncFParamList;

struct IfStmt;
struct WhileStmt;
struct BreakStmt;
struct ContinueStmt;
struct InitVal;

class Visitor;

// Virtual base of all kinds of syntax tree nodes.
struct Node
{
    Position loc;
    // Used in Visitor. Irrelevant to syntax tree generation.
    virtual void accept(Visitor &visitor) = 0;
};

//node for initial value
struct InitVal: Node{
    bool isExp;
    PtrVec<InitVal> elementList;
    Ptr<Expr> expr;
    void accept(Visitor &visitor) final;
};

// Root node of an ordinary syntax tree.
struct Assembly : Node
{
    PtrVec<GlobalDef> global_defs;
    void accept(Visitor &visitor) final;
};

// Virtual base of global definitions, function or variable one.
struct GlobalDef : virtual Node
{
    void accept(Visitor &visitor) override = 0;
};

// Function definition.
struct FuncDef : GlobalDef
{
    Type ret_type;
    Ptr<FuncFParamList> param_list;
    std::string name;
    Ptr<BlockStmt> body;
    void accept(Visitor &visitor) final;
};

// Virtual base for statements.
struct Stmt : virtual Node
{
    void accept(Visitor &visitor) override = 0;
};

// Variable definition. Multiple of this would be both a statement and a global definition; however, itself only
// represents a single variable definition.
struct VarDef : Stmt, GlobalDef
{
    bool is_constant;
    Type btype;
    std::string name;
    bool is_inited; // This is used to verify `{}`
    PtrVec<Expr> array_length; // empty for non-array variables
    Ptr<InitVal> initializers;
    void accept(Visitor &visitor) final;
};

// Assignment statement.
struct AssignStmt : Stmt
{
    Ptr<LVal> target;
    Ptr<Expr> value;
    void accept(Visitor &visitor) final;
};

// Return statement.
struct ReturnStmt : Stmt
{
    Ptr<Expr> ret;  // nullptr for void return
    void accept(Visitor &visitor) final;
};

// BlockStmt statement.
struct BlockStmt : Stmt
{
    PtrVec<Stmt> body;
    void accept(Visitor &visitor) final;
};

// Empty statement (aka a single ';').
struct EmptyStmt : Stmt
{
    void accept(Visitor &visitor) final;
};

struct ExprStmt : Stmt
{
    Ptr<Expr> exp;
    void accept(Visitor &visitor) final;
};

// Virtual base of expressions.
struct Expr : Node
{
    void accept(Visitor &visitor) override = 0;
};

struct CondExpr : Expr
{
    void accept(Visitor &visitor) override = 0;
};

struct AddExpr : Expr
{
    void accept(Visitor &visitor) override = 0;
};


struct UnaryCondExpr : CondExpr{
    UnaryCondOp op;
    Ptr<Expr> rhs;
    void accept(Visitor &visitor) final;
};

struct BinaryCondExpr : CondExpr{
    BinaryCondOp op;
    Ptr<Expr> lhs,rhs;
    void accept(Visitor &visitor) final;
};

// Expression like `lhs op rhs`.
struct BinaryExpr : AddExpr
{
    BinOp op;
    Ptr<Expr> lhs, rhs;
    void accept(Visitor &visitor) final;
};

// Expression like `op rhs`.
struct UnaryExpr : AddExpr
{
    UnaryOp op;
    Ptr<Expr> rhs;
    void accept(Visitor &visitor) final;
};

// Expression like `ident` or `ident[exp]`.
struct LVal : AddExpr
{
    std::string name;
    PtrVec<Expr> array_index; // nullptr if not indexed as array
    void accept(Visitor &visitor) final;
};

// Expression constructed by a literal number.
struct Literal : AddExpr
{
    Type literal_type;
    int int_const;
    // std::string str;
    double float_const;
    void accept(Visitor &visitor) final;
};

// Function call statement.
struct FuncCallStmt : AddExpr
{
    std::string name;
    PtrVec<Expr> params;
    void accept(Visitor &visitor) final;
};

struct FuncParam : Node
{
    std::string name;
    Type param_type;
    PtrVec<Expr> array_index; // nullptr if not indexed as array
    void accept(Visitor &visitor) final;
};

struct FuncFParamList : Node
{
    PtrVec<FuncParam> params;
    void accept(Visitor &visitor) final;
};

struct IfStmt : Stmt
{
    Ptr<Expr> cond_exp;
    Ptr<Stmt> if_statement;
    Ptr<Stmt> else_statement;
    void accept(Visitor &visitor) final;
};

struct WhileStmt : Stmt
{
    Ptr<Expr> cond_exp;
    Ptr<Stmt> statement;
    void accept(Visitor &visitor) final;
};

struct BreakStmt : Stmt
{
    void accept(Visitor &visitor) final;
};

struct ContinueStmt : Stmt
{
    void accept(Visitor &visitor) final;
};

// Visitor base type
class Visitor
{
public:
    virtual void visit(Assembly &node) = 0;
    virtual void visit(FuncDef &node) = 0;
    virtual void visit(BinaryExpr &node) = 0;
    virtual void visit(UnaryExpr &node) = 0;
    virtual void visit(LVal &node) = 0;
    virtual void visit(Literal &node) = 0;
    virtual void visit(ReturnStmt &node) = 0;
    virtual void visit(VarDef &node) = 0;
    virtual void visit(AssignStmt &node) = 0;
    virtual void visit(FuncCallStmt &node) = 0;
    virtual void visit(BlockStmt &node) = 0;
    virtual void visit(EmptyStmt &node) = 0;
    virtual void visit(ExprStmt &node) = 0;
    virtual void visit(FuncParam &node) = 0;
    virtual void visit(FuncFParamList &node) = 0;
    virtual void visit(IfStmt &node) = 0;
    virtual void visit(WhileStmt &node) = 0;
    virtual void visit(BreakStmt &node) = 0;
    virtual void visit(ContinueStmt &node) = 0;
    virtual void visit(UnaryCondExpr &node) = 0;
    virtual void visit(BinaryCondExpr &node) = 0;
    virtual void visit(InitVal &node) = 0;
};

} 
}

#endif // _SYSYF_SYNTAX_TREE_H_