in reply to trees of word lists

Edge cases are important here. Your example has word lists all of the same length. In that the case with your real data as well? If not, can you have the following two lists: 
    @list1 = qw [Truck Car];
    @list2 = qw [Truck Car Byke];

[download]
If you can, how must the resulting structure look time?

Replies are listed 'Best First'.
Re^2: trees of word lists
by Limbic~Region (Chancellor) on Jan 22, 2009 at 20:17 UTC
    JavaFan,
    I agree that edge cases are important here but I think the requirements are very ill defined to even point them out. Is each list to be read from left to right as item 1 is parent to item to which is parent to item 3? Is there any way for a branch to have more than one child in a single list? Does the order of the words matter? I think a lot is implied that should be stated explicitly.

    Cheers - L~R

[reply]

In Section Seekers of Perl Wisdom