Self-Doubt-Compiler

Question

$L=\{x^n:n \in N\} \cup\{x^ny^n|n \in N\}$

This language does not have LL(k) parser while being deterministic context free.Why?

Comments

yes, intuitively that is correct 👍 Similar to why LR(k) is more powerful than LL(k).

---

sir, can you show in formal way, why it doesn't have any LL(k) parser?

---

I don't know a formal way. But the above reason by @Ayush Upadhyaya is sufficient. 

https://stackoverflow.com/questions/14674912/why-are-there-lr0-parsers-but-not-ll0-parsers

Answer 1

Till DCFL there exist a LR(K) parser.