Path: csiph.com!newsfeed.hal-mli.net!feeder3.hal-mli.net!newsfeed.hal-mli.net!feeder1.hal-mli.net!news.misty.com!news.iecc.com!.POSTED!nerds-end From: Horst von Brand Newsgroups: comp.compilers Subject: Re: Compiling expressions Date: Mon, 14 Jan 2013 16:31:02 -0300 Organization: Compilers Central Lines: 15 Sender: johnl@iecc.com Approved: comp.compilers@iecc.com Message-ID: <13-01-021@comp.compilers> References: <12-12-035@comp.compilers> <12-12-036@comp.compilers> <13-01-006@comp.compilers> NNTP-Posting-Host: news.iecc.com X-Trace: leila.iecc.com 1358193449 2496 64.57.183.58 (14 Jan 2013 19:57:29 GMT) X-Complaints-To: abuse@iecc.com NNTP-Posting-Date: Mon, 14 Jan 2013 19:57:29 +0000 (UTC) Keywords: parse Posted-Date: 14 Jan 2013 14:57:29 EST X-submission-address: compilers@iecc.com X-moderator-address: compilers-request@iecc.com X-FAQ-and-archives: http://compilers.iecc.com Xref: csiph.com comp.compilers:844 James Harris said: > Compiling expressions is turning out to be more 'interesting' than I > anticipated! My requirements I believe to be fairly generic but they seem > not to be supported by standard algorithms so it's not as simple as it > might be. Your requirements seem to match operator precedence parsing closely. Look at . -- Dr. Horst H. von Brand User #22616 counter.li.org Departamento de Informatica Fono: +56 32 2654431 Universidad Tecnica Federico Santa Maria +56 32 2654239 Casilla 110-V, Valparaiso, Chile 2340000 Fax: +56 32 2797513