Question: Design BNF and draw a Parse Tree: Design BNF for expressions using binary + - * /, unary -, and (), with + and -
Design BNF and draw a Parse Tree:
Design BNF for expressions using binary + - * /, unary -, and (), with + and - having higher precedence than * /, the other precedence as in algebra. Unary - associates. + and - associate right to left, while * and / associate left to right.
Using the above, draw a parse tree for x + y / x - 3 * x. Then give the result, using th tree, when x = 1 and y = 3
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
