a) Consider a CFG: EE+E| E-E | E*E |0|1|2|3|...19, Considering the string 9+5*3, show that the CFG is ambiguous or not a

[answerhappygod]

A Consider A Cfg Ee E E E E E 0 1 2 3 19 Considering The String 9 5 3 Show That The Cfg Is Ambiguous Or Not A 1 (62.45 KiB) Viewed 18 times

a) Consider a CFG: EE+E| E-E | E*E |0|1|2|3|...19, Considering the string 9+5*3, show that the CFG is ambiguous or not ambiguous grammar. Consider the following CFG b) c) PPP+/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? Convert the expression (15-7)+( (3*5 ) /(7-2)) into postfix notation, after that, calculate the postfix expression value.