Question no2

Question Answered step-by-step Question no2 Question no2Image transcription textQuestion 2 : Context-free Languages Consider the following context-free grammar G on the alphabet E = {a, b}S ::= XX X aXa | bXb | a | b | & (a) Show that the grammar G is ambiguous. [7 marks] (b) A student is in theprocess of transforming & into Chomsky Normal Form and has reached the following: So S S… Show more… Show more  Engineering & Technology Computer Science Share QuestionEmailCopy link Comments (0)