Don't text and drive you could crash
<h3>Answer(:</h3>
•concatenation
• scanning
• substringing
• translation
• verification
<h3>if you want to remember means csstv;-)</h3>
Answer:
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 +,-.
