In formal language theory, a context-free language (CFL) is a language generated by some context-free grammar (CFG).
For every grammar, If the correct production can be deduced from the partially constructed tree and the next $k$ symbols in the unscanned string, for every possible step, then the grammar is said to be $LL(k)$.
Prove that : If $G$ is $LL(k)$, then $L(G)$ is a deterministic context free language.