Question

please solve it ASAP

Part IV: Grammars and Derivations (15 points): Use the following production rules to determine whether or not each of the associated strings is valid. Show the transformations or provide adequate explanation: N = {S, A, E) T = {a,b, e} Start = 5 1. S-->A 2. A--> bse 3. A--> be 4. S--> E 5. E--> Eea 6. E-> (a) aeaeaea (b) baeaea (c) Is this grammar context-sensitive or context free and why?

Answer 1

a)

S -> Eea -> Eeaea -> Eeaeaea -> aeaeaea

Clearly, this string is a valid string.

b)

S -> A -> bSe

Since there is no way this grammar can generate string which starts with b and ends with a, this string is not valid.

c)

This is a context free grammar since it satisfies all the rules required for CFG.