How would you write a Lezer grammar for a language where indentation is significant like Python, CoffeeScript, or TaskPaper?
It seems treesitter grammars use an external tokenizer. Would a Lezer grammar use a similar method?
What would be the best strategy for that external tokenizer? Could it keep a state of the current indentation level? Or perhaps it could be easily computed from the inputs to the tokenizer?