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

First I apologize for the unintended re-post of an age old message. My
Mozilla even sent some deleted messages at the same time :-(


Robert A Duff wrote:


> P.S. Why do you say that the "a = (b)-c;" ambiguity is more practical
> than the "x * y;" ambiguity? They seem like more-or-less the same
> thing, to me: the parser wants to know whether each identifier is a type
> name.


In the case of "x * y;" the context can be used, to determine whether
declarations or expressions can occur at all. Even if both are allowed,
one might argue that the result of a multiplication should be used
somehow, e.g. assigned to a variable.


Not a very strong point, of course, but it leaves room for discussions.
The ambiguity of "a = (b)-c;" is out of question, both interpretations
of "(b)-c" result in a syntactically valid expression.


DoDi

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