Made almost everything in 99-problems run in both niecza and rakudo.

All changes were minor: most were fixes to logic
and a couple to Pod errors.

P08-viklund and P13-viklund:
I couldn't get these to run without completely
altering their code, so I just left them alone.

Author: Ryan Connelly

99-problems/P01-scottp.pl

@@ -31,8 +31,8 @@ (@l)
 # c. Pop like perl5
 #	pop the last element off, which also returns it
 #	say either way
-say <X Y Z>.pop;
-<X Y Z>.pop.say;
+say <X Y Z>.list.pop;
+<X Y Z>.list.pop.say;
 
 
 # ORIGINAL LISP SPECIFICATION
@@ -42,7 +42,7 @@ (@l)
 # vice versa; as a result, this example does not distinguish between a
 # single element and a list containing a single element.
 
-=begin
+=begin pod
 
 =head1 NAME
 
@@ -55,5 +55,5 @@ =head1 LISP
  * (my-last '(a b c d))
  (D)
 
-=end
+=end pod
 

99-problems/P02-scottp.pl

@@ -32,7 +32,7 @@ (@l)
 
 # ORIGINAL LISP SPECIFICATION
 
-=begin
+=begin pod
 
 =head1 NAME
 
@@ -45,5 +45,5 @@ =head1 LISP
  * (my-but-last '(a b c d))
  (C D)
 
-=end
+=end pod
 

99-problems/P03-scottp.pl

@@ -30,7 +30,7 @@ (@l, $n)
 
 # ORIGINAL LISP SPECIFICATION
 
-=begin
+=begin pod
 
 =head1 NAME
 
@@ -44,5 +44,5 @@ =head1 LISP
  * (element-at '(a b c d e) 3)
  C
 
-=end
+=end pod
 

99-problems/P04-scottp.pl

@@ -17,11 +17,11 @@
 
 # ORIGINAL LISP SPECIFICATION
 
-=begin
+=begin pod
 
 =head1 NAME
 
 P04 - Find the number of elements of a list
 
-=end
+=end pod
 

99-problems/P05-scottp.pl

@@ -8,17 +8,17 @@
 # 	.reverse on the object to reverse the order
 # 	.join called to present the data with a " "
 # 	say displays the result
-say <A B C D>.reverse.join(' ');
+say <A B C D>.list.reverse.join(' ');
 
 # b. Perl representation
 #	.perl serialises the data as perl representation (like Data::Dumper in perl5)
 #	.say to display the result (print with a new line)
-<A B C D>.reverse.perl.say;
+<A B C D>.list.reverse.perl.say;
 
-=begin
+=begin pod
 =head1 NAME
 
 P05 - Reverse a list
 
-=end
+=end pod
 

99-problems/P06-scottp.pl

@@ -20,7 +20,7 @@
 
 # ORIGINAL LISP SPECIFICATION
 
-=begin
+=begin pod
 
 =head1 NAME
 
@@ -31,5 +31,5 @@ =head1 LISP
  P06 (*) Find out whether a list is a palindrome.
  A palindrome can be read forward or backward; e.g. (x a m a x).
 
-=end
+=end pod
 

99-problems/P07-eric256.pl

@@ -10,7 +10,7 @@
 
 
 sub splat (@t) { 
-	my @return;
+	my @return = [];
 	for @t -> $i {
 		if ($i.isa(Array)) {
 			@return.push( splat($i) );

99-problems/P08-eric256.pl

@@ -15,6 +15,10 @@ (@in)
 	my @return;
 	my $last;
 	for @in -> $i {
+# The FIRST { } will remove the 'use of uninitialised value of type Any in
+# String context' warning in rakudo, but niecza hasn't implemented it as of
+# Aug 15 2012 so I'll leave it here, but commented out.
+#        FIRST { $last = '' }
 		if ($i ne $last) {
 			@return.push($i);
 			$last = $i;

99-problems/P09-rje.pl

@@ -31,8 +31,8 @@ sub p09
 
    for @in -> $elem
    {
-      push @out, [] if $elem ne @out[-1][0]; 
-      push @out[-1], $elem;
+      push @out, [] if $elem ne @out[*-1][0]; 
+      push @out[*-1], $elem;
    }
    return @out;
 }

99-problems/P09-unobe.pl

@@ -13,7 +13,7 @@
 sub prob09 (@in) {
     return gather while @in.elems {
         my $val = @in[0];
-    	take [gather while @in[0] ~~ $val { take shift @in }];
+    	take [gather while @in.elems and @in[0] ~~ $val { take shift @in }];
     }
 }
 say ~@l;