Immanuel Haffner

I suppose a simpler (and faster) solution to computing the number of bits required can be found [here](https://users.rust-lang.org/t/logarithm-of-integers/8506/5). While this gives you `floor(log2(x))`, we can use it to implement `ceil(log2(x))`...

Oh man... this PR is one and a half years old by now. I may or may not give it another attempt to get this merged. Not in the near...

It's appreciated, thanks!

Well, i ditched tree-sitter-based features for the most part and use LSP semantic tokens instead. It's probably slower, but also nicer. You can have different Highlight groups for local variables...