Sergio A. Vargas

Is there any reason this couldn't be done with operator suffixes like `+ₒ, -ₒ, >>ₒ`? (I ask because Julia doesn't seem to mind using unicode for pretty conventional functions like...

Probably related to #92. For now, as a workaround, you can enclose the symbols in parentheses: ```julia if a == :(end) a = 1 else a = 2 end ```...

Yep, the parser is just slow because the grammar has lots of conflicts. Right now I'm more interested in making the resulting binary smaller (it's huge), but hopefully that will...

> * In the grammar, avoid single tokens that match multiple keywords e.g. primitive type, abstract type, as these don't work with keyword extraction, making the main lex function more...

I'll merge this now. We can regenerate later with a tree-sitter version that includes https://github.com/tree-sitter/tree-sitter/pull/3234/

No problem. I didn't update `parser.h` in the last `generate`, so the header still has the `set_contains` function.

Yep. I was also able to reproduce the issue in neovim. > I wasn't able to reproduce this in any other file, so I am not sure what exactly causes...

Yes. parsing fails because `"euler$"` is not a valid string literal in Julia. The problem here is that tree-sitter's error recovery isn't activated.

I see that the check is missing, but that doesn't seem to solve the underlying issue. When the scanner sees the `$`, it'll return a `STRING_CONTENT` token and return to...

I think I understand the issue, but it's not super-clear why having the quotes as child nodes solves it. Anyways, we already have tokens for string start/end quotes, they're just...