Jump to content

Reverse Polish notation: Difference between revisions

From Wikipedia, the free encyclopedia
Browse history interactively
← Previous editNext edit →
Content deleted Content added
VisualWikitext
+refs
Line 39: Line 39:
Other early computers to implement architectures enabling reverse Polish notation were the [[English Electric Company]]'s [[English Electric KDF9|KDF9]] machine, which was announced in 1960 and commercially available in 1963,<ref name="Beard_1997"/> and the [[Burroughs B5000]], announced in 1961 and also delivered in 1963:
Other early computers to implement architectures enabling reverse Polish notation were the [[English Electric Company]]'s [[English Electric KDF9|KDF9]] machine, which was announced in 1960 and commercially available in 1963,<ref name="Beard_1997"/> and the [[Burroughs B5000]], announced in 1961 and also delivered in 1963:


Presumably, the KDF9 designers drew ideas from Hamblin's [[GEORGE (autocode system)|GEORGE]] (General Order Generator),<ref name="Hamblin_1957_1"/><ref name="Hamblin_1957_2"/><ref name="Hamblin_1958"/> an [[autocode]] programming system written for a [[English Electric DEUCE|DEUCE]] computer installed at the [[University of Sydney]], Australia, in 1957.<ref name="Hamblin_1957_1"/><ref name="Hamblin_1957_2"/><ref name="Hamblin_1958"/><ref name="Beard_1997"/>
Presumably, the KDF9 designers drew ideas from Hamblin's [[GEORGE (autocode system)|GEORGE]] (General Order Generator),<ref name="Hamblin_1957_1"/><ref name="Hamblin_1957_2"/><ref name="Hamblin_1958"/><ref name="Duncan_1977"/><ref name="Allen_1985"/><ref name="LaForest_2007"/> an [[autocode]] programming system written for a [[English Electric DEUCE|DEUCE]] computer installed at the [[University of Sydney]], Australia, in 1957.<ref name="Hamblin_1957_1"/><ref name="Hamblin_1957_2"/><ref name="Hamblin_1958"/><ref name="Beard_1997"/>


