|Preferred order of evaluation firstname.lastname@example.org (Nils M. Holm) (1996-09-05)|
|Re: Preferred order of evaluation email@example.com (Jerry Leichter) (1996-09-06)|
|Re: Preferred order of evaluation firstname.lastname@example.org (David L Moore) (1996-09-07)|
|Re: Preferred order of evaluation email@example.com (1996-09-15)|
|Re: Preferred order of evaluation firstname.lastname@example.org (1996-09-15)|
|Re: Preferred order of evaluation email@example.com (1996-09-15)|
|Operator precedence firstname.lastname@example.org (Devon McCormick) (1996-09-17)|
|From:||"Nils M. Holm" <email@example.com>|
|Date:||5 Sep 1996 23:50:13 -0400|
Given a language without any operator precedence, would you prefer
1) evaluation from the left to the right, like a sequence of identical
Operations in C [a - b + c = (a - b) + c]
2) evaluation from the right to the left, like in APL?
[a - b + c = a - (b + c)]
What are the reasons for your choice?
Thanks for your help.
/* Nils M. Holm <firstname.lastname@example.org> */
[It's one of those underwear questions, you like what you're used to. -John]
Return to the
Search the comp.compilers archives again.