Dan Sugalski wrote: > > I think the first step here is to get the low-level perl operations > defined, and their parrot translations worked out. For this I mean > that we need to have a list of: > > Perl: > a = b + c; > > Parrot: > add a, b, c > > I expect things like the foreach loops to be slightly more difficult. > :) Anyway, with this we're in a good position to do the source > transformations, as well as see where Parrot's still lacking. > (Namespaces and lexical pads, for one, which is on the hit list after > I finish the event stuff)
I'll be a long list. :) Certainly possible. Any preferences on format? > Getting a full grammar worked out is also in order. It's *probably* a > good idea to do it up as a Perl 6 grammar, though given that we don't > have a perl 6 grammar engine yet it might be better to go with > something more traditional and transform it later. You looking for something BNF-ish? > Doing the same for regular expressions (perl 5 and perl 6 styles) is > also in order, though some of that meshes in with the string stuff > we're still fighting over. Is there anything similar already existing for Perl 5 regexen? Allison
