Question: Exercise 2 Let ={a,b} be the alphabet for this question. Consider the following context-free grammar G : SB::=aSa::=BBBb 1. Give a derivation tree for the

Exercise 2 Let ={a,b} be the alphabet for this question. Consider the following context-free grammar G : SB::=aSa::=BBBb 1. Give a derivation tree for the word abbba and the corresponding leftmost derivation in G. [3 marks] 2. What is the language L(G) generated by this grammar? [3 marks] 3. Is L(G) regular? Justify your answer. [3 marks]
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
