AB Baa

Ps Qr

L L,S

PQr sP

S -> aSd

S -> aAd

A ->e

S -> aSd

S -> aAdd

A ->b

S -> aSdd

S -> aAdd

A ->b

Set of all even length strings

All possible strings which starts and ends with different symbol

Set of all strings of length at least two

Set of all odd length strings

Every regular language is a subset of context-free language

L = {aⁿbc^k | n,k>0} is regular

L = { aⁿbcⁿ⁺¹ | n>0} is context-free

Every context-free language is a subset of regular language

(A` + B` + C`)(A + B` + C)(A + B` + C)

(A + B + C)(A` + B + C`)(A + B` + C)

(A` + B` + C`)(A + B + C`)(A` + B + C)

(A + B + C)(A+ B` + C)(A + B` + C`)