| author | Chengsong |
| Tue, 14 Dec 2021 16:06:42 +0000 | |
| changeset 378 | ee53acaf2420 |
| parent 375 | f83271c585d2 |
| child 379 | 28458dec90f8 |
| permissions | -rw-r--r-- |
| 365 | 1 |
|
2 |
theory SizeBound |
|
3 |
imports "Lexer" |
|
4 |
begin |
|
5 |
||
6 |
section \<open>Bit-Encodings\<close> |
|
7 |
||
8 |
datatype bit = Z | S |
|
9 |
||
10 |
fun code :: "val \<Rightarrow> bit list" |
|
11 |
where |
|
12 |
"code Void = []" |
|
13 |
| "code (Char c) = []" |
|
14 |
| "code (Left v) = Z # (code v)" |
|
15 |
| "code (Right v) = S # (code v)" |
|
16 |
| "code (Seq v1 v2) = (code v1) @ (code v2)" |
|
17 |
| "code (Stars []) = [S]" |
|
18 |
| "code (Stars (v # vs)) = (Z # code v) @ code (Stars vs)" |
|
19 |
||
20 |
||
21 |
fun |
|
22 |
Stars_add :: "val \<Rightarrow> val \<Rightarrow> val" |
|
23 |
where |
|
24 |
"Stars_add v (Stars vs) = Stars (v # vs)" |
|
25 |
||
26 |
function |
|
27 |
decode' :: "bit list \<Rightarrow> rexp \<Rightarrow> (val * bit list)" |
|
28 |
where |
|
29 |
"decode' ds ZERO = (Void, [])" |
|
30 |
| "decode' ds ONE = (Void, ds)" |
|
31 |
| "decode' ds (CH d) = (Char d, ds)" |
|
32 |
| "decode' [] (ALT r1 r2) = (Void, [])" |
|
33 |
| "decode' (Z # ds) (ALT r1 r2) = (let (v, ds') = decode' ds r1 in (Left v, ds'))" |
|
34 |
| "decode' (S # ds) (ALT r1 r2) = (let (v, ds') = decode' ds r2 in (Right v, ds'))" |
|
35 |
| "decode' ds (SEQ r1 r2) = (let (v1, ds') = decode' ds r1 in |
|
36 |
let (v2, ds'') = decode' ds' r2 in (Seq v1 v2, ds''))" |
|
37 |
| "decode' [] (STAR r) = (Void, [])" |
|
38 |
| "decode' (S # ds) (STAR r) = (Stars [], ds)" |
|
39 |
| "decode' (Z # ds) (STAR r) = (let (v, ds') = decode' ds r in |
|
40 |
let (vs, ds'') = decode' ds' (STAR r) |
|
41 |
in (Stars_add v vs, ds''))" |
|
42 |
by pat_completeness auto |
|
43 |
||
44 |
lemma decode'_smaller: |
|
45 |
assumes "decode'_dom (ds, r)" |
|
46 |
shows "length (snd (decode' ds r)) \<le> length ds" |
|
47 |
using assms |
|
48 |
apply(induct ds r) |
|
49 |
apply(auto simp add: decode'.psimps split: prod.split) |
|
50 |
using dual_order.trans apply blast |
|
51 |
by (meson dual_order.trans le_SucI) |
|
52 |
||
53 |
termination "decode'" |
|
54 |
apply(relation "inv_image (measure(%cs. size cs) <*lex*> measure(%s. size s)) (%(ds,r). (r,ds))") |
|
55 |
apply(auto dest!: decode'_smaller) |
|
56 |
by (metis less_Suc_eq_le snd_conv) |
|
57 |
||
58 |
definition |
|
59 |
decode :: "bit list \<Rightarrow> rexp \<Rightarrow> val option" |
|
60 |
where |
|
61 |
"decode ds r \<equiv> (let (v, ds') = decode' ds r |
|
62 |
in (if ds' = [] then Some v else None))" |
|
63 |
||
64 |
lemma decode'_code_Stars: |
|
65 |
assumes "\<forall>v\<in>set vs. \<Turnstile> v : r \<and> (\<forall>x. decode' (code v @ x) r = (v, x)) \<and> flat v \<noteq> []" |
|
66 |
shows "decode' (code (Stars vs) @ ds) (STAR r) = (Stars vs, ds)" |
|
67 |
using assms |
|
68 |
apply(induct vs) |
|
69 |
apply(auto) |
|
70 |
done |
|
71 |
||
72 |
lemma decode'_code: |
|
73 |
assumes "\<Turnstile> v : r" |
|
74 |
shows "decode' ((code v) @ ds) r = (v, ds)" |
|
75 |
using assms |
|
76 |
apply(induct v r arbitrary: ds) |
|
77 |
apply(auto) |
|
78 |
using decode'_code_Stars by blast |
|
79 |
||
80 |
lemma decode_code: |
|
81 |
assumes "\<Turnstile> v : r" |
|
82 |
shows "decode (code v) r = Some v" |
|
83 |
using assms unfolding decode_def |
|
84 |
by (smt append_Nil2 decode'_code old.prod.case) |
|
85 |
||
86 |
||
87 |
section {* Annotated Regular Expressions *}
|
|
88 |
||
89 |
datatype arexp = |
|
90 |
AZERO |
|
91 |
| AONE "bit list" |
|
92 |
| ACHAR "bit list" char |
|
93 |
| ASEQ "bit list" arexp arexp |
|
94 |
| AALTs "bit list" "arexp list" |
|
95 |
| ASTAR "bit list" arexp |
|
96 |
||
97 |
abbreviation |
|
98 |
"AALT bs r1 r2 \<equiv> AALTs bs [r1, r2]" |
|
99 |
||
100 |
fun asize :: "arexp \<Rightarrow> nat" where |
|
101 |
"asize AZERO = 1" |
|
102 |
| "asize (AONE cs) = 1" |
|
103 |
| "asize (ACHAR cs c) = 1" |
|
104 |
| "asize (AALTs cs rs) = Suc (sum_list (map asize rs))" |
|
105 |
| "asize (ASEQ cs r1 r2) = Suc (asize r1 + asize r2)" |
|
106 |
| "asize (ASTAR cs r) = Suc (asize r)" |
|
107 |
||
108 |
fun |
|
109 |
erase :: "arexp \<Rightarrow> rexp" |
|
110 |
where |
|
111 |
"erase AZERO = ZERO" |
|
112 |
| "erase (AONE _) = ONE" |
|
113 |
| "erase (ACHAR _ c) = CH c" |
|
114 |
| "erase (AALTs _ []) = ZERO" |
|
115 |
| "erase (AALTs _ [r]) = (erase r)" |
|
116 |
| "erase (AALTs bs (r#rs)) = ALT (erase r) (erase (AALTs bs rs))" |
|
117 |
| "erase (ASEQ _ r1 r2) = SEQ (erase r1) (erase r2)" |
|
118 |
| "erase (ASTAR _ r) = STAR (erase r)" |
|
119 |
||
120 |
||
121 |
fun nonalt :: "arexp \<Rightarrow> bool" |
|
122 |
where |
|
123 |
"nonalt (AALTs bs2 rs) = False" |
|
124 |
| "nonalt r = True" |
|
125 |
||
126 |
||
127 |
fun fuse :: "bit list \<Rightarrow> arexp \<Rightarrow> arexp" where |
|
128 |
"fuse bs AZERO = AZERO" |
|
129 |
| "fuse bs (AONE cs) = AONE (bs @ cs)" |
|
130 |
| "fuse bs (ACHAR cs c) = ACHAR (bs @ cs) c" |
|
131 |
| "fuse bs (AALTs cs rs) = AALTs (bs @ cs) rs" |
|
132 |
| "fuse bs (ASEQ cs r1 r2) = ASEQ (bs @ cs) r1 r2" |
|
133 |
| "fuse bs (ASTAR cs r) = ASTAR (bs @ cs) r" |
|
134 |
||
135 |
lemma fuse_append: |
|
136 |
shows "fuse (bs1 @ bs2) r = fuse bs1 (fuse bs2 r)" |
|
137 |
apply(induct r) |
|
138 |
apply(auto) |
|
139 |
done |
|
140 |
||
141 |
||
142 |
fun intern :: "rexp \<Rightarrow> arexp" where |
|
143 |
"intern ZERO = AZERO" |
|
144 |
| "intern ONE = AONE []" |
|
145 |
| "intern (CH c) = ACHAR [] c" |
|
146 |
| "intern (ALT r1 r2) = AALT [] (fuse [Z] (intern r1)) |
|
147 |
(fuse [S] (intern r2))" |
|
148 |
| "intern (SEQ r1 r2) = ASEQ [] (intern r1) (intern r2)" |
|
149 |
| "intern (STAR r) = ASTAR [] (intern r)" |
|
150 |
||
151 |
||
152 |
fun retrieve :: "arexp \<Rightarrow> val \<Rightarrow> bit list" where |
|
153 |
"retrieve (AONE bs) Void = bs" |
|
154 |
| "retrieve (ACHAR bs c) (Char d) = bs" |
|
155 |
| "retrieve (AALTs bs [r]) v = bs @ retrieve r v" |
|
156 |
| "retrieve (AALTs bs (r#rs)) (Left v) = bs @ retrieve r v" |
|
157 |
| "retrieve (AALTs bs (r#rs)) (Right v) = bs @ retrieve (AALTs [] rs) v" |
|
158 |
| "retrieve (ASEQ bs r1 r2) (Seq v1 v2) = bs @ retrieve r1 v1 @ retrieve r2 v2" |
|
159 |
| "retrieve (ASTAR bs r) (Stars []) = bs @ [S]" |
|
160 |
| "retrieve (ASTAR bs r) (Stars (v#vs)) = |
|
161 |
bs @ [Z] @ retrieve r v @ retrieve (ASTAR [] r) (Stars vs)" |
|
162 |
||
163 |
||
164 |
||
165 |
fun |
|
166 |
bnullable :: "arexp \<Rightarrow> bool" |
|
167 |
where |
|
168 |
"bnullable (AZERO) = False" |
|
169 |
| "bnullable (AONE bs) = True" |
|
170 |
| "bnullable (ACHAR bs c) = False" |
|
171 |
| "bnullable (AALTs bs rs) = (\<exists>r \<in> set rs. bnullable r)" |
|
172 |
| "bnullable (ASEQ bs r1 r2) = (bnullable r1 \<and> bnullable r2)" |
|
173 |
| "bnullable (ASTAR bs r) = True" |
|
174 |
||
175 |
fun |
|
176 |
bmkeps :: "arexp \<Rightarrow> bit list" |
|
177 |
where |
|
178 |
"bmkeps(AONE bs) = bs" |
|
179 |
| "bmkeps(ASEQ bs r1 r2) = bs @ (bmkeps r1) @ (bmkeps r2)" |
|
180 |
| "bmkeps(AALTs bs [r]) = bs @ (bmkeps r)" |
|
181 |
| "bmkeps(AALTs bs (r#rs)) = (if bnullable(r) then bs @ (bmkeps r) else (bmkeps (AALTs bs rs)))" |
|
182 |
| "bmkeps(ASTAR bs r) = bs @ [S]" |
|
183 |
||
184 |
||
185 |
fun |
|
186 |
bder :: "char \<Rightarrow> arexp \<Rightarrow> arexp" |
|
187 |
where |
|
188 |
"bder c (AZERO) = AZERO" |
|
189 |
| "bder c (AONE bs) = AZERO" |
|
190 |
| "bder c (ACHAR bs d) = (if c = d then AONE bs else AZERO)" |
|
191 |
| "bder c (AALTs bs rs) = AALTs bs (map (bder c) rs)" |
|
192 |
| "bder c (ASEQ bs r1 r2) = |
|
193 |
(if bnullable r1 |
|
194 |
then AALT bs (ASEQ [] (bder c r1) r2) (fuse (bmkeps r1) (bder c r2)) |
|
195 |
else ASEQ bs (bder c r1) r2)" |
|
196 |
| "bder c (ASTAR bs r) = ASEQ bs (fuse [Z] (bder c r)) (ASTAR [] r)" |
|
197 |
||
198 |
||
199 |
fun |
|
200 |
bders :: "arexp \<Rightarrow> string \<Rightarrow> arexp" |
|
201 |
where |
|
202 |
"bders r [] = r" |
|
203 |
| "bders r (c#s) = bders (bder c r) s" |
|
204 |
||
205 |
lemma bders_append: |
|
206 |
"bders r (s1 @ s2) = bders (bders r s1) s2" |
|
207 |
apply(induct s1 arbitrary: r s2) |
|
208 |
apply(simp_all) |
|
209 |
done |
|
210 |
||
211 |
lemma bnullable_correctness: |
|
212 |
shows "nullable (erase r) = bnullable r" |
|
213 |
apply(induct r rule: erase.induct) |
|
214 |
apply(simp_all) |
|
215 |
done |
|
216 |
||
217 |
lemma erase_fuse: |
|
218 |
shows "erase (fuse bs r) = erase r" |
|
219 |
apply(induct r rule: erase.induct) |
|
220 |
apply(simp_all) |
|
221 |
done |
|
222 |
||
223 |
lemma erase_intern [simp]: |
|
224 |
shows "erase (intern r) = r" |
|
225 |
apply(induct r) |
|
226 |
apply(simp_all add: erase_fuse) |
|
227 |
done |
|
228 |
||
229 |
lemma erase_bder [simp]: |
|
230 |
shows "erase (bder a r) = der a (erase r)" |
|
231 |
apply(induct r rule: erase.induct) |
|
232 |
apply(simp_all add: erase_fuse bnullable_correctness) |
|
233 |
done |
|
234 |
||
235 |
lemma erase_bders [simp]: |
|
236 |
shows "erase (bders r s) = ders s (erase r)" |
|
237 |
apply(induct s arbitrary: r ) |
|
238 |
apply(simp_all) |
|
239 |
done |
|
240 |
||
241 |
lemma retrieve_encode_STARS: |
|
242 |
assumes "\<forall>v\<in>set vs. \<Turnstile> v : r \<and> code v = retrieve (intern r) v" |
|
243 |
shows "code (Stars vs) = retrieve (ASTAR [] (intern r)) (Stars vs)" |
|
244 |
using assms |
|
245 |
apply(induct vs) |
|
246 |
apply(simp_all) |
|
247 |
done |
|
248 |
||
249 |
||
250 |
lemma retrieve_fuse2: |
|
251 |
assumes "\<Turnstile> v : (erase r)" |
|
252 |
shows "retrieve (fuse bs r) v = bs @ retrieve r v" |
|
253 |
using assms |
|
254 |
apply(induct r arbitrary: v bs) |
|
255 |
apply(auto elim: Prf_elims)[4] |
|
256 |
defer |
|
257 |
using retrieve_encode_STARS |
|
258 |
apply(auto elim!: Prf_elims)[1] |
|
259 |
apply(case_tac vs) |
|
260 |
apply(simp) |
|
261 |
apply(simp) |
|
262 |
(* AALTs case *) |
|
263 |
apply(simp) |
|
264 |
apply(case_tac x2a) |
|
265 |
apply(simp) |
|
266 |
apply(auto elim!: Prf_elims)[1] |
|
267 |
apply(simp) |
|
268 |
apply(case_tac list) |
|
269 |
apply(simp) |
|
270 |
apply(auto) |
|
271 |
apply(auto elim!: Prf_elims)[1] |
|
272 |
done |
|
273 |
||
274 |
lemma retrieve_fuse: |
|
275 |
assumes "\<Turnstile> v : r" |
|
276 |
shows "retrieve (fuse bs (intern r)) v = bs @ retrieve (intern r) v" |
|
277 |
using assms |
|
278 |
by (simp_all add: retrieve_fuse2) |
|
279 |
||
280 |
||
281 |
lemma retrieve_code: |
|
282 |
assumes "\<Turnstile> v : r" |
|
283 |
shows "code v = retrieve (intern r) v" |
|
284 |
using assms |
|
285 |
apply(induct v r ) |
|
286 |
apply(simp_all add: retrieve_fuse retrieve_encode_STARS) |
|
287 |
done |
|
288 |
||
289 |
||
290 |
lemma bnullable_Hdbmkeps_Hd: |
|
291 |
assumes "bnullable a" |
|
292 |
shows "bmkeps (AALTs bs (a # rs)) = bs @ (bmkeps a)" |
|
293 |
using assms |
|
294 |
by (metis bmkeps.simps(3) bmkeps.simps(4) list.exhaust) |
|
295 |
||
296 |
lemma r1: |
|
297 |
assumes "\<not> bnullable a" "bnullable (AALTs bs rs)" |
|
298 |
shows "bmkeps (AALTs bs (a # rs)) = bmkeps (AALTs bs rs)" |
|
299 |
using assms |
|
300 |
apply(induct rs) |
|
301 |
apply(auto) |
|
302 |
done |
|
303 |
||
304 |
lemma r2: |
|
305 |
assumes "x \<in> set rs" "bnullable x" |
|
306 |
shows "bnullable (AALTs bs rs)" |
|
307 |
using assms |
|
308 |
apply(induct rs) |
|
309 |
apply(auto) |
|
310 |
done |
|
311 |
||
312 |
lemma r3: |
|
313 |
assumes "\<not> bnullable r" |
|
314 |
" \<exists> x \<in> set rs. bnullable x" |
|
315 |
shows "retrieve (AALTs bs rs) (mkeps (erase (AALTs bs rs))) = |
|
316 |
retrieve (AALTs bs (r # rs)) (mkeps (erase (AALTs bs (r # rs))))" |
|
317 |
using assms |
|
318 |
apply(induct rs arbitrary: r bs) |
|
319 |
apply(auto)[1] |
|
320 |
apply(auto) |
|
321 |
using bnullable_correctness apply blast |
|
322 |
apply(auto simp add: bnullable_correctness mkeps_nullable retrieve_fuse2) |
|
323 |
apply(subst retrieve_fuse2[symmetric]) |
|
324 |
apply (smt bnullable.simps(4) bnullable_correctness erase.simps(5) erase.simps(6) insert_iff list.exhaust list.set(2) mkeps.simps(3) mkeps_nullable) |
|
325 |
apply(simp) |
|
326 |
apply(case_tac "bnullable a") |
|
327 |
apply (smt append_Nil2 bnullable.simps(4) bnullable_correctness erase.simps(5) erase.simps(6) fuse.simps(4) insert_iff list.exhaust list.set(2) mkeps.simps(3) mkeps_nullable retrieve_fuse2) |
|
328 |
apply(drule_tac x="a" in meta_spec) |
|
329 |
apply(drule_tac x="bs" in meta_spec) |
|
330 |
apply(drule meta_mp) |
|
331 |
apply(simp) |
|
332 |
apply(drule meta_mp) |
|
333 |
apply(auto) |
|
334 |
apply(subst retrieve_fuse2[symmetric]) |
|
335 |
apply(case_tac rs) |
|
336 |
apply(simp) |
|
337 |
apply(auto)[1] |
|
338 |
apply (simp add: bnullable_correctness) |
|
339 |
apply (metis append_Nil2 bnullable_correctness erase_fuse fuse.simps(4) list.set_intros(1) mkeps.simps(3) mkeps_nullable nullable.simps(4) r2) |
|
340 |
apply (simp add: bnullable_correctness) |
|
341 |
apply (metis append_Nil2 bnullable_correctness erase.simps(6) erase_fuse fuse.simps(4) list.set_intros(2) mkeps.simps(3) mkeps_nullable r2) |
|
342 |
apply(simp) |
|
343 |
done |
|
344 |
||
345 |
||
346 |
lemma t: |
|
347 |
assumes "\<forall>r \<in> set rs. nullable (erase r) \<longrightarrow> bmkeps r = retrieve r (mkeps (erase r))" |
|
348 |
"nullable (erase (AALTs bs rs))" |
|
349 |
shows " bmkeps (AALTs bs rs) = retrieve (AALTs bs rs) (mkeps (erase (AALTs bs rs)))" |
|
350 |
using assms |
|
351 |
apply(induct rs arbitrary: bs) |
|
352 |
apply(simp) |
|
353 |
apply(auto simp add: bnullable_correctness) |
|
354 |
apply(case_tac rs) |
|
355 |
apply(auto simp add: bnullable_correctness)[2] |
|
356 |
apply(subst r1) |
|
357 |
apply(simp) |
|
358 |
apply(rule r2) |
|
359 |
apply(assumption) |
|
360 |
apply(simp) |
|
361 |
apply(drule_tac x="bs" in meta_spec) |
|
362 |
apply(drule meta_mp) |
|
363 |
apply(auto)[1] |
|
364 |
prefer 2 |
|
365 |
apply(case_tac "bnullable a") |
|
366 |
apply(subst bnullable_Hdbmkeps_Hd) |
|
367 |
apply blast |
|
368 |
apply(subgoal_tac "nullable (erase a)") |
|
369 |
prefer 2 |
|
370 |
using bnullable_correctness apply blast |
|
371 |
apply (metis (no_types, lifting) erase.simps(5) erase.simps(6) list.exhaust mkeps.simps(3) retrieve.simps(3) retrieve.simps(4)) |
|
372 |
apply(subst r1) |
|
373 |
apply(simp) |
|
374 |
using r2 apply blast |
|
375 |
apply(drule_tac x="bs" in meta_spec) |
|
376 |
apply(drule meta_mp) |
|
377 |
apply(auto)[1] |
|
378 |
apply(simp) |
|
379 |
using r3 apply blast |
|
380 |
apply(auto) |
|
381 |
using r3 by blast |
|
382 |
||
383 |
lemma bmkeps_retrieve: |
|
384 |
assumes "nullable (erase r)" |
|
385 |
shows "bmkeps r = retrieve r (mkeps (erase r))" |
|
386 |
using assms |
|
387 |
apply(induct r) |
|
388 |
apply(simp) |
|
389 |
apply(simp) |
|
390 |
apply(simp) |
|
391 |
apply(simp) |
|
392 |
defer |
|
393 |
apply(simp) |
|
394 |
apply(rule t) |
|
395 |
apply(auto) |
|
396 |
done |
|
397 |
||
398 |
lemma bder_retrieve: |
|
399 |
assumes "\<Turnstile> v : der c (erase r)" |
|
400 |
shows "retrieve (bder c r) v = retrieve r (injval (erase r) c v)" |
|
401 |
using assms |
|
402 |
apply(induct r arbitrary: v rule: erase.induct) |
|
403 |
apply(simp) |
|
404 |
apply(erule Prf_elims) |
|
405 |
apply(simp) |
|
406 |
apply(erule Prf_elims) |
|
407 |
apply(simp) |
|
408 |
apply(case_tac "c = ca") |
|
409 |
apply(simp) |
|
410 |
apply(erule Prf_elims) |
|
411 |
apply(simp) |
|
412 |
apply(simp) |
|
413 |
apply(erule Prf_elims) |
|
414 |
apply(simp) |
|
415 |
apply(erule Prf_elims) |
|
416 |
apply(simp) |
|
417 |
apply(simp) |
|
418 |
apply(rename_tac "r\<^sub>1" "r\<^sub>2" rs v) |
|
419 |
apply(erule Prf_elims) |
|
420 |
apply(simp) |
|
421 |
apply(simp) |
|
422 |
apply(case_tac rs) |
|
423 |
apply(simp) |
|
424 |
apply(simp) |
|
425 |
apply (smt Prf_elims(3) injval.simps(2) injval.simps(3) retrieve.simps(4) retrieve.simps(5) same_append_eq) |
|
426 |
apply(simp) |
|
427 |
apply(case_tac "nullable (erase r1)") |
|
428 |
apply(simp) |
|
429 |
apply(erule Prf_elims) |
|
430 |
apply(subgoal_tac "bnullable r1") |
|
431 |
prefer 2 |
|
432 |
using bnullable_correctness apply blast |
|
433 |
apply(simp) |
|
434 |
apply(erule Prf_elims) |
|
435 |
apply(simp) |
|
436 |
apply(subgoal_tac "bnullable r1") |
|
437 |
prefer 2 |
|
438 |
using bnullable_correctness apply blast |
|
439 |
apply(simp) |
|
440 |
apply(simp add: retrieve_fuse2) |
|
441 |
apply(simp add: bmkeps_retrieve) |
|
442 |
apply(simp) |
|
443 |
apply(erule Prf_elims) |
|
444 |
apply(simp) |
|
445 |
using bnullable_correctness apply blast |
|
446 |
apply(rename_tac bs r v) |
|
447 |
apply(simp) |
|
448 |
apply(erule Prf_elims) |
|
449 |
apply(clarify) |
|
450 |
apply(erule Prf_elims) |
|
451 |
apply(clarify) |
|
452 |
apply(subst injval.simps) |
|
453 |
apply(simp del: retrieve.simps) |
|
454 |
apply(subst retrieve.simps) |
|
455 |
apply(subst retrieve.simps) |
|
456 |
apply(simp) |
|
457 |
apply(simp add: retrieve_fuse2) |
|
458 |
done |
|
459 |
||
460 |
||
461 |
||
462 |
lemma MAIN_decode: |
|
463 |
assumes "\<Turnstile> v : ders s r" |
|
464 |
shows "Some (flex r id s v) = decode (retrieve (bders (intern r) s) v) r" |
|
465 |
using assms |
|
466 |
proof (induct s arbitrary: v rule: rev_induct) |
|
467 |
case Nil |
|
468 |
have "\<Turnstile> v : ders [] r" by fact |
|
469 |
then have "\<Turnstile> v : r" by simp |
|
470 |
then have "Some v = decode (retrieve (intern r) v) r" |
|
471 |
using decode_code retrieve_code by auto |
|
472 |
then show "Some (flex r id [] v) = decode (retrieve (bders (intern r) []) v) r" |
|
473 |
by simp |
|
474 |
next |
|
475 |
case (snoc c s v) |
|
476 |
have IH: "\<And>v. \<Turnstile> v : ders s r \<Longrightarrow> |
|
477 |
Some (flex r id s v) = decode (retrieve (bders (intern r) s) v) r" by fact |
|
478 |
have asm: "\<Turnstile> v : ders (s @ [c]) r" by fact |
|
479 |
then have asm2: "\<Turnstile> injval (ders s r) c v : ders s r" |
|
480 |
by (simp add: Prf_injval ders_append) |
|
481 |
have "Some (flex r id (s @ [c]) v) = Some (flex r id s (injval (ders s r) c v))" |
|
482 |
by (simp add: flex_append) |
|
483 |
also have "... = decode (retrieve (bders (intern r) s) (injval (ders s r) c v)) r" |
|
484 |
using asm2 IH by simp |
|
485 |
also have "... = decode (retrieve (bder c (bders (intern r) s)) v) r" |
|
486 |
using asm by (simp_all add: bder_retrieve ders_append) |
|
487 |
finally show "Some (flex r id (s @ [c]) v) = |
|
488 |
decode (retrieve (bders (intern r) (s @ [c])) v) r" by (simp add: bders_append) |
|
489 |
qed |
|
490 |
||
491 |
||
492 |
definition blex where |
|
493 |
"blex a s \<equiv> if bnullable (bders a s) then Some (bmkeps (bders a s)) else None" |
|
494 |
||
495 |
||
496 |
||
497 |
definition blexer where |
|
498 |
"blexer r s \<equiv> if bnullable (bders (intern r) s) then |
|
499 |
decode (bmkeps (bders (intern r) s)) r else None" |
|
500 |
||
501 |
lemma blexer_correctness: |
|
502 |
shows "blexer r s = lexer r s" |
|
503 |
proof - |
|
504 |
{ define bds where "bds \<equiv> bders (intern r) s"
|
|
505 |
define ds where "ds \<equiv> ders s r" |
|
506 |
assume asm: "nullable ds" |
|
507 |
have era: "erase bds = ds" |
|
508 |
unfolding ds_def bds_def by simp |
|
509 |
have mke: "\<Turnstile> mkeps ds : ds" |
|
510 |
using asm by (simp add: mkeps_nullable) |
|
511 |
have "decode (bmkeps bds) r = decode (retrieve bds (mkeps ds)) r" |
|
512 |
using bmkeps_retrieve |
|
513 |
using asm era by (simp add: bmkeps_retrieve) |
|
514 |
also have "... = Some (flex r id s (mkeps ds))" |
|
515 |
using mke by (simp_all add: MAIN_decode ds_def bds_def) |
|
516 |
finally have "decode (bmkeps bds) r = Some (flex r id s (mkeps ds))" |
|
517 |
unfolding bds_def ds_def . |
|
518 |
} |
|
519 |
then show "blexer r s = lexer r s" |
|
520 |
unfolding blexer_def lexer_flex |
|
521 |
apply(subst bnullable_correctness[symmetric]) |
|
522 |
apply(simp) |
|
523 |
done |
|
524 |
qed |
|
525 |
||
526 |
||
527 |
fun distinctBy :: "'a list \<Rightarrow> ('a \<Rightarrow> 'b) \<Rightarrow> 'b set \<Rightarrow> 'a list"
|
|
528 |
where |
|
529 |
"distinctBy [] f acc = []" |
|
530 |
| "distinctBy (x#xs) f acc = |
|
531 |
(if (f x) \<in> acc then distinctBy xs f acc |
|
532 |
else x # (distinctBy xs f ({f x} \<union> acc)))"
|
|
533 |
||
| 374 | 534 |
lemma dB_single_step: |
535 |
shows "distinctBy (a#rs) f {} = a # distinctBy rs f {f a}"
|
|
536 |
by simp |
|
| 365 | 537 |
|
538 |
fun flts :: "arexp list \<Rightarrow> arexp list" |
|
539 |
where |
|
540 |
"flts [] = []" |
|
541 |
| "flts (AZERO # rs) = flts rs" |
|
542 |
| "flts ((AALTs bs rs1) # rs) = (map (fuse bs) rs1) @ flts rs" |
|
543 |
| "flts (r1 # rs) = r1 # flts rs" |
|
544 |
||
545 |
||
546 |
||
547 |
fun bsimp_ASEQ :: "bit list \<Rightarrow> arexp \<Rightarrow> arexp \<Rightarrow> arexp" |
|
548 |
where |
|
549 |
"bsimp_ASEQ _ AZERO _ = AZERO" |
|
550 |
| "bsimp_ASEQ _ _ AZERO = AZERO" |
|
551 |
| "bsimp_ASEQ bs1 (AONE bs2) r2 = fuse (bs1 @ bs2) r2" |
|
552 |
| "bsimp_ASEQ bs1 r1 r2 = ASEQ bs1 r1 r2" |
|
553 |
||
554 |
||
555 |
fun bsimp_AALTs :: "bit list \<Rightarrow> arexp list \<Rightarrow> arexp" |
|
556 |
where |
|
557 |
"bsimp_AALTs _ [] = AZERO" |
|
558 |
| "bsimp_AALTs bs1 [r] = fuse bs1 r" |
|
559 |
| "bsimp_AALTs bs1 rs = AALTs bs1 rs" |
|
560 |
||
561 |
||
562 |
fun bsimp :: "arexp \<Rightarrow> arexp" |
|
563 |
where |
|
564 |
"bsimp (ASEQ bs1 r1 r2) = bsimp_ASEQ bs1 (bsimp r1) (bsimp r2)" |
|
| 374 | 565 |
| "bsimp (AALTs bs1 rs) = bsimp_AALTs bs1 (distinctBy (flts (map bsimp rs)) erase {}) "
|
| 365 | 566 |
| "bsimp r = r" |
567 |
||
568 |
||
569 |
fun |
|
570 |
bders_simp :: "arexp \<Rightarrow> string \<Rightarrow> arexp" |
|
571 |
where |
|
572 |
"bders_simp r [] = r" |
|
573 |
| "bders_simp r (c # s) = bders_simp (bsimp (bder c r)) s" |
|
574 |
||
575 |
definition blexer_simp where |
|
576 |
"blexer_simp r s \<equiv> if bnullable (bders_simp (intern r) s) then |
|
| 374 | 577 |
decode (bmkeps (bders_simp (intern r) s)) r else None" |
| 365 | 578 |
|
579 |
export_code bders_simp in Scala module_name Example |
|
580 |
||
581 |
lemma bders_simp_append: |
|
582 |
shows "bders_simp r (s1 @ s2) = bders_simp (bders_simp r s1) s2" |
|
583 |
apply(induct s1 arbitrary: r s2) |
|
| 374 | 584 |
apply(simp_all) |
| 365 | 585 |
done |
586 |
||
587 |
lemma L_bsimp_ASEQ: |
|
588 |
"L (SEQ (erase r1) (erase r2)) = L (erase (bsimp_ASEQ bs r1 r2))" |
|
589 |
apply(induct bs r1 r2 rule: bsimp_ASEQ.induct) |
|
590 |
apply(simp_all) |
|
591 |
by (metis erase_fuse fuse.simps(4)) |
|
592 |
||
593 |
lemma L_bsimp_AALTs: |
|
594 |
"L (erase (AALTs bs rs)) = L (erase (bsimp_AALTs bs rs))" |
|
595 |
apply(induct bs rs rule: bsimp_AALTs.induct) |
|
596 |
apply(simp_all add: erase_fuse) |
|
597 |
done |
|
598 |
||
599 |
lemma L_erase_AALTs: |
|
600 |
shows "L (erase (AALTs bs rs)) = \<Union> (L ` erase ` (set rs))" |
|
601 |
apply(induct rs) |
|
602 |
apply(simp) |
|
603 |
apply(simp) |
|
604 |
apply(case_tac rs) |
|
605 |
apply(simp) |
|
606 |
apply(simp) |
|
607 |
done |
|
608 |
||
609 |
lemma L_erase_flts: |
|
610 |
shows "\<Union> (L ` erase ` (set (flts rs))) = \<Union> (L ` erase ` (set rs))" |
|
611 |
apply(induct rs rule: flts.induct) |
|
612 |
apply(simp_all) |
|
613 |
apply(auto) |
|
614 |
using L_erase_AALTs erase_fuse apply auto[1] |
|
615 |
by (simp add: L_erase_AALTs erase_fuse) |
|
616 |
||
617 |
lemma L_erase_dB_acc: |
|
618 |
shows "( \<Union>(L ` acc) \<union> ( \<Union> (L ` erase ` (set (distinctBy rs erase acc) ) ) )) = \<Union>(L ` acc) \<union> \<Union> (L ` erase ` (set rs))" |
|
619 |
apply(induction rs arbitrary: acc) |
|
620 |
apply simp |
|
621 |
apply simp |
|
622 |
by (smt (z3) SUP_absorb UN_insert sup_assoc sup_commute) |
|
623 |
||
624 |
lemma L_erase_dB: |
|
625 |
shows " ( \<Union> (L ` erase ` (set (distinctBy rs erase {}) ) ) ) = \<Union> (L ` erase ` (set rs))"
|
|
626 |
by (metis L_erase_dB_acc Un_commute Union_image_empty) |
|
627 |
||
628 |
lemma L_bsimp_erase: |
|
629 |
shows "L (erase r) = L (erase (bsimp r))" |
|
630 |
apply(induct r) |
|
631 |
apply(simp) |
|
632 |
apply(simp) |
|
633 |
apply(simp) |
|
634 |
apply(auto simp add: Sequ_def)[1] |
|
635 |
apply(subst L_bsimp_ASEQ[symmetric]) |
|
636 |
apply(auto simp add: Sequ_def)[1] |
|
637 |
apply(subst (asm) L_bsimp_ASEQ[symmetric]) |
|
638 |
apply(auto simp add: Sequ_def)[1] |
|
| 374 | 639 |
apply(simp) |
640 |
apply(subst L_bsimp_AALTs[symmetric]) |
|
641 |
defer |
|
642 |
apply(simp) |
|
| 365 | 643 |
apply(subst (2)L_erase_AALTs) |
644 |
apply(subst L_erase_dB) |
|
645 |
apply(subst L_erase_flts) |
|
646 |
apply(auto) |
|
| 374 | 647 |
apply (simp add: L_erase_AALTs) |
| 365 | 648 |
using L_erase_AALTs by blast |
649 |
||
| 374 | 650 |
|
651 |
||
| 365 | 652 |
lemma bsimp_ASEQ0: |
653 |
shows "bsimp_ASEQ bs r1 AZERO = AZERO" |
|
654 |
apply(induct r1) |
|
655 |
apply(auto) |
|
656 |
done |
|
657 |
||
658 |
lemma bsimp_ASEQ1: |
|
659 |
assumes "r1 \<noteq> AZERO" "r2 \<noteq> AZERO" "\<forall>bs. r1 \<noteq> AONE bs" |
|
660 |
shows "bsimp_ASEQ bs r1 r2 = ASEQ bs r1 r2" |
|
661 |
using assms |
|
662 |
apply(induct bs r1 r2 rule: bsimp_ASEQ.induct) |
|
663 |
apply(auto) |
|
664 |
done |
|
665 |
||
666 |
lemma bsimp_ASEQ2: |
|
667 |
shows "bsimp_ASEQ bs (AONE bs1) r2 = fuse (bs @ bs1) r2" |
|
668 |
apply(induct r2) |
|
669 |
apply(auto) |
|
670 |
done |
|
671 |
||
672 |
||
673 |
lemma L_bders_simp: |
|
674 |
shows "L (erase (bders_simp r s)) = L (erase (bders r s))" |
|
675 |
apply(induct s arbitrary: r rule: rev_induct) |
|
| 374 | 676 |
apply(simp) |
| 365 | 677 |
apply(simp) |
678 |
apply(simp add: ders_append) |
|
679 |
apply(simp add: bders_simp_append) |
|
680 |
apply(simp add: L_bsimp_erase[symmetric]) |
|
681 |
by (simp add: der_correctness) |
|
682 |
||
683 |
||
684 |
lemma b2: |
|
685 |
assumes "bnullable r" |
|
686 |
shows "bmkeps (fuse bs r) = bs @ bmkeps r" |
|
687 |
by (simp add: assms bmkeps_retrieve bnullable_correctness erase_fuse mkeps_nullable retrieve_fuse2) |
|
688 |
||
689 |
||
690 |
lemma b4: |
|
691 |
shows "bnullable (bders_simp r s) = bnullable (bders r s)" |
|
692 |
by (metis L_bders_simp bnullable_correctness lexer.simps(1) lexer_correct_None option.distinct(1)) |
|
693 |
||
694 |
||
695 |
lemma qq1: |
|
696 |
assumes "\<exists>r \<in> set rs. bnullable r" |
|
697 |
shows "bmkeps (AALTs bs (rs @ rs1)) = bmkeps (AALTs bs rs)" |
|
698 |
using assms |
|
699 |
apply(induct rs arbitrary: rs1 bs) |
|
700 |
apply(simp) |
|
701 |
apply(simp) |
|
702 |
by (metis Nil_is_append_conv bmkeps.simps(4) neq_Nil_conv bnullable_Hdbmkeps_Hd split_list_last) |
|
703 |
||
704 |
lemma qq2: |
|
705 |
assumes "\<forall>r \<in> set rs. \<not> bnullable r" "\<exists>r \<in> set rs1. bnullable r" |
|
706 |
shows "bmkeps (AALTs bs (rs @ rs1)) = bmkeps (AALTs bs rs1)" |
|
707 |
using assms |
|
708 |
apply(induct rs arbitrary: rs1 bs) |
|
709 |
apply(simp) |
|
710 |
apply(simp) |
|
711 |
by (metis append_assoc in_set_conv_decomp r1 r2) |
|
712 |
||
713 |
||
| 373 | 714 |
lemma flts_append: |
715 |
shows "flts (xs1 @ xs2) = flts xs1 @ flts xs2" |
|
716 |
by (induct xs1 arbitrary: xs2 rule: flts.induct)(auto) |
|
| 365 | 717 |
|
718 |
lemma k0a: |
|
719 |
shows "flts [AALTs bs rs] = map (fuse bs) rs" |
|
720 |
apply(simp) |
|
721 |
done |
|
722 |
||
723 |
||
724 |
lemma bsimp_AALTs_qq: |
|
725 |
assumes "1 < length rs" |
|
726 |
shows "bsimp_AALTs bs rs = AALTs bs rs" |
|
727 |
using assms |
|
728 |
apply(case_tac rs) |
|
729 |
apply(simp) |
|
730 |
apply(case_tac list) |
|
731 |
apply(simp_all) |
|
732 |
done |
|
733 |
||
734 |
||
735 |
||
736 |
lemma bbbbs1: |
|
737 |
shows "nonalt r \<or> (\<exists>bs rs. r = AALTs bs rs)" |
|
738 |
using nonalt.elims(3) by auto |
|
739 |
||
740 |
||
741 |
||
742 |
||
743 |
||
| 373 | 744 |
|
| 365 | 745 |
|
746 |
fun nonazero :: "arexp \<Rightarrow> bool" |
|
747 |
where |
|
748 |
"nonazero AZERO = False" |
|
749 |
| "nonazero r = True" |
|
750 |
||
751 |
||
752 |
lemma flts_single1: |
|
753 |
assumes "nonalt r" "nonazero r" |
|
754 |
shows "flts [r] = [r]" |
|
755 |
using assms |
|
756 |
apply(induct r) |
|
757 |
apply(auto) |
|
758 |
done |
|
759 |
||
760 |
||
761 |
||
762 |
lemma q3a: |
|
763 |
assumes "\<exists>r \<in> set rs. bnullable r" |
|
764 |
shows "bmkeps (AALTs bs (map (fuse bs1) rs)) = bmkeps (AALTs (bs@bs1) rs)" |
|
765 |
using assms |
|
766 |
apply(induct rs arbitrary: bs bs1) |
|
767 |
apply(simp) |
|
768 |
apply(simp) |
|
769 |
apply(auto) |
|
770 |
apply (metis append_assoc b2 bnullable_correctness erase_fuse bnullable_Hdbmkeps_Hd) |
|
771 |
apply(case_tac "bnullable a") |
|
772 |
apply (metis append.assoc b2 bnullable_correctness erase_fuse bnullable_Hdbmkeps_Hd) |
|
773 |
apply(case_tac rs) |
|
774 |
apply(simp) |
|
775 |
apply(simp) |
|
776 |
apply(auto)[1] |
|
777 |
apply (metis bnullable_correctness erase_fuse)+ |
|
778 |
done |
|
779 |
||
780 |
lemma qq4: |
|
781 |
assumes "\<exists>x\<in>set list. bnullable x" |
|
782 |
shows "\<exists>x\<in>set (flts list). bnullable x" |
|
783 |
using assms |
|
784 |
apply(induct list rule: flts.induct) |
|
785 |
apply(auto) |
|
786 |
by (metis UnCI bnullable_correctness erase_fuse imageI) |
|
787 |
||
788 |
||
789 |
lemma qs3: |
|
790 |
assumes "\<exists>r \<in> set rs. bnullable r" |
|
791 |
shows "bmkeps (AALTs bs rs) = bmkeps (AALTs bs (flts rs))" |
|
792 |
using assms |
|
793 |
apply(induct rs arbitrary: bs taking: size rule: measure_induct) |
|
794 |
apply(case_tac x) |
|
795 |
apply(simp) |
|
796 |
apply(simp) |
|
797 |
apply(case_tac a) |
|
798 |
apply(simp) |
|
799 |
apply (simp add: r1) |
|
800 |
apply(simp) |
|
801 |
apply (simp add: bnullable_Hdbmkeps_Hd) |
|
802 |
apply(simp) |
|
803 |
apply(case_tac "flts list") |
|
804 |
apply(simp) |
|
805 |
apply (metis L_erase_AALTs L_erase_flts L_flat_Prf1 L_flat_Prf2 Prf_elims(1) bnullable_correctness erase.simps(4) mkeps_nullable r2) |
|
806 |
apply(simp) |
|
807 |
apply (simp add: r1) |
|
808 |
prefer 3 |
|
809 |
apply(simp) |
|
810 |
apply (simp add: bnullable_Hdbmkeps_Hd) |
|
811 |
prefer 2 |
|
812 |
apply(simp) |
|
813 |
apply(case_tac "\<exists>x\<in>set x52. bnullable x") |
|
814 |
apply(case_tac "list") |
|
815 |
apply(simp) |
|
816 |
apply (metis b2 fuse.simps(4) q3a r2) |
|
817 |
apply(erule disjE) |
|
818 |
apply(subst qq1) |
|
819 |
apply(auto)[1] |
|
820 |
apply (metis bnullable_correctness erase_fuse) |
|
821 |
apply(simp) |
|
822 |
apply (metis b2 fuse.simps(4) q3a r2) |
|
823 |
apply(simp) |
|
824 |
apply(auto)[1] |
|
825 |
apply(subst qq1) |
|
826 |
apply (metis bnullable_correctness erase_fuse image_eqI set_map) |
|
827 |
apply (metis b2 fuse.simps(4) q3a r2) |
|
828 |
apply(subst qq1) |
|
829 |
apply (metis bnullable_correctness erase_fuse image_eqI set_map) |
|
830 |
apply (metis b2 fuse.simps(4) q3a r2) |
|
831 |
apply(simp) |
|
832 |
apply(subst qq2) |
|
833 |
apply (metis bnullable_correctness erase_fuse imageE set_map) |
|
834 |
prefer 2 |
|
835 |
apply(case_tac "list") |
|
836 |
apply(simp) |
|
837 |
apply(simp) |
|
838 |
apply (simp add: qq4) |
|
839 |
apply(simp) |
|
840 |
apply(auto) |
|
841 |
apply(case_tac list) |
|
842 |
apply(simp) |
|
843 |
apply(simp) |
|
844 |
apply (simp add: bnullable_Hdbmkeps_Hd) |
|
845 |
apply(case_tac "bnullable (ASEQ x41 x42 x43)") |
|
846 |
apply(case_tac list) |
|
847 |
apply(simp) |
|
848 |
apply(simp) |
|
849 |
apply (simp add: bnullable_Hdbmkeps_Hd) |
|
850 |
apply(simp) |
|
851 |
using qq4 r1 r2 by auto |
|
852 |
||
853 |
||
854 |
||
855 |
||
856 |
lemma bder_fuse: |
|
857 |
shows "bder c (fuse bs a) = fuse bs (bder c a)" |
|
858 |
apply(induct a arbitrary: bs c) |
|
859 |
apply(simp_all) |
|
860 |
done |
|
861 |
||
862 |
||
863 |
lemma bder_bsimp_AALTs: |
|
864 |
shows "bder c (bsimp_AALTs bs rs) = bsimp_AALTs bs (map (bder c) rs)" |
|
865 |
apply(induct bs rs rule: bsimp_AALTs.induct) |
|
866 |
apply(simp) |
|
867 |
apply(simp) |
|
868 |
apply (simp add: bder_fuse) |
|
869 |
apply(simp) |
|
870 |
done |
|
871 |
||
872 |
||
873 |
||
874 |
inductive rrewrite:: "arexp \<Rightarrow> arexp \<Rightarrow> bool" ("_ \<leadsto> _" [99, 99] 99)
|
|
875 |
where |
|
876 |
"ASEQ bs AZERO r2 \<leadsto> AZERO" |
|
877 |
| "ASEQ bs r1 AZERO \<leadsto> AZERO" |
|
878 |
| "ASEQ bs (AONE bs1) r \<leadsto> fuse (bs@bs1) r" |
|
879 |
| "r1 \<leadsto> r2 \<Longrightarrow> ASEQ bs r1 r3 \<leadsto> ASEQ bs r2 r3" |
|
880 |
| "r3 \<leadsto> r4 \<Longrightarrow> ASEQ bs r1 r3 \<leadsto> ASEQ bs r1 r4" |
|
881 |
| "r \<leadsto> r' \<Longrightarrow> (AALTs bs (rs1 @ [r] @ rs2)) \<leadsto> (AALTs bs (rs1 @ [r'] @ rs2))" |
|
882 |
(*context rule for eliminating 0, alts--corresponds to the recursive call flts r::rs = r::(flts rs)*) |
|
883 |
| "AALTs bs (rsa@AZERO # rsb) \<leadsto> AALTs bs (rsa@rsb)" |
|
884 |
| "AALTs bs (rsa@(AALTs bs1 rs1)# rsb) \<leadsto> AALTs bs (rsa@(map (fuse bs1) rs1)@rsb)" |
|
885 |
(*the below rule for extracting common prefixes between a list of rexp's bitcodes*) |
|
|
375
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
886 |
(***| "AALTs bs (map (fuse bs1) rs) \<leadsto> AALTs (bs@bs1) rs"******) |
| 365 | 887 |
(*opposite direction also allowed, which means bits are free to be moved around |
888 |
as long as they are on the right path*) |
|
889 |
| "AALTs (bs@bs1) rs \<leadsto> AALTs bs (map (fuse bs1) rs)" |
|
890 |
| "AALTs bs [] \<leadsto> AZERO" |
|
891 |
| "AALTs bs [r] \<leadsto> fuse bs r" |
|
892 |
| "erase a1 = erase a2 \<Longrightarrow> AALTs bs (rsa@[a1]@rsb@[a2]@rsc) \<leadsto> AALTs bs (rsa@[a1]@rsb@rsc)" |
|
893 |
||
894 |
||
895 |
inductive rrewrites:: "arexp \<Rightarrow> arexp \<Rightarrow> bool" ("_ \<leadsto>* _" [100, 100] 100)
|
|
896 |
where |
|
897 |
rs1[intro, simp]:"r \<leadsto>* r" |
|
898 |
| rs2[intro]: "\<lbrakk>r1 \<leadsto>* r2; r2 \<leadsto> r3\<rbrakk> \<Longrightarrow> r1 \<leadsto>* r3" |
|
899 |
||
900 |
inductive srewrites:: "arexp list \<Rightarrow> arexp list \<Rightarrow> bool" (" _ s\<leadsto>* _" [100, 100] 100)
|
|
901 |
where |
|
902 |
ss1: "[] s\<leadsto>* []" |
|
903 |
|ss2: "\<lbrakk>r \<leadsto>* r'; rs s\<leadsto>* rs'\<rbrakk> \<Longrightarrow> (r#rs) s\<leadsto>* (r'#rs')" |
|
904 |
(*rs1 = [r1, r2, ..., rn] rs2 = [r1', r2', ..., rn'] |
|
905 |
[r1, r2, ..., rn] \<leadsto>* [r1', r2, ..., rn] \<leadsto>* [...r2',...] \<leadsto>* [r1', r2',... rn'] |
|
906 |
*) |
|
907 |
||
908 |
||
909 |
||
910 |
lemma r_in_rstar : "r1 \<leadsto> r2 \<Longrightarrow> r1 \<leadsto>* r2" |
|
911 |
using rrewrites.intros(1) rrewrites.intros(2) by blast |
|
912 |
||
| 373 | 913 |
lemma real_trans [trans]: |
| 365 | 914 |
assumes a1: "r1 \<leadsto>* r2" and a2: "r2 \<leadsto>* r3" |
915 |
shows "r1 \<leadsto>* r3" |
|
916 |
using a2 a1 |
|
917 |
apply(induct r2 r3 arbitrary: r1 rule: rrewrites.induct) |
|
918 |
apply(auto) |
|
919 |
done |
|
920 |
||
921 |
||
922 |
lemma many_steps_later: "\<lbrakk>r1 \<leadsto> r2; r2 \<leadsto>* r3 \<rbrakk> \<Longrightarrow> r1 \<leadsto>* r3" |
|
923 |
by (meson r_in_rstar real_trans) |
|
924 |
||
925 |
||
926 |
lemma contextrewrites1: "r \<leadsto>* r' \<Longrightarrow> (AALTs bs (r#rs)) \<leadsto>* (AALTs bs (r'#rs))" |
|
927 |
apply(induct r r' rule: rrewrites.induct) |
|
928 |
apply simp |
|
929 |
by (metis append_Cons append_Nil rrewrite.intros(6) rs2) |
|
930 |
||
931 |
||
932 |
lemma contextrewrites2: "r \<leadsto>* r' \<Longrightarrow> (AALTs bs (rs1@[r]@rs)) \<leadsto>* (AALTs bs (rs1@[r']@rs))" |
|
933 |
apply(induct r r' rule: rrewrites.induct) |
|
934 |
apply simp |
|
935 |
using rrewrite.intros(6) by blast |
|
936 |
||
937 |
||
938 |
||
939 |
lemma srewrites_alt: "rs1 s\<leadsto>* rs2 \<Longrightarrow> (AALTs bs (rs@rs1)) \<leadsto>* (AALTs bs (rs@rs2))" |
|
940 |
||
941 |
apply(induct rs1 rs2 arbitrary: bs rs rule: srewrites.induct) |
|
942 |
apply(rule rs1) |
|
943 |
apply(drule_tac x = "bs" in meta_spec) |
|
944 |
apply(drule_tac x = "rsa@[r']" in meta_spec) |
|
945 |
apply simp |
|
946 |
apply(rule real_trans) |
|
947 |
prefer 2 |
|
948 |
apply(assumption) |
|
949 |
apply(drule contextrewrites2) |
|
950 |
apply auto |
|
951 |
done |
|
952 |
||
953 |
||
| 374 | 954 |
corollary srewrites_alt1: |
955 |
assumes "rs1 s\<leadsto>* rs2" |
|
956 |
shows "AALTs bs rs1 \<leadsto>* AALTs bs rs2" |
|
957 |
using assms |
|
| 365 | 958 |
by (metis append.left_neutral srewrites_alt) |
959 |
||
960 |
||
| 374 | 961 |
lemma star_seq: |
962 |
assumes "r1 \<leadsto>* r2" |
|
963 |
shows "ASEQ bs r1 r3 \<leadsto>* ASEQ bs r2 r3" |
|
964 |
using assms |
|
965 |
apply(induct r1 r2 arbitrary: r3 rule: rrewrites.induct) |
|
966 |
apply(auto intro: rrewrite.intros) |
|
967 |
done |
|
| 365 | 968 |
|
| 374 | 969 |
lemma star_seq2: |
970 |
assumes "r3 \<leadsto>* r4" |
|
971 |
shows "ASEQ bs r1 r3 \<leadsto>* ASEQ bs r1 r4" |
|
972 |
using assms |
|
973 |
apply(induct r3 r4 arbitrary: r1 rule: rrewrites.induct) |
|
974 |
apply(auto intro: rrewrite.intros) |
|
975 |
done |
|
| 365 | 976 |
|
| 374 | 977 |
lemma continuous_rewrite: |
978 |
assumes "r1 \<leadsto>* AZERO" |
|
979 |
shows "ASEQ bs1 r1 r2 \<leadsto>* AZERO" |
|
980 |
using assms |
|
| 365 | 981 |
apply(induction ra\<equiv>"r1" rb\<equiv>"AZERO" arbitrary: bs1 r1 r2 rule: rrewrites.induct) |
| 374 | 982 |
apply(auto intro: rrewrite.intros r_in_rstar star_seq) |
983 |
by (meson rrewrite.intros(1) rs2 star_seq) |
|
| 365 | 984 |
|
985 |
||
986 |
||
| 374 | 987 |
lemma bsimp_aalts_simpcases: |
988 |
shows "AONE bs \<leadsto>* bsimp (AONE bs)" |
|
989 |
and "AZERO \<leadsto>* bsimp AZERO" |
|
990 |
and "ACHAR bs c \<leadsto>* bsimp (ACHAR bs c)" |
|
991 |
by (simp_all) |
|
| 365 | 992 |
|
993 |
lemma trivialbsimpsrewrites: "\<lbrakk>\<And>x. x \<in> set rs \<Longrightarrow> x \<leadsto>* f x \<rbrakk> \<Longrightarrow> rs s\<leadsto>* (map f rs)" |
|
994 |
||
995 |
apply(induction rs) |
|
996 |
apply simp |
|
997 |
apply(rule ss1) |
|
998 |
by (metis insert_iff list.simps(15) list.simps(9) srewrites.simps) |
|
999 |
||
1000 |
||
1001 |
lemma bsimp_AALTsrewrites: "AALTs bs1 rs \<leadsto>* bsimp_AALTs bs1 rs" |
|
1002 |
apply(induction rs) |
|
1003 |
apply simp |
|
1004 |
apply(rule r_in_rstar) |
|
|
375
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
1005 |
apply (simp add: rrewrite.intros(10)) |
| 365 | 1006 |
apply(case_tac "rs = Nil") |
1007 |
apply(simp) |
|
1008 |
using rrewrite.intros(12) apply auto[1] |
|
|
375
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
1009 |
using r_in_rstar rrewrite.intros(11) apply presburger |
| 365 | 1010 |
apply(subgoal_tac "length (a#rs) > 1") |
1011 |
apply(simp add: bsimp_AALTs_qq) |
|
1012 |
apply(simp) |
|
1013 |
done |
|
1014 |
||
1015 |
inductive frewrites:: "arexp list \<Rightarrow> arexp list \<Rightarrow> bool" (" _ f\<leadsto>* _" [100, 100] 100)
|
|
1016 |
where |
|
1017 |
fs1: "[] f\<leadsto>* []" |
|
1018 |
|fs2: "\<lbrakk>rs f\<leadsto>* rs'\<rbrakk> \<Longrightarrow> (AZERO#rs) f\<leadsto>* rs'" |
|
1019 |
|fs3: "\<lbrakk>rs f\<leadsto>* rs'\<rbrakk> \<Longrightarrow> ((AALTs bs rs1) # rs) f\<leadsto>* ((map (fuse bs) rs1) @ rs')" |
|
1020 |
|fs4: "\<lbrakk>rs f\<leadsto>* rs';nonalt r; nonazero r\<rbrakk> \<Longrightarrow> (r#rs) f\<leadsto>* (r#rs')" |
|
1021 |
||
1022 |
||
1023 |
||
1024 |
lemma flts_prepend: "\<lbrakk>nonalt a; nonazero a\<rbrakk> \<Longrightarrow> flts (a#rs) = a # (flts rs)" |
|
| 373 | 1025 |
by (metis append_Cons append_Nil flts_single1 flts_append) |
| 365 | 1026 |
|
1027 |
lemma fltsfrewrites: "rs f\<leadsto>* (flts rs)" |
|
1028 |
apply(induction rs) |
|
1029 |
apply simp |
|
1030 |
apply(rule fs1) |
|
1031 |
||
1032 |
apply(case_tac "a = AZERO") |
|
1033 |
||
1034 |
||
1035 |
using fs2 apply auto[1] |
|
1036 |
apply(case_tac "\<exists>bs rs. a = AALTs bs rs") |
|
1037 |
apply(erule exE)+ |
|
1038 |
||
1039 |
apply (simp add: fs3) |
|
1040 |
apply(subst flts_prepend) |
|
1041 |
apply(rule nonalt.elims(2)) |
|
1042 |
prefer 2 |
|
1043 |
thm nonalt.elims |
|
1044 |
||
1045 |
apply blast |
|
1046 |
||
1047 |
using bbbbs1 apply blast |
|
| 374 | 1048 |
apply(simp)+ |
| 365 | 1049 |
|
1050 |
apply (meson nonazero.elims(3)) |
|
1051 |
||
1052 |
by (meson fs4 nonalt.elims(3) nonazero.elims(3)) |
|
1053 |
||
1054 |
||
| 374 | 1055 |
lemma rrewrite0away: "AALTs bs (AZERO # rsb) \<leadsto> AALTs bs rsb" |
| 365 | 1056 |
by (metis append_Nil rrewrite.intros(7)) |
1057 |
||
1058 |
||
1059 |
lemma frewritesaalts:"rs f\<leadsto>* rs' \<Longrightarrow> (AALTs bs (rs1@rs)) \<leadsto>* (AALTs bs (rs1@rs'))" |
|
1060 |
apply(induct rs rs' arbitrary: bs rs1 rule:frewrites.induct) |
|
1061 |
apply(rule rs1) |
|
1062 |
apply(drule_tac x = "bs" in meta_spec) |
|
1063 |
apply(drule_tac x = "rs1 @ [AZERO]" in meta_spec) |
|
1064 |
apply(rule real_trans) |
|
1065 |
apply simp |
|
1066 |
using r_in_rstar rrewrite.intros(7) apply presburger |
|
1067 |
apply(drule_tac x = "bsa" in meta_spec) |
|
1068 |
apply(drule_tac x = "rs1a @ [AALTs bs rs1]" in meta_spec) |
|
1069 |
apply(rule real_trans) |
|
1070 |
apply simp |
|
1071 |
using r_in_rstar rrewrite.intros(8) apply presburger |
|
1072 |
apply(drule_tac x = "bs" in meta_spec) |
|
1073 |
apply(drule_tac x = "rs1@[r]" in meta_spec) |
|
1074 |
apply(rule real_trans) |
|
1075 |
apply simp |
|
1076 |
apply auto |
|
1077 |
done |
|
1078 |
||
1079 |
lemma fltsrewrites: " AALTs bs1 rs \<leadsto>* AALTs bs1 (flts rs)" |
|
1080 |
apply(induction rs) |
|
1081 |
apply simp |
|
1082 |
apply(case_tac "a = AZERO") |
|
1083 |
apply (metis append_Nil flts.simps(2) many_steps_later rrewrite.intros(7)) |
|
1084 |
||
1085 |
||
1086 |
||
1087 |
apply(case_tac "\<exists>bs2 rs2. a = AALTs bs2 rs2") |
|
1088 |
apply(erule exE)+ |
|
| 374 | 1089 |
apply(simp) |
| 365 | 1090 |
prefer 2 |
1091 |
||
1092 |
apply(subst flts_prepend) |
|
1093 |
||
1094 |
apply (meson nonalt.elims(3)) |
|
1095 |
||
1096 |
apply (meson nonazero.elims(3)) |
|
1097 |
apply(subgoal_tac "(a#rs) f\<leadsto>* (a#flts rs)") |
|
1098 |
apply (metis append_Nil frewritesaalts) |
|
1099 |
apply (meson fltsfrewrites fs4 nonalt.elims(3) nonazero.elims(3)) |
|
| 373 | 1100 |
by (metis append_Cons append_Nil fltsfrewrites frewritesaalts flts_append k0a) |
| 365 | 1101 |
|
1102 |
lemma alts_simpalts: "\<And>bs1 rs. (\<And>x. x \<in> set rs \<Longrightarrow> x \<leadsto>* bsimp x) \<Longrightarrow> |
|
1103 |
AALTs bs1 rs \<leadsto>* AALTs bs1 (map bsimp rs)" |
|
1104 |
apply(subgoal_tac " rs s\<leadsto>* (map bsimp rs)") |
|
1105 |
prefer 2 |
|
1106 |
using trivialbsimpsrewrites apply auto[1] |
|
1107 |
using srewrites_alt1 by auto |
|
1108 |
||
1109 |
||
1110 |
lemma threelistsappend: "rsa@a#rsb = (rsa@[a])@rsb" |
|
1111 |
apply auto |
|
1112 |
done |
|
1113 |
||
1114 |
||
1115 |
lemma somewhereInside: "r \<in> set rs \<Longrightarrow> \<exists>rs1 rs2. rs = rs1@[r]@rs2" |
|
1116 |
using split_list by fastforce |
|
1117 |
||
1118 |
lemma somewhereMapInside: "f r \<in> f ` set rs \<Longrightarrow> \<exists>rs1 rs2 a. rs = rs1@[a]@rs2 \<and> f a = f r" |
|
1119 |
apply auto |
|
1120 |
by (metis split_list) |
|
1121 |
||
1122 |
lemma alts_dBrewrites_withFront: " AALTs bs (rsa @ rs) \<leadsto>* AALTs bs (rsa @ distinctBy rs erase (erase ` set rsa))" |
|
1123 |
apply(induction rs arbitrary: rsa) |
|
1124 |
apply simp |
|
1125 |
apply(drule_tac x = "rsa@[a]" in meta_spec) |
|
1126 |
apply(subst threelistsappend) |
|
1127 |
apply(rule real_trans) |
|
1128 |
apply simp |
|
1129 |
apply(case_tac "a \<in> set rsa") |
|
1130 |
apply simp |
|
1131 |
apply(drule somewhereInside) |
|
1132 |
apply(erule exE)+ |
|
1133 |
apply simp |
|
1134 |
apply(subgoal_tac " AALTs bs |
|
1135 |
(rs1 @ |
|
1136 |
a # |
|
1137 |
rs2 @ |
|
1138 |
a # |
|
1139 |
distinctBy rs erase |
|
1140 |
(insert (erase a) |
|
1141 |
(erase ` |
|
1142 |
(set rs1 \<union> set rs2)))) \<leadsto> AALTs bs (rs1@ a # rs2 @ distinctBy rs erase |
|
1143 |
(insert (erase a) |
|
1144 |
(erase ` |
|
1145 |
(set rs1 \<union> set rs2)))) ") |
|
1146 |
prefer 2 |
|
|
375
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
1147 |
using rrewrite.intros(12) apply force |
| 365 | 1148 |
using r_in_rstar apply force |
1149 |
apply(subgoal_tac "erase ` set (rsa @ [a]) = insert (erase a) (erase ` set rsa)") |
|
1150 |
prefer 2 |
|
1151 |
||
1152 |
apply auto[1] |
|
1153 |
apply(case_tac "erase a \<in> erase `set rsa") |
|
1154 |
||
1155 |
apply simp |
|
1156 |
apply(subgoal_tac "AALTs bs (rsa @ a # distinctBy rs erase (insert (erase a) (erase ` set rsa))) \<leadsto> |
|
1157 |
AALTs bs (rsa @ distinctBy rs erase (insert (erase a) (erase ` set rsa)))") |
|
1158 |
apply force |
|
|
375
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
1159 |
apply (smt (verit, ccfv_threshold) append_Cons append_assoc append_self_conv2 r_in_rstar rrewrite.intros(12) same_append_eq somewhereMapInside) |
| 365 | 1160 |
by force |
1161 |
||
1162 |
||
1163 |
||
1164 |
lemma alts_dBrewrites: "AALTs bs rs \<leadsto>* AALTs bs (distinctBy rs erase {})"
|
|
1165 |
apply(induction rs) |
|
1166 |
apply simp |
|
1167 |
apply simp |
|
1168 |
using alts_dBrewrites_withFront |
|
1169 |
by (metis append_Nil dB_single_step empty_set image_empty) |
|
1170 |
||
1171 |
||
1172 |
||
1173 |
||
1174 |
||
1175 |
||
| 374 | 1176 |
lemma bsimp_rewrite: |
1177 |
shows "r \<leadsto>* bsimp r" |
|
| 365 | 1178 |
apply(induction r rule: bsimp.induct) |
1179 |
apply simp |
|
1180 |
apply(case_tac "bsimp r1 = AZERO") |
|
1181 |
apply simp |
|
1182 |
using continuous_rewrite apply blast |
|
1183 |
apply(case_tac "\<exists>bs. bsimp r1 = AONE bs") |
|
1184 |
apply(erule exE) |
|
1185 |
apply simp |
|
1186 |
apply(subst bsimp_ASEQ2) |
|
1187 |
apply (meson real_trans rrewrite.intros(3) rrewrites.intros(2) star_seq star_seq2) |
|
1188 |
apply (smt (verit, best) bsimp_ASEQ0 bsimp_ASEQ1 real_trans rrewrite.intros(2) rs2 star_seq star_seq2) |
|
1189 |
defer |
|
1190 |
using bsimp_aalts_simpcases(2) apply blast |
|
1191 |
apply simp |
|
1192 |
apply simp |
|
1193 |
apply simp |
|
1194 |
||
1195 |
apply auto |
|
1196 |
||
1197 |
||
1198 |
apply(subgoal_tac "AALTs bs1 rs \<leadsto>* AALTs bs1 (map bsimp rs)") |
|
1199 |
apply(subgoal_tac "AALTs bs1 (map bsimp rs) \<leadsto>* AALTs bs1 (flts (map bsimp rs))") |
|
1200 |
apply(subgoal_tac "AALTs bs1 (flts (map bsimp rs)) \<leadsto>* AALTs bs1 (distinctBy (flts (map bsimp rs)) erase {})")
|
|
1201 |
apply(subgoal_tac "AALTs bs1 (distinctBy (flts (map bsimp rs)) erase {}) \<leadsto>* bsimp_AALTs bs1 (distinctBy (flts (map bsimp rs)) erase {} )")
|
|
1202 |
||
1203 |
||
1204 |
apply (meson real_trans) |
|
1205 |
||
1206 |
apply (meson bsimp_AALTsrewrites) |
|
1207 |
||
1208 |
apply (meson alts_dBrewrites) |
|
1209 |
||
1210 |
using fltsrewrites apply auto[1] |
|
1211 |
||
1212 |
using alts_simpalts by force |
|
1213 |
||
1214 |
||
1215 |
lemma rewrite_non_nullable: "\<lbrakk>r1 \<leadsto> r2; \<not>bnullable r1 \<rbrakk> \<Longrightarrow> \<not>bnullable r2" |
|
1216 |
apply(induction r1 r2 rule: rrewrite.induct) |
|
1217 |
apply auto |
|
1218 |
apply (metis bnullable_correctness erase_fuse)+ |
|
1219 |
done |
|
1220 |
||
| 373 | 1221 |
lemma rewrite_non_nullable_strong: |
1222 |
assumes "r1 \<leadsto> r2" |
|
1223 |
shows "bnullable r1 = bnullable r2" |
|
1224 |
using assms |
|
1225 |
apply(induction r1 r2 rule: rrewrite.induct) |
|
1226 |
apply(auto) |
|
1227 |
apply(metis bnullable_correctness erase_fuse)+ |
|
1228 |
apply(metis UnCI bnullable_correctness erase_fuse imageI) |
|
1229 |
apply(metis bnullable_correctness erase_fuse)+ |
|
1230 |
done |
|
| 365 | 1231 |
|
| 373 | 1232 |
lemma rewrite_nullable: |
1233 |
assumes "r1 \<leadsto> r2" "bnullable r1" |
|
1234 |
shows "bnullable r2" |
|
1235 |
using assms rewrite_non_nullable_strong |
|
1236 |
by auto |
|
1237 |
||
1238 |
lemma rewritesnullable: |
|
1239 |
assumes "r1 \<leadsto>* r2" "bnullable r1" |
|
1240 |
shows "bnullable r2" |
|
1241 |
using assms |
|
| 365 | 1242 |
apply(induction r1 r2 rule: rrewrites.induct) |
1243 |
apply simp |
|
| 373 | 1244 |
using rewrite_non_nullable_strong by blast |
| 365 | 1245 |
|
1246 |
lemma nonbnullable_lists_concat: " \<lbrakk> \<not> (\<exists>r0\<in>set rs1. bnullable r0); \<not> bnullable r; \<not> (\<exists>r0\<in>set rs2. bnullable r0)\<rbrakk> \<Longrightarrow> |
|
1247 |
\<not>(\<exists>r0 \<in> (set (rs1@[r]@rs2)). bnullable r0 ) " |
|
1248 |
apply simp |
|
1249 |
apply blast |
|
1250 |
done |
|
1251 |
||
1252 |
||
1253 |
||
1254 |
lemma nomember_bnullable: "\<lbrakk> \<not> (\<exists>r0\<in>set rs1. bnullable r0); \<not> bnullable r; \<not> (\<exists>r0\<in>set rs2. bnullable r0)\<rbrakk> |
|
1255 |
\<Longrightarrow> \<not>bnullable (AALTs bs (rs1 @ [r] @ rs2))" |
|
| 374 | 1256 |
using bnullable.simps(4) nonbnullable_lists_concat by presburger |
| 365 | 1257 |
|
1258 |
lemma bnullable_segment: " bnullable (AALTs bs (rs1@[r]@rs2)) \<Longrightarrow> bnullable (AALTs bs rs1) \<or> bnullable (AALTs bs rs2) \<or> bnullable r" |
|
1259 |
apply(case_tac "\<exists>r0\<in>set rs1. bnullable r0") |
|
| 374 | 1260 |
using r2 apply blast |
| 365 | 1261 |
apply(case_tac "bnullable r") |
1262 |
||
1263 |
apply blast |
|
1264 |
apply(case_tac "\<exists>r0\<in>set rs2. bnullable r0") |
|
1265 |
||
1266 |
using bnullable.simps(4) apply presburger |
|
1267 |
apply(subgoal_tac "False") |
|
1268 |
||
1269 |
apply blast |
|
1270 |
||
1271 |
using nomember_bnullable by blast |
|
1272 |
||
1273 |
||
1274 |
||
1275 |
lemma bnullablewhichbmkeps: "\<lbrakk>bnullable (AALTs bs (rs1@[r]@rs2)); \<not> bnullable (AALTs bs rs1); bnullable r \<rbrakk> |
|
1276 |
\<Longrightarrow> bmkeps (AALTs bs (rs1@[r]@rs2)) = bs @ (bmkeps r)" |
|
1277 |
using qq2 bnullable_Hdbmkeps_Hd by force |
|
1278 |
||
1279 |
||
1280 |
||
1281 |
lemma spillbmkepslistr: "bnullable (AALTs bs1 rs1) |
|
1282 |
\<Longrightarrow> bmkeps (AALTs bs (AALTs bs1 rs1 # rsb)) = bmkeps (AALTs bs ( map (fuse bs1) rs1 @ rsb))" |
|
1283 |
apply(subst bnullable_Hdbmkeps_Hd) |
|
1284 |
||
1285 |
apply simp |
|
1286 |
by (metis bmkeps.simps(3) k0a list.set_intros(1) qq1 qq4 qs3) |
|
1287 |
||
1288 |
lemma third_segment_bnullable: "\<lbrakk>bnullable (AALTs bs (rs1@rs2@rs3)); \<not>bnullable (AALTs bs rs1); \<not>bnullable (AALTs bs rs2)\<rbrakk> \<Longrightarrow> |
|
1289 |
bnullable (AALTs bs rs3)" |
|
1290 |
||
| 373 | 1291 |
by (metis append.left_neutral append_Cons bnullable.simps(1) bnullable_segment rrewrite.intros(7) rewrite_non_nullable) |
| 365 | 1292 |
|
1293 |
||
1294 |
lemma third_segment_bmkeps: "\<lbrakk>bnullable (AALTs bs (rs1@rs2@rs3)); \<not>bnullable (AALTs bs rs1); \<not>bnullable (AALTs bs rs2)\<rbrakk> \<Longrightarrow> |
|
1295 |
bmkeps (AALTs bs (rs1@rs2@rs3) ) = bmkeps (AALTs bs rs3)" |
|
1296 |
apply(subgoal_tac "bnullable (AALTs bs rs3)") |
|
1297 |
apply(subgoal_tac "\<forall>r \<in> set (rs1@rs2). \<not>bnullable r") |
|
1298 |
apply(subgoal_tac "bmkeps (AALTs bs (rs1@rs2@rs3)) = bmkeps (AALTs bs ((rs1@rs2)@rs3) )") |
|
| 374 | 1299 |
apply (metis bnullable.simps(4) qq2) |
| 365 | 1300 |
|
1301 |
apply (metis append.assoc) |
|
1302 |
||
1303 |
apply (metis append.assoc in_set_conv_decomp r2 third_segment_bnullable) |
|
1304 |
||
1305 |
using third_segment_bnullable by blast |
|
1306 |
||
1307 |
||
1308 |
lemma rewrite_bmkepsalt: " \<lbrakk>bnullable (AALTs bs (rsa @ AALTs bs1 rs1 # rsb)); bnullable (AALTs bs (rsa @ map (fuse bs1) rs1 @ rsb))\<rbrakk> |
|
1309 |
\<Longrightarrow> bmkeps (AALTs bs (rsa @ AALTs bs1 rs1 # rsb)) = bmkeps (AALTs bs (rsa @ map (fuse bs1) rs1 @ rsb))" |
|
1310 |
apply(case_tac "bnullable (AALTs bs rsa)") |
|
1311 |
||
1312 |
using qq1 apply force |
|
1313 |
apply(case_tac "bnullable (AALTs bs1 rs1)") |
|
1314 |
apply(subst qq2) |
|
1315 |
||
1316 |
||
1317 |
using r2 apply blast |
|
1318 |
||
1319 |
apply (metis list.set_intros(1)) |
|
| 374 | 1320 |
apply (smt (verit, ccfv_threshold) append_eq_append_conv2 list.set_intros(1) qq2 bnullable.simps(4) rewrite_nullable rrewrite.intros(8) self_append_conv2 spillbmkepslistr) |
| 365 | 1321 |
|
1322 |
||
1323 |
thm qq1 |
|
1324 |
apply(subgoal_tac "bmkeps (AALTs bs (rsa @ AALTs bs1 rs1 # rsb)) = bmkeps (AALTs bs rsb) ") |
|
1325 |
prefer 2 |
|
1326 |
||
|
375
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
1327 |
apply (metis append_Cons append_Nil bnullable.simps(1) bnullable_segment rewrite_nullable rrewrite.intros(10) third_segment_bmkeps) |
|
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
1328 |
by (metis bnullable.simps(4) rewrite_non_nullable_strong rrewrite.intros(9) third_segment_bmkeps) |
| 365 | 1329 |
|
1330 |
||
1331 |
||
|
375
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
1332 |
lemma rewrite_bmkeps: "\<lbrakk> r1 \<leadsto> r2; bnullable r1\<rbrakk> \<Longrightarrow> bmkeps r1 = bmkeps r2" |
| 365 | 1333 |
|
| 373 | 1334 |
apply(frule rewrite_nullable) |
| 365 | 1335 |
apply simp |
1336 |
apply(induction r1 r2 rule: rrewrite.induct) |
|
1337 |
apply simp |
|
1338 |
using bnullable.simps(1) bnullable.simps(5) apply blast |
|
1339 |
apply (simp add: b2) |
|
1340 |
apply simp |
|
1341 |
apply simp |
|
1342 |
apply(frule bnullable_segment) |
|
1343 |
apply(case_tac "bnullable (AALTs bs rs1)") |
|
1344 |
using qq1 apply force |
|
1345 |
apply(case_tac "bnullable r") |
|
| 373 | 1346 |
using bnullablewhichbmkeps rewrite_nullable apply presburger |
| 365 | 1347 |
apply(subgoal_tac "bnullable (AALTs bs rs2)") |
1348 |
apply(subgoal_tac "\<not> bnullable r'") |
|
1349 |
apply (simp add: qq2 r1) |
|
1350 |
||
| 373 | 1351 |
using rewrite_non_nullable apply blast |
| 365 | 1352 |
|
1353 |
apply blast |
|
1354 |
apply (simp add: flts_append qs3) |
|
1355 |
||
1356 |
apply (meson rewrite_bmkepsalt) |
|
|
375
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
1357 |
using q3a apply force |
| 365 | 1358 |
|
1359 |
apply (simp add: q3a) |
|
1360 |
apply (simp add: b2) |
|
|
375
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
1361 |
apply(simp del: append.simps) |
|
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
1362 |
apply(case_tac "bnullable a1") |
|
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
1363 |
apply (metis append.assoc in_set_conv_decomp qq1) |
|
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
1364 |
apply(case_tac "\<exists>r \<in> set rsa. bnullable r") |
|
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
1365 |
using qq1 apply presburger |
|
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
1366 |
apply(case_tac "\<exists>r \<in> set rsb. bnullable r") |
|
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
1367 |
apply (metis UnCI append.assoc qq1 set_append) |
|
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
1368 |
apply(case_tac "bnullable a2") |
|
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
1369 |
apply (metis bnullable_correctness) |
|
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
1370 |
apply(subst qq2) |
|
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
1371 |
apply blast |
|
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
1372 |
apply(auto)[1] |
|
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
1373 |
apply(subst qq2) |
|
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
1374 |
apply (metis empty_iff list.set(1) set_ConsD) |
|
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
1375 |
apply(auto)[1] |
|
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
1376 |
apply(subst qq2) |
|
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
1377 |
apply(auto)[2] |
|
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
1378 |
apply(subst qq2) |
|
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
1379 |
apply(auto)[2] |
|
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
1380 |
apply(subst qq2) |
|
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
1381 |
apply(auto)[2] |
|
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
1382 |
apply(subst qq2) |
|
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
1383 |
apply(auto)[2] |
|
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
1384 |
apply(subst qq2) |
|
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
1385 |
apply(auto)[2] |
|
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
1386 |
apply(simp) |
|
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
1387 |
done |
| 365 | 1388 |
|
| 373 | 1389 |
lemma rewrites_bmkeps: |
1390 |
assumes "r1 \<leadsto>* r2" "bnullable r1" |
|
1391 |
shows "bmkeps r1 = bmkeps r2" |
|
1392 |
using assms |
|
1393 |
proof(induction r1 r2 rule: rrewrites.induct) |
|
1394 |
case (rs1 r) |
|
1395 |
then show "bmkeps r = bmkeps r" by simp |
|
1396 |
next |
|
1397 |
case (rs2 r1 r2 r3) |
|
1398 |
then have IH: "bmkeps r1 = bmkeps r2" by simp |
|
1399 |
have a1: "bnullable r1" by fact |
|
1400 |
have a2: "r1 \<leadsto>* r2" by fact |
|
1401 |
have a3: "r2 \<leadsto> r3" by fact |
|
1402 |
have a4: "bnullable r2" using a1 a2 by (simp add: rewritesnullable) |
|
1403 |
then have "bmkeps r2 = bmkeps r3" using rewrite_bmkeps a3 a4 by simp |
|
1404 |
then show "bmkeps r1 = bmkeps r3" using IH by simp |
|
1405 |
qed |
|
| 365 | 1406 |
|
1407 |
lemma alts_rewrite_front: "r \<leadsto> r' \<Longrightarrow> AALTs bs (r # rs) \<leadsto> AALTs bs (r' # rs)" |
|
1408 |
by (metis append_Cons append_Nil rrewrite.intros(6)) |
|
1409 |
||
1410 |
lemma alt_rewrite_front: "r \<leadsto> r' \<Longrightarrow> AALT bs r r2 \<leadsto> AALT bs r' r2" |
|
1411 |
using alts_rewrite_front by blast |
|
1412 |
||
1413 |
lemma to_zero_in_alt: " AALT bs (ASEQ [] AZERO r) r2 \<leadsto> AALT bs AZERO r2" |
|
1414 |
by (simp add: alts_rewrite_front rrewrite.intros(1)) |
|
1415 |
||
1416 |
lemma alt_remove0_front: " AALT bs AZERO r \<leadsto> AALTs bs [r]" |
|
1417 |
by (simp add: rrewrite0away) |
|
1418 |
||
1419 |
lemma alt_rewrites_back: "r2 \<leadsto>* r2' \<Longrightarrow>AALT bs r1 r2 \<leadsto>* AALT bs r1 r2'" |
|
1420 |
apply(induction r2 r2' arbitrary: bs rule: rrewrites.induct) |
|
1421 |
apply simp |
|
1422 |
by (meson rs1 rs2 srewrites_alt1 ss1 ss2) |
|
1423 |
||
1424 |
lemma rewrite_fuse: " r2 \<leadsto> r3 \<Longrightarrow> fuse bs r2 \<leadsto>* fuse bs r3" |
|
1425 |
apply(induction r2 r3 arbitrary: bs rule: rrewrite.induct) |
|
1426 |
apply auto |
|
1427 |
||
1428 |
apply (simp add: continuous_rewrite) |
|
1429 |
||
1430 |
apply (simp add: r_in_rstar rrewrite.intros(2)) |
|
1431 |
||
1432 |
apply (metis fuse_append r_in_rstar rrewrite.intros(3)) |
|
1433 |
||
1434 |
using r_in_rstar star_seq apply blast |
|
1435 |
||
1436 |
using r_in_rstar star_seq2 apply blast |
|
1437 |
||
1438 |
using contextrewrites2 r_in_rstar apply auto[1] |
|
1439 |
||
1440 |
apply (simp add: r_in_rstar rrewrite.intros(7)) |
|
1441 |
||
1442 |
using rrewrite.intros(8) apply auto[1] |
|
1443 |
||
1444 |
apply (metis append_assoc r_in_rstar rrewrite.intros(9)) |
|
1445 |
||
|
375
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
1446 |
apply (metis r_in_rstar rrewrite.intros(10)) |
|
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
1447 |
apply (metis fuse_append r_in_rstar rrewrite.intros(11)) |
|
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
1448 |
using rrewrite.intros(12) by auto |
| 365 | 1449 |
|
1450 |
||
| 374 | 1451 |
lemma rewrites_fuse: |
1452 |
assumes "r2 \<leadsto>* r2'" |
|
1453 |
shows "fuse bs1 r2 \<leadsto>* fuse bs1 r2'" |
|
1454 |
using assms |
|
1455 |
apply(induction r2 r2' arbitrary: bs1 rule: rrewrites.induct) |
|
1456 |
apply(auto intro: rewrite_fuse real_trans) |
|
1457 |
done |
|
| 365 | 1458 |
|
| 374 | 1459 |
lemma bder_fuse_list: |
1460 |
shows "map (bder c \<circ> fuse bs1) rs1 = map (fuse bs1 \<circ> bder c) rs1" |
|
1461 |
apply(induction rs1) |
|
1462 |
apply(simp_all add: bder_fuse) |
|
1463 |
done |
|
| 365 | 1464 |
|
1465 |
||
1466 |
lemma rewrite_der_altmiddle: "bder c (AALTs bs (rsa @ AALTs bs1 rs1 # rsb)) \<leadsto>* bder c (AALTs bs (rsa @ map (fuse bs1) rs1 @ rsb))" |
|
1467 |
apply simp |
|
1468 |
apply(simp add: bder_fuse_list) |
|
1469 |
apply(rule many_steps_later) |
|
1470 |
apply(subst rrewrite.intros(8)) |
|
1471 |
apply simp |
|
1472 |
||
1473 |
by fastforce |
|
1474 |
||
1475 |
lemma lock_step_der_removal: |
|
1476 |
shows " erase a1 = erase a2 \<Longrightarrow> |
|
1477 |
bder c (AALTs bs (rsa @ [a1] @ rsb @ [a2] @ rsc)) \<leadsto>* |
|
1478 |
bder c (AALTs bs (rsa @ [a1] @ rsb @ rsc))" |
|
1479 |
apply(simp) |
|
1480 |
||
|
375
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
1481 |
using rrewrite.intros(12) by auto |
| 365 | 1482 |
|
1483 |
lemma rewrite_after_der: "r1 \<leadsto> r2 \<Longrightarrow> (bder c r1) \<leadsto>* (bder c r2)" |
|
1484 |
apply(induction r1 r2 arbitrary: c rule: rrewrite.induct) |
|
1485 |
||
1486 |
apply (simp add: r_in_rstar rrewrite.intros(1)) |
|
1487 |
apply simp |
|
1488 |
||
|
375
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
1489 |
apply (meson contextrewrites1 r_in_rstar rrewrite.intros(10) rrewrite.intros(2) rrewrite0away rs2) |
| 365 | 1490 |
apply(simp) |
1491 |
apply(rule many_steps_later) |
|
1492 |
apply(rule to_zero_in_alt) |
|
1493 |
apply(rule many_steps_later) |
|
1494 |
apply(rule alt_remove0_front) |
|
1495 |
apply(rule many_steps_later) |
|
|
375
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
1496 |
apply(rule rrewrite.intros(11)) |
| 365 | 1497 |
using bder_fuse fuse_append rs1 apply presburger |
1498 |
apply(case_tac "bnullable r1") |
|
1499 |
prefer 2 |
|
1500 |
apply(subgoal_tac "\<not>bnullable r2") |
|
1501 |
prefer 2 |
|
1502 |
using rewrite_non_nullable apply presburger |
|
1503 |
apply simp+ |
|
1504 |
||
1505 |
using star_seq apply auto[1] |
|
1506 |
apply(subgoal_tac "bnullable r2") |
|
1507 |
apply simp+ |
|
1508 |
apply(subgoal_tac "bmkeps r1 = bmkeps r2") |
|
1509 |
prefer 2 |
|
1510 |
using rewrite_bmkeps apply auto[1] |
|
1511 |
using contextrewrites1 star_seq apply auto[1] |
|
| 373 | 1512 |
using rewrite_nullable apply auto[1] |
| 365 | 1513 |
apply(case_tac "bnullable r1") |
1514 |
apply simp |
|
1515 |
apply(subgoal_tac "ASEQ [] (bder c r1) r3 \<leadsto> ASEQ [] (bder c r1) r4") |
|
1516 |
prefer 2 |
|
1517 |
using rrewrite.intros(5) apply blast |
|
1518 |
apply(rule many_steps_later) |
|
1519 |
apply(rule alt_rewrite_front) |
|
1520 |
apply assumption |
|
1521 |
apply (meson alt_rewrites_back rewrites_fuse) |
|
1522 |
||
1523 |
apply (simp add: r_in_rstar rrewrite.intros(5)) |
|
1524 |
||
1525 |
using contextrewrites2 apply force |
|
1526 |
||
1527 |
using rrewrite.intros(7) apply force |
|
1528 |
||
1529 |
using rewrite_der_altmiddle apply auto[1] |
|
1530 |
||
1531 |
apply (metis bder.simps(4) bder_fuse_list map_map r_in_rstar rrewrite.intros(9)) |
|
|
375
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
1532 |
apply (simp add: r_in_rstar rrewrite.intros(10)) |
| 365 | 1533 |
|
|
375
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
1534 |
apply (simp add: r_in_rstar rrewrite.intros(10)) |
|
f83271c585d2
deleted one rewrite rule
Christian Urban <christian.urban@kcl.ac.uk>
parents:
374
diff
changeset
|
1535 |
using bder_fuse r_in_rstar rrewrite.intros(11) apply presburger |
| 365 | 1536 |
|
1537 |
||
1538 |
using lock_step_der_removal by auto |
|
1539 |
||
1540 |
||
1541 |
||
| 373 | 1542 |
lemma rewrites_after_der: |
1543 |
assumes "r1 \<leadsto>* r2" |
|
1544 |
shows "bder c r1 \<leadsto>* bder c r2" |
|
1545 |
using assms |
|
1546 |
apply(induction r1 r2 rule: rrewrites.induct) |
|
1547 |
apply(simp_all add: rewrite_after_der real_trans) |
|
1548 |
done |
|
| 365 | 1549 |
|
| 373 | 1550 |
lemma central: |
1551 |
shows "bders r s \<leadsto>* bders_simp r s" |
|
1552 |
proof(induct s arbitrary: r rule: rev_induct) |
|
1553 |
case Nil |
|
1554 |
then show "bders r [] \<leadsto>* bders_simp r []" by simp |
|
1555 |
next |
|
1556 |
case (snoc x xs) |
|
1557 |
have IH: "\<And>r. bders r xs \<leadsto>* bders_simp r xs" by fact |
|
1558 |
have "bders r (xs @ [x]) = bders (bders r xs) [x]" by (simp add: bders_append) |
|
1559 |
also have "... \<leadsto>* bders (bders_simp r xs) [x]" using IH |
|
1560 |
by (simp add: rewrites_after_der) |
|
1561 |
also have "... \<leadsto>* bders_simp (bders_simp r xs) [x]" using IH |
|
1562 |
by (simp add: bsimp_rewrite) |
|
1563 |
finally show "bders r (xs @ [x]) \<leadsto>* bders_simp r (xs @ [x])" |
|
1564 |
by (simp add: bders_simp_append) |
|
1565 |
qed |
|
| 365 | 1566 |
|
1567 |
||
| 373 | 1568 |
lemma quasi_main: |
1569 |
assumes "bnullable (bders r s)" |
|
1570 |
shows "bmkeps (bders r s) = bmkeps (bders_simp r s)" |
|
1571 |
using assms central rewrites_bmkeps by blast |
|
| 365 | 1572 |
|
| 373 | 1573 |
theorem main_main: |
1574 |
shows "blexer r s = blexer_simp r s" |
|
| 365 | 1575 |
by (simp add: b4 blexer_def blexer_simp_def quasi_main) |
1576 |
||
1577 |
||
| 373 | 1578 |
theorem blexersimp_correctness: |
1579 |
shows "lexer r s = blexer_simp r s" |
|
| 365 | 1580 |
using blexer_correctness main_main by auto |
1581 |
||
1582 |
||
| 378 | 1583 |
|
1584 |
export_code blexer_simp blexer lexer bders bders_simp in Scala module_name VerifiedLexers |
|
1585 |
||
1586 |
||
| 365 | 1587 |
unused_thms |
1588 |
||
1589 |
||
| 378 | 1590 |
inductive aggressive:: "arexp \<Rightarrow> arexp \<Rightarrow> bool" ("_ \<leadsto>? _" [99, 99] 99)
|
1591 |
where |
|
1592 |
"ASEQ bs (AALTs bs1 rs) r \<leadsto>? AALTs (bs@bs1) (map (\<lambda>r'. ASEQ [] r' r) rs) " |
|
1593 |
||
1594 |
||
1595 |
||
| 365 | 1596 |
end |