Timeline for Shortest code that raises a SIGSEGV
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 30 at 23:22 | comment | added | Braden Best | @BenMillwood I wasn't sure if dc had TCO, so to find out that it definitely does is really cool. | |
| Nov 26, 2016 at 7:58 | comment | added | Ben Millwood |
[dx0] stores dx0 on the stack, then d duplicates the top stack element, then x pops the top stack element (dx0) and executes it. Which duplicates the top stack element, and starts executing it... the 0 needs to be there to prevent this being a tail call, so they all build up.
|
|
| Nov 21, 2016 at 12:17 | comment | added | Stéphane Gourichon | Is works, but can you elaborate? Why does it behave that way? | |
| Oct 26, 2012 at 22:43 | review | Low quality posts | |||
| Oct 26, 2012 at 23:53 | |||||
| Oct 26, 2012 at 22:27 | history | answered | Geoff Reedy | CC BY-SA 3.0 |