MathGroup Archive 2000

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: recursion

  • To: mathgroup at
  • Subject: [mg25888] Re: recursion
  • From: "Paul Lutus" <nospam at>
  • Date: Tue, 7 Nov 2000 02:55:59 -0500 (EST)
  • References: <8u0cg3$>
  • Sender: owner-wri-mathgroup at

"F.M.Brul" <fmbrul at> wrote in message
news:8u0cg3$t5r at
> Hello,
> Can anyone explain to me what recursion means in terms of
> converting an infix notation method to an pre or postfix
> notati n method? Where van I find an example perhaps?
> I want to write an algorithm that can converts say  (3 + 4)*6 to  *6+(3 4)
> Hope this is the right group to post this question...

In the context of the problem you are discussing, recursion is a way to
efficiently break down the task of converting an expression in infix
notation to a postfix notation form.

The reason recursion is a logical approach is because there may be nested
expressions that require the same treatment as the outer expressions that
contain them.

By the way, the proper form for your example is (3 + 4)*6 -> 3 4 + 6 *

Here is a link you may find useful for background:


Paul Lutus

  • Prev by Date: Re: recursion
  • Next by Date: Simultaneous Equation Estimation (SUR,2SLS,3SLS)?
  • Previous by thread: Re: recursion
  • Next by thread: Recursion