OnlineWoerterBuecher.de
Internes

Lexikon


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. (2003-06-23)

In addition suitable contents:
[ 2 ] [ = ] [ ad ] [ ag ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ architecture ] [ as ] [ at ] [ b ] [ ba ] [ base ] [ be ] [ by ] [ C ] [ ca ] [ calculator ] [ ch ] [ ck ] [ co ] [ com ] [ compiler ] [ con ] [ cons ] [ cu ] [ de ] [ du ] [ ec ] [ ed ] [ edu ] [ er ] [ era ] [ es ] [ et ] [ fi ] [ file ] [ fix ] [ fo ] [ for ] [ function ] [ ge ] [ gs ] [ gu ] [ h ] [ hat ] [ Hewlett-Packard ] [ hit ] [ HP ] [ hr ] [ id ] [ il ] [ in ] [ infix notation ] [ io ] [ ir ] [ is ] [ it ] [ kn ] [ la ] [ language ] [ lc ] [ Lex ] [ li ] [ ly ] [ ma ] [ mall ] [ mo ] [ mod ] [ mode ] [ module ] [ mp ] [ N ] [ na ] [ nc ] [ ne ] [ nf ] [ ng ] [ no ] [ norm ] [ ns ] [ O ] [ om ] [ op ] [ operand ] [ OR ] [ ordering ] [ pa ] [ pe ] [ ph ] [ pl ] [ post ] [ postfix syntax ] [ pr ] [ prefix ] [ prefix notation ] [ query ] [ rc ] [ re ] [ Reverse Polish Notation ] [ RPN ] [ S ] [ se ] [ sh ] [ SI ] [ si ] [ st ] [ stack ] [ su ] [ suit ] [ sy ] [ syntax ] [ T ] [ tag ] [ tf ] [ th ] [ to ] [ tt ] [ ua ] [ us ] [ va ] [ ve ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (4786 Reads)

All logos and trademarks in this site are property of their respective owner.

Page Generation in 0.0949 Seconds, with 17 Database-Queries
Zurück zur Startseite