Is there an existing algorithm for this notation translation/conversion?
Posted
by John
on Stack Overflow
See other posts from Stack Overflow
or by John
Published on 2010-06-16T15:35:47Z
Indexed on
2010/06/16
17:12 UTC
Read the original article
Hit count: 247
A system has a notation that would require writing an expression like (A+B)*C
as #MUL(#ADD(A,B),C)
. Is there already an algorithm to do this kind of notation conversion so users can enter in a more conventional way?
In other words an algorithm to convert from infix -> my notation. First issue is I don't know an exact name for my notation... it's similar to reverse-polish but not quite. Every operator is encoded as a function taking arguments.
© Stack Overflow or respective owner