AndrasKovacs / AndrasKovacs/flatparse
Resumable parsing using continuation primitives
Nobody has claimed this yet.
- Dominant language
- Haskell
- Stars
- 178
- Forks
- 18
- PR merge metrics
- No merged PRs in 30d
Description
So far, resumable parsers were really only feasible with CPS-based internals, like in Attoparsec. Unfortunately, that has painful overhead because it effectively moves the control stack of the parsers to the heap, and continuation closure calls are also slower than native GHC returns.
GHC 9.6.x is now available in release candidates, and it has new primops for delimited continuations: https://github.com/ghc-proposals/ghc-proposals/blob/master/proposals/0313-delimited-continuation-primops.rst It might be interesting to investigate the new primitives. The idea would be to save the current parser continuation when running out of input, instead of throwing an error.
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start by reading the linked GHC proposal on delimited continuation primops and the existing resumable-parser approach described in the issue. Determine how parser continuation state is currently represented and what would need to change to preserve it on input exhaustion. Done would require a defined implementation and evidence that resumable parsing works with the new primitives.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- haskell
- Domain
- backend
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100