in reply to Parens permutations

If   1 ((2 3)) is valid, then what about   1 (((2 3))) ? If that's valid, then you have a countably infinite number of possible permutations. I kinda doubt the problem is phrased to allow that.


Update: D'oh. So that's what p= means.

Replies are listed 'Best First'.
Re: Re: Parens permutations
by artist (Parson) on Aug 03, 2003 at 01:16 UTC
    Hi dws,
    The number of parens are given. So if p = 2 then 
    1 ((2 3)) => valid 
((1 2 3)) => valid 
1 (((2 3))) => invalid

    artist

[reply]

In Section Seekers of Perl Wisdom