stunt VS toaststunt

ToastStunt is a fork of Stunt which is a fork of LambdaMOO. ToastStunt adds a bunch of features and is under active development. I worked with the knowledgeable folx on the ToastStunt Discord and the primary devs, to update the classic LambdaMOO Programmers Guide for ToastStunt.

However, improving the interpreter is going to be very tricky as the bytecode is dynamically typed, so you can't tell at compile time whether a+b is going to do an integer addition, float addition, string concatenation, etc --- you have to test the object types at run time. See the implementation here: https://github.com/toddsundsted/stunt/blob/a4158f5835f1beb9d754c92fd5b3a137e459aabf/execute.cc#L1272 This means that unless you're willing to do sophisticated run-time analysis inside the interpreter, a JIT is going to be very hard.

Hi all, I've been interested in compiler design and optimization for a long time now, and want to start learning as I work on this language. The language's grammar is defined using Bison, and from there an AST is created. the AST is passed to the codegen system that creates bytecodes from it, which the VM then runs. When I look up optimization Gcc and Clang seem to be the first primary options people look toward for learning, but I have a few issues with that. First, picking out a path forward to begin working on this seems daunting because I'm not sure where to start, and secondly there are so many things those compilers do that I don't actually need to do. I'm looking for some advice on how I can begin learning to make this system better, maybe some resources or just some starting points. The code is here: https://github.com/sorressean/toaststunt