clibparser/cast.h at master · bajdcc/clibparser · GitHub

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
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
//
// Project: cliblisp
// Created by bajdcc
//

#ifndef CLIBLISP_CAST_H
#define CLIBLISP_CAST_H

#include "types.h"
#include "memory.h"

#define AST_NODE_MEM (256 * 1024)
#define AST_STR_MEM (16 * 1024)

namespace clib {

    enum ast_t {
        ast_root,
        ast_collection,
        ast_keyword,
        ast_operator,
        ast_literal,
        ast_string,
        ast_char,
        ast_uchar,
        ast_short,
        ast_ushort,
        ast_int,
        ast_uint,
        ast_long,
        ast_ulong,
        ast_float,
        ast_double,
    };

    enum ast_to_t {
        to_parent,
        to_prev,
        to_next,
        to_child,
    };

    enum ast_attr_t {
        a_none,
        a_exp,
    };

    // 结点
    struct ast_node {
        // 类型
        uint16 flag;
        uint16 attr;
        int line, column;

        union {
#define DEFINE_NODE_DATA(t) LEX_T(t) _##t;
            DEFINE_NODE_DATA(char)
            DEFINE_NODE_DATA(uchar)
            DEFINE_NODE_DATA(short)
            DEFINE_NODE_DATA(ushort)
            DEFINE_NODE_DATA(int)
            DEFINE_NODE_DATA(uint)
            DEFINE_NODE_DATA(long)
            DEFINE_NODE_DATA(ulong)
            DEFINE_NODE_DATA(float)
            DEFINE_NODE_DATA(double)
#undef DEFINE_NODE_DATA
            const char *_string;
            const char *_identifier;
            keyword_t _keyword;
            operator_t _op;
            coll_t _coll;
            struct {
                uint _1, _2;
            } _ins;
        } data; // 数据

        // 树型数据结构，广义表
        ast_node *parent; // 父亲
        ast_node *prev; // 左兄弟
        ast_node *next; // 右兄弟
        ast_node *child; // 最左儿子
    };

    class cast {
    public:
        cast();
        ~cast() = default;

        cast(const cast &) = delete;
        cast &operator=(const cast &) = delete;

        ast_node *get_root() const;

        ast_node *new_node(ast_t type);
        ast_node *new_child(ast_t type, bool step = true);
        ast_node *new_sibling(ast_t type, bool step = true);

        void remove(ast_node*);

        ast_node *add_child(ast_node*);
        static ast_node *set_child(ast_node*, ast_node*);
        static ast_node *set_sibling(ast_node*, ast_node*);
        static int children_size(ast_node*);

        void set_str(ast_node *node, const string_t &str);
        static std::string display_str(const char *str);

        void to(ast_to_t type);

        static void print(ast_node *node, int level, std::ostream &os);
        static string_t to_string(ast_node *node);
        static const string_t &ast_str(ast_t type);
        static bool ast_equal(ast_t type, lexer_t lex);
        static int ast_prior(ast_t type);
        static lexer_t ast_lexer(ast_t type);

        static void unlink(ast_node *node);

        static ast_node *index(ast_node *node, int index);
        static ast_node *index(ast_node *node, const string_t &index);

        void reset();
    private:
        void init();

        void error(const string_t &);

    private:
        memory_pool<AST_NODE_MEM> nodes; // 全局AST结点内存管理
        memory_pool<AST_STR_MEM> strings; // 全局字符串管理
        ast_node *root; // 根结点
        ast_node *current; // 当前结点
    };
}

#endif //CLIBLISP_CAST_H