Would you know about a PEG representation of Rust grammar ?
My goal is to express the Rust Programming langage as SSLR (which is a kind of ANTLR alternative where Left recursion is not allowed).
Most of the language is pretty easy to represent but I am curious about how to avoid Left recursion for constructs like call expressions which are expressions based on...expressions
As mentioned in another post
Parsing Expression Grammars, much like LL(*) parsers, can’t perform left recursion because it can and will lead to infinite recursion.
Please note I am note looking for a solution like Pest that would be written in Rust but for a formal representation of the Rust Grammar based on PEG