Skip to content

Consider a recusive ascent/descent backend #167

Open
@sgraf812

Description

@sgraf812

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

No one assigned

    Labels

    No labels
    No labels

    Type

    No type

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions