From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: *
X-Spam-Status: No, score=2.0 required=5.0 tests=BAYES_00,FORGED_MUA_MOZILLA,
	REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4
X-Google-Thread: 103376,b076e6315fd62dc5
X-Google-NewGroupId: yes
X-Google-Attributes: gida07f3367d7,domainid0,public,usenet
X-Google-Language: ENGLISH,ASCII-7-bit
Received: by 10.68.223.40 with SMTP id qr8mr6874177pbc.0.1336661235975;
        Thu, 10 May 2012 07:47:15 -0700 (PDT)
Path: 
 pr3ni10241pbb.0!nntp.google.com!news2.google.com!goblin2!goblin.stu.neva.ru!aioe.org!.POSTED!not-for-mail
From: "Nasser M. Abbasi" <nma@12000.org>
Newsgroups: comp.lang.ada
Subject: Re: fyi, very interesting Ada paper OOP vs. Readability
Date: Thu, 10 May 2012 09:47:06 -0500
Organization: Aioe.org NNTP Server
Message-ID: <jogkdf$3tf$1@speranza.aioe.org>
References: <jodq5f$j5f$1@speranza.aioe.org> <jof9dq$c46$1@munin.nbi.dk>
 <1fcezxog7qwud.tc9mrhco9t1c$.dlg@40tude.net>
 <4fabcf68$0$9505$9b4e6d93@newsspool1.arcor-online.net>
Reply-To: nma@12000.org
NNTP-Posting-Host: JFgm6aMVwmC/YQNQyUTYRQ.user.speranza.aioe.org
Mime-Version: 1.0
X-Complaints-To: abuse@aioe.org
User-Agent: Mozilla/5.0 (Windows NT 6.1; WOW64;
 rv:12.0) Gecko/20120428 Thunderbird/12.0.1
X-Notice: Filtered by postfilter v. 0.8.2
Content-Type: text/plain; charset=ISO-8859-1; format=flowed
Content-Transfer-Encoding: 7bit
Date: 2012-05-10T09:47:06-05:00
List-Id: <comp.lang.ada>

On 5/10/2012 9:23 AM, Georg Bauhaus wrote:
> On 10.05.12 13:46, Dmitry A. Kazakov wrote:
>> if Standard.Boolean'(Ada.Strings.Unbounded."="(Left =>  My_String,
>>    Right =>  Ada.Strings.Unbounded.To_Unbounded_String
>> (Standard.String'("open")) then
>
>     if Standard."=" (Left =>  Standard.Boolean'
>       (Ada.Strings.Unbounded."=" (Left =>  My_String, Right =>
>       Ada.Strings.Unbounded.To_Unbounded_String
>       (Standard.String'("open")))), Right =>  Standard.True) then

The above made me make this little scale based on what
little I know about some programming languages I've used.

This is my scale of verbosity of a computer language.

On the left is the least verbose, and on the right is
the most verbose. Feel free to edit and add/adjust as
you feel. ofcourse this is all subjective and for fun.


perl   Matlab    pascal PLI  f77    f95  Java cobol
|       |         |      |    |      |     |    |
<-----------------------+------------------------>
  |     |    |       |            |     |    |
  |     c  scala    c++         SNOBOL HTML Ada
  |
Mathematica

I think too verbose is not good. It makes it hard to
understand the algorithm. Also, too cryptic is not
good. There is a sweet spot in the middle somewhere.

--Nasser