Let the Grammar G for  arithmetic 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. 

The Parse table (Lecture 5/slide 58) is given below:

Using the following parse table,  parse the following arithmetic expression:

(i*i + i*i + i*i) / i

Print out the contents of the stacktop and the input buffer in each step (Lecture 5/Slide 68).