stoye at stoye.com
Tue May 14 12:17:28 CDT 2013
> That is not true. Stacks and cons cells are fundamentally different data structures. You can build a stack out of cons cells, but you can't build cons cells out of a stack. A stack is *strictly* a last-in-first-out data structure, which is the reason it doesn't need to be garbage collected.
sure you can allocate cons cells on a stack, but you will crash if you return this list to the caller (try dynamic-extent for that ;-) )
> Well, by implementing a stack of course. There are a lot of good books and articles about how to implement compilers. Have you read any of them?
So please give an example (eg. Dragon Book? Hint Hint)
> Have you read anything about the Ackerman function
Keep on topic: this list is not about education, it's about information, in this case the problem is a limited (fixed sized) stack.
Sorry - i havn't enough time to explain further - maybe some other list member?
@Tom & Joshua
Really helpful comments
More information about the Openmcl-devel