1)Convert the following context free grammar to Chomsky NormalForm
S → a X | Yb
X → S | λ
Y → b Y | λ
2)Some languages distinguish between uppercase and lowercase inidentifiers. What are the pros and cons of this designdecision?
3)Use the pumping lemma to prove that the following languagesare not regular. (The alphabet is Σ = {a,b}.)
a) L = {an b1 ak: k >= n+l}
b) L = {ww: w ∈ Σ *}
c) L= {ak2} // this is k square
d) L ={uwwrv :u,v,w ∈ Σ+, |u| >=|v|}
Expert Answer
An answer will be send to you shortly. . . . .