Problem Detail: In Knuth’s original paper on $LR(k)$ grammars, he proved that the decision problem “Given a CFG $G$, is there a $k$ such that $G$ is an $LR(k)$ grammar?” is undecidable. Is there a similar result showing that it is undecidable whether a given CFG is an $LL(k)$ grammar for some choice of $k$? Or is this problem known to be decidable?
Asked By : templatetypedef
Answered By : Alex ten Brink
This is undecidable. It is theorem 11 in Properties of deterministic top down grammars by Rosenkrantz and Stearns. Theorem 12 in the same paper however states that the problem becomes decidable if the grammar is known to be $LR(k’)$ for some (possibly different) $k’$.
Best Answer from StackOverflow
Question Source : http://cs.stackexchange.com/questions/2889 Ask a Question Download Related Notes/Documents
