Introduction - If you have any usage issues, please Google them yourself
		 
Design of operator precedence parser
Given the definition of operator precedence grammar arithmetic expressions are as follows:
 G [E]:
 (1) E-> E+ T
 (2) E-> E-T
 (3) E-> T
 (4) T-> T* F
 (5) T-> T/F
 (6) T-> F
 (7) F-> P ^ F
 (8) F-> P
 (9) P-> (E)
 (10) P-> i
 Programming algorithm for precedence parser article law, and set the input of the grammar of the sentence is:
 (i* (i+ i)-i)/i ^ i ^ i
 Given output