Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!wuarchive!sdd.hp.com!hp-pcd!hpfcso!hpfcmgw!hpfcse!hpuvfpa!ge!bentz
From: bentz@ge.UUCP (Ray Bentz)
Newsgroups: comp.sys.hp
Subject: Evaluator
Message-ID: <60003@ge.UUCP>
Date: 21 Mar 91 20:52:44 GMT
Organization: GE Aerospace - GESD Moorestown, NJ
Lines: 15

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.