Re: Add nested-function support in a language the based on a stack-machine

Gene Wirchenko <genew@telus.net>
Mon, 19 Mar 2018 12:50:50 -0700

          From comp.compilers
Related articles
| List of all articles for this month |
From: Gene Wirchenko <genew@telus.net>
Newsgroups: comp.compilers
Date: Mon, 19 Mar 2018 12:50:50 -0700
Organization: A noiseless patient Spider
References: <6effed5e-6c90-f5f4-0c80-a03c61fd2127@gkc.org.uk> 18-03-042 18-03-047 18-03-075
Injection-Info: gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="51091"; mail-complaints-to="abuse@iecc.com"
Keywords: performance, comment
Posted-Date: 20 Mar 2018 07:22:49 EDT

On Mon, 19 Mar 2018 11:04:20 +0000, Martin Ward <martin@gkc.org.uk>
wrote:


[snip]


>Faster machines and larger memories mean that it becomes more
>important to use the best algorithms.


          How does that follow?


          One could argue exactly the opposite as there are resources to
waste.


[snip]


Sincerely,


Gene Wirchenko
[Depends on the algorithms. If they're linear, things are fine,
not so fine if they're O(N^2) or O(2^N) -John]

Post a followup to this message

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