HP Forums / HP Museum Forums / Old HP Forum Archives v / Parsing Object Oriented Expressions with RPN

Linear Mode
Parsing Object Oriented Expressions with RPN


▼
Post: #6
10-05-2010, 01:39 AM
Howard Owen Offline
Unregistered
Posts: 1,830
Threads: 113
Joined: Aug 2005

Incredibly geeky hyperlink.

Find
▼
Post: #7
10-05-2010, 03:07 AM
Bill Zimmerly Offline
Unregistered
Posts: 78
Threads: 12
Joined: Oct 2009

Very cool Howard, thanks for posting it. ;)

Find
Post: #8
10-05-2010, 06:18 AM
David Hayden Offline
Unregistered
Posts: 528
Threads: 40
Joined: Dec 2008

For what it's worth, this is basically how an algebraic calculator evaluates an expression that you type. So in a way, even TI's are RPN at heart :).

HP calculators do the same thing when they parse a symbolic expression because symbolics are stored in postfix notation.

Find
▼
Post: #9
10-05-2010, 12:57 PM
Thomas Klemm Offline
Unregistered
Posts: 735
Threads: 34
Joined: May 2007

Quote:
symbolics are stored in postfix notation.

That's why you can't enter something like '(A+B)'. It is stored as 'A B +' and displayed as 'A+B'.

BTW: There's a programm ->RPN in the directory 'EXAMPLE/PRGS' you get when executing the command TEACH. It transforms an algebraic expression to its equivalent RPN-representation.

Thomas

Edited: 5 Oct 2010, 12:59 p.m.

Find
Post: #10
10-06-2010, 02:03 AM
Namir Offline
Unregistered
Posts: 2,247
Threads: 200
Joined: Jun 2005

Several years ago I wrote an expression parser that converts an algebraic expression (with variables and functions) into an array of RPN tokens. This approach allows the re-evaluation of the expression multiple times without having to re-parse each time. It was a fun project in VB .Net.

The program's GUI would list the parsed RPN expression.

Namir

Edited: 6 Oct 2010, 2:04 a.m.

Find

Forum Jump: