Jonathan Worthington

To make matters worse, the `` form interprets everything it sees as *code*, and it also needs to do LTM, meaning that we are: * Compiling each value form 0..255...

I'm missing the overall goal of this PR? Bytecode files store strings in a couple of different ways, in order to reduce memory use and startup decoding time (because if...

> is a proof of concept for fixing us having both utf8 and latin-1 encoded lexicals I don't understand why there's anything to fix. To me this looks like it's...

It works in front of anything (see the `| ` below), it's just that the `for` statement case is special-cased.

Well, since the `lazy for ..` case has its own special code path there, it'd seem especially deserving of a test. :-)

The original design plan for `==>` was that it would automatically imply parallel execution, and achieve it by setting up a chain of producer-consumer workers (effectively, each stage in the...

The data in question would be Unicode Character Database. MoarVM has a similar situation, where we have source files generated from the UCD. I don't think requiring MoarVM and NQP...

Well, per [Hyrum's law](http://www.hyrumslaw.com/), they'll probably all converge on being de facto spec if they don't change for long enough. :-) That aside, I'm a bit conflicted on this matter....

The best fix for this would be to implement detection of undeclared routines in NQP (using a mechanism like the `%*MYSTERY` hash in Rakudo's grammar). That way, things with undeclared...

> It's state with infinite lifetime, and an extremely local scope. Just a clarification: it's a state variable, and therefore it exists once per closure clone. Typical uses of it...