On Apr 1, 2005 3:13 AM, Niklas Nebel <[EMAIL PROTECTED]> wrote: > Kohei Yoshida wrote: > > With this one, since this is not linear, the linearity test should > > fail. I still don't know wether the linearity test can be done by > > merely changing the cell values. But this seems like the only case > > where the descent parser may be necessary. But again, I may still be > > over-complicating the problem... > > Testing for linearity will be incomplete - you can only try a limited > number of values. But after all, the user did assert the problem was > linear, so why not believe them. > > In return, the formula can then contain table lookups, user-defined > (Basic) functions, add-in functions, you name it, just as long as the > result is linear in relation to the input values. No amount of parsing > will give you that.
Well, I guess you're right. I should probably take this approach then. Thanks for your suggestion, Niklas. BTW, the spirit parser framework of the boost library is pretty cool. I was surprised to see something that advanced available as a library. I will probably use it for all my future text-parsing needs (in C++, that is). Kohei --------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
