按递归下降方式设计其编译程序，生成PL/0栈式指令代码，然后解释执行。用(a=1)+2*(b=3+4*5)/2+2*a*b-(a=a+5)/ (c=2) 测试-dropped by recursive approach to design their own compiler, generating PL / 0 Stack-code instructions, and then the interpretation and implementation. Using (a = 1) 2 * (b = 3 4 * 5) / 2 * a * b - (a = 5 a) / (c = 2) Testing