Hacker News new | past | comments | ask | show | jobs | submit login
A Simple Decompiler (1988) (drdobbs.com)
60 points by userbinator on Jan 20, 2018 | hide | past | favorite | 3 comments



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.


It 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/fu...


In that respect it is the inverse of the shunting yard algorithm (which converts infix to postfix) https://en.wikipedia.org/wiki/Shunting-yard_algorithm




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: