I don’t think there is one. I’ve been working on something in this direction. My idea was to build upon data-dependent grammars (a la Iguana) and fungll in a parser combinator library, but it doesn’t quite work out yet. My latest experiment is on Github. The main issue I’m getting stuck on is dealing with variable binding in the EDSL.
The reason I’m considering data-dependant grammars rather than SGLR parsers is because Jurgen Vinju gave quite a convincing talk at EVCS: https://homepages.cwi.nl/~jurgenv/papers/EVCS.pdf. TL;DR: data-dependant grammars allow you to easily define disambiguation strategies in a generic framework instead of modifying the internals of the parsing algorithm for each new disambiguation strategy.
When I manage to crack that, I think it should not be hard to turn the parser combinator library into a parser generator by using some Template Haskell.
I don’t have plans to include full attribute grammars, because I think they are usually at the wrong level of abstraction. After parsing you generally want to think in terms of control flow and data flow, but attribute grammars just keep viewing the IR as a tree. And you either have to thread the attributes yourself or rely on syntactic flow like from left to right through the tree.
But if you want to use attribute grammars anyway, I’d recommend taking a look at UUAGC which is a completely standalone attribute grammar system. You can combine that with any parser you want.