Push-down automaton for unary addition

w = 




Grammar




  E -> TX 

X -> e | +TX | -TX

T -> FY

Y -> e | *FY | /FY

F -> n | (E) | i(E)