Math Is Fun Forum

  Discussion about math, puzzles, games and fun.   Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ • π ƒ -¹ ² ³ °

You are not logged in.

#1 2007-03-07 12:53:00

Sekky
Member
Registered: 2007-01-12
Posts: 181

Evaluating Postfix Notation Primer

http://www.stylebucket.co.uk/primers/Po … tation.pdf

I kinda like this algorithm, and sometime we can get so weighed down in heavy math we forget some of the more semantic ideas, anyway tell me what you think.

Offline

#2 2007-03-07 20:12:52

lightning
Real Member
Registered: 2007-02-26
Posts: 2,060

Re: Evaluating Postfix Notation Primer

try your hardest and never give up!

Last edited by lightning (2007-03-07 20:13:05)


Zappzter - New IM app! Unsure of which room to join? "ZNU" is made to help new users. c:

Offline

#3 2007-03-08 13:53:02

Sekky
Member
Registered: 2007-01-12
Posts: 181

Re: Evaluating Postfix Notation Primer

kylekatarn wrote:

Creation of a postfix parser is an interesting task for those who are interested in Compilers & Language Processing wink

So is an infix to postfix converter for the same interest. I might write a primer for the shunting yard algorithm sometime over the weekend

Offline

#4 2007-03-08 20:22:08

lightning
Real Member
Registered: 2007-02-26
Posts: 2,060

Re: Evaluating Postfix Notation Primer

ok uh whats a postfix?


Zappzter - New IM app! Unsure of which room to join? "ZNU" is made to help new users. c:

Offline

Board footer

Powered by FluxBB