[antlr-interest] Tree Evaluation with Logical Operators (AND and OR)

[shmuel siegel]

Priolo, Scott wrote:
> This is what I have so far.  ID is converted to an INT. Variable are
> pulled out of a memory map that is preloaded prior to processing.
>
> I will try | ^(AND|OR expr expr) but it seems like there should be more
> of a recursive nature to "and, or"  operators.
>
>   
This is recursive since expr can itself be an AND or OR subtree.