On Oct 24, 5:53 am, andrea <[EMAIL PROTECTED]> wrote:
> On 26 Set, 20:01, "Aaron \"Castironpi\" Brady" <[EMAIL PROTECTED]>
> wrote:
>
>
>
> > Good idea. If you want prefixed operators: 'and( a, b )' instead of
> > 'a and b', you'll have to write your own. ('operator.and_' is bitwise
> > only.) I
On Oct 24, 5:53 am, andrea <[EMAIL PROTECTED]> wrote:
> On 26 Set, 20:01, "Aaron \"Castironpi\" Brady" <[EMAIL PROTECTED]>
> wrote:
>
>
>
> > Good idea. If you want prefixed operators: 'and( a, b )' instead of
> > 'a and b', you'll have to write your own. ('operator.and_' is bitwise
> > only.) I
On 26 Set, 20:01, "Aaron \"Castironpi\" Brady" <[EMAIL PROTECTED]>
wrote:
>
> Good idea. If you want prefixed operators: 'and( a, b )' instead of
> 'a and b', you'll have to write your own. ('operator.and_' is bitwise
> only.) It may be confusing to mix prefix with infix: 'impl( a and b,
> c )',
On Sep 26, 11:40 am, "Tim Rowe" <[EMAIL PROTECTED]> wrote:
> 2008/9/26 andrea <[EMAIL PROTECTED]>:
>
> > Well I would like to make a little program that given a certain
> > logical expression gives the complete truth table.
>
> > It's not too difficult in fact, I just have some doubts on how to
> >
2008/9/26 andrea <[EMAIL PROTECTED]>:
> Well I would like to make a little program that given a certain
> logical expression gives the complete truth table.
>
> It's not too difficult in fact, I just have some doubts on how to
> design it.
>
> I thought something like that:
>
> class Term:
>
> clas
Well I would like to make a little program that given a certain
logical expression gives the complete truth table.
It's not too difficult in fact, I just have some doubts on how to
design it.
I thought something like that:
class Term:
class Table:
def and(...
def or(...
But I'm not con
