-
Notifications
You must be signed in to change notification settings - Fork 3
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Parser.foldl isn't (always?) tail recursive #5
Comments
It is certainly intended to be tail recursive but I don't think this was carefully tested. Yes, please add an example. That would be very helpful. |
Here in I'll try make a more minimal reproduction later, but this is what sent me here The stack trace from the core dump:
|
In the process of trying to come up with a minimal example, I caused an internal panic instead 😭.
stdout/stderr
|
Quick update: The other code appears to have a different issue. Somehow the IR compilation of test is: Anyway, lots of fun work to do on my end! |
I now have a fix where I'm looking into the other issue. |
Ah! The other issue is because |
I'll fix some other defs that aren't actually tail recursive in PR #6. In the mean time, you can use branch |
The way the code is structured suggests that it is intended to be. I'm using
SimpleParserT
with my own monad if that contributes anything to it not functioning as it should. I can push example code if need be.The text was updated successfully, but these errors were encountered: