Parrot is a virtual machine designed to efficiently compile and execute bytecode for dynamic languages. Parrot currently hosts a variety of language implementations in various stages of completion, including Tcl, Javascript, Ruby, Lua, Scheme, PHP, Python, Perl 6, APL, and a .NET bytecode translator. Parrot is not about parrots, though we are rather fond of them for obvious reasons.

Got the nqp/t/qregex tests to pass.
It would be a good idead for me to document how the rules engines of the MoarVM, Parrot, JVM and JavaScript backends work.
They are pretty similiar as it's basically the translation of the same code.
Unfortunately some things get cargo culted.
Like parrot registers names ending up in MoarVM code.

Now that a minimal api is ready, its time that I document how to use it:

Its possible to use the library to deal with repositories, the repository index, low-level object access, commits, revision walking, blobs, git configs and more. Major things that are still not done are dealing with references and trees, which are only waiting on a few issues(mentioned below).

Rock Concert Movement #237 - Taking the audience on a Jungian journey
into the collective unconscious by using the shadow as a metaphor for the
primal self that gets repressed by the modern persona and also by using an
underground setting and labyrinth office design to represent both the depths
of the psyche and the dungeon-like isolation of our increasingly mechanistic
society which prevents people from finding satisfying work or meaningful
connections with others.
...
It's Time to Start!
-- "Rock Concert Instruction Manual" Narrator, Blue Man Group

On behalf of the Parrot team, I'm proud to announce Parrot 5.7.0, also known as "Azure-rumped Parrot".

This is easy to do after bootstraping (when we have the whole compiler avaliable at runtime) or a bunch of crafty hacks.
After attempting to quick hack a workaround (which would involve starting up a new parrot process to cross compile a regex) it turned out our current cross compiling solution won't work. I decided to avoid waisting time on that and leave it to after the boostrap.

t/nqp directory in the nqp repository contains all the tests for the NQP language features.
There are also tests in t/qregex which are really a whole bunch of regex and their expected results on a suplied string.
(in a tab separated format + a harness).
And 3 tests in t/serialization which would involve a boring translation of serialization code from a different backend.

What seems to be a good direction is to get all the tests qast tests (which were written by Jonathan while porting nqp to the jvm) under JavaScript. They test the backend without requiring a parser. Doing that has uncovered a number of bugs in nqp-js. Major things like multi methods seem to work correctly but I have encoutered many small bugs. Which seems to imply that the nqp test suit needs to be more exaustive.
A few examples of those and their fixes:

Currently in nqp-js I'm using JavaScript arrays as nqp arrays (with a bunch of methods monkey patched on top of them).
That caused a problem as JavaScript alread has a push and unshift methods (hinting that it was somewhat inspired by Perl 5).
The tests thus far where using the nqp::push op for adding elements to arrays.
However QAST::Compiler::JavaScript uses the .push method
Example: nqp::push(@foo,$value) vs @foo.push($value).

My current calling convention is that $foo.bar(:a("named"),1) is translated to $foo.bar(ctx,{"a":"named"},1).

Which ended up in strange things being added into arrays (Which resulted in some fun debugging).

This report comes rather late, so let me give an overview of what's been happening.
The last report talked about an unified buildsystem. Since then the project has made a little progress. There were bugs in the unified buildsystem which meant that that the pir file which was generated from the nci file was stale at best, representing older versions of libgit2. This made a lot of work go down the drain, as a lot of my debugging was aimed at sending the correct datastructures. However this was a good step in finding my mistakes and moving ahead.