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
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
|
/* 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.*/
#pragma once
#include <cassert>
#include <list>
#include <stdexcept>
#include <type_traits>
#include "MoonP/parser.hpp"
namespace parserlib {
class ast_node;
template <bool Required, class T> class ast_ptr;
template <bool Required, class T> class ast_list;
template <class T> class ast;
/** type of AST node stack.
*/
typedef std::vector<ast_node*> ast_stack;
typedef std::list<ast_node*> node_container;
template<size_t Num> struct Counter { enum { value = Counter<Num-1>::value }; };
template<> struct Counter<0> { enum { value = 0 }; };
#define COUNTER_READ Counter<__LINE__>::value
#define COUNTER_INC template<> struct Counter<__LINE__> { enum { value = Counter<__LINE__-1>::value + 1}; }
class ast_node;
template<class T>
constexpr typename std::enable_if<std::is_base_of<ast_node,T>::value,int>::type
id();
enum class traversal {
Continue,
Return,
Stop
};
/** Base class for AST nodes.
*/
class ast_node : public input_range {
public:
ast_node() : _ref(0) {}
void retain() {
++_ref;
}
void release() {
--_ref;
if (_ref == 0) {
delete this;
}
}
/** interface for filling the contents of the node
from a node stack.
@param st stack.
*/
virtual void construct(ast_stack&) {}
/** interface for visiting AST tree use.
*/
virtual traversal traverse(const std::function<traversal (ast_node*)>& func);
template <typename... Ts>
struct select_last {
using type = typename decltype((std::enable_if<true,Ts>{}, ...))::type;
};
template <typename... Ts>
using select_last_t = typename select_last<Ts...>::type;
template <class ...Args>
select_last_t<Args...>* getByPath() {
int types[] = {id<Args>()...};
return static_cast<select_last_t<Args...>*>(getByTypeIds(std::begin(types), std::end(types)));
}
virtual bool visitChild(const std::function<bool (ast_node*)>& func);
virtual int getId() const = 0;
template<class T>
inline ast_ptr<false, T> new_ptr() const {
auto item = new T;
item->m_begin.m_line = m_begin.m_line;
item->m_end.m_line = m_begin.m_line;
return ast_ptr<false, T>(item);
}
private:
int _ref;
ast_node* getByTypeIds(int* begin, int* end);
};
template<class T>
constexpr typename std::enable_if<std::is_base_of<ast_node,T>::value,int>::type
id() { return 0; }
template<class T>
T* ast_cast(ast_node* node) {
return node && id<T>() == node->getId() ? static_cast<T*>(node) : nullptr;
}
template<class T>
T* ast_to(ast_node* node) {
assert(node->getId() == id<T>());
return static_cast<T*>(node);
}
template <class ...Args>
bool ast_is(ast_node* node) {
if (!node) return false;
bool result = false;
int i = node->getId();
using swallow = bool[];
(void)swallow{result || (result = id<Args>() == i)...};
return result;
}
class ast_member;
/** type of ast member vector.
*/
typedef std::vector<ast_member*> ast_member_vector;
/** base class for AST nodes with children.
*/
class ast_container : public ast_node {
public:
void add_members(std::initializer_list<ast_member*> members) {
for (auto member : members) {
m_members.push_back(member);
}
}
/** returns the vector of AST members.
@return the vector of AST members.
*/
const ast_member_vector& members() const {
return m_members;
}
/** 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.
*/
virtual void construct(ast_stack& st) override;
virtual traversal traverse(const std::function<traversal (ast_node*)>& func) override;
virtual bool visitChild(const std::function<bool (ast_node*)>& func) override;
private:
ast_member_vector m_members;
friend class ast_member;
};
enum class ast_holder_type {
Pointer,
List
};
/** Base class for children of ast_container.
*/
class ast_member {
public:
virtual ~ast_member() {}
/** interface for filling the the member from a node stack.
@param st stack.
*/
virtual void construct(ast_stack& st) = 0;
virtual bool accept(ast_node* node) = 0;
virtual ast_holder_type get_type() const = 0;
};
class _ast_ptr : public ast_member {
public:
_ast_ptr(ast_node* node) : m_ptr(node) {
if (node) node->retain();
}
virtual ~_ast_ptr() {
if (m_ptr) {
m_ptr->release();
m_ptr = nullptr;
}
}
ast_node* get() const {
return m_ptr;
}
template <class T>
T* as() const {
return ast_cast<T>(m_ptr);
}
template <class T>
T* to() const {
assert(m_ptr && m_ptr->getId() == id<T>());
return static_cast<T*>(m_ptr);
}
template <class T>
bool is() const {
return m_ptr && m_ptr->getId() == id<T>();
}
void set(ast_node* node) {
if (node == m_ptr) {
return;
} else if (!node) {
if (m_ptr) m_ptr->release();
m_ptr = nullptr;
} else {
assert(accept(node));
if (m_ptr) m_ptr->release();
m_ptr = node;
node->retain();
}
}
virtual ast_holder_type get_type() const override {
return ast_holder_type::Pointer;
}
protected:
ast_node* m_ptr;
};
/** pointer to an AST object.
It assumes ownership of the object.
It pops an object of the given type from the stack.
@tparam Required if true, the object is required.
@tparam T type of object to control.
*/
template <bool Required, class T> class ast_ptr : public _ast_ptr {
public:
ast_ptr(T* node = nullptr) : _ast_ptr(node) {}
ast_ptr(const ast_ptr& other) : _ast_ptr(other.get()) {}
ast_ptr& operator=(const ast_ptr& other) {
set(other.get());
return *this;
}
/** gets the underlying ptr value.
@return the underlying ptr value.
*/
T* get() const {
return static_cast<T*>(m_ptr);
}
/** auto conversion to the underlying object ptr.
@return the underlying ptr value.
*/
operator T*() const {
return static_cast<T*>(m_ptr);
}
/** member access.
@return the underlying ptr value.
*/
T* operator->() const {
assert(m_ptr);
return static_cast<T*>(m_ptr);
}
/** Pops a node from the stack.
@param st stack.
@exception std::logic_error thrown if the node is not of the appropriate type;
thrown only if Required == true or if the stack is empty.
*/
virtual void construct(ast_stack& st) override {
// check the stack node
if (st.empty()) {
if (!Required) return;
throw std::logic_error("Invalid AST stack.");
}
ast_node* node = st.back();
if (!ast_ptr::accept(node)) {
// if the object is not required, simply return
if (!Required) return;
// else if the object is mandatory, throw an exception
throw std::logic_error("Invalid AST node.");
}
st.pop_back();
m_ptr = node;
node->retain();
}
private:
virtual bool accept(ast_node* node) override {
return node && (std::is_same<ast_node,T>() || id<T>() == node->getId());
}
};
template <bool Required, class ...Args> class ast_sel : public _ast_ptr {
public:
ast_sel() : _ast_ptr(nullptr) {}
ast_sel(const ast_sel& other) : _ast_ptr(other.get()) {}
ast_sel& operator=(const ast_sel& other) {
set(other.get());
return *this;
}
operator ast_node*() const {
return m_ptr;
}
ast_node* operator->() const {
assert(m_ptr);
return m_ptr;
}
virtual void construct(ast_stack& st) override {
if (st.empty()) {
if (!Required) return;
throw std::logic_error("Invalid AST stack.");
}
ast_node* node = st.back();
if (!ast_sel::accept(node)) {
if (!Required) return;
throw std::logic_error("Invalid AST node.");
}
st.pop_back();
m_ptr = node;
node->retain();
}
private:
virtual bool accept(ast_node* node) override {
if (!node) return false;
using swallow = bool[];
bool result = false;
(void)swallow{result || (result = id<Args>() == node->getId())...};
return result;
}
};
class _ast_list : public ast_member {
public:
~_ast_list() {
clear();
}
inline ast_node* back() const {
return m_objects.back();
}
inline ast_node* front() const {
return m_objects.front();
}
inline size_t size() const {
return m_objects.size();
}
inline bool empty() const {
return m_objects.empty();
}
void push_back(ast_node* node) {
assert(node && accept(node));
m_objects.push_back(node);
node->retain();
}
void push_front(ast_node* node) {
assert(node && accept(node));
m_objects.push_front(node);
node->retain();
}
void pop_front() {
auto node = m_objects.front();
m_objects.pop_front();
node->release();
}
void pop_back() {
auto node = m_objects.back();
m_objects.pop_back();
node->release();
}
bool swap(ast_node* node, ast_node* other) {
for (auto it = m_objects.begin(); it != m_objects.end(); ++it) {
if (*it == node) {
*it = other;
other->retain();
node->release();
return true;
}
}
return false;
}
const node_container& objects() const {
return m_objects;
}
void clear() {
for(ast_node* obj : m_objects) {
if (obj) obj->release();
}
m_objects.clear();
}
void dup(const _ast_list& src) {
for(ast_node* obj : src.m_objects) {
m_objects.push_back(obj);
obj->retain();
}
}
virtual ast_holder_type get_type() const override {
return ast_holder_type::List;
}
protected:
node_container m_objects;
};
/** A list of objects.
It pops objects of the given type from the ast stack, until no more objects can be popped.
It assumes ownership of objects.
@tparam Required if true, the object is required.
@tparam T type of object to control.
*/
template <bool Required, class T> class ast_list : public _ast_list {
public:
ast_list() { }
ast_list(const ast_list& other) {
dup(other);
}
ast_list& operator=(const ast_list& other) {
clear();
dup(other);
return *this;
}
/** Pops objects of type T from the stack until no more objects can be popped.
@param st stack.
*/
virtual void construct(ast_stack &st) override {
while (!st.empty()) {
ast_node* node = st.back();
// if the object was not not of the appropriate type,
// end the list parsing
if (!ast_list::accept(node)) {
if (Required && m_objects.empty()) {
throw std::logic_error("Invalid AST node.");
}
return;
}
st.pop_back();
// insert the object in the list, in reverse order
m_objects.push_front(node);
node->retain();
}
if (Required && m_objects.empty()) {
throw std::logic_error("Invalid AST stack.");
}
}
private:
virtual bool accept(ast_node* node) override {
return node && (std::is_same<ast_node,T>() || id<T>() == node->getId());
}
};
template <bool Required, class ...Args> class ast_sel_list : public _ast_list {
public:
ast_sel_list() { }
ast_sel_list(const ast_sel_list& other) {
dup(other);
}
ast_sel_list& operator=(const ast_sel_list& other) {
clear();
dup(other);
return *this;
}
virtual void construct(ast_stack &st) override {
while (!st.empty()) {
ast_node* node = st.back();
if (!ast_sel_list::accept(node)) {
if (Required && m_objects.empty()) {
throw std::logic_error("Invalid AST node.");
}
return;
}
st.pop_back();
m_objects.push_front(node);
node->retain();
}
if (Required && m_objects.empty()) {
throw std::logic_error("Invalid AST stack.");
}
}
private:
virtual bool accept(ast_node* node) override {
if (!node) return false;
using swallow = bool[];
bool result = false;
(void)swallow{result || (result = id<Args>() == node->getId())...};
return result;
}
};
/** AST function which creates an object of type T
and pushes it to the node stack.
*/
template <class T> class ast {
public:
/** constructor.
@param r rule to attach the AST function to.
*/
ast(rule& r) {
r.set_parse_proc(&_parse_proc);
}
private:
//parse proc
static void _parse_proc(const pos& b, const pos& e, void* d) {
ast_stack* st = reinterpret_cast<ast_stack*>(d);
T* obj = new T;
obj->m_begin = b;
obj->m_end = e;
obj->construct(*st);
st->push_back(obj);
}
};
/** 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);
} //namespace parserlib
|