toc

Question

 for DCFL there exists LL(k) or not?

Answer 1

No, LL(k) form subset of  DCFLs.

https://en.wikipedia.org/wiki/LL_grammar

Answer 2

All the parsing methods are defined for a grammar and not a language.

There may be multiple grammar which may represent a particular language.

Depending on the grammar we can decide whether it is LL(k) or not.

And for LL(k),Grammar should be unambiguous,deterministic and it should not be left recursive.

Comments

which rule? plz mention it clearly

---

Sorry, LL grammars form subsets of DCFGs and DCFLs

https://en.wikipedia.org/wiki/LL_grammar

There exist LR(k) for every DCFL.

---

This may be helpful

http://cs.stackexchange.com/questions/32088/lr0-expressive-power