A more convenient representation of Boolean expressions that would translate DIRECTLY into a digital circuit would be one in which the operands (inputs) preceded the operation:

- A · B => A B ·
- A + B => A B +
- ~B => B ~

This notation is called "Polish Notation" and has the advantage of never needing a hierarchy or parentheses to determine the order of evaluation of operators.

Thus

Last updated 2000/02/11

© J.A.N. Lee, 2000.