Consider the following grammar S→ a | b | aTa | bTb T→ aT | bT | ϵ Select the…
Consider the following grammar
S→ a | b | aTa | bTb
T→ aT | bT | ϵ
Select the wrong option.
- A.
The language generated by the grammar is regular.
- B.
The language generated by the grammar is a(a+b)*a +b(a+b)*b.
- C.
The language generated by the grammar can be accepted by NFA.
- D.
The given grammar is CFG.
Attempted by 35 students.
Sign up free to check your answer
Sign up freeLoading lesson…