kuroko VS bluebird

(kuroko)[https://github.com/kuroko-lang/kuroko] is basically Python, but C

Kuroko: Dialect of Python with explicit variable declaration and block scoping, with a lightweight and easy-to-embed bytecode compiler and interpreter.

I would say Kuroko makes more sense ;-P

Kuroko 1.3.0 gets a release candidate. Lots of big things since 1.2.5, like optimized method invocation, more operator overloads, better support for f-string expressions (format specs, =, faster constructions), a long type with my own bigint implementation (this was the last thing I was still regularly opening Python repls for, so a huge personal win). I also fixed a bunch of little things that have been nagging me, like the compiler can now compile expressions directly, which allowed me to remove the kludge that made the repl work previously. The WASM web repl also got some love with a port of the core of Hiwire from Pyodide, giving a very straightforward interface between JS and Kuroko in a browser - and I rebuilt the web IDE on it. I've also been working on a new compiler, which will hopefully form the basis of 2.0 - and this might be the last 1.x release (though I expect at least a few 1.3.x bug fix releases).

In case it's not clear, PonyOS is a joke reskin of my serious OS project, ToaruOS. PonyOS gets a new release every April 1st. All of the libraries and applications in ToaruOS are in-house things I built myself - the whole OS is "built from scratch". PonyOS adds ponysay, which is an external app originally written in Python - and in previous releases of PonyOS I shipped the Python version alongside a port of Python 3.6. This release, though, comes with a port to my own language, Kuroko, which is a dialect of Python - a lot of what went into building the PonyOS release this year was getting ponysay to work well.

Did this year's Advent of Code in Kuroko which sussed out some bugs and missing functionality. Better hashing for tuples, more builtins and methods on standard classes for improved compatibility with Python, general build cleanups. In the later problems, most suffering was caused by the GC, so I'd like to put more thought into collection strategies going forward.

Is it me you're looking for?

0 upto n and 0 thru n. I think I saw it in Bluebird first and really liked it.

Instead of the classic visitor pattern, I found it easier to create a class that basically wraps a big switch statement that switches on an enum representing the kind of expression. You pass it an expression, and based on the enum returned by its kind() function you downcast the expression into the subclass you need. The code is here for reference. My AST code is here.

I am working some again on my Ada-like language bluebird. I am making another attempt to use MLIR as an intermediate IR between the AST and LLVM IR (I made a brief attempt a few months ago just to look into it).

I fworked some more towards adding pointers on my Ada-like programming language bluebird. I've finished adding pointer types and variables (as well as the operators for dereferencing/getting the address of objects), but I still need to add the ability to dereference and assign.

I started to experiment with using MLIR to write a high-level IR for my language bluebird, which will hopefully reduce the work of implementing features I want to add such as generics and ranges, as well as allowing me to eventually write some optimizations. I am also considering rewriting my AST as an MLIR dialect, since MLIR provides a bunch of type-checking/error printing/support infrastructure.

I continued implementing support for references (a restricted form of pointers) in my Ada-like language bluebird. I also am working on adding a cleanup pass between my parser/typechecker to handle stuff like type resolution of literals and constant folding.

I didn’t add too many new features to my Ada-like language bluebird this month because of lots of projects/school stuff.

Here is a link to my optimizer pass setup for reference. This is just a simple optimization pipeline (I think clang has a setup where optimization stages are re-run multiple times to take advantage of inlining making more optimizations possible).

I made some more progress on bluebird, my Ada-like language.

I continued to make progress on the compiler for my Ada-inspired language bluebird. I will have less time to spend on it as classes began earlier last month, but I still hope to continue working on it. Things are getting to the point where adding a new feature isn’t as difficult as it was when doing so often meant writing the supporting code from nothing.