Deutsch   English   Français   Italiano  
<aa770ad25cdcbae657eaf1d07ab09b53@www.novabbs.com>

View for Bookmarking (what is this?)
Look up another Usenet article

Path: ...!eternal-september.org!feeder3.eternal-september.org!i2pn.org!i2pn2.org!.POSTED!not-for-mail
From: zbigniew2011@gmail.com (LIT)
Newsgroups: comp.lang.forth
Subject: Re: Stack vs stackless operation
Date: Mon, 24 Feb 2025 22:41:57 +0000
Organization: novaBBS
Message-ID: <aa770ad25cdcbae657eaf1d07ab09b53@www.novabbs.com>
References: <591e7bf58ebb1f90bd34fba20c730b83@www.novabbs.com> <2025Feb24.225021@mips.complang.tuwien.ac.at>
MIME-Version: 1.0
Content-Type: text/plain; charset=utf-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Info: i2pn2.org;
	logging-data="1628745"; mail-complaints-to="usenet@i2pn2.org";
	posting-account="ovTHZ/VLht/KDF1nKqB7PmGhjiyfUdv/DKd8kGKFjRY";
User-Agent: Rocksolid Light
X-Rslight-Site: $2y$10$PwGYYkBpzJAeyT24syBuO.bLO21e7F7oTi6TEI9VUOCZc5yDAfG92
X-Spam-Checker-Version: SpamAssassin 4.0.0
X-Rslight-Posting-User: 8e58c9b6d1da98b6162b84d03d2307a6516add15
Bytes: 1751
Lines: 21

> Probably because the case where the two operands
> of a + are in memory, and the result is needed
> in memory is not that frequent.

One example could be matrix multiplication.
It's rather trivial but cumbersome operation,
where usually a few transitional variables are
used to maintain clarity of the code.

> I don't think that it would be faster or shorter to use
> memory-to-memory operations here.  That's also why the VAX died: RISCs
> just outperformed it.

Probably "bigger" Forth compilers are indeed
already "too good" for the difference to be
(practically) noticeable — still maybe for
simpler Forths, I mean like the ones for DOS
or even for 8-bit machines it would make sense?
I'll try to do a few checks in the days that'll
follow.

--