解法:对原文法消除左递归,根据消除左递归后的等价文法建立语法树,而后对此语法树 进行后根遍历,即可得到后缀式.- Solution: Eliminates the left recursion to the original
grammar, after equal in value grammar establishment grammar tree which
eliminates the left recursion, after but the grammar tree carries on
the root to spread the calendar regarding this, after then obtains
decorates the type