Question

Problem 3. f10 points for each of the following context-free grammars, i)use set notation to define the language generated by the grammar, and ii) Show that it is ambiguous by drawing 2 different parse trees for a string. a) Grammar: S + SaSb Si S + Sja | SibT T + Tb Tac b) Grammar: S + 151 T T + 1X1 X X + 0X01

Answer 1

problem 3: @ Language & (9) S-sasalbsibl-t as able to speccette WT WR Ty Totale is able to genererate Cath)" Sa sal sbls, is able fo genovate wCatht we catbox So Nalaloo : L- Aras”.fee” ngay String is abba. (Pi) parse tree (9) . parse free en S Liikunta two parse tres exist . sopt is ambiguous S->?S11T As able togenerale Main T-> 1X11X Ps able togeneeste 300 m X50Xoli as able to generale otrok Set Notation : Laf in markmin/n, mzq Kzd}

(1) String: 111 tree 2 ! treer: L X --- <= two parse trees exist aso 9tis. ambotquous.

Answer 2

problem 3; @ language 6 19) S aalbs,bl.-t as able to proceste WTOR Is ThlTale as able to genere safe cath' sv sal sb)s, is able to generale wCarb the catbyt Set Ndalion 15 : La Wcats) "WR CO-4c," nomzo} : String is abba. Set Nolation as se tree (9) en parse . parse. free Likinta two pause tres exist . so it is ambiguous 3-»!ST es able to generale Marin T->1X11X Ps able togeneeste Marim X90Xoli as ale to generale oliok Set Molation : L = f n mokok min/n, mzq kzo}

(1) String: 111 tree 2 ! treer: L X --- <= two parse trees exist aso 9tis. ambotquous.