-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathgrammars_ex.py
297 lines (237 loc) · 7.93 KB
/
grammars_ex.py
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
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
#!/usr/bin/env python3
"""Code for testing."""
# %cd ..
#%%
from tcs.tools.tools import Tools
from tcs.grammar.regular.regular_grammar import RG
from tcs.grammar.cf.cf_grammar import CFG
from tcs.grammar.cs.cs_grammar import CSG
from tcs.grammar.general.general_grammar import GG
# Descrizione di una grammatica:
# - tipo di grammatica (GG generale, CSG context-sensitive, CFG context-free, RG regolare sinistra, RRG regolare destra)
# - insieme dei terminali: insieme di stringhe
# - insieme dei nonterminali: insieme di stringhe disgiunto
# - assioma: un nonterminale
# - produzioni: dizionario con chiavi ed elementi rappresentati da tuple di terminali e non terminali, inclusa la tupla () relativa alla stringa nulla
# Regular grammar
rg = RG(
terminals={'a', 'b', 'c'},
non_terminals={'S', 'A', 'B'},
axiom='S',
productions={
'S': {('a', 'S'), ('a', 'A'), ('b', 'A'), ()},
'A': {('b', 'A'), 'b', ('b', 'B')},
'B': {('c', 'A'), 'c'}
}
)
rg
# Stampa della struttura della grammatica
print(rg)
print(rg.nfa)
print(rg.nfa.dfa)
d = rg.random_derivation() # Generazione di una derivazione casuale
# Stampa della derivazione: nella colonna a sx la sequenza di forme di frasi; nella colonna a dx la sequenza di produzioni applicate
print(d)
# CF grammar
cfg = CFG(
terminals={'a', 'b', 'c'},
non_terminals={'S', 'AA', 'B', 'C'},
axiom='S',
productions={
('S',): {('a', 'S', 'a', 'S'), ('a', 'AA'), ('AA', 'B')},
('AA',): {('b', 'b', 'AA', 'B'), ('b', 'b'), ('b', 'AA', 'a', 'B'), ('B',)},
('B',): {('c', 'AA', 'AA'), ('c', 'c'), ('C',), ()},
('C',): {('c', 'C'), ('c',), ('S',)}
}
)
print(cfg)
print(cfg.random_derivation())
cfg0 = CFG(
terminals={'a'},
non_terminals={'S', 'A', 'B'},
axiom='S',
productions={
('S',): {('A', 'B'), ('a',)},
('A',): {('a',)}
}
)
# +
# cfg1 = cfg0.remove_nulls()
# cfg2 = cfg0.remove_unit_prods()
# cfg3 = cfg0.reduce()
# -
csg = CSG(
terminals={'io', 'tu', 'lui'},
non_terminals={'A', 'AX', 'XX'},
axiom='A',
productions={
('A',): {('io',), ('tu',), ('lui',), ('AX', 'tu'), ('XX', 'A', 'io')},
('AX', 'tu', 'io'): {('XX', 'A', 'io'), ('AX', 'io', 'tu')},
('A', 'io'): {('XX', 'A', 'io'), ('AX', 'io', 'tu'), ('tu', 'tu')},
('XX', 'A'): {('A', 'XX'), ('A', 'io'), ('tu', 'tu')}
}
)
print(csg)
d = csg.random_derivation()
print(d)
csg0 = CSG(
terminals={'a', 'b', 'c'},
non_terminals={'X', 'Y', 'Z'},
axiom='X',
productions={
('X',): {('a',), ('b',), ('c',), ('Y', 'b'), ('Z', 'X', 'a')},
('Y', 'b', 'a'): {('Z', 'X', 'a'), ('Y', 'a', 'b')},
('X', 'a'): {('Z', 'X', 'a'), ('Y', 'a', 'b'), ('b', 'b')},
('Z', 'X'): {('X', 'Z'), ('X', 'a'), ('b', 'b')}
}
)
d = csg0.random_derivation()
# Il generatore g consente, attraverso l'iterazione dell'istruzione next(g), di ottenere la sequenza dei passi di derivazione
g = d.generator
# Stampa del prossimo passo di derivazione: a sinistra la produzione applicata, a destra la derivazione diretta conseguente
print(next(g))
# La funzione Tools.simple_productions() applicata all'insieme dell produzioni permette di specificarle, nel caso in cui terminali e nonterminali siano singoli caratteri, utilizzando stringhe al posto di tuple
gg0 = GG(
terminals={'0', '1'},
non_terminals={'A', 'B', 'C'},
axiom='A',
productions=Tools.simple_productions({
'A': {'0', '01', 'B1', 'BA0'},
'BA': {'', 'AB', '01'},
'A01': {'0', 'A0', 'C', '001'},
'AA': {'0A0', '0B1', ''}
})
)
print(gg0)
# La funzione Tools.simple_sequence() permette di definire una sequenza di simboli terminali o nonterminali mediante una stringa, nel caso in cui siano singoli caratteri
cfg1 = CFG(
terminals={'a', 'b', 'c'},
non_terminals={'A', 'S'},
axiom='S',
productions={
Tools.simple_sequence('S'): {Tools.simple_sequence('aSc'),
Tools.simple_sequence('A')},
Tools.simple_sequence('A'): {Tools.simple_sequence(''),
Tools.simple_sequence('bAc')}
}
)
print(cfg1)
csg1 = CSG(
terminals={'a'},
non_terminals={'I', 'S', 'F', 'M'},
axiom='S',
productions={
Tools.simple_sequence('S'): {Tools.simple_sequence('a'),
Tools.simple_sequence('aa'),
Tools.simple_sequence('IaF')},
Tools.simple_sequence('aF'): {Tools.simple_sequence('Maa'),
Tools.simple_sequence('MaaF')},
Tools.simple_sequence('aM'): {Tools.simple_sequence('Maa')},
Tools.simple_sequence('IM'): {Tools.simple_sequence('Ia'),
Tools.simple_sequence('aa')}
}
)
print(csg1)
# Il parametro n indica la lunghezza massima della derivazione riportata (default n=100)
d = csg1.random_derivation(n=20)
print(d)
gg1 = GG(
terminals={'a', 'b'},
non_terminals={'S', 'A'},
axiom='S',
productions={
Tools.simple_sequence('S'): {Tools.simple_sequence('aAb')},
Tools.simple_sequence('aA'): {Tools.simple_sequence('aaAb')},
Tools.simple_sequence('A'): {Tools.simple_sequence('')}
}
)
csg2 = CSG(
terminals={'a', 'b'},
non_terminals={'S', 'A'},
axiom='S',
productions={
Tools.simple_sequence('S'): {Tools.simple_sequence('aSa'),
Tools.simple_sequence('aAb'),
Tools.simple_sequence('aAa')},
Tools.simple_sequence('aA'): {Tools.simple_sequence('aa')},
Tools.simple_sequence('Ab'): {Tools.simple_sequence('aab')}
}
)
csg3 = CSG(
terminals={'a', 'b'},
non_terminals={'S', 'B'},
axiom='S',
productions={
Tools.simple_sequence('S'): {Tools.simple_sequence('aBS'),
Tools.simple_sequence('ab')},
Tools.simple_sequence('Ba'): {Tools.simple_sequence('aB')},
Tools.simple_sequence('Bb'): {Tools.simple_sequence('bb')}
}
)
cfg4 = CFG(
terminals={'i', '+', '*', '(', ')'},
non_terminals={'E', 'T', 'F'},
axiom='E',
productions=Tools.simple_productions({
'E': {'E+T', 'T'},
'T': {'T*F', 'F'},
'F': {'i', '(E)'}
})
)
cfg5 = CFG(
terminals={'a', 'b'},
non_terminals={'S'},
axiom='S',
productions=Tools.simple_productions({
'S': {'aSb', 'ab'}
})
)
cfg6 = CFG(
terminals={'(', ')'},
non_terminals={'S'},
axiom='S',
productions=Tools.simple_productions({
'S': {'()', 'SS', '(S)'}
})
)
cfg7 = CFG(
terminals={'a', 'b'},
non_terminals={'S', 'U'},
axiom='S',
productions=Tools.simple_productions({
'S': {'Ub'},
'U': {'ab', 'S'}
})
)
cfg8 = CFG(
terminals={'a', 'b'},
non_terminals={'S', 'U'},
axiom='S',
productions=Tools.simple_productions({
'S': {'Ub', ''},
'U': {'ab', 'S'}
})
)
gg2 = GG(
terminals={'a', 'b', 'c'},
non_terminals={'S', 'B', 'C', 'F', 'G'},
axiom='S',
productions={
Tools.simple_sequence('S'): {Tools.simple_sequence('aSBC')},
Tools.simple_sequence('CB'): {Tools.simple_sequence('BC')},
Tools.simple_sequence('SB'): {Tools.simple_sequence('bF')},
Tools.simple_sequence('FB'): {Tools.simple_sequence('bF')},
Tools.simple_sequence('FC'): {Tools.simple_sequence('cG')},
Tools.simple_sequence('GC'): {Tools.simple_sequence('cG')},
Tools.simple_sequence('G'): {Tools.simple_sequence('')}
}
)
print(gg2)
# Salva definizione di una grammatica in un file .yaml nella cartella 'store'
gg2.save('gg2')
# File yaml derivato
# %less store/gg2.yaml
# La funzione Tools.load carica la definizione di una grammatica dal file specificato, nella cartella 'store'
gg20 = Tools.load('gg2')
print(gg20)
# %%