Re: What can I do?

"Richard Tobin" <richard@[EMAIL PROTECTED]
> wrote in message
news:f3uog3$2nor$1@[EMAIL PROTECTED]
> In article <46627d09$1@[EMAIL PROTECTED]
>,
> Rod Pemberton <do_not_have@[EMAIL PROTECTED]
> wrote:
>
> >> Fixing this would have to change drastically the design of the
> >> compiler. In the other hand leaving this as is would leave a
> >> compiler that can crash in some cir***stances.
>
> >Increasing the stack size would require drastic redesign?
>
> Increasing the stack size might solve this particular example, but a
> bigger program would fail in the same way.
>

There are no alternate methods that won't also fail due to resource
limitations within the compiler without changing the stated problem.  He
must increase storage to solve the problem as stated.  This "solution" is
only effective upto the amount of increased storage.

The two key questions to me are:
1) What is the larrgest condition in the "if" that his customer needs?
i.e., keep the stated problem by fixing the compiler stack size
2) Why can't his customer restructure the logic?  i.e., make a change to
the
stated problem to find an alternate working method


For example, why can't his customer generate code like this?

int fn(int a)
{
         int x=0;

         x&=(a == 6 || a == 7 || a == 4 || a == 67 || a == 78);
         x&=(a == 6 || a == 7 || a == 4 || a == 67 || a == 78);
           /* "(4955 lines exactly the same as above elided)" */
         x&=(a == 6 || a == 7 || a == 4 || a == 67 || a == 78);
         x&=(a == 6 || a == 7 || a == 4 || a == 67 || a == 78);

         if (x)
             return 1;
         return 0;
}


Rod Pemberton