engineering recuitment Beltron Programmer Mock Test 2024 Theory of Computation Context Free Languages and Pushdown Automata Context Free Grammars
Which of the following statements is incorrect?
1
Deterministic PDA cannot handle languages or grammars with ambiguity
2
NDPDA can handle languages with ambiguity and any context-free grammar
3
Every NFA cannot be converted to an equivalent PDA
4
Complement of every context-free language is recursive