Sque a Copy

d$).$ You are a good compiler designer and constructor who have been using various grammars $($identified in Chomsky's hierarchy for languages$)$ to generate patterns in your bid to provide proofs in your work. Given the Context$-$free Grammar $($CFG$)$ with the following $7$ production rules:

$SaS|B|$

$BbA$

$AaA|bC|$

$CaC||$

i$.$ Derive the word aabaabaa

ii$.$ Draw the derivation tree for aabaabaa

$\backslash$table$[[\backslash$table$[[$Majice Topk$],[$Context$-$free Grammars$]],\backslash$table$[[$Eosern$],[$Dosinathon$],[$EV$]],\backslash$table$[[$Serre$]]]]$

TOTAL SCORE: $25$

Question $10$

$($a$).$ Kleene's closures $*,+$ and $?($over alphabets$)$ are commonly used for designing regular languages that compilers can recognize.

$($i$).$ Obtain the regular expressions for the language $G=\{a^{\text{t}\text{a}\text{r}3}$;$a0\}$

$($ii$).$ Given the language $L-\{a^2{b}^{**}$:$n0\},$ determine if the string aaaabDbD can be generated; and justify your answer.