theory LexerExt

  imports Main

begin

section {* Sequential Composition of Languages *}

definition

  Sequ :: "string set \<Rightarrow> string set \<Rightarrow> string set" ("_ ;; _" [100,100] 100)

where 

  "A ;; B = {s1 @ s2 | s1 s2. s1 \<in> A \<and> s2 \<in> B}"

text {* Two Simple Properties about Sequential Composition *}

lemma seq_empty [simp]:

  shows "A ;; {[]} = A"

  and   "{[]} ;; A = A"

by (simp_all add: Sequ_def)

lemma seq_null [simp]:

  shows "A ;; {} = {}"

  and   "{} ;; A = {}"

by (simp_all add: Sequ_def)

lemma seq_assoc: 

  shows "A ;; (B ;; C) = (A ;; B) ;; C"

apply(auto simp add: Sequ_def)

apply(metis append_assoc)

apply(metis)

done

section {* Semantic Derivative (Left Quotient) of Languages *}

definition

  Der :: "char \<Rightarrow> string set \<Rightarrow> string set"

where

  "Der c A \<equiv> {s. c # s \<in> A}"

definition

  Ders :: "string \<Rightarrow> string set \<Rightarrow> string set"

where

  "Ders s A \<equiv> {s'. s @ s' \<in> A}"

lemma Der_null [simp]:

  shows "Der c {} = {}"

unfolding Der_def

by auto

lemma Der_empty [simp]:

  shows "Der c {[]} = {}"

unfolding Der_def

by auto

lemma Der_char [simp]:

  shows "Der c {[d]} = (if c = d then {[]} else {})"

unfolding Der_def

by auto

lemma Der_union [simp]:

  shows "Der c (A \<union> B) = Der c A \<union> Der c B"

unfolding Der_def

by auto

lemma Der_Sequ [simp]:

  shows "Der c (A ;; B) = (Der c A) ;; B \<union> (if [] \<in> A then Der c B else {})"

unfolding Der_def Sequ_def

by (auto simp add: Cons_eq_append_conv)

lemma Der_UNION: 

  shows "Der c (\<Union>x\<in>A. B x) = (\<Union>x\<in>A. Der c (B x))"

by (auto simp add: Der_def)

section {* Power operation for Sets *}

fun 

  Pow :: "string set \<Rightarrow> nat \<Rightarrow> string set" ("_ \<up> _" [101, 102] 101)

where

   "A \<up> 0 = {[]}"

|  "A \<up> (Suc n) = A ;; (A \<up> n)"

lemma Pow_empty [simp]:

  shows "[] \<in> A \<up> n \<longleftrightarrow> (n = 0 \<or> [] \<in> A)"

by(induct n) (auto simp add: Sequ_def)

lemma Pow_plus:

  "A \<up> (n + m) = A \<up> n ;; A \<up> m"

by (induct n) (simp_all add: seq_assoc)

section {* Kleene Star for Languages *}

inductive_set

  Star :: "string set \<Rightarrow> string set" ("_\<star>" [101] 102)

  for A :: "string set"

where

  start[intro]: "[] \<in> A\<star>"

| step[intro]:  "\<lbrakk>s1 \<in> A; s2 \<in> A\<star>\<rbrakk> \<Longrightarrow> s1 @ s2 \<in> A\<star>"

lemma star_cases:

  shows "A\<star> = {[]} \<union> A ;; A\<star>"

unfolding Sequ_def

by (auto) (metis Star.simps)

lemma star_decomp: 

  assumes a: "c # x \<in> A\<star>" 

  shows "\<exists>a b. x = a @ b \<and> c # a \<in> A \<and> b \<in> A\<star>"

using a

by (induct x\<equiv>"c # x" rule: Star.induct) 

   (auto simp add: append_eq_Cons_conv)

lemma Der_star [simp]:

  shows "Der c (A\<star>) = (Der c A) ;; A\<star>"

proof -    

  have "Der c (A\<star>) = Der c ({[]} \<union> A ;; A\<star>)"  

    by (simp only: star_cases[symmetric])

  also have "... = Der c (A ;; A\<star>)"

    by (simp only: Der_union Der_empty) (simp)

  also have "... = (Der c A) ;; A\<star> \<union> (if [] \<in> A then Der c (A\<star>) else {})"

    by simp

  also have "... =  (Der c A) ;; A\<star>"

    unfolding Sequ_def Der_def

    by (auto dest: star_decomp)

  finally show "Der c (A\<star>) = (Der c A) ;; A\<star>" .

qed

lemma Star_in_Pow:

  assumes a: "s \<in> A\<star>"

  shows "\<exists>n. s \<in> A \<up> n"

using a

apply(induct)

apply(auto)

apply(rule_tac x="Suc n" in exI)

apply(auto simp add: Sequ_def)

