Is there an automatic (or semi-automatic) way to convert a tree-sitter grammar into a lezer grammar, assuming it doesn't use dynamic precedence and external scanner?
The context is making a web editor for an in-house mini-language, where the parser and interpreter were already written based on tree-sitter.
Is there an automatic (or semi-automatic) way to convert a tree-sitter grammar into a lezer grammar, assuming it doesn't use dynamic precedence and external scanner?
The context is making a web editor for an in-house mini-language, where the parser and interpreter were already written based on tree-sitter.