Simplicity = efficiency = readability a simple infix to prefix algorithm
Shimon Cohen · ACM SIGPLAN Notices · 1981
The following is not the expected breakthrough in the methodology of computer programming. It is just a small contribution to this troubled topic. It proposes an improved (simple) version for infix expression evaluation. The main idea behind this algorithm is it's simplicity which surprisingly leads to a (very) flexible, efficient, readable, small (I dare say pure) program.The simple purpose of this small paper is to promote the ideal of small and simple programs.