done

lemma Pow_in_Star:

  assumes a: "s \<in> A \<up> n"

  shows "s \<in> A\<star>"

using a

by (induct n arbitrary: s) (auto simp add: Sequ_def)

lemma Star_def2: 

  shows "A\<star> = (\<Union>n. A \<up> n)"

using Star_in_Pow Pow_in_Star

by (auto)

section {* Regular Expressions *}

datatype rexp =

  ZERO

| ONE

| CHAR char

| SEQ rexp rexp

| ALT rexp rexp

| STAR rexp

| UPNTIMES rexp nat

| NTIMES rexp nat

section {* Semantics of Regular Expressions *}

fun

  L :: "rexp \<Rightarrow> string set"

where

  "L (ZERO) = {}"

| "L (ONE) = {[]}"

| "L (CHAR c) = {[c]}"

| "L (SEQ r1 r2) = (L r1) ;; (L r2)"

| "L (ALT r1 r2) = (L r1) \<union> (L r2)"

| "L (STAR r) = (L r)\<star>"

| "L (UPNTIMES r n) = (\<Union>i\<in> {..n} . (L r) \<up> i)"

| "L (NTIMES r n) = ((L r) \<up> n)"

section {* Nullable, Derivatives *}

fun

 nullable :: "rexp \<Rightarrow> bool"

where

  "nullable (ZERO) = False"

| "nullable (ONE) = True"

| "nullable (CHAR c) = False"

| "nullable (ALT r1 r2) = (nullable r1 \<or> nullable r2)"

| "nullable (SEQ r1 r2) = (nullable r1 \<and> nullable r2)"

| "nullable (STAR r) = True"

| "nullable (UPNTIMES r n) = True"

| "nullable (NTIMES r n) = (if n = 0 then True else nullable r)"

fun

 der :: "char \<Rightarrow> rexp \<Rightarrow> rexp"

where

  "der c (ZERO) = ZERO"

| "der c (ONE) = ZERO"

| "der c (CHAR d) = (if c = d then ONE else ZERO)"

| "der c (ALT r1 r2) = ALT (der c r1) (der c r2)"

| "der c (SEQ r1 r2) = 

     (if nullable r1

      then ALT (SEQ (der c r1) r2) (der c r2)

      else SEQ (der c r1) r2)"

| "der c (STAR r) = SEQ (der c r) (STAR r)"

| "der c (UPNTIMES r 0) = ZERO"

| "der c (UPNTIMES r (Suc n)) = SEQ (der c r) (UPNTIMES r n)"

| "der c (NTIMES r 0) = ZERO"

| "der c (NTIMES r (Suc n)) = SEQ (der c r) (NTIMES r n)"

fun 

 ders :: "string \<Rightarrow> rexp \<Rightarrow> rexp"

where

  "ders [] r = r"

| "ders (c # s) r = ders s (der c r)"

lemma nullable_correctness:

  shows "nullable r  \<longleftrightarrow> [] \<in> (L r)"

apply(induct r) 

apply(auto simp add: Sequ_def) 

done

lemma Suc_reduce_Union:

  "(\<Union>x\<in>{Suc n..Suc m}. B x) = (\<Union>x\<in>{n..m}. B (Suc x))"

by (metis UN_extend_simps(10) image_Suc_atLeastAtMost)

lemma Suc_reduce_Union2:

  "(\<Union>x\<in>{Suc n..}. B x) = (\<Union>x\<in>{n..}. B (Suc x))"

apply(auto)

apply(rule_tac x="xa - 1" in bexI)

apply(simp)

apply(simp)

done

lemma Seq_UNION: 

  shows "(\<Union>x\<in>A. B ;; C x) = B ;; (\<Union>x\<in>A. C x)"

by (auto simp add: Sequ_def)

lemma Seq_Union:

  shows "A ;; (\<Union>x\<in>B. C x) = (\<Union>x\<in>B. A ;; C x)"

by (auto simp add: Sequ_def)

lemma Der_Pow [simp]:

  shows "Der c (A \<up> (Suc n)) = 

     (Der c A) ;; (A \<up> n) \<union> (if [] \<in> A then Der c (A \<up> n) else {})"

unfolding Der_def Sequ_def 

by(auto simp add: Cons_eq_append_conv Sequ_def)

lemma Suc_Union:

  "(\<Union>x\<le>Suc m. B x) = (B (Suc m) \<union> (\<Union>x\<le>m. B x))"

by (metis UN_insert atMost_Suc)

lemma Der_Pow_subseteq:

  assumes "[] \<in> A"  

  shows "Der c (A \<up> n) \<subseteq> (Der c A) ;; (A \<up> n)"

using assms

apply(induct n)

apply(simp add: Sequ_def Der_def)

apply(simp)

apply(rule conjI)

