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