letl(a) be the language generated by g(a) – (n, 2, s, p) where 2 – [a,b), n= {s,x) and s->axb … Question: Let L(a) be the languagegenerated by G(a) – (N, 2, S, P) where 2 – [a, b), N= {S,X) andS->aX… Let L(a) be the language generated by G(a) – (N, 2, S,P) where 2 – [a, b), N= {S,X) and S->aXb X->aX|bX|epsilon (i)(3 marks) Describe the language L(a). (First generate a few stringsusing G(a)) i (1 mark) Determine whether G(a) is a type 0 grammarbut not a type 1 grammar, a type 1 grammar but not a type
PayPal Gateway not configured
PayPal Gateway not configured