PWC 181

PWC 181

Challenge 1 (Sentence Order)

This challenge asks us to take a given paragraph, and then:

  1. first, break it into sentences, and then
  2. sort the words and punctuation marks in each sentence into alphanumeric order
  3. print the sentences with the sorted word order

Since this task does not need anything from CPAN, I did it using only Perl 4 syntax. I've done this in some earlier challenges. To add a bit of further challenge, I stuck a  use strict on top. Also, I used one single hydra-headed variable to do everything. To be precise, I used just one symbol-table entry,  main::teststring, or in Perl 4 syntax, main'teststring.

Dynamic scope allows some strange things. For example, I locally redefine my &main'teststring subroutine inside the subroutine and then call the redefined subroutine from inside the original (a non-recursive call). A nested subroutine is not really needed here, but hey why not?

I can't be sure that my script would actually work on a Perl 4 interpreter, since I don't have one. My script actually ran on Perl 5.36.0.

Update and disclaimer: These programs will not work on Perl 4 as I discovered later when I found and installed a Perl 4.019 executable. For one thing, the ability to assign a subroutine to a locally scoped typeglob was not available in Perl 4.

It's nice that Perl 5 is so backward compatible that I can run such an archaic script on the latest Perl 5 version, and with use strict turned on to boot.

The gedit syntax highlighting was confused by the old-fashioned syntax, particularly the ' instead of ::. Github too. Atom too. Both emacs and vi were unfazed though.

My Raku script for this task is modern and straightforward. I'll let it speak for itself.

I did not write a Julia script for this challenge. Of course, Julia can do it, as  Robert DiCicco shows here. 

 
Next time there is a task that needs no external libraries, maybe I'll try the opposite extreme and do it with lexical variables only. Strictly interpreted, that means no public subroutines.

Challenge 2 (Hot day)

Challenge 2 provides a text file that lists dates in %Y-%m-%d format, and temperatures on each date. We are asked to read in the file and then print out the dates where the temperature was higher than on the preceding day.

In Perl 5, this is easy with the Date::Manip suite of packages. There are several other date packages, but Date::Manip is  a one-stop shop for anything date-related.  Its OO syntax looks verbose, but I find it easy and intuitive.

In Raku and Julia, this task is also easy with the standard date support, built-in in Raku, and via the Dates standard library module in Julia.

Julia is surprisingly quite a bit slower than both Perl 5 and Raku for this task (runtime is around 0.5 seconds for Perl 5, 1 second for Raku, and 1.3 seconds for Julia).




Comments

Post a Comment

Popular posts from this blog

PWC 258

PWC 258 Last week (#257) I finished challenge 2 and my blog post for challenge 257 late last week, so had only submitted challenge 1. Here is my blog post for PWC 257 , including the full code for my challenge 2 solution. This week, I have done both challenges in perl 4.019 on DOSBOX. Both scripts also work fine on the latest Perl 5.38. I also did the challenges in Raku, where they are one-liners.  Challenge 1 (Count Even Digits Number) We are given a list of integers, and asked to count the number of elements whose base-10 representation has an even number of digits. In Raku , this is a one-liner. Here it is: raku -e 'say +@*ARGS.grep({$_.chars %% 2})' $@ It could be a one-liner in Perl 4 too, but since I run it on DOSBOX, my script would not be a bash shell script. Here is the short subroutine that does the job.  sub count_even_digits {  scalar( grep( ((length($_) % 2) == 0), @_) ); } The full code is here . Challenge 2 (Sum of values) We are given an integer k  and a list in
Read more

PWC 249

PWC 249 Challenge 1 (Equal pairs) We are given a list of integers with an even number of elements. We are asked to check if the list can be completely divided into sub-lists of size 2 with each sub-list containing the same integer repeated, like say (2,2). If so, we are asked to return the list of such sub-lists. This is straightforward in Perl 5. I use modern conveniences this time, though it could be done using only primitive Perl 4 syntax. Here is my subroutine. It returns a list of array references. local *equal_pairs = sub {     #-- return () if input is of odd length     ((scalar(@_) % 2) > 0) && (return ());          #-- count number of occurrences of each element using a hash     local %_ = ();     map {$_{$_}++} @_;          #-- if any element occurs an odd number of times, return ()     (grep {($_{$_} % 2) > 0} keys %_) && (return ());          #-- loop thru %_ keys, returning pairs of such keys     map {         my $k=$_;         my $num_pairs=( ($_{$k}
Read more

PWC 253

PWC 253 I do both challenges this week using old software on DOSBOX: perl 4.019, and for comparison, also python 1.4 beta. My solutions also work on the current versions of Perl 5 (5.38) and Python 2 (2.7.18) respectively. Challenge 1 (Split Strings) Links to code: perl4.019 python1.4b We are given a list of strings, and a single character say sep . We are asked to return the list, with the strings split into component substrings using sep as a separator. We should not include any empty strings in the output. In perl 4, I first stick a backslash in front of the separator character, so that it is escaped if entered in a regex. This is because the perl split function takes a regex as its first argument indicating the separator. If we have a character like '$' or ',', we want to escape it so that it is read literally when parsing the regex. Here is the key subroutine:   sub split_strings {  local ($separator, @words)=@_;  local (@retval)=(); #array to be returned  #  #--
Read more