Push-down automaton for unary addition

w = 




Grammar




    E -> TX 

    X -> ε | +TX | -TX

    T -> FY

    Y -> ε | *FY | /FY

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