Course: Discrete Structures
Concept: Formal Languages
Q1-Q6
(1)6. Use a parse tree to derive the word in #5. (1)1. Describe the language L(G) for the following grammar. G = (V, VT, S, P) where V s(S, A, 0, 1], Vr- [0, 13, and P consists of A→0A A 1 (2)2. Write the productions of #1 in BNF. (2)3. Give the productions for a grammar that generates the following language. 10(11)*0 (2)7. Write
