Question

3. Consider the CFG as defined:
X -> XY
X >> aX /bX / a
Y -> Ya / Yb/b
Any string of terminals, which can be generated by the CFG
i) Has at least one b
11) Ends with a
111) Has no consecutive a's and b's
iv) Has at least 2 a's.​

Answer 1

Answer:

tutfyd xufufigcohc iyfysetufciigcoh if igcougrd igfitfoyfohvyovoygoygoyvyogogcigcgicicgkb kv kvcogcoygygoochlhvlhvtfoygv kgcooyfhvkgcoyocihcbk yvougohvihcihvohv ohvvoigcogcohvb kogvohvohvgcoogckbvb kbl vyoypgohv kvbklb lb bpk

Explanation:

bkgcifxitdcgkh b fiyicgj, cigcv kgvfogcigckg coyocyv kgocco Yb vkypvgoclg pgcb. glitchkvb ogvbl. lhh