-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathcpp-gen.py
More file actions
225 lines (195 loc) · 6.38 KB
/
cpp-gen.py
File metadata and controls
225 lines (195 loc) · 6.38 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
import rsaregex
import argparse
import sys
parser = argparse.ArgumentParser(
prog='cpp-gen',
description='C++ code generator for a run of a drsa',
epilog='')
parser.add_argument('pattern',
help='pattern to be matched to input data')
args = parser.parse_args()
print(f"generating drsa for pattern '{args.pattern}'", file=sys.stderr)
drsa = rsaregex.create_rsa(args.pattern)
ordered_regs = list(drsa.R)
#rsaregex.draw_automaton(drsa, "rsa")
# states_i = {item: i + 1 for i, item in enumerate(drsa.Q)}
states_i = {}
i = 0
for s in drsa.Q:
key = (frozenset(s.states), frozenset(s.mapping.items()))
states_i[key] = i
i += 1
init_s = next(iter(drsa.I))
init_i = states_i[(frozenset(init_s.states), frozenset(init_s.mapping.items()))]
final_ind = set()
for f in drsa.F:
final_ind.add(states_i[(frozenset(f.states), frozenset(f.mapping.items()))])
# for t in drsa.delta:
# print(t.update )
# exit()
def compute_trans_bitmap(regs, guardeq):
bitmap = 0
i = 0
for r in regs:
if r in guardeq:
bitmap += 1 << i
i += 1
return bitmap
def charset_to_str(charset):
res = "{"
for c in charset:
res += str(ord(c))+", "
res += "}"
return res
def print_reg_update(regs, update):
spacing = " "
i = 0
for r in regs:
print(f"{spacing}std::unordered_set<char32_t> tmp_set_{i};")
j = 0
for r2 in regs:
if r2 in update[r]:
print(f"{spacing}tmp_set_{i}.insert(regs[{j}].begin(), regs[{j}].end());")
j += 1
if 'in' in update[r]:
print(f"{spacing}tmp_set_{i}.insert(a);")
i += 1
i = 0
for r in regs:
print(f"{spacing}regs[{i}] = tmp_set_{i};")
i += 1
# prefix
print('''#include <string>
#include <iostream>
#include <unordered_set>
#include <bitset>
#include <array>
#include <cstdint>
#include <frozen/unordered_set.h>
#define NUM_REGS ''' + str(len(drsa.R)) +'''
typedef std::array<std::unordered_set<char32_t>, NUM_REGS> regs_t;
char32_t get_next_codepoint(const std::string& utf8_input) {
static size_t i = 0;
if (i < utf8_input.size()) {
char32_t ch = 0;
unsigned char byte = static_cast<unsigned char>(utf8_input[i]);
if (byte <= 0x7F) { // 1-byte character
ch = byte;
++i;
} else if ((byte & 0xE0) == 0xC0) { // 2-byte character
ch = byte & 0x1F;
ch = (ch << 6) | (utf8_input[i + 1] & 0x3F);
i += 2;
} else if ((byte & 0xF0) == 0xE0) { // 3-byte character
ch = byte & 0x0F;
ch = (ch << 6) | (utf8_input[i + 1] & 0x3F);
ch = (ch << 6) | (utf8_input[i + 2] & 0x3F);
i += 3;
} else if ((byte & 0xF8) == 0xF0) { // 4-byte character
ch = byte & 0x07;
ch = (ch << 6) | (utf8_input[i + 1] & 0x3F);
ch = (ch << 6) | (utf8_input[i + 2] & 0x3F);
ch = (ch << 6) | (utf8_input[i + 3] & 0x3F);
i += 4;
} else {
throw std::runtime_error("Invalid UTF-8 encoding");
}
return ch;
}
return '\\0';
}
//TODO: generate differently for NUM_REGS > 64
inline uint_fast64_t compute_reg_bitmap_old(regs_t ®s, char32_t a)
{
uint_fast64_t bitmap = 0;
for (size_t i = 0; i < NUM_REGS; i++)
{
//assumes contains returns 1 for true
bitmap += (regs[i].contains(a)) << i;
}
return bitmap;
}
inline std::bitset<NUM_REGS> compute_reg_bitmap(regs_t ®s, char32_t a)
{
std::bitset<NUM_REGS> bitmap;
for (size_t i = 0; i < NUM_REGS; i++)
{
if (regs[i].contains(a)) {
bitmap.set(i); // Set the bit at index i
}
}
return bitmap;
}
inline bool cmp_bitmap_old(uint_fast64_t a, uint_fast64_t b)
{
return !(a - b);
}
inline bool cmp_bitmap(std::bitset<NUM_REGS> a, std::bitset<NUM_REGS> b)
{
return a == b;
}
''')
print('''bool run_word(std::string input) {
int s = '''+ str(init_i) +''';
std::array<std::unordered_set<char32_t>, NUM_REGS> regs;
constexpr frozen::unordered_set<uint_fast64_t, ''' + str(len(final_ind)) +'''> final = '''+ str(final_ind) +''';
char32_t a = get_next_codepoint(input);
while (a != '\\0') {
std::bitset<NUM_REGS> a_bitmap = compute_reg_bitmap(regs, a);
switch (s)
{''')
for s in states_i.keys():
s_ind = states_i[s]
print(f" case {s_ind}:")
print(" {")
cnt = 0
for t in drsa.trans_dict[s]:
t_bitmap = compute_trans_bitmap(ordered_regs, t.eqGuard)
t_bitmap = bin(t_bitmap)[2:].zfill(len(drsa.R))
t_bitmap_name = f'trans_bitmap_{s_ind}_{cnt}'
chars_set = set(t.symbol[1])
cond = "!" if t.symbol[0] == "^" else ""
set_name = f'trans_chars_{s_ind}_{cnt}'
print(' constexpr std::bitset<'+str(len(t_bitmap))+f'> {t_bitmap_name} ("{t_bitmap}");')
if len(chars_set) > 0:
print('''
constexpr frozen::unordered_set<char32_t, ''' + str(len(chars_set)) +'> '+set_name+' = '+ charset_to_str(chars_set) +''';
if (cmp_bitmap(a_bitmap, '''+t_bitmap_name+''') && '''+ cond+set_name+'''.contains(a)) {''')
print_reg_update(ordered_regs, t.update)
print('''
s ='''+str(states_i[(frozenset(t.dest.states),frozenset(t.dest.mapping.items()))])+''';
break;
}''')
#not empty set, i.e. every char
elif cond == "!":
print('''
if (cmp_bitmap(a_bitmap,'''+t_bitmap_name+''')) {''')
print_reg_update(ordered_regs, t.update)
print('''
s ='''+str(states_i[(frozenset(t.dest.states),frozenset(t.dest.mapping.items()))])+''';
break;
}''')
cnt += 1
print(" return false;")
print(" }")
print(''' default:
break;
}
a = get_next_codepoint(input);
}
if (final.contains(s)) {
return true;
}
return false;
}''')
print('''
int main(int argc, char *argv[]) {
if (argc != 2) {
printf("Missing argument\\n");
return 1;
}
std::string input = argv[1];
bool result = run_word(input);
if (result) printf("YES\\n");
else printf("NO\\n");
}''')