blob: 852593bfcf3886adb3bb5b61178a713c7abe42cf (
plain)
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
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
|
#include <cassert>
#include "ast.hpp"
namespace parserlib {
//current AST container.
static ast_container* _current = 0;
int ast_type_id = 0;
traversal ast_node::traverse(const std::function<traversal (ast_node*)>& func) {
return func(this);
}
ast_node* ast_node::getByPath(std::initializer_list<size_t>) {
return nullptr;
}
bool ast_node::visitChild(const std::function<bool (ast_node*)>&) {
return false;
}
/** sets the container under construction to be this.
*/
ast_container::ast_container() {
_current = this;
}
/** Asks all members to construct themselves from the stack.
The members are asked to construct themselves in reverse order.
from a node stack.
@param st stack.
*/
void ast_container::construct(ast_stack &st) {
for(ast_member_vector::reverse_iterator it = m_members.rbegin();
it != m_members.rend();
++it)
{
ast_member* member = *it;
member->construct(st);
}
}
traversal ast_container::traverse(const std::function<traversal (ast_node*)>& func) {
traversal action = func(this);
switch (action) {
case traversal::Stop: return traversal::Stop;
case traversal::Return: return traversal::Continue;
default: break;
}
const auto& members = this->members();
for (auto member : members) {
if (_ast_ptr* ptr = ast_cast<_ast_ptr>(member)) {
if (ptr->get() && ptr->get()->traverse(func) == traversal::Stop) {
return traversal::Stop;
}
} else if (_ast_list* list = ast_cast<_ast_list>(member)) {
for (auto obj : list->objects()) {
if (obj->traverse(func) == traversal::Stop) {
return traversal::Stop;
}
}
}
}
return traversal::Continue;
}
ast_node* ast_container::getByPath(std::initializer_list<size_t> paths) {
ast_node* current = this;
auto it = paths.begin();
while (it != paths.end()) {
ast_node* findNode = nullptr;
size_t id = *it;
current->visitChild([&](ast_node* node) {
if (node->getId() == id) {
findNode = node;
return true;
}
return false;
});
if (findNode) {
current = findNode;
} else {
current = nullptr;
break;
}
++it;
}
return current;
}
bool ast_container::visitChild(const std::function<bool (ast_node*)>& func) {
const auto& members = this->members();
for (auto member : members) {
if (_ast_ptr* ptr = ast_cast<_ast_ptr>(member)) {
if (ptr->get()) {
if (func(ptr->get())) return true;
}
} else if (_ast_list* list = ast_cast<_ast_list>(member)) {
for (auto obj : list->objects()) {
if (obj) {
if (func(obj)) return true;
}
}
}
}
return false;
}
ast_node* ast_container::getChild(int index) const {
int i = 0;
const auto& members = this->members();
for (auto member : members) {
if (_ast_ptr* ptr = ast_cast<_ast_ptr>(member)) {
if (i == index) return ptr->get();
} else if (_ast_list* list = ast_cast<_ast_list>(member)) {
for (auto obj : list->objects()) {
if (i == index) return obj;
}
}
i++;
}
return nullptr;
}
ast_node* ast_container::getFirstChild() const {
const auto& members = this->members();
if (!members.empty()) {
auto member = members.front();
if (_ast_ptr* ptr = ast_cast<_ast_ptr>(member)) {
return ptr->get();
} else if (_ast_list* list = ast_cast<_ast_list>(member)) {
if (!list->objects().empty()) {
return list->objects().front();
}
}
}
return nullptr;
}
ast_node* ast_container::getLastChild() const {
const auto& members = this->members();
if (!members.empty()) {
auto member = members.back();
if (_ast_ptr* ptr = ast_cast<_ast_ptr>(member)) {
return ptr->get();
} else if (_ast_list* list = ast_cast<_ast_list>(member)) {
if (!list->objects().empty()) {
return list->objects().front();
}
}
}
return nullptr;
}
size_t ast_container::getChildCount() const {
size_t count = 0;
const auto& members = this->members();
for (auto member : members) {
if (_ast_ptr* ptr = ast_cast<_ast_ptr>(member)) {
count += 1;
} else if (_ast_list* list = ast_cast<_ast_list>(member)) {
count += list->objects().size();
}
}
return count;
}
//register the AST member to the current container.
void ast_member::add_to_owner() {
assert(_current);
_current->m_members.push_back(this);
}
/** parses the given input.
@param i input.
@param g root rule of grammar.
@param el list of errors.
@param ud user data, passed to the parse procedures.
@return pointer to ast node created, or null if there was an error.
The return object must be deleted by the caller.
*/
ast_node* _parse(input &i, rule &g, error_list &el, void* ud) {
ast_stack st;
if (!parse(i, g, el, &st, ud)) return 0;
assert(st.size() == 1);
return st[0];
}
} //namespace parserlib
|
