0 votes 0 votes Show that if G is an LL (k) grammar, then L (G) is a deterministic context-free language. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation context-free-grammar context-free-language + – Naveen Kumar 3 asked Jun 25, 2019 Naveen Kumar 3 260 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.