What about using a recursive descent parser where each method is one element in your grammar? Not very sophisticated but it may be sufficient.
Regards, Glen ----- Original Message ----- From: "acoliver" <[EMAIL PROTECTED]> To: <[EMAIL PROTECTED]> Sent: Saturday, March 16, 2002 3:49 AM Subject: Re: Re: random Thoughts on Formulotica > I see some algorythm here.. Probably be as much effort for me to translate > it from italian and C as to rewrite it. I can translate text with web tools > and my knowledge of spanish but no chance on source code. > > Anyhow, the only things that we can use that are similar are looking at > gnumeric, but its approach is to use yacc basically thats the summary. > > -Andy > > >On Fri, 15 Mar 2002 17:24:55 0100 "Nicola Ken Barozzi" > <[EMAIL PROTECTED]> wrote. > >From: "Andrew C. Oliver" <[EMAIL PROTECTED]> > > > >> So I've been thinking on how we might implement formulas: > >> > >> two stacks and a list > >> > >> operators operands results > > > >I think that the best thing to do is to reuse available stuff. > > > >Did you check if there are other packages that we can use? > >Did you check if there are other packages that we peek at? > >Do you want my formula algorithm done in C for a project I did some years > >ago for an Excel in Dos? > > > >Attached. It's in Italian, but hey, aren't you the one who likes a > >challenge? ;-) > > > >-- > >Nicola Ken Barozzi [EMAIL PROTECTED] > > - verba volant, scripta manent - > > (discussions get forgotten, just code remains) > >--------------------------------------------------------------------- > > >
