Evaluation of boolean expressions on one's complement machines

Abstract

An algorithm is presented which evaluates an arbitrary boolean expression in terms of a small instruction set and which often generates fewer instructions than other methods the author has seen. The algorithm tells what code to generate whenever a boolean operator, a branch test, a boolean assignment statement, or a conditional expression is encountered. One's complement arithmetic is assumed throughout.