Regular Grammer


L1 and L2 are CFL’s and R is a regular set, one of the languages below is not necessarily a C.F.G
a. L1L2
b. L1 intersection L2
c. L1 intersection R
d. L1 union L2


B is the answer because intersection of two CFG 's is not a CFG.