Answer:
Step-by-step explanation:
Let G denote an unambiguous Grammar capable of producing simple mathematical expressions, involving operators +,-,*,/. These operators are left associative (which ensures left to right evaluation). S is the start symbol of the Grammar i.e. the production starts from S. n denotes a number and is a terminal i.e. we can't produce anything further from n. Then, the solution is as follows :
S â S + T |S - T | S
TâT | F | T*F|F
F â n
Here, S, T and F are variables. Note that /,* have been given precedence over +,-.