Timeline for Which are the alternatives to using a stack to represent function call semantics?
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 3, 2016 at 15:50 | comment | added | shawnhcorey |
For virtual machines, a linked list can be used. Each node of the list is a frame. Since the hardware stack is used by the VM, this is allows frames to exist on the heap without the overhead of realloc().
|
|
| Dec 8, 2015 at 18:38 | comment | added | user76821 | Clean uses a graph and a graph rewrite machine, which is in turn implemented using a three-stack machine, but with different content than usually. | |
| Jun 27, 2013 at 18:01 | audit | Reopen votes | |||
| Jun 27, 2013 at 18:01 | |||||
| Jun 11, 2013 at 6:55 | vote | accept | Lorenzo Dematté | ||
| Jun 8, 2013 at 13:19 | history | edited | Lorenzo Dematté | CC BY-SA 3.0 |
added 301 characters in body
|
| Jun 7, 2013 at 21:32 | answer | added | Kile Asmussen | timeline score: 4 | |
| Jun 7, 2013 at 12:24 | answer | added | John R. Strohm | timeline score: 22 | |
| Jun 7, 2013 at 10:00 | answer | added | Brendan | timeline score: 6 | |
| Jun 7, 2013 at 9:45 | history | edited | Lorenzo Dematté | CC BY-SA 3.0 |
added 39 characters in body
|
| Jun 7, 2013 at 9:38 | history | asked | Lorenzo Dematté | CC BY-SA 3.0 |