CS2201 Lecture22 Stacks2

Показать описание

At 4:32 I make a bonehead slip in which I say that a compiler will translate an ambiguous infix expression into an unambiguous postfix expression, but of course the infix expression is just as unambiguous given precedence rules (operator precedence, parenthetical, left to right evaluation). The computer code for evaluating postfix is simpler than code for evaluating infix.