|Parsing questions firstname.lastname@example.org (Rasmus Anthin) (2000-01-06)|
|Parsing Questions email@example.com (Stefan Ewing) (2002-06-13)|
|Re: Parsing Questions firstname.lastname@example.org (Michael J. Fromberger) (2002-06-14)|
|Re: Parsing Questions email@example.com (Ian Wild) (2002-06-14)|
|Re: Parsing Questions firstname.lastname@example.org (Joachim Durchholz) (2002-06-14)|
|Re: Parsing Questions email@example.com (Richard C Bilson) (2002-06-14)|
|Re: Parsing Questions firstname.lastname@example.org (VBDis) (2002-06-14)|
|Re: Parsing Questions email@example.com (Stefan Ewing) (2002-06-17)|
|[1 later articles]|
|From:||"Stefan Ewing" <firstname.lastname@example.org>|
|Date:||13 Jun 2002 21:11:11 -0400|
|Keywords:||C, parse, question|
|Posted-Date:||13 Jun 2002 21:11:10 EDT|
How can the postfix increment/decrement operators in C, C++, and Java
be represented in a parse tree? For example, if we have the
a = b++ + c;
b will be incremented after b + c has been calculated. But the only
place to put the operator (it seems to me) is between "b" and "+".
But doesn't this imply we should increment b *before* adding it to c?
Also, how should one represent the Java field access operator (.) in a
parse tree? At first glance, it seems like a binary operator to me
(given the object name and the field name, a memory address is
returned), but one operator precedence chart I saw online shows . as a
I'd be grateful if anyone could shed any light on these questions.
Return to the
Search the comp.compilers archives again.