You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository has been archived by the owner on Feb 4, 2021. It is now read-only.
You can parse the same language just fine using repeat zeroOrMore (keyword "1"). I would suggest that very long documents would generally have a repetitive structure, so might allow parsing using repeat.
I'm a bit curious to what extent an Elm parser combinator library with andThen necessarily exhibits this problem. It feels that due to the general type ((a -> Parser b) -> Parser a -> Parser b as opposed to e.g. (a -> Parser (List a)) -> Parser a -> Parser (List a), some form of recursion might be implied?
Minimal example
Changing 10000 to 1000 compiles fine.
Error message
Uncaught RangeError: Maximum call stack size exceeded
Ellie reproduction
https://ellie-app.com/42MsxddqX9ya1/0
The text was updated successfully, but these errors were encountered: