I had a nice response to this typed up
So you're getting the really short version.
Some things are just plain different. For instance method calls are . rather than ->, you write %foo{$bar} rather than $foo{$bar}, a few operators changed, etc. Most of the changes make the language less surprising for people who are learning it.
Perl regular expressions now have facilities for flexibly capturing lots of information about the match. You also can build them up from small pieces. This has all been carefully designed so that you can write something that looks a lot like a BNF grammar and you'll get a regular expression that actually parses that grammar. (It is only a recursive descent parser though.) These complex regular expressions are known as (surprise, surprise) grammars.
Perl 6's grammar will be a Perl 6 grammar. This grammar will be available to play with, and can be overridden on the fly (this is the upside of a recursive descent parser - you can play these games). This is expected to replace the games that (some) people play today with source filters.
There are many small improvements. For instance:
\n# multi-way comparisons now work\nif (1 < $x < 10) {\n ...\n}\n\n# Sometimes you don't need parens where you once did.\nif 1 < $x < 10 {\n ...\n}\n\n# I used it, but didn't point out that this is the\n# "TBD" operator. It is legal Perl but throws an\n# exception if it executes.\n...\n\n# The print here syntax has some new tricks.\n print <<EOT;\n And we write some text here using the\n "print here" syntax. Note that leading\n whitespace will be stripped to the EOT\n marker, letting us maintain code indentation\n but easily output a block of text that isn't\n indented.\n EOT\n\n# Pipelines let us write code top to bottom where\n# previously it was bottom to top. Compare a\n# Schwartzian transform in Perl 5:\nmy @shortest_first # 5\n = map { $_->[0] } # 4\n sort { $a->[1] <=> $b->[1] } # 3\n map { [ $_, $_->height ] } # 2\n @animals; # 1\n# with one in Perl 6:\n@animals # 1\n ==> map { [ $_, .height ] } # 2\n ==> sort { $^a[1] <=> $^b[1] } # 3\n ==> map { $_[0] } # 4\n ==> my @shortest_first; # 5\n\n# Junctions let you write code like this:\nif any(@these) > all(@those) {\n print "These have the largest element\\n";\n}\nPerl 6 has a much richer object system. It adds lots of goodies for those who like functional programming. Named arguments to functions. And a swarm of smaller improvements.
Cheers,
Ben
