postfix notation

Also found in: Dictionary, Thesaurus, Wikipedia.

postfix notation

[′pōst‚fiks nō′tā·shən]
(computer science)
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.

postfix notation

(Or "Reverse Polish Notation", RPN) One of the possible orderings of functions and operands: in postfix notation the functions are preceded by all their operands. For example, what may normally be written as "1+2" becomes "1 2 +". Postfix notation is well suited for stack based architectures but modern compilers reduced this advantage considerably.

The best-known language with postfix syntax is FORTH. Some Hewlett-Packard calculators use it, e.g. HP-25, HP-29C, HP-41C, HP-23SII.

Compare: infix notation, prefix notation.
This article is provided by FOLDOC - Free Online Dictionary of Computing (

reverse Polish notation

A mathematical expression in which the numbers precede the operation. For example, 2 + 2 would be expressed as 2 2 +, and 10 - 3 * 4 would be 10 3 4 * -. See FORTH.
Copyright © 1981-2019 by The Computer Language Company Inc. All Rights reserved. THIS DEFINITION IS FOR PERSONAL USE ONLY. All other reproduction is strictly prohibited without permission from the publisher.