Parsing Questions

"Stefan Ewing" <sewing@uvic.ca>
13 Jun 2002 21:11:11 -0400

          From comp.compilers
Related articles
Parsing questions e8rasmus@etek.chalmers.se (Rasmus Anthin) (2000-01-06)
Parsing Questions sewing@uvic.ca (Stefan Ewing) (2002-06-13)
Re: Parsing Questions sting@linguist.dartmouth.edu (Michael J. Fromberger) (2002-06-14)
Re: Parsing Questions ian@cfmu.eurocontrol.be (Ian Wild) (2002-06-14)
Re: Parsing Questions joachim_d@gmx.de (Joachim Durchholz) (2002-06-14)
Re: Parsing Questions rcbilson@plg2.math.uwaterloo.ca (Richard C Bilson) (2002-06-14)
Re: Parsing Questions vbdis@aol.com (VBDis) (2002-06-14)
Re: Parsing Questions sewing@uvic.ca (Stefan Ewing) (2002-06-17)
[1 later articles]
| List of all articles for this month |
From: "Stefan Ewing" <sewing@uvic.ca>
Newsgroups: comp.compilers
Date: 13 Jun 2002 21:11:11 -0400
Organization: http://groups.google.com/
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
epxression


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
unary operator.


I'd be grateful if anyone could shed any light on these questions.


Stefan Ewing

Post a followup to this message

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