Related articles |
---|
Problems with Hardware, Languages, and Compilers hrubin@stat.purdue.edu (1997-03-07) |
Re: Definable operators (was: Problems with Hardware, Languages, and C rrogers@cs.washington.edu (1997-03-13) |
Re: Definable operators (was: Problems with Hardware, Languages, and C andy@cs.Stanford.EDU (1997-03-16) |
Re: Definable operators Dik.Winter@cwi.nl (1997-03-18) |
Re: Definable operators fjh@murlibobo.cs.mu.OZ.AU (1997-03-18) |
Re: Definable operators nmm1@cus.cam.ac.uk (1997-03-21) |
Re: Definable operators henry@zoo.toronto.edu (Henry Spencer) (1997-03-22) |
Re: Definable operators nmm1@cus.cam.ac.uk (1997-03-23) |
Re: Definable operators fanf@lspace.org (Tony Finch) (1997-03-23) |
Re: Definable operators Dave@occl-cam.demon.co.uk (Dave Lloyd) (1997-03-27) |
Re: Definable operators henry@zoo.toronto.edu (Henry Spencer) (1997-03-31) |
[35 later articles] |
From: | fjh@murlibobo.cs.mu.OZ.AU (Fergus Henderson) |
Newsgroups: | comp.compilers,comp.lang.misc |
Date: | 18 Mar 1997 13:04:24 -0500 |
Organization: | Comp Sci, University of Melbourne |
References: | 97-03-037 97-03-051 97-03-076 |
Keywords: | design |
andy@cs.Stanford.EDU (Andy Freeman) writes:
>Yes, I think that definiable operators are worse than poorly chosen
>value reference names. Definable operators share the "what is that?"
>property of poorly chosen names, but they also have a "what is it
>operating on?" problem.
In languages such as Haskell and Prolog, which both allow alphabetic
character sequences in operators, there is no reason why operators
need have the "what is that?" property of poorly chosen names.
And the "what is it operating on" problem is usually easily
resolved by looking at the operator declaration.
>Frankly, I see no "large" potential benefits.
Have you ever tried to write a combinator parser without using infix operators?
--
Fergus Henderson <fjh@cs.mu.oz.au>
WWW: <http://www.cs.mu.oz.au/~fjh>
PGP: finger fjh@128.250.37.3
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.