F
Fred Bloggs
Guest
Spehro Pefhany wrote:
PL/I about 10,000 years ago- we were experimenting with stacks at the
time. The problem with RPN is not learning it- but unlearning it, it is
impossible to use a non-RPN calculator again.
Right- that was a homework assignment in my undergraduate course usingOn Mon, 24 May 2004 22:30:59 -0400, the renowned KR Williams
krw@att.biz> wrote:
Just as an aside... Has anyone who loves algebraic calculators
tried to program one? ...as in write the assembler code to
produce the crap?
I think it's pretty trivial- you just use the same setup as you would
for an RPN calculator but with another (narrow) stack for the pending
operators. Whenever the user hits open-paren or you run into a higher
precedence operator you push the intermediate value and pending
operator into the stacks. When the opposite happens you perform the
operation and drop the stack .
PL/I about 10,000 years ago- we were experimenting with stacks at the
time. The problem with RPN is not learning it- but unlearning it, it is
impossible to use a non-RPN calculator again.