竜 TatSu is a tool that takes grammars in a variation of EBNF as input, and outputs memoizing (Packrat) PEG parsers in Python. 竜 TatSu can compile a grammar stored in a string into a tatsu.grammars.Grammar object that can be used to parse any given input, much like the re module does with regular expressions, or it can generate a Python module that implements the parser. 竜 TatSu supports left-recursive rules in PEG grammars using the algorithm by Laurent and Mens. The generated AST has the expected left associativity. This release adds optimizations and solves obscure bugs and backwards-compatibility issues. See the changelog at: https://github.com/neogeny/TatSu/releases/tag/v5.8.0 -- Juancarlo Añez mailto:apalala@gmail.com