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
|
/* Copyright (c) 2012, Achilleas Margaritis, modified by Jin Li
All rights reserved.
Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */
#include <cassert>
#include "MoonP/ast.hpp"
namespace parserlib {
int ast_type_id = 0;
traversal ast_node::traverse(const std::function<traversal (ast_node*)>& func) {
return func(this);
}
ast_node* ast_node::getByTypeIds(int* begin, int* end) {
ast_node* current = this;
auto it = begin;
while (it != end) {
ast_node* findNode = nullptr;
int type = *it;
current->visitChild([&](ast_node* node) {
if (node->get_type() == type) {
findNode = node;
return true;
}
return false;
});
if (findNode) {
current = findNode;
} else {
current = nullptr;
break;
}
++it;
}
return current;
}
bool ast_node::visitChild(const std::function<bool (ast_node*)>&) {
return false;
}
/** 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;
}
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;
}
/** 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)) {
for (auto node : st) {
delete node;
}
st.clear();
return nullptr;
}
assert(st.size() == 1);
return st.front();
}
} //namespace parserlib
|
