Hi. This is stereobooster's personal blog

Awesome Tagged Template Literals

Template literals is a pretty simple thing - it is a multiline string with interpolations:

Notes on parsing theory, part 3

Based on Theory of Computation (CS3102), Spring 2017, videos are here.

Accidental complexity and closed source

Accidental complexity All software construction involves essential tasks, the fashioning of the complex conceptual structures that compose the abstract software entity, and accidental tasks, the representation of these abstract entities in programming languages and the mapping of these onto machine languages within space and speed constraints. Most of the big past gains in software productivity have come from removing artificial barriers that have made the accidental tasks inordinately hard, such as severe hardware constraints, awkward programming languages, lack of machine time.

What I miss in Markdown (and Hugo)

I like Markdown for its simplicity. Simplicity comes with limitations. There are some features that I miss in Markdown or it is possible to extend Markdown to support these cases, but there is no support from the Hugo side (static site generator I use).

Improve your IDE

Improve syntax highlighting Traditionally IDE (or text editors) use regular expressions to do syntax highlighting. This approach is limited in what is highlight correctly. They do it because: it will work even for files with syntax errors it is faster than do real parsing on each keystroke (programming languages typically use context-free grammar) Tree-sitter uses incremental parsing, which allows it to do real parsing on each keystroke fast - it reparses only changed region of code and reuses parse tree from the previous parse for the rest.

One shortcut to rule them all

or an ode to command palette.

Quiz: is this a programming language?

Definition I would say that something is programming language (PL) if: 1: there is a machine that can do some actions (computations) based on the text written in the language (program) 2: or this language can be mechanically translated (compiled) to a programming language Now let’s see if we can tell based on this rule if something a PL or not. Machine code? Yes, it can be interpreted by CPU Assembly?