Thinker output

[CThinker]

Would not be very elegant IMHO because changing the size of the array would become problematic.

Oh, btw, this string table is not created or updated by hand. It is generated by another program intended for this purpose.

[bob]

Blowing the stack in x86-land is going to take a _big_ set of pushes...

Maybe not, depending on the amount of automatic storage used for each recursive invocation.

The test string

Code: Select all

x = (((((((((((((((((((((((((((((((((((y)))))))))))))))))))))))))))))))))));

written with a sufficient number of parentheses will take out a recursive descent parser. This has been useful for chastising overconfident students in compiler writing courses.

yeah, but the size of the stack is _huge_ and you can easily make it bigger. With a 48 bit virtual address space you can have a few gigs for the stack if you need it.

[Laszlo Gaspar]

Now back to the squre PV array..., in Thinker, the max ply is 128. The square PV array approach would translate to 64K. 32K of that will never be used. For others, its nothing. To me, that's a lot. On a Pocket PC, that may be the difference between running and running out of stack and terminating.

Hi Lance,

You are not connected to maxply, you can limit the pv array to any size.

Code: Select all

if&#40;ply < maxpvply&#41;
&#123;
...
&#125;

Regards,
Laszlo