Polish Notation

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:

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.


(A · B) + ~(C + D) => A B · C D + ~ +

where operators are evaluated in the strict order in which they are encountered, the last operands being used as appropriate. Though parentheses are not needed the order is seen from their inclusion:

((A B ·)((C D + )~) +)

The left to right order also shows the connections between operands and operators (gates) in the digital circuit:

[Prev] [Next]

Last updated 2000/02/11
© J.A.N. Lee, 2000.