Consider the following CFG.
𝑆 𝑋 𝐴 𝐵 → 𝑋 → 𝐵 𝐴 → 𝑎 𝐴 | 𝜖 → 𝑏 𝐵 | 𝑏
The Language generated by this CFG is
S → X

X → BA
A → aA | ε

B → bB | b

Question

Consider the following CFG. 
                                      𝑆 𝑋 𝐴 𝐵 → 𝑋 → 𝐵 𝐴 → 𝑎 𝐴   |   𝜖 → 𝑏 𝐵   |   𝑏 
 The Language generated by this CFG is 
 S → X 
 
 X → BA 
 A → aA | ε 
 
 B → bB | b

Answer

None of the answer

Answer

{ b n  a m  | n  ≥ 1, m  ≥0 } and its regular language

Answer

{ (ab) m  | m  ≥ 1} and its not regular language

Answer

{ b n  a m  | n  ≥ 1, m  ≥0 } and its not regular language

Answer

{ (ab) m  | m  ≥ 1} and its regular language

Crowdly

Consider the following CFG. 𝑆 𝑋 𝐴 𝐵 →...

Want instant access to all verified answers on moovit.vit.ac.in?