apply (smt Sequ_def append_Nil2 mem_Collect_eq seq_assoc subsetI)

apply(subgoal_tac "((Der c A) ;; (A \<up> n)) \<subseteq> ((Der c A) ;; (A ;; (A \<up> n)))")

apply(auto)[1]

by (smt Sequ_def append_Nil2 mem_Collect_eq seq_assoc subsetI)

lemma test:

  shows "(\<Union>x\<le>Suc n. Der c (L r \<up> x)) = (\<Union>x\<le>n. Der c (L r) ;; L r \<up> x)"

apply(induct n)

apply(simp)

apply(auto)[1]

apply(case_tac xa)

apply(simp)

apply(simp)

apply(auto)[1]

apply(case_tac "[] \<in> L r")

apply(simp)

apply(simp)

by (smt Der_Pow Suc_Union inf_sup_aci(5) inf_sup_aci(7) sup_idem)

lemma Der_Pow_in:

  assumes "[] \<in> A"

  shows "Der c (A \<up> n) = (\<Union>x\<le>n. Der c (A \<up> x))"

using assms 

apply(induct n)

apply(simp)

apply(simp add: Suc_Union)

done

lemma Der_Pow_notin:

  assumes "[] \<notin> A"

  shows "Der c (A \<up> (Suc n)) = (Der c A) ;; (A \<up> n)"

using assms

by(simp)

lemma der_correctness:

  shows "L (der c r) = Der c (L r)"

apply(induct c r rule: der.induct) 

apply(simp_all add: nullable_correctness)[7]

apply(simp only: der.simps L.simps)

apply(simp only: Der_UNION)

apply(simp only: Seq_UNION[symmetric])

apply(simp add: test)

apply(simp)

(* NTIMES *)

apply(simp only: L.simps der.simps)

apply(simp)

apply(rule impI)

by (simp add: Der_Pow_subseteq sup_absorb1)

lemma ders_correctness:

  shows "L (ders s r) = Ders s (L r)"

apply(induct s arbitrary: r)

apply(simp_all add: Ders_def der_correctness Der_def)

done

lemma ders_ZERO:

  shows "ders s (ZERO) = ZERO"

apply(induct s)

apply(simp_all)

done

lemma ders_ONE:

  shows "ders s (ONE) = (if s = [] then ONE else ZERO)"

apply(induct s)

apply(simp_all add: ders_ZERO)

done

lemma ders_CHAR:

  shows "ders s (CHAR c) = (if s = [c] then ONE else 

                           (if s = [] then (CHAR c) else ZERO))"

apply(induct s)

apply(simp_all add: ders_ZERO ders_ONE)

done

lemma  ders_ALT:

  shows "ders s (ALT r1 r2) = ALT (ders s r1) (ders s r2)"

apply(induct s arbitrary: r1 r2)

apply(simp_all)

done

section {* Values *}

datatype val = 

  Void

| Char char

| Seq val val

| Right val

| Left val

| Stars "val list"

section {* The string behind a value *}

fun 

  flat :: "val \<Rightarrow> string"

where

  "flat (Void) = []"

| "flat (Char c) = [c]"

| "flat (Left v) = flat v"

| "flat (Right v) = flat v"

| "flat (Seq v1 v2) = (flat v1) @ (flat v2)"

| "flat (Stars []) = []"

| "flat (Stars (v#vs)) = (flat v) @ (flat (Stars vs))" 

lemma flat_Stars [simp]:

 "flat (Stars vs) = concat (map flat vs)"

by (induct vs) (auto)

section {* Relation between values and regular expressions *}

inductive 

  Prf :: "val \<Rightarrow> rexp \<Rightarrow> bool" ("\<turnstile> _ : _" [100, 100] 100)

where

 "\<lbrakk>\<turnstile> v1 : r1; \<turnstile> v2 : r2\<rbrakk> \<Longrightarrow> \<turnstile> Seq v1 v2 : SEQ r1 r2"

| "\<turnstile> v1 : r1 \<Longrightarrow> \<turnstile> Left v1 : ALT r1 r2"

| "\<turnstile> v2 : r2 \<Longrightarrow> \<turnstile> Right v2 : ALT r1 r2"

| "\<turnstile> Void : ONE"

| "\<turnstile> Char c : CHAR c"

| "\<turnstile> Stars [] : STAR r"

| "\<lbrakk>\<turnstile> v : r; \<turnstile> Stars vs : STAR r\<rbrakk> \<Longrightarrow> \<turnstile> Stars (v # vs) : STAR r"

| "\<turnstile> Stars [] : UPNTIMES r 0"

| "\<lbrakk>\<turnstile> v : r; \<turnstile> Stars vs : UPNTIMES r n\<rbrakk> \<Longrightarrow> \<turnstile> Stars (v # vs) : UPNTIMES r (Suc n)"

