10 Aug 2005 11:51:46 -0400

Related articles |
---|

[7 earlier articles] |

Re: Implementing a stack-based interpreter dot@dotat.at (Tony Finch) (2005-07-26) |

Re: Implementing a stack-based interpreter marcov@stack.nl (Marco van de Voort) (2005-08-03) |

Re: Implementing a stack-based interpreter mailbox@dmitry-kazakov.de (Dmitry A. Kazakov) (2005-08-05) |

Re: Implementing a stack-based interpreter rossen.radev@gmail.com (aquarin) (2005-08-05) |

Re: Implementing a stack-based interpreter tk@ic.unicamp.br (Tomasz Kowaltowski) (2005-08-07) |

Re: Implementing a stack-based interpreter kszabo@bcml120x.ca.nortel.com (2005-08-07) |

Re: Implementing a stack-based interpreter haberg@math.su.se (2005-08-10) |

From: | haberg@math.su.se (Hans Aberg) |

Newsgroups: | comp.compilers |

Date: | 10 Aug 2005 11:51:46 -0400 |

Organization: | Mathematics |

References: | <200508060920.j769K6a11755@maceio.ic.unicamp.br> 05-08-033 |

Keywords: | interpreter, theory, history |

Posted-Date: | 10 Aug 2005 11:51:46 EDT |

John Levine <johnl@iecc.com> wrote:

*> > BTW, does anybody know the author of the infix to reverse Polish notation*

*> > conversion algorithm? I failed to find any references, so far.*

*> [Forward Polish notation was invented in 1920, RPN in the 1950s, so I*

*> wouldn't be surprised if infix to Polish algorithms were invented in*

*> the 1920s. -John]*

The very point with Polish notation is that infix expressions can be

translated into them, because then one can use it to simplify proofs in

metamathematics. That's why, simplification of proofs, that Church used it

in his lambda calculus. So I guess Jan Lukasiewicz made that algorithm at

the same time he introduced the prefix notation. Also see

http://en.wikipedia.org/wiki/Polish_notation

http://en.wikipedia.org/wiki/RPN

The latter page says that Charles Hamblin made the RPN algorithm.

--

Hans Aberg

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.