Answer Happy

Posted: **Sun Jul 03, 2022 9:59 am**

: B Consider The Following Cfg P Pp Pp Pp Pp D E D 0 1 2 3 4 5 6 7 8 9 I Using This Cfg Drive The String 42 3 45 1 (33.46 KiB) Viewed 25 times

b) Consider the following CFG P→→PP+/PP*/ PP / PP//D/E D 0/1/2/3/4/5/6/7/8/9 - i)Using this CFG Drive the string 42/3*45+- by left most derivation and right most derivation ii) generate parse tree for the above string iii) What language is generated by this grammar?

Answer Happy

b) Consider the following CFG P→→PP+/PP/ PP / PP//D/E D 0/1/2/3/4/5/6/7/8/9 - i)Using this CFG Drive the string 42/345

b) Consider the following CFG P→→PP+/PP/ PP / PP//D/E D 0/1/2/3/4/5/6/7/8/9 - i)Using this CFG Drive the string 42/345