One of the designers of the B5000, [[Robert S. Barton]], later wrote that he developed reverse Polish notation independently of Hamblin sometime in 1958 after reading a 1954 textbook on symbolic logic by [[Irving Copi]],<ref name="NewApproach"/><ref name="B5000_1985"/><ref name="Galler-Rosin_1985"/> where he found a reference to Polish notation,<ref name="Galler-Rosin_1985"/> which made him read the works of Jan Łukasiewicz as well,<ref name="Galler-Rosin_1985"/> and before he was aware of Hamblin's work.
One of the designers of the B5000, [[Robert S. Barton]], later wrote that he developed reverse Polish notation independently of Hamblin sometime in 1958 after reading a 1954 textbook on symbolic logic by [[Irving Copi]],<ref name="NewApproach"/><ref name="B5000_1985"/><ref name="Galler-Rosin_1985"/> where he found a reference to Polish notation,<ref name="Galler-Rosin_1985"/> which made him read the works of Jan Łukasiewicz as well,<ref name="Galler-Rosin_1985"/> and before he was aware of Hamblin's work.
Line 218: Line 218:
<ref name="Dietrich_2019">{{cite journal |author-last=Dietrich |author-first=Johannes W. |title=TRURL RPN Engine |journal=Zenodo |date=2019-07-24 |doi=10.5281/zenodo.3257689 |url=https://zenodo.org/record/3350851 |access-date=2022-07-02}}</ref>
<ref name="Dietrich_2019">{{cite journal |author-last=Dietrich |author-first=Johannes W. |title=TRURL RPN Engine |journal=Zenodo |date=2019-07-24 |doi=10.5281/zenodo.3257689 |url=https://zenodo.org/record/3350851 |access-date=2022-07-02}}</ref>
<ref name="Blaauw-Brooks_1997">{{cite book |title=Computer architecture: Concepts and evolution |author-first1=Gerrit Anne |author-last1=Blaauw |author-link1=Gerrit Anne Blaauw |author-first2=Frederick Phillips |author-last2=Brooks, Jr. |author-link2=Frederick Phillips Brooks |publisher=[[Addison-Wesley Longman Publishing Co., Inc.]] |publication-place=Boston, Massachusetts, USA |date=1997}}</ref>
<ref name="Blaauw-Brooks_1997">{{cite book |title=Computer architecture: Concepts and evolution |author-first1=Gerrit Anne |author-last1=Blaauw |author-link1=Gerrit Anne Blaauw |author-first2=Frederick Phillips |author-last2=Brooks, Jr. |author-link2=Frederick Phillips Brooks |publisher=[[Addison-Wesley Longman Publishing Co., Inc.]] |publication-place=Boston, Massachusetts, USA |date=1997}}</ref>
<ref name="Duncan_1977">Fraser George Duncan, Stack machine development: Australia, great britain, and europe, Computer 10 (1977), no. 5, 50–52</ref>
<ref name="Allen_1985">Murray W. Allen, Charles Hamblin (1922–1985), Aust. Comput. J. 17 (1985), no. 4, 194–195</ref>
<ref name="LaForest_2007">{{cite book |title=Second-Generation Stack Computer Architecture |chapter=2.1 Lukasiewicz and the First Generation: 2.1.2 Germany: Konrad Zuse (1910–1995); 2.2 The First Generation of Stack Computers: 2.2.1 Zuse Z4 |author-first=Charles Eric |author-last=LaForest |type=thesis |publisher=[[University of Waterloo]] |location=Waterloo, Canada |date=April 2007 |pages=8, 11 |url=http://fpgacpu.ca/publications/Second-Generation_Stack_Computer_Architecture.pdf |access-date=2022-07-02 |url-status=live |archive-url=https://web.archive.org/web/20220120155616/http://fpgacpu.ca/publications/Second-Generation_Stack_Computer_Architecture.pdf |archive-date=2022-01-20}} (178 pages)</ref>
<ref name="LaForest_2007">{{cite book |title=Second-Generation Stack Computer Architecture |chapter=2.1 Lukasiewicz and the First Generation: 2.1.2 Germany: Konrad Zuse (1910–1995); 2.2 The First Generation of Stack Computers: 2.2.1 Zuse Z4 |author-first=Charles Eric |author-last=LaForest |type=thesis |publisher=[[University of Waterloo]] |location=Waterloo, Canada |date=April 2007 |pages=8, 11 |url=http://fpgacpu.ca/publications/Second-Generation_Stack_Computer_Architecture.pdf |access-date=2022-07-02 |url-status=live |archive-url=https://web.archive.org/web/20220120155616/http://fpgacpu.ca/publications/Second-Generation_Stack_Computer_Architecture.pdf |archive-date=2022-01-20}} (178 pages)</ref>
<ref name="Rojas_1997">{{cite journal |title=Konrad Zuse's Legacy: The Architecture of the Z1 and Z3 |author-last=Rojas |author-first=Raúl |author-link=Raúl Rojas |journal=[[IEEE Annals of the History of Computing]] |volume=19 |number=2 |date=April–June 1997 |pages=5–16 [7–8] |doi=10.1109/85.586067 |url=http://ed-thelen.org/comp-hist/Zuse_Z1_and_Z3.pdf |access-date=2022-07-03 |url-status=live |archive-url=https://web.archive.org/web/20220703082408/http://ed-thelen.org/comp-hist/Zuse_Z1_and_Z3.pdf |archive-date=2022-07-03}} (12 pages)</ref>
<ref name="Rojas_1997">{{cite journal |title=Konrad Zuse's Legacy: The Architecture of the Z1 and Z3 |author-last=Rojas |author-first=Raúl |author-link=Raúl Rojas |journal=[[IEEE Annals of the History of Computing]] |volume=19 |number=2 |date=April–June 1997 |pages=5–16 [7–8] |doi=10.1109/85.586067 |url=http://ed-thelen.org/comp-hist/Zuse_Z1_and_Z3.pdf |access-date=2022-07-03 |url-status=live |archive-url=https://web.archive.org/web/20220703082408/http://ed-thelen.org/comp-hist/Zuse_Z1_and_Z3.pdf |archive-date=2022-07-03}} (12 pages)</ref>

Revision as of 09:51, 15 October 2023

"Operational stack" redirects here. For the English Channel lorry parking procedure, see Operation Stack.

Infix notation

Reverse Polish notation (RPN), also known as reverse Łukasiewicz notation, Polish postfix notation or simply postfix notation, is a mathematical notation in which operators follow their operands, in contrast to prefix or Polish notation (PN), in which operators precede their operands. The notation does not need any parentheses for as long as each operator has a fixed number of operands.

The term postfix notation describes the general scheme in mathematics and computer sciences, whereas the term reverse Polish notation typically refers specifically to the method used to enter calculations into hardware or software calculators, which often have additional side effects and implications depending on the actual implementation involving a stack. The description "Polish" refers to the nationality of logician Jan Łukasiewicz,[1][2] who invented Polish notation in 1924.[3][4][5][6]

The first computer to use postfix notation, though it long remained essentially unknown outside of Germany, was Konrad Zuse's Z3 in 1941[7][8][9][10][11][12][13][14][15][excessive citations] as well as his Z4 in 1945. The reverse Polish scheme was again proposed in 1954 by Arthur Burks, Don Warren, and Jesse Wright[16] and was independently reinvented by Friedrich L. Bauer and Edsger W. Dijkstra in the early 1960s to reduce computer memory access and use the stack to evaluate expressions. The algorithms and notation for this scheme were extended by the Australian philosopher and computer scientist Charles L. Hamblin in the mid-1950s.[17][18][19][20][21][22]

During the 1970s and 1980s, Hewlett-Packard used RPN in all of their desktop and hand-held calculators, and has continued to use it in some models into the 2020s.[23][24] In computer science, reverse Polish notation is used in stack-oriented programming languages such as Forth, dc, STOIC, PostScript, RPL, and Joy.

Explanation

In reverse Polish notation, the operators follow their operands. For example, to add 3 and 4 together, the expression is 3 4 + rather than 3 + 4. The expression 3 − 4 + 5 in conventional notation is 3 4 − 5 + in reverse Polish notation: 4 is first subtracted from 3, then 5 is added to it.

The concept of a stack, a last-in/first-out construct, is integral to the left-to-right evaluation of RPN. In the example 3 4 −, first the 3 is put onto the stack, then the 4; the 4 is now on top and the 3 below it. The subtraction operator removes the top two items from the stack, performs 3 − 4, and puts the result of −1 onto the stack.

The common terminology is that added items are pushed on the stack and removed items are popped.

The advantage of reverse Polish notation is that it removes the need for order of operations and parentheses that are required by infix notation and can be evaluated linearly, left-to-right. For example, the infix expression (3 × 4) + (5 × 6) becomes 3 4 × 5 6 × + in reverse Polish notation.

Practical implications

Reverse Polish notation has been compared to how one had to work through problems with a slide rule.[25]

In comparison testing of reverse Polish notation with algebraic notation, reverse Polish has been found to lead to faster calculations, for two reasons. The first reason is that reverse Polish calculators do not need expressions to be parenthesized, so fewer operations need to be entered to perform typical calculations. Additionally, users of reverse Polish calculators made fewer mistakes than for other types of calculators.[26][27] Later research clarified that the increased speed from reverse Polish notation may be attributed to the smaller number of keystrokes needed to enter this notation, rather than to a smaller cognitive load on its users.[28] However, anecdotal evidence suggests that reverse Polish notation is more difficult for users who previously learned algebraic notation.[27]

Converting from infix notation

Main article: Shunting-yard algorithm

Edsger W. Dijkstra invented the shunting-yard algorithm to convert infix expressions to postfix expressions (reverse Polish notation), so named because its operation resembles that of a railroad shunting yard.

There are other ways of producing postfix expressions from infix expressions. Most operator-precedence parsers can be modified to produce postfix expressions; in particular, once an abstract syntax tree has been constructed, the corresponding postfix expression is given by a simple post-order traversal of that tree.

Implementations

Hardware calculators

Early history

The first computer implementing a form of reverse Polish notation (but without the name and also without a stack), was Konrad Zuse's Z3, which he started to construct in 1938 and demonstrated publicly on 12 May 1941.[29][11][30][13] In dialog mode, it allowed operators to enter two operands followed by the desired operation.[7][8][9][10][11][12][13][14][15] It was destroyed on 21 December 1943 in a bombing raid.[11] With Zuse's help a first replica was built in 1961.[11] The 1945 Z4 also added a 2-level stack.[31][32]

Other early computers to implement architectures enabling reverse Polish notation were the English Electric Company's KDF9 machine, which was announced in 1960 and commercially available in 1963,[33] and the Burroughs B5000, announced in 1961 and also delivered in 1963:

Presumably, the KDF9 designers drew ideas from Hamblin's GEORGE (General Order Generator),[17][18][20][34][35][32] an autocode programming system written for a DEUCE computer installed at the University of Sydney, Australia, in 1957.[17][18][20][33]

One of the designers of the B5000, Robert S. Barton, later wrote that he developed reverse Polish notation independently of Hamblin sometime in 1958 after reading a 1954 textbook on symbolic logic by Irving Copi,[36][37][38] where he found a reference to Polish notation,[38] which made him read the works of Jan Łukasiewicz as well,[38] and before he was aware of Hamblin's work.

Friden introduced reverse Polish notation to the desktop calculator market with the EC-130, designed by Robert "Bob" Appleby Ragen,[39] supporting a four-level stack[5] in June 1963.[40] The successor EC-132 added a square root function in April 1965.[41] Around 1966, the Monroe Epic calculator supported an unnamed input scheme resembling RPN as well.[5]

Hewlett-Packard

Main article: HP calculators
A promotional Hewlett-Packard "No Equals" hat from the 1980s – both a boast and a reference to RPN

Hewlett-Packard engineers designed the 9100A Desktop Calculator in 1968 with reverse Polish notation[23] with only three stack levels with working registers X ("keyboard"), Y ("accumulate") and visible storage register Z ("temporary"),[42][43] a reverse Polish notation variant later referred to as three-level RPN.[44] This calculator popularized reverse Polish notation among the scientific and engineering communities. The HP-35, the world's first handheld scientific calculator,[23] introduced the classical four-level RPN with its specific ruleset of the so-called operational (memory) stack[45][nb 1] (later also called automatic memory stack[46][47][nb 1]) in 1972.[48] In this scheme, the Enter ↑ key duplicates values into Y under certain conditions (automatic stack lift with temporary stack lift disable), and the top register T ("top") gets duplicated on drops (top copy on pop aka top stack level repetition) in order to ease some calculations and to save keystrokes.[47] HP used reverse Polish notation on every handheld calculator it sold, whether scientific, financial, or programmable, until it introduced the HP-10 adding machine calculator in 1977. By this time, HP was the leading manufacturer of calculators for professionals, including engineers and accountants.

Later calculators with LCDs in the early 1980s, such as the HP-10C, HP-11C, HP-15C, HP-16C, and the financial HP-12C calculator also used reverse Polish notation. In 1988, Hewlett-Packard introduced a business calculator, the HP-19B, without reverse Polish notation, but its 1990 successor, the HP-19BII, gave users the option of using algebraic or reverse Polish notation again.

In 1986,[49][50] HP introduced RPL, an object-oriented successor to reverse Polish notation. It deviates from classical reverse Polish notation by using a dynamic stack only limited by the amount of available memory (instead of three or four fixed levels) and which could hold all kinds of data objects (including symbols, strings, lists, matrices, graphics, programs, etc.) instead of just numbers. The system would display an error message when running out of memory instead of just dropping values off the stack on overflow as with fixed-sized stacks.[51] It also changed the behaviour of the stack to no longer duplicate the top register on drops (since in an unlimited stack there is no longer a top register) and the behaviour of the Enter ↑ key so that it no longer duplicated values into Y, which had shown to sometimes cause confusion among users not familiar with the specific properties of the automatic memory stack. From 1990 to 2003, HP manufactured the HP-48 series of graphing RPL calculators, followed by the HP-49 series between 1999 and 2008. The last RPL calculator was named HP 50g, introduced in 2006 and discontinued in 2015. However, there are several community efforts like newRPL or DB48X to recreate RPL on modern calculators.

As of 2011, Hewlett-Packard was offering the calculator models 12C, 12C Platinum, 17bII+, 20b, 30b, 33s, 35s, 48gII (RPL) and 50g (RPL) which support reverse Polish notation.[52]

While calculators emulating classical models continued to support classical reverse Polish notation, new reverse Polish notation models feature a variant of reverse Polish notation, where the Enter ↑ key behaves as in RPL. This latter variant is sometimes known as entry RPN.[53]

In 2013, the HP Prime introduced a 128-level form of entry RPN called advanced RPN. In contrast to RPL with its dynamic stack, it just drops values off the stack on overflow like other fixed-sized stacks do.[51] However, like RPL, it does not emulate the behaviour of a classical operational RPN stack to duplicate the top register on drops.

In late 2017, the list of active models supporting reverse Polish notation included only the 12C, 12C Platinum, 17bii+, 35s, and Prime. On 1 November 2021, Moravia Consulting spol. s r.o.[54] (for all markets but the Americas) and Royal Consumer Information Products, Inc.[55] (for the Americas) became the licensees of HP Development Company, L.P. to continue the development, production, distribution, marketing and support of HP-branded calculators. By July 2023, only the 12C, 12C Platinum, the freshly released HP 15C Collector's Edition, and the Prime remain active models supporting RPN.

See also: HP-related community-developed calculators

Sinclair Radionics

In Britain, Clive Sinclair's Sinclair Scientific (1974) and Scientific Programmable (1975) models used reverse Polish notation.[56][57]

Commodore

In 1974, Commodore produced the Minuteman *6 (MM6) without an enter  key and the Minuteman *6X (MM6X) with an enter  key, both implementing a form of two-level RPN. The SR4921 RPN came with a variant of four-level RPN with stack levels named X, Y, Z, and W (rather than T) and an Ent key (for "entry"). In contrast to Hewlett-Packard's reverse Polish notation implementation, W filled with 0 instead of its contents being duplicated on stack drops.[58]

Prinztronic

Prinz and Prinztronic were own-brand trade names of the British Dixons photographic and electronic goods stores retail chain, later rebranded as Currys Digital stores, and became part of DSG International. A variety of calculator models was sold in the 1970s under the Prinztronic brand, all made for them by other companies.

Among these was the PROGRAM[59] Programmable Scientific Calculator which featured reverse Polish notation.

Heathkit

The Aircraft Navigation Computer Heathkit OC-1401/OCW-1401 used five-level RPN in 1978.

Soviet Union

Soviet programmable calculators (MK-52, MK-61, B3-34 and earlier B3-21[60] models) used reverse Polish notation for both automatic mode and programming. Modern Russian calculators MK-161[61] and MK-152,[62] designed and manufactured in Novosibirsk since 2007 and offered by Semico,[63] are backwards compatible with them. Their extended architecture is also based on reverse Polish notation.

Others

Community-developed hardware-based calculators

See also: Hewlett-Packard RPN calculators

An eight-level stack was suggested by John A. Ball in 1978.[5]

The community-developed calculators WP 34S (2011), WP 31S (2014) and WP 34C (2015), which are based on the HP 20b/HP 30b hardware platform, support classical Hewlett-Packard-style reverse Polish notation supporting automatic stack lift behaviour of the Enter ↑ key and top register copies on pops, but switchable between a four- and an eight-level operational stack.

In addition to the optional support for an eight-level stack, the newer SwissMicros DM42-based WP 43S as well as the WP 43C (2019) / C43 (2022) / C47 (2023) derivatives support data types for stack objects (real numbers, infinite integers, finite integers, complex numbers, strings, matrices, dates and times). The latter three variants can also be switched between classical and entry RPN behaviour of the Enter ↑ key, a feature often requested by the community.[67] They also support a rarely seen significant figures mode, which had already been available as a compile-time option for the WP 34S and WP 31S.[68][69]

Since 2021, the HP-42S simulator Free42 version 3 can be enabled to support a dynamic RPN stack only limited by the amount of available memory instead of the classical 4-level stack. This feature was incorporated as a selectable function into the DM42 since firmware DMCP-3.21 / DM42-3.18.[70][71]

Software calculators

Software calculators:

  • Mac OS X Calculator
  • Several Apple iPhone applications e.g. "reverse polish notation calculator"
  • Several Android applications e.g. "RealCalc"
  • Several Windows 10 Mobile applications e.g. "RPN9"
  • Unix system calculator program dc
  • Emacs lisp library package calc
  • Xorg calculator (xcalc)
  • ARPCalc, a powerful scientific/engineering RPN calculator for Windows, Linux and Android that also has a web-browser based version
  • grpn[72] scientific/engineering calculator using the GIMP Toolkit (GTK+)
  • F-Correlatives in MultiValue dictionary items
  • RRDtool, a widely used tabulating and graphing software
  • grdmath, a program for algebraic operations on NetCDF grids, part of Generic Mapping Tools (GMT) suite
  • galculator,[73] a GTK desktop calculator
  • Mouseless Stack-Calculator[74] scientific/engineering calculator including complex numbers
  • rpCalc, a simple reverse polish notation calculator written in Python for Linux and MS Windows and published under the GNU GPLv2 license
  • orpie, RPN calculator for the terminal for real or complex numbers or matrices
  • Qalculate!, a powerful and versatile cross-platform desktop calculator

Programming languages

Existing implementations using reverse Polish notation include:

See also

Notes

  1. ^ a b Hewlett-Packard called their special RPN stack implementation an operational (memory) stack or automatic memory stack. Interestingly, Klaus Samelson and Friedrich L. Bauer, the inventors of the stack principle, called their stack Operationskeller (Engl. "operational cellar") in 1955, and parallel discoverer Wilhelm Kämmerer [de] called his stack concept Automatisches Gedächtnis (Engl. "automatic memory") in 1958.

References

  1. ^ Łukasiewicz, Jan (1951). "Chapter IV. Aristotle's System in Symbolic Form (section on "Explanation of the Symbolism")". Aristotle's Syllogistic from the Standpoint of Modern Formal Logic (1 ed.). p. 78.
  2. ^ Łukasiewicz, Jan (1957). Aristotle's Syllogistic from the Standpoint of Modern Formal Logic (2 ed.). Oxford University Press. (Reprinted by Garland Publishing in 1987 ISBN 0-8240-6924-2.)
  3. ^ Łukasiewicz, Jan (February 1929). Elementy logiki matematycznej (in Polish) (1 ed.). Warsaw, Poland: Państwowe Wydawnictwo Naukowe; Łukasiewicz, Jan (1963). Elements of mathematical logic. Translated by Wojtasiewicz, Olgierd Adrian [in Polish]. New York, USA: The MacMillan Company. p. 24.
  4. ^ Hamblin, Charles Leonard (1962-11-01). "Translation to and from Polish notation" (PDF). Computer Journal. 5 (3): 210–213. doi:10.1093/comjnl/5.3.210. Archived from the original (PDF) on 2022-10-20. (4 pages)
  5. ^ a b c d Ball, John A. (1978). Algorithms for RPN calculators (1 ed.). Cambridge, Massachusetts, USA: Wiley-Interscience, John Wiley & Sons, Inc. ISBN 0-471-03070-8. LCCN 77-14977. p. 2: […] In their advertisements and also in a letter to me, Hewlett-Packard Company (HP), the best known manufacturer of RPN calculators, says that RPN is based on a suggestion by Jan Łukasiewicz (1878–1956), and that RPN was invented and is patented by HP. Aside from the apparent contradiction in these two statements, I do not think that either of them is quite true. My first experience with RPN involved a nice old Friden EC-130 desktop electronic calculator, circa 1964. The EC-130 has RPN with a push-down stack of four registers, all visible simultaneously on a cathode ray tube display. Furthermore, they are shown upside down, that is, the last-in-first-out register is at the bottom. […] Around 1966, the Monroe Epic calculator offered RPN with a stack of four, a printer, and either 14 or 42 step programmability. The instruction booklets with these two calculators make no mention of RPN or Jan Łukasiewicz. […]
  6. ^ Kennedy, John (August 1982). "RPN Perspective". PPC Calculator Journal. 9 (5). Mathematics Department, Santa Monica College, Santa Monica, California, USA: 26–29. CiteSeerX 10.1.1.90.6448. Archived from the original on 2022-07-01. Retrieved 2022-07-02. (12 pages)
  7. ^ a b Ceruzzi, Paul E. (April 1980). "1941 RPN Computer?". PPC Calculator Journal. 7 (3): 25. Archived from the original on 2022-07-01. Retrieved 2022-07-01. p. 25: The interesting aspect of the programming of the Z-3 was that this code was very similar to that of, say, an HP-25. To perform an operation on two numbers, commands would first be given to recall the numbers from appropriate locations in the memory, followed by the command for the operation. Numbers were automatically positioned in registers in the Arithmetic Unit of the machine so that operations like division and subtraction would proceed in the right order. Results were left in a register in the AU so that long sequences of operations could be carried out. Thus, the Z-3 used a version of RPN that was nearly identical to that used by HP! I have obtained copies of early programs that Zuse had written for the evaluation of a 5 × 5 determinant, and it is possible to run these programs on an HP-41C with almost no modification whatsoever (once the numbers have been placed in the storage registers beforehand). The AU of the Z-3 contained 3 registers, although Zuse never referred to them as a stack, of course. These registers were labelled "f", "a", and "b". All entrance and exit to and from the AU was through the "f" register. This is sort of like the display register of the 41C, which is distinct from the stack. Arithmetic operations were performed on numbers in the a and b registers, so these may be thought of as corresponding to the x and y registers of HP's. Unlike modern computer practice, the actual numbers themselves were moved around the registers, not just a pointer.
  8. ^ a b Ceruzzi, Paul E. (1983). "2. Computers in Germany". Reckoners - The prehistory of the digital computer, from relays to the stored program concept, 1935–1945. Contributions to the study of computer science. Vol. 1 (1 ed.). Westport, Connecticut, USA: Greenwood Press, Congressional Information Service, Inc. p. 0010. ISBN 0-313-23382-9. ISSN 0734-757X. LCCN 82-20980. Archived from the original on 2022-07-01. Retrieved 2022-07-02.
  9. ^ a b Rojas, Raúl (April–June 1997). "Konrad Zuse's Legacy: The Architecture of the Z1 and Z3" (PDF). IEEE Annals of the History of Computing. 19 (2): 5–16 [7–8]. doi:10.1109/85.586067. Archived (PDF) from the original on 2022-07-03. Retrieved 2022-07-03. (12 pages)
  10. ^ a b Zuse, Horst. "2. Dialogfähigkeit der Maschine Z3". Written at Berlin, Germany. In Cremers, Armin B.; Manthey, Rainer; Martini, Peter; Steinhage, Volker (eds.). Die ergonomischen Erfindungen der Zuse-Maschinen (PDF). INFORMATIK 2005 Informatik LIVE! Band 1, Beiträge der 35. Jahrestagung der Gesellschaft für Informatik e.V. (GI), 19. bis 22. September 2005 in Bonn. Lecture Notes in Informatics (in German). Bonn, Germany: Gesellschaft für Informatik (GI). pp. 200–204 [200–201]. Archived (PDF) from the original on 2022-07-01. Retrieved 2022-07-02. p. 201: Dazu stehen die beiden Register R1 und R2 als Kurzspeicher für die Operanden der arithmetischen Operationen zur Verfügung. Gerechnet wird in der umgekehrten polnischen Notation, wie z.B. beim Taschenrechner HP 45 (1972) oder HP11 (1998). (5 pages)
  11. ^ a b c d e Zuse, Horst, ed. (2008-02-22). "Z3 im Detail" [Z3 in details]. Professor Dr.-Ing. habil. Horst Zuse (in German). Archived from the original on 2022-07-01. Retrieved 2022-07-01. Die Z3 konnte in zwei Betriebsmodi betrieben werden, und zwar in dem Programm- und Dialogmodus. Das Rechnen im Dialog erfolgt wie mit einem Taschenrechner in der umgekehrten polnischen Notation. [1]
  12. ^ a b Bonten, Jo H. M. (2009-05-28) [2009-03-08]. "Fast Calculators: Konrad Zuse's Z1 and Z3". Geldrop, Netherlands. Archived from the original on 2022-07-01. Retrieved 2022-07-02. The computer can be used as a simple hand-held calculator. In this mode besides entering the numeric values the user must enter the instructions and the addresses by pressing their keys. He has to enter the numbers and operators in the reverse Polish notation.
  13. ^ a b c Bundesmann, Jan (June 2016). "Zum 75. Geburtstag von Konrad Zuses Z3: Ratterkasten". Report / Jubiläum. iX (in German). Vol. 2016, no. 6. Heise Verlag. p. 94. Archived from the original on 2022-07-01. Retrieved 2022-07-01. p. 94: Zum Eingeben der Zahlen stand eine Tastatur bereit (Dezimalzahlen, Gleitkommadarstellung). Anweisungen gaben Nutzer in umgekehrter polnischer Notation: zuerst die Argumente, um Register zu befüllen, dann der auszuführende Operator.
  14. ^ a b "Die Computerwelt von Konrad Zuse - Auf den Spuren eines EDV-Genies" (PDF). Die Welt der technischen Museen. Welt der Fertigung [de] (in German). Vol. 2018, no. 2. 2018. pp. 32–35. ISSN 2194-9239. Archived (PDF) from the original on 2019-10-17. Retrieved 2022-07-02. pp. 32–33: Er hat wohl auch als erster die vom polnischen Mathematiker Jan Lukasiewicz entwickelte ›polnische Notation‹ weiterentwickelt und daraus die ›umgekehrte polnische Notation‹ (UPN) ersonnen, da diese in seinen Rechnern verwendet wird: zunächst werden die Werte eingegeben, danach die gewünschte Rechenoperation ausgelöst. Klammern werden auf diese Weise vermieden. (4 pages)
  15. ^ a b Tremmel, Sylvester (2021-11-21). "Computergeschichte: Zuse Z3 "im Test"". c't magazin. Heise Verlag. Archived from the original on 2022-03-01. Retrieved 2022-07-01. Über die I/O-Einheit kann man die Z3 als reine Rechenmaschine einsetzen, Operationen nimmt sie dann in der praktischen – wenn auch gewöhnungsbedürftigen – umgekehrten polnischen Notation entgegen. Werte im Speicher ablegen (oder von dort laden) kann man so allerdings nicht.
  16. ^ Burks, Arthur Walter; Warren, Don W.; Wright, Jesse B. (1954). "An Analysis of a Logical Machine Using Parenthesis-Free Notation". Mathematical Tables and Other Aids to Computation. 8 (46): 53–57. doi:10.2307/2001990. JSTOR 2001990.
  17. ^ a b c Hamblin, Charles Leonard (May 1957). An Addressless Coding Scheme based on Mathematical Notation (Typescript). New South Wales University of Technology.
  18. ^ a b c Hamblin, Charles Leonard (June 1957). "An addressless coding scheme based on mathematical notation". Proceedings of the First Australian Conference on Computing and Data Processing. Salisbury, South Australia: Weapons Research Establishment.
  19. ^ Hamblin, Charles Leonard (1957). "Computer Languages". The Australian Journal of Science (20?): 135–139; Hamblin, Charles Leonard (November 1985). "Computer Languages". The Australian Computer Journal (Reprint). 17 (4): 195–198.
  20. ^ a b c Hamblin, Charles Leonard (1958). GEORGE IA and II: A semi-translation programming scheme for DEUCE: Programming and Operation Manual (PDF). School of Humanities, University of New South Wales, Kensington, New South Wales. Archived (PDF) from the original on 2020-04-04. Retrieved 2020-07-27.
  21. ^ McBurney, Peter (2008-12-06). "Charles L. Hamblin and his work". Archived from the original on 2008-12-06.
  22. ^ McBurney, Peter (2008-07-27). "Charles L. Hamblin: Computer Pioneer". Archived from the original on 2008-12-07. […] Hamblin soon became aware of the problems of (a) computing mathematical formulae containing brackets, and (b) the memory overhead in having dealing with memory stores each of which had its own name. One solution to the first problem was Jan Łukasiewicz's Polish notation, which enables a writer of mathematical notation to instruct a reader the order in which to execute the operations (e.g. addition, multiplication, etc) without using brackets. Polish notation achieves this by having an operator (+, ×, etc) precede the operands to which it applies, e.g., +ab, instead of the usual, a+b. Hamblin, with his training in formal logic, knew of Lukasiewicz's work. […]
  23. ^ a b c Osborne, Thomas E. (2010) [1994]. "Tom Osborne's Story in His Own Words". Steve Leibson. Archived from the original on 2022-04-04. Retrieved 2016-01-01. […] I changed the architecture to use RPN (Reverse Polish Notation), which is the ideal notation for programming environment in which coding efficiency is critical. In the beginning, that change was not well received... […]
  24. ^ Peterson, Kristina (2011-05-04). "Wall Street's Cult Calculator Turns 30". The Wall Street Journal. Archived from the original on 2015-03-16. Retrieved 2015-12-06.
  25. ^ Williams, Al (2023-06-21). "In Praise Of RPN (with Python Or C)". Hackaday. Archived from the original on 2023-09-23. Retrieved 2023-09-23.
  26. ^ Kasprzyk, Dennis Michael; Drury, Colin G.; Bialas, Wayne F. (1979) [1978-09-25]. "Human behaviour and performance in calculator use with Algebraic and Reverse Polish Notation". Ergonomics. 22 (9). Department of Industrial Engineering, State University of New York at Buffalo, Amherst, New York, USA: Taylor & Francis: 1011–1019. doi:10.1080/00140137908924675. eISSN 1366-5847. ISSN 0014-0139. S2CID 62692402. (9 pages)
  27. ^ a b Agate, Seb J.; Drury, Colin G. (March 1980). "Electronic calculators: which notation is the better?" (PDF). Applied Ergonomics. 11 (1). Department of Industrial Engineering, University at Buffalo, State University of New York, USA: IPC Business Press: 2–6. doi:10.1016/0003-6870(80)90114-3. eISSN 1872-9126. ISSN 0003-6870. PMID 15676368. 0003-6870/80/01 0002-05. Archived (PDF) from the original on 2023-09-23. Retrieved 2018-09-22. p. 6: In terms of practical choice between calculators, it would appear that RPN is faster and more accurate overall but particularly for more complex problems. (5 pages)
  28. ^ Hoffman, Errol; Ma, Patrick; See, Jason; Yong, Chee Kee; Brand, Jason; Poulton, Matthew (1994). "Calculator logic: when and why is RPN superior to algebraic?". Applied Ergonomics. 25 (5). Elsevier Science Ltd.: 327–333. doi:10.1016/0003-6870(94)90048-5. eISSN 1872-9126. ISSN 0003-6870.
  29. ^ "Rechenhilfe für Ingenieure". Alumni-Magazin der Technischen Universität Berlin (in German). Vol. 2, no. 3. Technische Universität Berlin. December 2000. Archived from the original on 2009-02-13.
  30. ^ "An einem 12. Mai" (in German). Deutsches Historisches Museum (German Historical Museum). Archived from the original on 2013-05-30.
  31. ^ Blaauw, Gerrit Anne; Brooks, Jr., Frederick Phillips (1997). Computer architecture: Concepts and evolution. Boston, Massachusetts, USA: Addison-Wesley Longman Publishing Co., Inc.
  32. ^ a b LaForest, Charles Eric (April 2007). "2.1 Lukasiewicz and the First Generation: 2.1.2 Germany: Konrad Zuse (1910–1995); 2.2 The First Generation of Stack Computers: 2.2.1 Zuse Z4". Second-Generation Stack Computer Architecture (PDF) (thesis). Waterloo, Canada: University of Waterloo. pp. 8, 11. Archived (PDF) from the original on 2022-01-20. Retrieved 2022-07-02. (178 pages)
  33. ^ a b Beard, Bob (Autumn 1997) [1996-10-01]. "The KDF9 Computer — 30 Years On" (PDF). Resurrection - The Bulletin of the Computer Conservation Society. No. 18. Computer Conservation Society (CCS). pp. 7–15. ISSN 0958-7403. Archived (PDF) from the original on 2020-07-27. Retrieved 2020-07-27. p. 8: […] The KDF9 is remarkable because it is the believed to be the first zero-address instruction format computer to have been announced (in 1960). It was first delivered at about the same time (early 1963) as the other famous zero-address computer, the Burroughs B5000 in America. Like many modern pocket calculators, a zero-address machine allows the use of Reverse Polish arithmetic; this offers certain advantages to compiler writers. It is believed that the attention of the English Electric team was first drawn to the zero-address concept through contact with George (General Order Generator), an autocode programming system written for a Deuce computer by the University of Sydney, Australia, in the latter half of the 1950s. George used Reversed Polish, and the KDF9 team were attracted to this convention for the pragmatic reason of wishing to enhance performance by minimising accesses to main store. This may be contrasted with the more "theoretical" line taken independently by Burroughs. Besides a hardware nesting store or stack - the basic mechanism of a zero-address computer - the KDF9 had other groups of central registers for improving performance which gave it an interesting internal structure. […] [2] (NB. This is an edited version of a talk given to North West Group of the Society at the Museum of Science and Industry, Manchester, UK on 1996-10-01.)
  34. ^ Fraser George Duncan, Stack machine development: Australia, great britain, and europe, Computer 10 (1977), no. 5, 50–52
  35. ^ Murray W. Allen, Charles Hamblin (1922–1985), Aust. Comput. J. 17 (1985), no. 4, 194–195
  36. ^ Galler, Bernard A.; Rosin, Robert F., eds. (1986) [1985-09-06]. The Burroughs B 5000 Conference - OH 98 (PDF). Marina Del Ray Hotel, Marina Del Ray, California, USA: Charles Babbage Institute, The Center for the History of Information Processing, University of Minnesota, Minneapolis, USA. Archived from the original (PDF) on 2012-04-22. Retrieved 2013-02-27. A New Approach to the Design of a Digital Computer (1961)
  37. ^ "The Burroughs B5000 Conference (1985)". 2023-06-17. p. 49.
  38. ^ a b c Galler, Bernard A.; Rosin, Robert F., eds. (1985-09-06). "Oral History: Burroughs B5000 Conference" (PDF). Marina del Rey, California, USA, archived by the Charles Babbage Institute, University of Minnesota, Minneapolis: AFIPS / Burroughs Corporation. hdl:11299/107105. OH 98. Archived (PDF) from the original on 2023-09-23. Retrieved 2023-09-23.
  39. ^ "1928–2012 Obituary Condolences Robert (Bob) Ragen". Legacy.com. 2012-07-23. Archived from the original on 2017-12-18. Retrieved 2016-01-01. […] Bob holds over 80 patents awarded during his work as Director of RD for Friden, and Singer and as Senior Project Engineer at Xerox. He retired from Xerox RD in 1990. He is responsible for the development of the first commercial electronic calculator, the Friden 130, which has been displayed at the Smithsonian. […]
  40. ^ "Friden EC-130 Electronic Calculator". www.oldcalculatormuseum.com. 2020-08-09. Archived from the original on 2022-10-20. Retrieved 2018-03-21.
  41. ^ "Friden EC-132 Electronic Calculator". www.oldcalculatormuseum.com. 2022-07-15. Archived from the original on 2022-10-20. Retrieved 2018-03-21.
  42. ^ Monnier, Richard E. (September 1968). "A New Electronic Calculator with Computerlike Capabilities" (PDF). Hewlett-Packard Journal. 20 (1). Palo Alto, California, USA: Hewlett-Packard: 3–9. Archived (PDF) from the original on 2022-10-20. Retrieved 2016-01-03.
  43. ^ "hp 9100A Calculator" (PDF) (marketing brochure). Hewlett-Packard. 1968. pp. 8–10. Archived (PDF) from the original on 2021-10-22. Retrieved 2013-01-26.
  44. ^ "HP 9100A/B". MoHPC - The Museum of HP Calculators. 1998. Archived from the original on 2023-09-23. Retrieved 2023-09-23.
  45. ^ HP35 User's Manual. Hewlett-Packard. p. i. p. i: […] The operational stack and reverse Polish (Łukasiewicz) notation used in the HP-35 are the most efficient way known to computer science for evaluating mathematical expressions. […]
  46. ^ HP-42S RPN Scientific Calculator – Owner's Manual (PDF) (1 ed.). Corvallis, Oregon, USA: Hewlett-Packard Co. June 1988. p. 3. 00042-90001. Archived (PDF) from the original on 2017-09-17. Retrieved 2017-09-17.
  47. ^ a b "Section 3: The Automatic Memory Stack, LAST X, and Data Storage". Hewlett-Packard HP-15C Owner's Handbook (PDF). 2.4. Hewlett-Packard Development Company, LP. September 2011. pp. 32–46. 00015-90001. Archived (PDF) from the original on 2017-09-17. Retrieved 2015-12-05.
  48. ^ Laporte, Jacques (2014-05-22). "The slide rule killer: a milestone in computer history". Archived from the original on 2015-02-11. Retrieved 2016-01-01.
  49. ^ a b Wickes, William C. (January–February 1987). "The HP-28C: An Insider's Perspective". HPX Exchange. 1 (1). [3]
  50. ^ a b Hewlett-Packard. "RPLMan from Goodies Disk 4" (RPLMAN.ZIP). Retrieved 2015-09-12.
  51. ^ a b Wessman, Timothy "Tim" James (2016-06-21) [2016-06-20]. "What to do with stack overflow OBJ->/LIST->?". MoHPC - The Museum of HP Calculators. Archived from the original on 2023-09-24. Retrieved 2023-09-24.
  52. ^ "HP Calculators".
  53. ^ Nelson, Richard J. (April 2012). "HP RPN Evolves" (PDF). HP Solve (27). Hewlett-Packard Development Company, L.P.: 42–45. Archived (PDF) from the original on 2022-10-20. Retrieved 2022-10-20. [4] (4 of 56 pages)
  54. ^ https://hpcalcs.com/
  55. ^ https://hpofficesupply.com/
  56. ^ Shirriff, Ken. "Reversing Sinclair's amazing 1974 calculator hack – half the ROM of the HP-35". Archived from the original on 2022-08-26. Retrieved 2013-12-09.
  57. ^ Sharwood, Simon (2013-09-02). "Google chap reverse engineers Sinclair Scientific Calculator". The Register. Archived from the original on 2022-10-20. Retrieved 2013-12-09.
  58. ^ SR4921 RPN Reverse Notation Scientific Calculator Instruction Manual (PDF). Palo Alto, California, USA: Commodore Business Machines, Inc. Archived (PDF) from the original on 2017-06-25. Retrieved 2022-10-16.
  59. ^ "Prinztronic Program". www.vintagecalculators.com. Retrieved 2018-03-21.
  60. ^ Elektronika B3-21 page on RSkey.org
  61. ^ Elektronika MK-161 page on RSkey.org
  62. ^ "Elektronika MK-61/52 and 152/161: small tech review (En) - Кон-Тики". arbinada.com. Retrieved 2018-03-21.
  63. ^ "НПП СЕМИКО - вычислительная техника и устройства автоматизации". mk.semico.ru. Retrieved 2018-03-21.
  64. ^ "A new standard!... The 7400 scientific & engineering calculator" (PDF). Radio-Electronics - For men with ideas in electronics (Advertisement). Vol. 43, no. 12. New York, USA: Gernsback Publications, Inc. December 1972. p. 17. Archived (PDF) from the original on 2022-12-28. Retrieved 2022-12-28. p. 17: DATA STORAGE: 2 Auxiliary Storage Registers plus up to 7 push-up Stack Registers. […] 7400A 3 Registers Kit $299.95 Assembled $379.95 […] 7400B 5 Registers Kit $319.95 Assembled $399.95 […] 7400C 7 Registers Kit $339.95 Assembled $419.95
  65. ^ Berger, Ivan (May 1973). "New calculator kits: From pocket minis to versatile desk models". Popular Mechanics. Hearst Magazines: 152. Retrieved 2017-04-29.
  66. ^ "MITS 7400 Scientific/Engineering Calculator". Archived from the original on 2017-04-30. Retrieved 2017-04-30. (NB. Shows a photo of the MITS 7400, but the text erroneously refers to the later algebraic 7440 model instead of the 7400A/B/C models.)
  67. ^ Paul, Matthias R. (2015-02-18) [2015-02-15]. "[34S] Proposal for Entry RPN mode with dynamic stack". MoHPC - The Museum of HP Calculators. Archived from the original on 2023-09-23. Retrieved 2023-09-24.
  68. ^ Bit (2014-11-15). "Bit's WP 34S and 31S patches and custom binaries (version: r3802 20150805-1)". MoHPC - The Museum of HP Calculators. Archived from the original on 2023-09-24. Retrieved 2023-09-24.
  69. ^ Bit (2015-02-07). "[34S & 31S] Unique display mode: significant figures". MoHPC - The Museum of HP Calculators. Archived from the original on 2023-09-24. Retrieved 2023-09-24.
  70. ^ https://forum.swissmicros.com/viewtopic.php?f=16&t=2939
  71. ^ https://forum.swissmicros.com/viewtopic.php?f=15&t=2845
  72. ^ "Katharina & Paul Wilkins' Home Page". lashwhip.com. Retrieved 2018-03-21.
  73. ^ "galculator - a GTK 2 / GTK 3 algebraic and RPN calculator". galculator.sourceforge.net. Retrieved 2018-03-21.
  74. ^ Schrijver, Frans. "Home - mouseless Stack-Calculator". www.stack-calculator.com. Retrieved 2018-03-21.
  75. ^ Geschke, Charles (1986) [1985]. Preface. PostScript Language Tutorial and Cookbook. By Adobe Systems Incorporated (27th printing, August 1998, 1st ed.). Addison Wesley Publishing Company. ISBN 0-201-10179-3. 9-780201-101799. (NB. This book is informally called "blue book" due to its blue cover.)
  76. ^ Adobe Systems Incorporated (February 1999) [1985]. PostScript Language Reference Manual (PDF) (1st printing, 3rd ed.). Addison-Wesley Publishing Company. ISBN 0-201-37922-8. Archived (PDF) from the original on 2017-02-18. Retrieved 2017-02-18. (NB. This book is informally called "red book" due to its red cover.)
  77. ^ Born, Günter [in German] (December 2000). "Kapitel 1. LOTUS 1-2-3-Format (WKS/WK1)" [Chapter 1. Lotus 1-2-3 WKS/WK1 format]. Dateiformate – Eine Referenz – Tabellenkalkulation, Text, Grafik, Multimedia, Sound und Internet [File formats – a reference – spreadsheets, text, graphics, multimedia, sound and internet] (PDF) (in German). Bonn, Germany: Galileo Computing. ISBN 3-934358-83-7. Archived (PDF) from the original on 2016-11-29. Retrieved 2016-11-28.
  78. ^ Born, Günter [in German] (December 2000). "Kapitel 2. LOTUS 1-2-3-Format (WK3)" [Chapter 2. Lotus 1-2-3 WK3 format]. Dateiformate – Eine Referenz – Tabellenkalkulation, Text, Grafik, Multimedia, Sound und Internet [File formats – a reference – spreadsheets, text, graphics, multimedia, sound and internet] (PDF) (in German). Bonn, Germany: Galileo Computing. ISBN 3-934358-83-7. Archived (PDF) from the original on 2016-11-29. Retrieved 2016-11-28.
  79. ^ Feichtinger, Herwig (1987). Arbeitsbuch Mikrocomputer (in German) (2 ed.). Munich, Germany: Franzis-Verlag GmbH. pp. 427–428. ISBN 3-7723-8022-0. (NB. According to this book, a 4 KB compiler was available from Lifeboat Software for CP/M.)
  80. ^ Wostrack, Gustav (January 1989). RPNL. Eine FORTH ähnliche Sprache mit strukturunterstützenden Sprachkonstrukten (in German). Wolf-Detlef Luther, Gens. ISBN 978-3-88707022-9.
  81. ^ Dietrich, Johannes W. (2019-07-24). "TRURL RPN Engine". Zenodo. doi:10.5281/zenodo.3257689. Retrieved 2022-07-02.

Further reading

Retrieved from "https://en.wikipedia.org/w/index.php?title=Reverse_Polish_notation&oldid=1180235828"