Question

Automata: solve a - e

2. (10+10+10+10+10-50 points) Agrammar is a 4-tuple G, G-ON,E,11,L$) where N is a finite set of nonterminal symbols Σ is a finite set of terminal symbols is a finite set of rules S is the starting symbol Let N- (S, T s-{a, b, c} s-> ab aT >aaTb aT-ac S is the starting symbol. (a 10 points) Prove that the given grammar G is a context sensitive grammar. (b-10 points) What is the language L- L(G) generated by the given grammar G? (e 10 points) For the string aaacbbb design the appropriate syntax tree based on the context sensitive grammar G (d-10 points) The language L- L(G) generated by the given grammar G is also context free language Write the context free grammar G L. l that generates the language (e 10 points) For the string aaacbbb design the appropriate syntax tree based on the context free grammar Gl.

Answer 1

リー59ab Given rammalu content seniti ve becauin the containaeaminal aud a non bninal b) To eakecome exandes Contains eai co tre a 2

Deliveri ть

シ 5 ать ac bh

( 3 pictures attached.Hope this was helpful)