How to simplifying boolean algebra expression?

[Regardt]

Hi all

I need do the following based on Boolean Algebra
ex 1. (M271/M272/M651)+(450/965)/M642/M646

All possible result
M271 + 450
M271 + 965
M272 + 450
M272 + 965
M651 + 450
M651 + 965
M642
M646

ex 2 M271/M646+M006/M651+M013
M271 + M006 + M013
M646 + M006 + M013
M271 + M651 + M013
M646 + M651 + M013

Do somebody no where I can find a code library or code to help
me to break up any Boolean Algebra expression into all possible result

Thanks in advance

PS. I also have more complex expression

[Andrew Morton]

Regardt wrote:

I need do the following based on Boolean Algebra
ex 1. (M271/M272/M651)+(450/965)/M642/M646

All possible result <snip> Do somebody no where I can find a code library or code to help
me to break up any Boolean Algebra expression into all possible result

What are the rules for breaking it up?
Commutativity/associativity/precedence of operators?

Andrew

[Regardt]

Thanks for the reply

The basic rules is as follows

/ (=OR),
+ (=AND),
- (=NOT)

The BRACKET is evaluated first, as is also the case in mathematics.
The AND is always evaluated before the OR.
The NOT is shown by the '-' sign which always refers directly to the
code or bracketed expression that it precedes.

There are big variety of different rules depending on the complexity of
the expression

[tommaso.gastaldi]

As said, I believe the best thing is to use the underlying VB (or
whatever .net language)
compiler (in case, overloading operators, if you want to change the
syntactical look):

(see for instance:
http://www.developer.com/net/vb/article.php/3512311)

You could embark yourself in the construction of a parser, but unless
you do it for personal research, I wouldn't advise you to that way: you
would be reinventing a *difficult* wheel...

....anyway if you do it just for fun and to learn, it can be a very good
and instructive experience...

-tom

Regardt ha scritto:

Thanks for the reply

The basic rules is as follows

/ (=OR),
+ (=AND),
- (=NOT)

The BRACKET is evaluated first, as is also the case in mathematics.
The AND is always evaluated before the OR.
The NOT is shown by the '-' sign which always refers directly to the
code or bracketed expression that it precedes.

There are big variety of different rules depending on the complexity of
the expression