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
|
/*
* Copyright (c) 2015, Intel Corporation
*
* 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.
* * Neither the name of Intel Corporation nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* 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 OWNER 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.
*/
/** \file
* \brief Atomic groups (?>...)
*/
#include "ComponentAtomicGroup.h"
#include "buildstate.h"
#include "position.h"
#include <algorithm>
using namespace std;
namespace ue2 {
ComponentAtomicGroup *ComponentAtomicGroup::clone() const {
return new ComponentAtomicGroup(*this);
}
Component *ComponentAtomicGroup::accept(ComponentVisitor &v) {
Component *c = v.visit(this);
if (c != this) {
v.post(this);
return c;
}
for (auto i = children.begin(), e = children.end(); i != e; ++i) {
Component *child = i->get();
c = (*i)->accept(v);
if (c != child) {
// Child has been replaced (new Component pointer) or we've been
// instructed to delete it (null).
i->reset(c);
}
}
// Remove deleted children.
children.erase(remove(children.begin(), children.end(), nullptr),
children.end());
v.post(this);
return this;
}
void ComponentAtomicGroup::accept(ConstComponentVisitor &v) const {
v.pre(*this);
for (auto i = children.begin(), e = children.end(); i != e; ++i) {
(*i)->accept(v);
if (i + 1 != e) {
v.during(*this);
}
}
v.post(*this);
}
void ComponentAtomicGroup::notePositions(GlushkovBuildState &) {
assert(0);
}
void ComponentAtomicGroup::buildFollowSet(GlushkovBuildState &,
const vector<PositionInfo> &) {
assert(0);
}
} // namespace
|
