A proof of Hamblin's algorithm for translation of arithmetic expressions from infix to postfix form |
| |
| Authors: | D. Wood |
| |
| Affiliation: | (1) The Courant Institute, New York, USA |
| |
| Abstract: | We show that a particular algorithm for the translation of arithmetic expressions in infix form into postfix form is correct. The method used is ad hoc, in contrast to other work in this field, and it is hoped that this in itself is of interest.Work carried out at the University of Leeds, England. |
| |
| Keywords: | Translation compiler arithmetic expression algorithm infix postfix |
| 本文献已被 SpringerLink 等数据库收录！ |
