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.

PAST Pattern Matching

Last Wednesday, I discussed a little bit of the rationale behind my GSoC project and summarized the most low-level portion of my project: PAST::Walker. Today, I want to describe another portion of my project: PAST::Pattern. PAST::Walker provides a very powerful and complete interface. Any possible transformation or other traversal of a PAST should be implementable using it. However, it will not be very convenient if you only want to turn return nodes containing only a call node into tail-call nodes.

Instrumenting Parrot

Having an instrumentation framework opens the doors to having many different tools that can help to diagnose problems within a piece of code. One main example of this is Valgrind. Valgrind provides an interface for making many different tools that help to diagnose and identify certain specific problems, ranging from memory leaks to multithreaded data races between threads. Furthermore, the framework is also used to provide profiling tools, such as Callgrind and Cachegrind, to determine useful information such as call graphs and execution times of functions.

Encodings, charsets and how NFG fits in there.

The post from last week talked about what NFG was and tried to explain how it was a good feature for parrot to have. Today I'll be slightly more concrete and talk a bit about how NFG fits inside the parrot string structure. There's other parts of parrot that will need hacking on, but this time I want to limit myself to the the two bottommost pointers in the STRING structure definition and the concepts behind them.

Hybrid Threads

Threading systems let multiple code paths run at the same time. Why would anyone want that? Simple: impatience. It's no fun waiting for the computer to finish one thing when you want it to be doing something else.

So what are "hybrid" threads and why does Parrot need them? Well, there are two common schools of thought in building threading systems for high level language runtimes. The Java people call them "green" threads and "native" threads. As with any design tradeoff the right answer is to cheat and just take all the good properties of both options.

PAST Optimization

One of the advantages of a common virtual machine for various languages is the ability to apply the same optimizations to all of those languages. For example, LLVM includes optimization passes to propagate constants, eliminate dead arguments, code, and globals, inline functions, and eliminate recursive tail calls, among others. Any language with a compiler to LLVM can easily take advantage of these optimizations without any additional work by the compiler writer.

What is NFG and why you want Parrot to have it.

The Grapheme Normal Form for Unicode (or NFG as we like to call it) has been specified as a feature parrot wants for a long time, it's been in the Parrot Design Document for strings since before I had a commit bit, or any involvement in the project come to that. Something that has gone that long unimplemented can't be that important, right? I mean, we clearly have survived without it. Turns out it is important, but it takes some background to realize why.

Parrot Foundation Announces Accepted Students in Google Summer of Code™ Program

Seattle, WA — April 26, 2010  Parrot Foundation is pleased to announce the acceptance of five student proposals for projects relating to the Parrot Virtual Machine in the 2010 Google Summer of Code program.

parrot-users list created!

The parrot-users mailing list is now available; if you are a language author targeting parrot and have questions or need assistance, please sign up at http://lists.parrot.org/mailman/listinfo/parrot-users.

You can also follow the group via google at http://groups.google.com/group/parrot-users

"Parrot is a virtual machine designed to efficiently compile and
execute bytecode for dynamic languages. This mailing list is for
general users of Parrot and languages running on Parrot."

Straw poll: Which version control system would you like Parrot to use? (Just a straw poll, not a commitment to change anything)

SVN (Current)
30% (8 votes)
CVS
0% (0 votes)
Git
70% (19 votes)
Mercurial
0% (0 votes)
Bazaar
0% (0 votes)
Total votes: 27

2009 Members' Meeting Minutes

The Parrot Foundation held its annual members' meeting on August 25th, 2009 at 2pm Pacific time in Seattle, Washington, USA. Jerry Gay presided over the meeting. Allison Randal prepared these minutes.

Syndicate content