Question

Q let g = (v, t, s, p) be a context-free grammar such that every one of its productions is of the form a v, with |v| = k > 1. The derivation tree for any w l(g) has a height h such that (net-jan-2017) a) logk|w| h logk((|w|-1)/k-1) b) logk|w| h logk(k|w|) c) logk|w| h k logk|w| d) logk|w| h ((|w|-1)/k-1)

Answer 1

Answer:

sorry i dont know..............