Related articles |
---|
Preferred order of evaluation fs29@rumpelkammer.uni-mannheim.de (Nils M. Holm) (1996-09-05) |
Re: Preferred order of evaluation leichter@smarts.com (Jerry Leichter) (1996-09-06) |
Re: Preferred order of evaluation dlmoore@ix.netcom.com (David L Moore) (1996-09-07) |
Re: Preferred order of evaluation ok@cs.rmit.edu.au (1996-09-15) |
Re: Preferred order of evaluation dmoen@mks.com (1996-09-15) |
Re: Preferred order of evaluation gbcacm@ccs.neu.edu (1996-09-15) |
From: | gbcacm@ccs.neu.edu (Peter Sherwood) |
Newsgroups: | comp.compilers |
Date: | 15 Sep 1996 00:42:05 -0400 |
Organization: | College of Computer Science, Northeastern University. |
References: | 96-09-021 96-09-042 |
Keywords: | design |
Jerry Leichter (leichter@smarts.com) wrote:
: MUMPS (now known as M, I guess) uses straight left-to-right evaluation.
: In M, assignment isn't an operator, so doesn't follow the left-to-right
: rule. I've never seen an explanation for M's rule...
The left-to-right evaluation is due to MUMPS' interpretive nature. It's
easiest to evaluate an expression using a single temporary (the accumulator)
with left-to-right precedence. Incidentally, early versions of MUMPS were
unable to cope with some string expressions because of this design.
-----------------------------------------------------------------------------
Peter Sherwood
(617) 332-8880 (voice)
(617) 969-2101 (fax)
gbcacm@ccs.neu.edu
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.