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 T → T*, and w is the start word. For such a grammar, define the language
OR
OR