Let the Grammar G for arithemetic expressions as follows:
1. E -> E + T
2. E -> E – T
3. E -> T
4. T -> T*F
5. T -> T/F
6. T -> F
7. F -> i
8. F -> (E)
Where i stands for an identifier .
The above grammar looks as below after the left recursions have been removed. see image.
The Parse table (Lecture 5/slide 58) is given below: see image.
Using the above parse table, parse the following arithmetic expression:
(i*i + i*i + i*i)
Print out the contents of the stack top and the input buffer in each step (Lecture 5/Slide 68). see image.
The Pushdown automata for Prog#2: see image.