| "\<lbrakk>\<turnstile> Stars vs : UPNTIMES r n\<rbrakk> \<Longrightarrow> \<turnstile> Stars vs : UPNTIMES r (Suc n)"

| "\<turnstile> Stars [] : NTIMES r 0"

| "\<lbrakk>\<turnstile> v : r; \<turnstile> Stars vs : NTIMES r n\<rbrakk> \<Longrightarrow> \<turnstile> Stars (v # vs) : NTIMES r (Suc n)"

inductive_cases Prf_elims:

  "\<turnstile> v : ZERO"

  "\<turnstile> v : SEQ r1 r2"

  "\<turnstile> v : ALT r1 r2"

  "\<turnstile> v : ONE"

  "\<turnstile> v : CHAR c"

(*  "\<turnstile> vs : STAR r"*)

lemma Prf_flat_L:

  assumes "\<turnstile> v : r" shows "flat v \<in> L r"

using assms

apply(induct v r rule: Prf.induct)

apply(auto simp add: Sequ_def)

apply(rotate_tac 2)

apply(rule_tac x="Suc x" in bexI)

apply(auto simp add: Sequ_def)[2]

done

lemma Prf_Stars:

  assumes "\<forall>v \<in> set vs. \<turnstile> v : r"

  shows "\<turnstile> Stars vs : STAR r"

using assms

by(induct vs) (auto intro: Prf.intros)

lemma Prf_Stars_NTIMES:

  assumes "\<forall>v \<in> set vs. \<turnstile> v : r" "(length vs) = n"

  shows "\<turnstile> Stars vs : NTIMES r n"

using assms

apply(induct vs arbitrary: n) 

apply(auto intro: Prf.intros)

done

lemma Prf_Stars_UPNTIMES:

  assumes "\<forall>v \<in> set vs. \<turnstile> v : r" "(length vs) = n"

  shows "\<turnstile> Stars vs : UPNTIMES r n"

using assms

apply(induct vs arbitrary: n) 

apply(auto intro: Prf.intros)

done

lemma Prf_UPNTIMES_bigger:

  assumes "\<turnstile> Stars vs : UPNTIMES r n" "n \<le> m" 

  shows "\<turnstile> Stars vs : UPNTIMES r m"

using assms

apply(induct m arbitrary:)

apply(auto)

using Prf.intros(10) le_Suc_eq by blast

lemma UPNTIMES_Stars:

 assumes "\<turnstile> v : UPNTIMES r n"

 shows "\<exists>vs. v = Stars vs \<and> (\<forall>v \<in> set vs. \<turnstile> v : r) \<and> length vs \<le> n"

using assms

apply(induct n arbitrary: v)

apply(erule Prf.cases)

apply(simp_all)

apply(erule Prf.cases)

apply(simp_all)

apply(auto)

using le_SucI by blast

lemma NTIMES_Stars:

 assumes "\<turnstile> v : NTIMES r n"

 shows "\<exists>vs. v = Stars vs \<and> (\<forall>v \<in> set vs. \<turnstile> v : r) \<and> length vs = n"

using assms

apply(induct n arbitrary: v)

apply(erule Prf.cases)

apply(simp_all)

apply(erule Prf.cases)

apply(simp_all)

apply(auto)

done

lemma Star_string:

  assumes "s \<in> A\<star>"

  shows "\<exists>ss. concat ss = s \<and> (\<forall>s \<in> set ss. s \<in> A)"

using assms

apply(induct rule: Star.induct)

apply(auto)

apply(rule_tac x="[]" in exI)

apply(simp)

apply(rule_tac x="s1#ss" in exI)

apply(simp)

done

lemma Star_val:

  assumes "\<forall>s\<in>set ss. \<exists>v. s = flat v \<and> \<turnstile> v : r"

  shows "\<exists>vs. concat (map flat vs) = concat ss \<and> (\<forall>v\<in>set vs. \<turnstile> v : r)"

using assms

apply(induct ss)

apply(auto)

apply (metis empty_iff list.set(1))

by (metis concat.simps(2) list.simps(9) set_ConsD)

lemma Star_val_length:

  assumes "\<forall>s\<in>set ss. \<exists>v. s = flat v \<and> \<turnstile> v : r"

  shows "\<exists>vs. concat (map flat vs) = concat ss \<and> (\<forall>v\<in>set vs. \<turnstile> v : r) \<and> (length vs) = (length ss)"

using assms

apply(induct ss)

apply(auto)

by (metis List.bind_def bind_simps(2) length_Suc_conv set_ConsD)

lemma Star_Pow:

  assumes "s \<in> A \<up> n"

  shows "\<exists>ss. concat ss = s \<and> (\<forall>s \<in> set ss. s \<in> A) \<and> (length ss = n)"