Paul Sandoz <[EMAIL PROTECTED]> writes:
> 
>       I think i have got it:
>       
>       It is possible to extend expression types to include
>       an N peer boolean expression that contains a list of
>       expressions and applies the same operator to each.
>       
>       Like a 'flatened' part of a binary tree:
>       'if (a | b | c | d)' instead of 'if (a | (b | (c | d)))'
> 
>       (There are probably logical precedence rules to automatically
>       work out this sort of thing from a binary tree and group
>       leaf nodes. I bet its a one liner is lisp!).

Heh.  Yup.  :-)

>       Attached is some idl, does this 'express' a boolean
>       expression model for the GUI use cases you and
>       Matthew have 'expressed'?

Nice work!

Dan
-- 

Reply via email to