Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| [33 earlier articles] |
| Re: Definable operators burley@tweedledumb.cygnus.com (Craig Burley) (1997-05-08) |
| Re: Definable operators burley@tweedledumb.cygnus.com (Craig Burley) (1997-05-08) |
| Re: Definable operators Dave@occl-cam.demon.co.uk (Dave Lloyd) (1997-05-12) |
| Re: Definable operators mfinney@lynchburg.net (1997-05-12) |
| Re: Definable operators burley@tweedledumb.cygnus.com (Craig Burley) (1997-05-13) |
| Re: Definable operators burley@tweedledumb.cygnus.com (Craig Burley) (1997-05-13) |
| Re: Definable operators pjj@cs.man.ac.uk (1997-05-14) |
| Re: Definable operators jkoss@snet.net (1997-05-15) |
| Re: Definable operators genew@vip.net (1997-05-22) |
| Re: Definable operators mfinney@lynchburg.net (1997-05-22) |
| Re: Definable Operators burley@tweedledumb.cygnus.com (Craig Burley) (1997-05-30) |
| From: | pjj@cs.man.ac.uk (Pete Jinks) |
| Newsgroups: | comp.compilers |
| Date: | 14 May 1997 23:56:58 -0400 |
| Organization: | Dept of Computer Science, University of Manchester, U.K. |
| References: | 97-03-037 97-04-164 97-04-169 97-05-151 |
| Keywords: | syntax, design |
<mfinney@lynchburg.net> wrote:
>it has also been shown, that for any set of control structures,
>there are programs which grow exponentially in size when compared to
>the use of another control structure.
...
That's very interesting - can you give any references?
I know that e.g. while/if/call are sufficient but potentially
inefficient, (I suppose while/if are also sufficient, but even more
inefficient) but I thought that if you also had
completers/repeaters/exceptions they were optimally efficient. Maybe
the difference is that I am thinking of the compiled code (or perhaps
of the abstract text) rather than the concrete source text?
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.