Open
Description
See https://github.com/djspiewak/scala-bison, its tool paper and the original paper on recursive ascent/descent.
There's also the Typed LR paper, which maybe is a preferrable embedding compared to plain recursive ascent-descent.
I expect that with a bit of tuning, such a parser can outperform happy's current table-driven backend because GHC will be able to inline functions.
Metadata
Metadata
Assignees
Labels
No labels