[Purdue-pm] challenge problem for next meeting?

Mark Daniel Ward mdw at purdue.edu
Wed Jul 29 09:02:56 PDT 2015

Dear Mark,

That's a pretty interesting question (to me, at least), because I study 
retrieval trees in my research, and this is a very closely related 
topic.  I am eager to see what contributions that people make!  I am 
assuming you have an amazing way to do this in Perl 6.


On 7/29/15 10:59 AM, Mark Senn wrote:
> Is there interest in this challenge problem for the next meeting?
> Write back if you'll talk, email, or blog about your solution.
> Given a list of names, for example
>      Abe
>      Alan
>      Ben
>      Cat
>      Cathy
> print a list of all names, shortening them as much
> as possible, with them still remaining unique, like this
>      Ab
>      Abe
>      Al
>      Ala
>      Alan
>      B
>      Be
>      Ben
>      Cat
>      Cath
>      Cathy
> in Perl 5 and Perl 6.
> Read the names from a Perl data section one name per line.
> Do error checking to make sure you aren't given duplicate names.
> Perl 6 has grammars
>      http://doc.perl6.org/language/grammars
> and sets, bags, and mixes:
>      http://doc.perl6.org/language/setbagmix
> -mark
> _______________________________________________
> Purdue-pm mailing list
> Purdue-pm at pm.org
> http://mail.pm.org/mailman/listinfo/purdue-pm

More information about the Purdue-pm mailing list