Daily Thought - 2024-08-28
Hey, I'm Hanno! These are my daily thoughts on Crosscut, the programming language I'm creating. If you have any questions, comments, or feedback, please get in touch!
This thought was published before Crosscut was called Crosscut! If it refers to "Caterpillar", that is the old name, just so you know.
The approaches to call stack reconstruction I've presented so far ([1], [2]) do not cover all possible cases. One limitation that I do know of, is if a missing function is called by another function which has multiple branches. I'd like to talk about that tomorrow.
Aside from that, I can't shake the feeling that the algorithm I explained yesterday must have other limitations that I'm missing. But I can't come up with an example (aside from the aforementioned multi-branch case) that won't work.
If you can spot any problems that I've been missing, then I'd love to hear about it!
Hey, you! Want to subscribe to my daily thoughts? Just let me know (maybe include a nice message, if you're up for it), and I'll send you an email whenever I post a new one.