-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathFast_Attribute_DFA.cpp
More file actions
238 lines (225 loc) · 9.79 KB
/
Copy pathFast_Attribute_DFA.cpp
File metadata and controls
238 lines (225 loc) · 9.79 KB
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
#include "Attribute_DFA.hpp"
//states code
//runtime length encode state transitions
std::ostream& Fast_Attribute_DFA::DFA_State::write(std::ostream& o)
{
uint32_t count_same = 0;
uint32_t current_state = this->transitions[0];
o.write(reinterpret_cast<char*>(&this->attribute_priority), sizeof(this->attribute_priority));
o.write(reinterpret_cast<char*>(&this->accept), sizeof(this->accept));
for(size_t i = 0; i < this->transitions.size(); i++)
{
if(this->transitions[i] != current_state)
{
if(count_same > 1)
{
o.write(reinterpret_cast<const char*>(&DFA_State::rle_key), sizeof(DFA_State::rle_key));
o.write(reinterpret_cast<char*>(&count_same), sizeof(count_same));
o.write(reinterpret_cast<char*>(¤t_state), sizeof(current_state));
}
else
o.write(reinterpret_cast<char*>(¤t_state), sizeof(current_state));
current_state = this->transitions[i];
count_same = 1;
}
else
count_same++;
}
if(count_same > 1)
{
o.write(reinterpret_cast<const char*>(&DFA_State::rle_key), sizeof(DFA_State::rle_key));
o.write(reinterpret_cast<char*>(&count_same), sizeof(count_same));
o.write(reinterpret_cast<char*>(¤t_state), sizeof(current_state));
}
else
o.write(reinterpret_cast<char*>(¤t_state), sizeof(current_state));
o.write(reinterpret_cast<const char*>(&DFA_State::end_state_encoding), sizeof(DFA_State::end_state_encoding));
return o;
}
std::istream& Fast_Attribute_DFA::DFA_State::read(std::istream& in)
{
in.read(reinterpret_cast<char*>(&this->attribute_priority), sizeof(this->attribute_priority));
in.read(reinterpret_cast<char*>(&this->accept), sizeof(this->accept));
uint32_t current = 0;
uint32_t state_index = 0;
while(in)
{
in.read(reinterpret_cast<char*>(¤t), sizeof(current));
if(current == DFA_State::end_state_encoding)
break;
if(state_index >= this->transitions.size())
break;//should throw exception
if(current == DFA_State::rle_key)
{
uint32_t count_same, transition;
in.read(reinterpret_cast<char*>(&count_same), sizeof(count_same));
in.read(reinterpret_cast<char*>(&transition), sizeof(transition));
for(size_t i = 0; state_index < this->transitions.size() && i < count_same; i++, state_index++)
{
this->transitions[state_index] = transition;
}
}
else
{
this->transitions[state_index++] = current;
}
}
if(current != DFA_State::end_state_encoding)
std::cerr<<"Corrupted file no end state encoding after state\n";
return in;
}
//dfa code
std::ostream& Fast_Attribute_DFA::write(std::ostream& o)
{
uint32_t size = this->states.size();
o.write(reinterpret_cast<char*>(&size), sizeof(size));
size = this->attributes.size();
o.write(reinterpret_cast<char*>(&size), sizeof(size));
size = this->regex.size();
o.write(reinterpret_cast<char*>(&size), sizeof(size));
o.write(this->regex.c_str(), size);
for(size_t i = 0; i < this->attributes.size(); i++)
{
size = this->attributes[i].size();
o.write(reinterpret_cast<char*>(&size), sizeof(size));
o.write(this->attributes[i].c_str(), this->attributes[i].size());
}
for(size_t i = 0; i < this->states.size(); i++)
this->states[i].write(o);
return o;
}
std::istream& Fast_Attribute_DFA::read_string(std::istream& in, std::string& str)
{
uint32_t size = 0;
in.read(reinterpret_cast<char*>(&size), sizeof(size));
str.clear();
str.reserve(size);
for(size_t i = 0; i < size; i++)
str += ' ';
in.read(str.data(), size);
return in;
}
std::istream& Fast_Attribute_DFA::read(std::istream& in)
{
uint32_t states_count = 0, attributes_count = 0;
in.read(reinterpret_cast<char*>(&states_count), sizeof(states_count));
in.read(reinterpret_cast<char*>(&attributes_count), sizeof(attributes_count));
read_string(in, regex);
std::string line;
this->attributes.clear();
for(size_t i = 0; i < attributes_count; i++)
{
read_string(in, line);
this->attributes.push_back(line);
}
this->states.clear();
this->states.reserve(states_count);
for(size_t i = 0; i < states_count; i++)
{
this->states.push_back(DFA_State(false, "", 0));
this->states.back().read(in);
}
return in;
}
void Fast_Attribute_DFA::load_file(const std::string filepath)
{
std::ifstream file(filepath, std::ios::binary);
read(file);
}
void Fast_Attribute_DFA::write_to_file(const std::string filepath)
{
std::ofstream file(filepath, std::ios::binary);
write(file);
}
Fast_Attribute_DFA::Fast_Attribute_DFA(const std::string& regex, const std::deque<std::string>& attributes): regex(regex)
{
for(size_t i = 0; i < attributes.size(); i++)
this->attributes.push_back(attributes[i]);
}
bool Fast_Attribute_DFA::operator==(const Fast_Attribute_DFA& o) const noexcept
{
bool equal = states.size() == o.states.size() && regex.size() == o.regex.size() && attributes.size() == o.attributes.size();
for(size_t i = 0; equal && i < states.size(); i++)
{
const DFA_State& state = states[i];
const DFA_State& ostate = o.states[i];
equal = state == ostate;
}
return equal;
}
std::ostream& operator<<(std::ostream& o, const Fast_Attribute_DFA& dfa)
{
for(size_t state_index = 0; state_index < dfa.states.size(); state_index++)
{
const Fast_Attribute_DFA::DFA_State& state = dfa.states[state_index];
std::cout<<state_index<<(state.is_accepting() ? "@":"")<<(state.is_accepting() ? dfa.get_attribute(state):"")<<": {";
for(size_t i = ' '; i < 128; i++)
{
if(state.transition_iterator(i) != -1)
std::cout<<((char) i)<<":"<<state.transition_iterator(i)<<", ";
}
std::cout<<"}\n";
}
return o;
}
size_t Fast_Attribute_DFA::start_state() const noexcept
{
return 0;
}
uint32_t Fast_Attribute_DFA::transition(char symbol, uint32_t current_state) const noexcept
{
if(current_state == -1)
return -1;
return states[current_state].transitions[symbol];
}
const std::vector<Fast_Attribute_DFA::DFA_State>& Fast_Attribute_DFA::get_states() const noexcept
{
return states;
}
const std::string& Fast_Attribute_DFA::get_attribute(const DFA_State& state) const noexcept
{
return attributes[state.attribute_priority];
}
Fast_Attribute_DFA::ParseRecord Fast_Attribute_DFA::parse_token_simple(const std::string_view input_text, const size_t start)
{
uint32_t state = this->start_state();
uint32_t last_state = -1;
size_t input_index = start;
const char original_ending = (*(const_cast<char*>(input_text.data()) + input_text.size()));
(*(const_cast<char*>(input_text.data()) + input_text.size())) = 0;
while(state != -1 && input_index <= input_text.size())
{
last_state = state;
state = this->states[state].transitions[input_text[input_index]];
input_index++;
if(state != -1 && input_index == input_text.size())
last_state = state;
if(state != -1 && this->get_states()[last_state].accept && this->get_states()[state].attribute_priority != this->get_states()[last_state].attribute_priority && this->get_states()[state].attribute_priority > this->get_states()[last_state].attribute_priority)
{
last_state = state;
state = -1;
}
}
(*(const_cast<char*>(input_text.data()) + input_text.size())) = original_ending;
return ParseRecord(last_state, input_index);
}
SimpleLexToken Fast_Attribute_DFA::parse_token_no_attribute(const std::string_view input_text, const size_t start)
{
const auto rec = parse_token_simple(input_text, start);
if(states[rec.state].accept & (rec.state != -1))
{
SimpleLexToken tok(start, this->get_states()[rec.state].attribute_priority, std::string_view(input_text.data() + start, rec.end_index - start - 1));
return tok;
}
return SimpleLexToken(start, 0, "");
}
LexToken Fast_Attribute_DFA::parse_token(const std::string_view input_text, const size_t start)
{
const auto rec = parse_token_simple(input_text, start);
if(states[rec.state].accept & (rec.state != -1))
{
LexToken tok(start, this->get_states()[rec.state].attribute_priority, attributes[this->get_states()[rec.state].attribute_priority], std::string_view(input_text.data() + start, rec.end_index - start - 1));
return tok;
}
return LexToken(start, 0, "", "");
}