Question

6.(20) Let G=(V, S, R, S) be a grammar with V = {Q, R, T}; { = {q, r,ts}; and the set of rules: SQ Qq RqT R~rrt Qor T>t | ST a. (5) Convert G to a PDA using the method we described. b. (15) Convert G to Chomsky normal form.

Answer 1

Please like if u helps you ?

Push sz role Put all rules on state 2 title Accepte if there S.SE 9, 9/6 6,TIẾT E,T/S ETIE E, R/QOr E, RINT E,R/7 E,Q) Rat €,Q)9 E.€/sz 2 €, 21€ Scanned with CamScanner 6, s/Q is nothing on stack. F CS

Chomsky normal form CONF): - *) In CNF We have Jestrictia on length of R.H.S, either Two variables cos) che Terminal ABC cod Аәсі Steps In Iven xammar Start symbol s' is present in R.HS, So start with new stast symbols وداع SQ Q +9/RIT R->)YTIQQY T → ISTET Step2 - elimination of null Deductions cno null Preductins) Step- elimination o4 crit productors Deliminate & Q Then S2/RET Deliminate s'as den glq/RET Melimincue T-> Then T→/R27 g'-» QIRET S EIRET Q &/RET Rx18T/QQ8 T>t/52/RT/ET SEPL - annano useless symbors CS Stored with

Sons GON Into CNI Sla/RCIT SRC Q-9/11 P --> 01/000 Tot/2/ Rel /C27 cu PC :0500 C6-2PC, S'q/cut SqlCut Q- QICHT finaluf R-/OT/C5C2 Tot/9/COTO7 Whero cinq : C3T :c4 RCI 5-6G G6 PC, Mey. S, S'Q,CI are non Temnas 8,2 it axe Terminas CS Scanned with CamScanner