Re: Implementing a stack-based interpreter

Tomasz Kowaltowski <tk@ic.unicamp.br>
7 Aug 2005 16:20:29 -0400

          From comp.compilers

Related articles
[5 earlier articles]
Re: Implementing a stack-based interpreter Jan.Bogaerts@telenet.be (Jan Bogaerts) (2005-07-22)
Re: Implementing a stack-based interpreter anton@mips.complang.tuwien.ac.at (2005-07-26)
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)
| List of all articles for this month |
From: Tomasz Kowaltowski <tk@ic.unicamp.br>
Newsgroups: comp.compilers
Date: 7 Aug 2005 16:20:29 -0400
Organization: Compilers Central
References: <200508060920.j769K6a11755@maceio.ic.unicamp.br>
Keywords: interpreter, comment
Posted-Date: 07 Aug 2005 16:20:29 EDT

"Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de>:
> BTW, does anybody know the author of the infix to reverse Polish notation
> conversion algorithm? I failed to find any references, so far.


I recall vaguely a description of the first Fortran compiler which
translated infix expressions into code which must have been equivalent
to reverse Polish (postfix) notation. The original method was quite
complicated introducing extra parentheses around each operator
according to its priority and then doing the translation. It required
thus two passes over the expression.


The simple stack based one pass algorithm seems to appear in many texts
on data structures. Probably it was reinvented by many authors.


-- Tomasz Kowaltowski
[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]


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.