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
|
/*
Ousía
Copyright (C) 2014, 2015 Benjamin Paaßen, Andreas Stöckel
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include "ParserState.hpp"
namespace ousia {
/* Class ParserState */
ParserState::ParserState() : elementHandler(nullptr), childHandler(nullptr) {}
ParserState::ParserState(ParserStateSet parents, Arguments arguments,
RttiSet createdNodeTypes,
HandlerConstructor elementHandler,
HandlerConstructor childHandler)
: parents(parents),
arguments(arguments),
createdNodeTypes(createdNodeTypes),
elementHandler(elementHandler),
childHandler(childHandler)
{
}
ParserState::ParserState(const ParserStateBuilder &builder)
: ParserState(builder.build())
{
}
/* Class ParserStateBuilder */
ParserStateBuilder &ParserStateBuilder::copy(const ParserState &state)
{
this->state = state;
return *this;
}
ParserStateBuilder &ParserStateBuilder::parent(const ParserState *parent)
{
state.parents = ParserStateSet{parent};
return *this;
}
ParserStateBuilder &ParserStateBuilder::parents(const ParserStateSet &parents)
{
state.parents = parents;
return *this;
}
ParserStateBuilder &ParserStateBuilder::arguments(const Arguments &arguments)
{
state.arguments = arguments;
return *this;
}
ParserStateBuilder &ParserStateBuilder::createdNodeType(const Rtti *type)
{
state.createdNodeTypes = RttiSet{type};
return *this;
}
ParserStateBuilder &ParserStateBuilder::createdNodeTypes(const RttiSet &types)
{
state.createdNodeTypes = types;
return *this;
}
ParserStateBuilder &ParserStateBuilder::elementHandler(
HandlerConstructor elementHandler)
{
state.elementHandler = elementHandler;
return *this;
}
ParserStateBuilder &ParserStateBuilder::childHandler(
HandlerConstructor childHandler)
{
state.childHandler = childHandler;
return *this;
}
const ParserState &ParserStateBuilder::build() const { return state; }
/* Class ParserStateDeductor */
ParserStateDeductor::ParserStateDeductor(
std::vector<const Rtti *> signature,
std::vector<const ParserState *> states)
: tbl(signature.size()),
signature(std::move(signature)),
states(std::move(states))
{
}
bool ParserStateDeductor::isActive(size_t d, const ParserState *s)
{
// Lookup the "active" state of (d, s), if it was not already set
// (e.second is true) we'll have to calculate it
auto e = tbl[d].emplace(s, false);
bool &res = e.first->second;
if (!e.second) {
return res;
}
// Check whether this node is generative (may have produced the Node
// described by the current Signature element)
bool isGenerative = signature[d]->isOneOf(s->createdNodeTypes);
if (isGenerative && d == 0) {
// End of recursion -- the last signature element is reached and the
// node was generative
res = true;
} else {
// Try repetition of this node
if (isGenerative && isActive(d - 1, s)) {
res = true;
} else {
// Check whether any of the parent nodes were active -- either for
// the previous element (if this one is generative) or for the
// current element (assuming this node was not generative)
for (const ParserState *parent : s->parents) {
if ((isGenerative && isActive(d - 1, parent)) ||
isActive(d, parent)) {
res = true;
break;
}
}
}
}
return res;
}
std::vector<const ParserState *> ParserStateDeductor::deduce()
{
std::vector<const ParserState *> res;
if (!signature.empty()) {
const size_t D = signature.size();
for (auto s : states) {
if (signature[D - 1]->isOneOf(s->createdNodeTypes) &&
isActive(D - 1, s)) {
res.push_back(s);
}
}
}
return res;
}
/* Constant initializations */
namespace ParserStates {
const ParserState All;
const ParserState None;
}
}
|
