[comp.sys.hp] Evaluator

bentz@ge.UUCP (Ray Bentz) (03/22/91)

My goal is to produce an algorithm designed to parse a logical expression

into one that will minimize the number of evaluations needed to derive

the overall evaluation (True or False)

For example, the expression  (A && B) || C would be more efficiently 

evaluated if it were written as C || (A && B)

I am looking for an algorithm, preferably C code, to reconstruct a logical

expression to the most efficient expression befor the evaluation is

performed.