Bill,

Yes, VFP as it parses the logical expression understands the overall structure of operators (NOTs, ANDs and ORs) and operands (memvars, fields, object properties and function calls). Expressions like these are typically put into a binary tree for evaluation, the optimizer can eliminate whole subtrees quite easily if it knows they can't affect the overall value of the expression.

>Agreed with your statement. However what Jim said about VFP having to evaluate the operator type ( i.e. AND, OR, etc. ) is required to determine whether the expression result must be evaluated, correct?