Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical
 
PerlMonks  

Re: Favorite Perl 6 feature?

by mirod (Canon)
on Apr 11, 2003 at 09:25 UTC ( #249839=note: print w/ replies, xml ) Need Help??


in reply to Favorite Perl 6 feature?

My favourites:

  • the entire new regexp system, which will allow us to write grammars directly in the language,
  • the type system, which will most likely allow us to reduce the amount of memory used by Perl when needed,
  • wrappers around subroutines (along with temporization), will make testing much easier, it will be possible to write stubs for existing functions,
  • "cute" feature I like the most: the "pipe operator" (==> and <==),
  • and of course Parrot is great idea, I want to be able to use the best ruby/python/brainfuck libraries (OK, maybe not brainfuck ;--)


Comment on Re: Favorite Perl 6 feature?
Re: Re: Favorite Perl 6 feature?
by zby (Vicar) on Apr 11, 2003 at 09:42 UTC
    That's pretty much like me. In the regexp I like that 'closure' property - that you can call code from regexp and the other way. And as for cute operators I like the vector operators. For the last point about Parrot - well Perl libraries are I think the bigest so I believe it will be much more the other way around - ruby/python/brainfuck programmers using Perl libraries.

      Reason: diotalevi Duplicate node. Delete me.

      For more information on this node visit: this

      Regexps are already closures via the ??{ construct. You just can't jump back into regexp because the engine isn't re-entrant (though I hear it works a bit - I seem to fall over all the nasty bits). What I'm really pining for are:

      • Grammars for binary data (P::RD chokes)
      • Being able to locally redefine the language
      • Getting full access to the VM and in a meaningful way since perl5's VM is so clunky to work with
      • Junctions!
      • Lazy pipelining
      • Co-routines

      And I want these not because they're cool but because at various points I could have made my own code simpler, more efficient or had some otherwise significant improvement.

        Grammars for binary data (P::RD chokes)

        I guess preprocessing the input into strings of 1s and 0s isn't (?x: fast | efficient | good ) enough? (Should get around the choke no?)

        ;-)


        ---
        demerphq

        <Elian> And I do take a kind of perverse pleasure in having an OO assembly language...

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://249839]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others scrutinizing the Monastery: (9)
As of 2015-07-07 00:57 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (86 votes), past polls