Board index » delphi » Looking for Expresion Tree/Binary Tree algorythms

Looking for Expresion Tree/Binary Tree algorythms

Help,

I'm looking for a class to help me create an expression tree to handle
nested
comparisons.  In other words, I need to evaluate statements formated as
follows...
(A <B AND C >D) OR B=F.  

Any suggestions or help on source code I would appreciate it.

RM

 

Re:Looking for Expresion Tree/Binary Tree algorythms


Hi,

Our HyperTerp Script Language VCL can handle these (and other kinds
of) expressions.

You can get more information at http:.//www.hyperact.com/

Ron.

On 14 May 1997 18:14:12 GMT, randym...@aol.com (RandyMich) wrote:

Quote
>Help,

>I'm looking for a class to help me create an expression tree to handle
>nested
>comparisons.  In other words, I need to evaluate statements formated as
>follows...
>(A <B AND C >D) OR B=F.  

>Any suggestions or help on source code I would appreciate it.

>RM

Other Threads