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
|
/* 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/ATN.h"
#include "atn/Transition.h"
#include "misc/IntervalSet.h"
#include "support/CPPUtils.h"
#include "atn/ATNState.h"
using namespace antlr4::atn;
using namespace antlrcpp;
ATNState::ATNState() {
}
ATNState::~ATNState() {
for (auto *transition : transitions) {
delete transition;
}
}
const std::vector<std::string> ATNState::serializationNames = {
"INVALID", "BASIC", "RULE_START", "BLOCK_START",
"PLUS_BLOCK_START", "STAR_BLOCK_START", "TOKEN_START", "RULE_STOP",
"BLOCK_END", "STAR_LOOP_BACK", "STAR_LOOP_ENTRY", "PLUS_LOOP_BACK", "LOOP_END"
};
size_t ATNState::hashCode() {
return stateNumber;
}
bool ATNState::operator == (const ATNState &other) {
return stateNumber == other.stateNumber;
}
bool ATNState::isNonGreedyExitState() {
return false;
}
std::string ATNState::toString() const {
return std::to_string(stateNumber);
}
void ATNState::addTransition(Transition *e) {
addTransition(transitions.size(), e);
}
void ATNState::addTransition(size_t index, Transition *e) {
for (Transition *transition : transitions)
if (transition->target->stateNumber == e->target->stateNumber) {
delete e;
return;
}
if (transitions.empty()) {
epsilonOnlyTransitions = e->isEpsilon();
} else if (epsilonOnlyTransitions != e->isEpsilon()) {
std::cerr << "ATN state %d has both epsilon and non-epsilon transitions.\n" << stateNumber;
epsilonOnlyTransitions = false;
}
transitions.insert(transitions.begin() + index, e);
}
Transition *ATNState::removeTransition(size_t index) {
Transition *result = transitions[index];
transitions.erase(transitions.begin() + index);
return result;
}
|
