The black hole…
Here I am again sharing news from my recent toy-project. The version 0.3.0 of tree-sitter-bnf-tools is out. If you did not run my tree-sitter grammars in plain BNF notation instead of JavaScript. It hips a CLI called ts-bnf-tool to convert, check, format, and analyse those grammars. Versions 0.1.0 and 0.2.0 were covered in earlier posts; […]
A few weeks ago I wrote about Writing Tree-sitter grammars in BNF, introducing a new toy project, a utility to write grammars in a clean BNF notation and convert them to the Tree-Sitter JavaScript syntax. The project repository is on GitHub: ambs/tree-sitter-bnf-tools. Version 0.2.0 is out now. I introduced a couple of new sub-commands to […]
If you keep up with my blog, you might remember a tutorial series on using Tree-sitter. At that time, I expressed my frustration on using it to write grammars, as they are expressed in JavaScript. But I ended up learning it, and for that, I invested some time in the tutorial. The tutorial example was […]
As stated previously, Part #5 of this tutorial provides a brief overview of using Tree-Sitter from C#. This post continues from Part #4 and will add a Domain Object Model to the parser. It will not include many details specific to Tree-Sitter, as it will be more of a restructuring of our Rust code. Nevertheless, […]
Continuing with Rust, in this part of the tutorial we will improve the grammar with support for a few new things. One will be the support of literals and regular expressions for terminal symbols, and the second will be the support for the Kleene closures. Grammar Literals The first changes we will perform are to […]
C is a nice programming language, I enjoy playing with. But we need to accept that, unless we use libraries, writing code from scratch takes a lot of time. With that in mind, and given that I am also trying to learn Rust, I decided to write this post, very similar to the second part […]
