Maximum recursion of procedures is much lower than Scratch

[GarboMuffin]

Expected Behavior

https://scratch.mit.edu/projects/116680081/ should work

Actual Behavior

It errors with Uncaught RangeError: Maximum call stack size exceeded

This seems to be caused by the project using recursion as an alternative to repeat something 40,000 times.

We are limited by the call stack size of the browser because we use actual JS recursion, whereas Scratch's interpreter uses a list that allows essentially infinite recursion.

Steps to Reproduce

https://turbowarp.org/116680081

Operating System and Browser

Happens in all browsers.

[hello-smile6]

Expected Behavior

https://scratch.mit.edu/projects/116680081/ should work

Actual Behavior

It errors with Uncaught RangeError: Maximum call stack size exceeded

This seems to be caused by the project using recursion as an alternative to repeat something 40,000 times.

We are limited by the call stack size of the browser because we use actual JS recursion, whereas Scratch's interpreter uses a list that allows essentially infinite recursion.

Steps to Reproduce

https://turbowarp.org/116680081

Operating System and Browser

Happens in all browsers.

Could you detect when you're close to reaching the limit and start a new thread with a reference to the original context using setTimeout()? Also, it seems like

scratch-vm/src/compiler/jsexecute.js

Line 581 in 6aeccdb

return new Function('globalState', withRuntime)(globalState);

might be part of the issue.

[GarboMuffin]

setTimeout is not useful here and that line of code is not the problem

I know perfectly well how to solve this (continuations instead of generators, like forkphorus). Solving this requires many changes, only affects a few projects, and makes everything much slower, so it won't happen any time soon