3. A pure grammar, G, is one which uses no variables in its productions. Such a grammar is defined by a triple, (T,P,w), where T is a finite set of terminals, P is a finite set of productions TT, and w is the start word. For such a grammar, define the language generated by G to be the set of all terminal strings derivable from the start word. For example, if G (a,
OR
OR