Re: Generating a simple hand-coded like recursive descent parser

Ivan Boldyrev <boldyrev@cgitftp.uiggm.nsc.ru>
23 Dec 2006 13:38:31 -0500

          From comp.compilers
Related articles
[37 earlier articles]
Re: Generating a simple hand-coded like recursive descent parser DrDiettrich1@aol.com (Hans-Peter Diettrich) (2006-12-19)
Re: Generating a simple hand-coded like recursive descent parser walter@bytecraft.com (Walter Banks) (2006-12-19)
Re: Generating a simple hand-coded like recursive descent parser cfc@shell01.TheWorld.com (Chris F Clark) (2006-12-19)
Re: Generating a simple hand-coded like recursive descent parser bobduff@shell01.TheWorld.com (Robert A Duff) (2006-12-22)
Re: Generating a simple hand-coded like recursive descent parser bobduff@shell01.TheWorld.com (Robert A Duff) (2006-12-23)
Re: Generating a simple hand-coded like recursive descent parser DrDiettrich1@aol.com (Hans-Peter Diettrich) (2006-12-23)
Re: Generating a simple hand-coded like recursive descent parser boldyrev@cgitftp.uiggm.nsc.ru (Ivan Boldyrev) (2006-12-23)
| List of all articles for this month |
From: Ivan Boldyrev <boldyrev@cgitftp.uiggm.nsc.ru>
Newsgroups: comp.compilers
Date: 23 Dec 2006 13:38:31 -0500
Organization: this field is intentionally left blank
References: 06-09-029 06-09-042 06-09-048 06-09-060 06-09-078 06-09-093 06-12-064 06-12-066 06-12-071 06-12-089
Keywords: parse, Ada
Posted-Date: 23 Dec 2006 13:38:31 EST
X-Mantra: OM MANI PADME HUM

On 9696 day of my life Robert A. Duff wrote:
> In particular, X(Y) could mean a call to X passing Y as argument,
> or an array indexing (among other things).


Array access may be considered special case of function call. IMHO,
distinction is often not that important until code generation phase.
But at this phase you should know everything about compiled program :)


It is same sort of problem as analyzing a=b+c. Are b and c numbers or
strings (in a language where you can add strings).


One can say that function call expression is overloaded for function
calls and array access. I don't see any problem here.


> For Ada, I can't imagine doing all that with feedback from semantic
> analysis to parser.


You don't need it. Anyway, unlike C, you can parse Y same way each
time.


--
Ivan Boldyrev

Post a followup to this message

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