Given G be the grammar with V = {a, b, c, S}; T = {a, b, c}; start symbol S and productions P consist of the following: S→ abS ; S → bcS ; S → bbS ; S → a; S → cb i. Show that bbbcbba belongs to the language generated by G. ii. Construct the derivation tree for bbbcbba basea on your answer in part i).

Describe L(G) for the grammar G = (V, VT, S, P) where V = {0, 1, A, S},  VT = {0, 1}, and P consists of: (L(G) is a possibly infinite set of words. You can describe it by listing its elements, or explaining which elements are in the set L(G)) S → 0 S → ASA A → 1

QUESTION 4. rules: 1. 2. Let G= ({S}, {(,)), P, S) be a CFG, where P contains the following S→SSI(S)Se List three different strings in L(G). What is the language L(G)? (You may either give its name or characterize the strings in it.) 3. Show that the grammar G is ambiguous by constructing two different parse trees for some member of L(G). Can you revise the grammar G to make it unambiguous?

24. Show that the grammars and are not equivalent. S → aSb|bSa|SS|a S aSb|bSala