Consider the context-free grammars over the alphabet {a,b,c}

Please wait...
THANKU FOR BEING A PART OF OUR JOURNEY TO BRING "REVOLUTION IN EDUCATION"
We Genuinely APPRECIATE your PATIENCE

Coming Soon

65

M: +2.00/-0.66

Consider the context-free grammars over the alphabet {a,b,c} given below. S and T are non-terminals

The language is

[GATE CS 2017 Set 1]

A Finite

B Not finite but regular

C Context-free but not regular

D Recursive but not context-free