Related articles |
---|
Jack W. Crenshaw - Any clues how to optimize ? prinz@c2i.net (XlatB) (1999-04-09) |
Re: Jack W. Crenshaw - Any clues how to optimize ? torbenm@diku.dk (Torben Mogensen) (1999-04-18) |
Re: Jack W. Crenshaw - Any clues how to optimize ? whitten@netcom.com (David Whitten) (1999-04-18) |
Re: Jack W. Crenshaw - Any clues how to optimize ? mallors@ips1.msfc.nasa.gov (1999-04-19) |
Re: Jack W. Crenshaw - Any clues how to optimize ? bill@megahits.com (Bill A.) (1999-04-22) |
Re: Jack W. Crenshaw - Any clues how to optimize ? andersh@maths.lth.se (Anders Holtsberg) (1999-05-03) |
Re: Jack W. Crenshaw - Any clues how to optimize ? mikee@cetasoft.cog (1999-05-07) |
Parsing != (either 'recursive descent' or 'operator precedence') hunk@alpha1.csd.uwm.edu (1999-05-16) |
From: | mikee@cetasoft.cog (Mike Enright) |
Newsgroups: | comp.compilers |
Date: | 7 May 1999 01:14:25 -0400 |
Organization: | CetaSoft (com not cog) |
References: | 99-04-034 99-04-067 99-05-010 |
Keywords: | parse, comment |
On 3 May 1999 14:44:50 -0400, Anders Holtsberg <andersh@maths.lth.se>
wrote:
><[Op precedence parsing more economical than rec. descent]>
> (Or am I saying something stupid here: for me "recursive
>decent" and "operator precedance" is mutually exclusive. Correct???)
>
Not mutually exclusive. I have combined the two (operator precedence
expression parsing within a generally recursive-descent translator).
I'm pretty sure I was just emulating what others did. My one-pass
back-patching byte-code generation was much easier to get right with
operator precedence. With recursive descent it was a pain to have all
the productions doing almost the same things and to revise them when
an optimization came along.
[The original Ritchie C compiler used operator precedence for expressions
and recursive descent for everything else. Worked great, fit in 24K bytes.
Yes, that's a K, not an M. -John]
Return to the
comp.compilers page.
Search the
comp.compilers archives again.