Re: Jack W. Crenshaw - Any clues how to optimize ?

> > I am working on simple compiler (currently only a "basic" to x86 asm
> > converter). It is based on the model by Jack W. Crenshaw. (Author of
> > "Let's build a compiler" or something very similar). I am having
> > problems to accept the inefficiency on the expression calculations.


I felt I saw the light when I read Hansons book "The design and
implementation of a retargetable C-compiler" (or something
similar). The expression parser is shockingly short and simple since
it is table driven by operator precedance. The shorter and simpler
the code the easier it is to modify and tweek it. Read that chapter of
his book. (Or am I saying something stupid here: for me "recursive
decent" and "operator precedance" is mutually exclusive. Correct???)


Best wishes


-- Anders Holtsberg
__________________________________________________________________
Anders Holtsberg Matematisk statistik Telefon 046-2224953
andersh@maths.lth.se Matematikcentrum Fax 046-2224998
www.maths.lth.se Lunds universitet Box 118, 221 00 Lund

Return to the comp.compilers page.
Search the comp.compilers archives again.