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
|
/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
* Use of this file is governed by the BSD 3-clause license that
* can be found in the LICENSE.txt file in the project root.
*/
#include "atn/RuleStopState.h"
#include "atn/ATNConfigSet.h"
#include "atn/ATNConfig.h"
#include "misc/MurmurHash.h"
#include "SemanticContext.h"
#include "PredictionMode.h"
using namespace antlr4;
using namespace antlr4::atn;
using namespace antlrcpp;
struct AltAndContextConfigHasher
{
/**
* The hash code is only a function of the {@link ATNState#stateNumber}
* and {@link ATNConfig#context}.
*/
size_t operator () (ATNConfig *o) const {
size_t hashCode = misc::MurmurHash::initialize(7);
hashCode = misc::MurmurHash::update(hashCode, o->state->stateNumber);
hashCode = misc::MurmurHash::update(hashCode, o->context);
return misc::MurmurHash::finish(hashCode, 2);
}
};
struct AltAndContextConfigComparer {
bool operator()(ATNConfig *a, ATNConfig *b) const
{
if (a == b) {
return true;
}
return a->state->stateNumber == b->state->stateNumber && *a->context == *b->context;
}
};
bool PredictionModeClass::hasSLLConflictTerminatingPrediction(PredictionMode mode, ATNConfigSet *configs) {
/* Configs in rule stop states indicate reaching the end of the decision
* rule (local context) or end of start rule (full context). If all
* configs meet this condition, then none of the configurations is able
* to match additional input so we terminate prediction.
*/
if (allConfigsInRuleStopStates(configs)) {
return true;
}
bool heuristic;
// Pure SLL mode parsing or SLL+LL if:
// Don't bother with combining configs from different semantic
// contexts if we can fail over to full LL; costs more time
// since we'll often fail over anyway.
if (mode == PredictionMode::SLL || !configs->hasSemanticContext) {
std::vector<antlrcpp::BitSet> altsets = getConflictingAltSubsets(configs);
heuristic = hasConflictingAltSet(altsets) && !hasStateAssociatedWithOneAlt(configs);
} else {
// dup configs, tossing out semantic predicates
ATNConfigSet dup(true);
for (auto &config : configs->configs) {
Ref<ATNConfig> c = std::make_shared<ATNConfig>(*config, SemanticContext::Empty::Instance);
dup.add(c);
}
std::vector<antlrcpp::BitSet> altsets = getConflictingAltSubsets(&dup);
heuristic = hasConflictingAltSet(altsets) && !hasStateAssociatedWithOneAlt(&dup);
}
return heuristic;
}
bool PredictionModeClass::hasConfigInRuleStopState(ATNConfigSet *configs) {
for (const auto &config : configs->configs) {
if (RuleStopState::is(config->state)) {
return true;
}
}
return false;
}
bool PredictionModeClass::allConfigsInRuleStopStates(ATNConfigSet *configs) {
for (const auto &config : configs->configs) {
if (!RuleStopState::is(config->state)) {
return false;
}
}
return true;
}
size_t PredictionModeClass::resolvesToJustOneViableAlt(const std::vector<antlrcpp::BitSet>& altsets) {
return getSingleViableAlt(altsets);
}
bool PredictionModeClass::allSubsetsConflict(const std::vector<antlrcpp::BitSet>& altsets) {
return !hasNonConflictingAltSet(altsets);
}
bool PredictionModeClass::hasNonConflictingAltSet(const std::vector<antlrcpp::BitSet>& altsets) {
for (antlrcpp::BitSet alts : altsets) {
if (alts.count() == 1) {
return true;
}
}
return false;
}
bool PredictionModeClass::hasConflictingAltSet(const std::vector<antlrcpp::BitSet>& altsets) {
for (antlrcpp::BitSet alts : altsets) {
if (alts.count() > 1) {
return true;
}
}
return false;
}
bool PredictionModeClass::allSubsetsEqual(const std::vector<antlrcpp::BitSet>& altsets) {
if (altsets.empty()) {
return true;
}
const antlrcpp::BitSet& first = *altsets.begin();
for (const antlrcpp::BitSet& alts : altsets) {
if (alts != first) {
return false;
}
}
return true;
}
size_t PredictionModeClass::getUniqueAlt(const std::vector<antlrcpp::BitSet>& altsets) {
antlrcpp::BitSet all = getAlts(altsets);
if (all.count() == 1) {
return all.nextSetBit(0);
}
return ATN::INVALID_ALT_NUMBER;
}
antlrcpp::BitSet PredictionModeClass::getAlts(const std::vector<antlrcpp::BitSet>& altsets) {
antlrcpp::BitSet all;
for (const auto &alts : altsets) {
all |= alts;
}
return all;
}
antlrcpp::BitSet PredictionModeClass::getAlts(ATNConfigSet *configs) {
antlrcpp::BitSet alts;
for (const auto &config : configs->configs) {
alts.set(config->alt);
}
return alts;
}
std::vector<antlrcpp::BitSet> PredictionModeClass::getConflictingAltSubsets(ATNConfigSet *configs) {
std::unordered_map<ATNConfig*, antlrcpp::BitSet, AltAndContextConfigHasher, AltAndContextConfigComparer> configToAlts;
for (auto &config : configs->configs) {
configToAlts[config.get()].set(config->alt);
}
std::vector<antlrcpp::BitSet> values;
values.reserve(configToAlts.size());
for (const auto &pair : configToAlts) {
values.push_back(pair.second);
}
return values;
}
std::unordered_map<ATNState*, antlrcpp::BitSet> PredictionModeClass::getStateToAltMap(ATNConfigSet *configs) {
std::unordered_map<ATNState*, antlrcpp::BitSet> m;
for (const auto &c : configs->configs) {
m[c->state].set(c->alt);
}
return m;
}
bool PredictionModeClass::hasStateAssociatedWithOneAlt(ATNConfigSet *configs) {
auto x = getStateToAltMap(configs);
for (const auto &pair : x){
if (pair.second.count() == 1) return true;
}
return false;
}
size_t PredictionModeClass::getSingleViableAlt(const std::vector<antlrcpp::BitSet>& altsets) {
antlrcpp::BitSet viableAlts;
for (const auto &alts : altsets) {
size_t minAlt = alts.nextSetBit(0);
viableAlts.set(minAlt);
if (viableAlts.count() > 1) // more than 1 viable alt
{
return ATN::INVALID_ALT_NUMBER;
}
}
return viableAlts.nextSetBit(0);
}
|
