6. Show that if G is an LL (k) grammar, then L (G) is a deterministic contextfree language.
7. Show that a deterministic context-free language is never inherently
ambiguous.
8. Let G be a context-free grammar in Greibach normal form. Describe an
algorithm which, for any given k, determines whether or not G is an LL (k)
grammar.
9. Give LL grammars for the following languages, assuming Σ = {a,b, c}.