© 1975 by British Computer Society
| ||||||||||||||||||||||||||||||||||||||||||||||||||||
A postfix notation for logic circuits


1 Department of Computer Science, University of Bristol, School of Mathematics, University Walk, Bristol, UK,, 2 Department of Mathematics, Statistics and Computing Science, University of Calgary, Calgary, Canada
Reverse Polish (postfix) notation is well known to compiler writers through its relationship to the concepts of the stack and the tree (Randell and Russell, 1969). A development of the ideas of postfix notation is proposed which in principle can be applied to any information structure expressible as a directed graph. In the present paper the developed notation is specialised to the needs of logic circuits. It has already proved itself as a powerful and convenient tool in logic design. Its considerable advantages over the conventional notation of Boolean expressions stem from the immediate one-to-one correspondence between its symbols and the elements of the physical circuit. In addition it has been found most useful for the representation of circuits in computer storage, particularly for programs concerned with automatic circuit design.
Received July 1973.
* Department of Computer Science, University of Bristol, School of Mathematics, University Walk, Bristol BS8 1TW.
Department of Mathematics, Statistics and Computing Science, University of Calgary, Canada.