Please clarify: Right-to-left or left-to-right?

Please clarify: Right-to-left or left-to-right?

Imagen de john_e_lilley
john_e_lilley
Mar, 14/06/2011 - 06:56

Here http://software.intel.com/en-us/forums/showpost.php?p=152354
Rama said "right to left" as the default operator order. Did he really mean "left to right"? Right-to-left is terribly non-standard and unintuitive, but if that's the spec, then that's the spec. For example consider: 15 + 15 / 3 l-t-r = 10 r-t-l = 20

RSS Superior
publicaciones de 8 / 0 nuevos
Último envío
Para obtener más información sobre las optimizaciones del compilador, consulte el aviso sobre la optimización.
Imagen de 邓辉
邓辉
Mar, 14/06/2011 - 10:39

I think, left to right More reasonable.

写字楼里写字间,写字间里程序员 程序人员写程序,又拿程序换酒钱 酒醒只在网上坐,酒醉还来网下眠 酒醉酒醒日复日,网上网下年复年
Superior
Imagen de Rama Kishan Malladi (Intel)
Rama Kishan Malladi (Intel)
Mié, 15/06/2011 - 09:21

Hi,
I agree left toright might be sensible and easy to implement if it may. But given that we are 12 days to the closing of problem set 3 (June 27), I would want to do minimal changes to the problem statement unless really required.

Thanks
-Rama

Superior
Imagen de 邓辉
邓辉
Mié, 15/06/2011 - 09:41

thans Rama

If the definition of priority * /" > " - + ".

then the Right-to-left Poland expression can be more easily .

Now my output is: 20.0000000000

写字楼里写字间,写字间里程序员 程序人员写程序,又拿程序换酒钱 酒醒只在网上坐,酒醉还来网下眠 酒醉酒醒日复日,网上网下年复年
Superior
Imagen de john_e_lilley
john_e_lilley
Mié, 15/06/2011 - 11:13

Rama, Please, just say which it is. I thinkyou mean that we'll stick with the original "right to left" statement. john

Superior
Imagen de Rama Kishan Malladi (Intel)
Rama Kishan Malladi (Intel)
Mié, 15/06/2011 - 12:30

Hi,
Yes, I mean that we will stick with the original "right to left".

Thanks
-Rama

Superior
Imagen de DweeberlyLoom
DweeberlyLoom
Jue, 16/06/2011 - 19:15

that's my head exploding :-D Thanks for the clarification.

Superior
Imagen de john_e_lilley
john_e_lilley
Jue, 16/06/2011 - 19:48
Let me help. This is not that hard, at least for recursive-descent: LTR: ParseExpr() { expr = ParseAtomic(); while (token is binaryop) { expr = MakeBinaryExpr(token, expr, ParseAtomic()); } } RTL: ParseExpr() { expr = ParseAtomic(); if (token is binaryop) { expr = MakeBinaryExpr(token, expr, ParseExpr()); } }

Superior

Inicie sesión para dejar un comentario.