4 ms·
This looks like a normal postfix to infix notation converter. It transforms "abc++" to "a+b+c". You can call it a decompiler for a very simple stack machine. Bu
by s-macke 9y ago
This looks like a normal postfix to infix notation converter. It transforms "abc++" to "a+b+c". You can call it a decompiler for a very simple stack machine. But it neither accounts for branches nor loops.
- bluedino 9y agoIt appears it supports branching, however the author implemented a spreadsheet so he didn't use them. Trying to find the original article only came up with this: http://onlinelibrary.wiley.com/doi/10.1002/spe.4380070502/full http://onlinelibrary.wiley.com/doi/10.1002/spe.4380070502/fu...
- theoh 9y agoIn that respect it is the inverse of the shunting yard algorithm (which converts infix to postfix) https://en.wikipedia.org/wiki/Shunting-yard_algorithm https://en.wikipedia.org/wiki/Shunting-yard_algorithm