Python to RPN converter
|
06-25-2018, 07:13 AM
Post: #35
|
|||
|
|||
RE: Python to RPN converter
Hi all,
Reading this thread reactivated an idea I had but never had the courage to implement: build the algebraic equation parser and solver from the HP-27S into the 42S. Since Thomas won't build this kind of far-off feature in free42, the only way to do it... is FOCAL. While in theory FOCAL is Turing-complete and should be able to implement anything, especially with the virtually unlimited speed and memory of Free42, in practice this is pretty heavy stuff. I thought of using matrices as nodes to build trees, using their variable names as pointers, but you need a strong stomach... Then I saw this Python to RPN thing and thought "wow ! In Python this is almost trivial to do !". Then I read the converter documentation and my enthousiasm scaled down... It seems that the converter still relied on the 4-level stack to evaluate expressions, without using registers to store temporary computations, and that therefore too complex algebraic computations are doomed to failure. And since I want to do recursive tree evaluation... I don't want to start this if this has no chance of success. What do you think ? Thanks in advance and cheers, Vincent |
|||
« Next Oldest | Next Newest »
|
User(s) browsing this thread: 1 Guest(s)