分析递归算法的栈实现以及用栈运算转换递归算法为非递归算法，阐述递归思想及其应用。
The realizing recursive algorithm by stack and the Changing recursive algorithm into non-recursive by stack operation are studied. The thinking of recursion and its application are expounded.
当它是一个操作符时，从栈中弹出两个数进行运算，并且将运算结果压入栈中。
When it is an operator, pop two Numbers from the stack, do the calculation, and push back the result.
掌握利用栈实现十进制数转换成八进制数的运算。
Master the stack to achieve a decimal number converted to octal number of operation.
应用推荐