Sign in

NewNcertRecursively Enumerable Language And Turing Machine

Consider the language
L = { $${a^n}|n \ge 0$$ } $$ \cup $$ { $${a^n}{b^n}|n \ge 0$$ }
and the following statements.

I. L is deterministic context-free.
II. L is context-free but not deterministic context-free.
III. L is not LL(k) for any k.

Which of the above statements is/are TRUE?
✓ Correct answer: C

Want the full step-by-step reasoning?

Practice thousands more questions free on NewNcert
Start practicing →

Question ID #144947 · NewNcert