[plt-scheme] Re: typo error 11.2.2

when one arrives at n = 0 during the recursive process
(cond
   ((zero? n) (cons (make-posn 0 (f 0)) empty)
   (else (cons (make-posn n (f n) (tabulate-f (sub1 n))))
 in this scenario we have n+1 posn structures in the list. I guesss
this problem can be equally interpreted
in 2 ways: firstly tabulate returns empty  when n=0 or
one can also infer the above from the problem statement.
mike

On Mar 28, 10:23 am, Matthias Felleisen <matth... at ccs.neu.edu> wrote:
> Is this true if f returns empty for 0?
>
> On Mar 28, 2009, at 12:39 AM, mike wrote:
>
> > Develop the function......Specifically it consumes
> > a natural number and produces a list of  n posns.
> > (since  0 is included in the recursion i believe it
> > should state "a list of n+1 posns"
> > mike
> > _________________________________________________
> >   For list-related administrative tasks:
> >  http://list.cs.brown.edu/mailman/listinfo/plt-scheme
>
> _________________________________________________
>   For list-related administrative tasks:
>  http://list.cs.brown.edu/mailman/listinfo/plt-scheme