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.9 required=5.0 tests=BAYES_00,FREEMAIL_FROM,
	MAILING_LIST_MULTI autolearn=unavailable autolearn_force=no
	version=3.4.4
X-Google-Thread: 103376,8de7eedad50552f1
X-Google-Attributes: gid103376,public
X-Google-Language: ENGLISH,ASCII-7-bit
Path: 
 g2news1.google.com!news1.google.com!proxad.net!usenet-fr.net!enst.fr!melchior!cuivre.fr.eu.org!melchior.frmug.org!not-for-mail
From: Marius Amado Alves <amado.alves@netcabo.pt>
Newsgroups: comp.lang.ada
Subject: Re: Ada bench : count words
Date: Tue, 22 Mar 2005 12:53:56 +0000
Organization: Cuivre, Argent, Or
Message-ID: <mailman.50.1111496054.23655.comp.lang.ada@ada-france.org>
References: <ur7ib38sg.fsf@obry.net>
	<pan.2005.03.19.16.57.03.525542@linuxchip.demon.co.uk.uk.uk>
	<87vf7n5njs.fsf@code-hal.de> <umzsy3c8j.fsf@obry.net>
	<423f5813$0$9224$9b4e6d93@newsread4.arcor-online.net>
	<mailman.47.1111454204.23655.comp.lang.ada@ada-france.org>
	<18arnvu705ly4$.1wz6ybz1jt70y$.dlg@40tude.net>
	<mailman.48.1111492666.23655.comp.lang.ada@ada-france.org>
	<1q9cx4jt7802s.k45m6mcntl87$.dlg@40tude.net>
NNTP-Posting-Host: lovelace.ada-france.org
Mime-Version: 1.0 (Apple Message framework v619.2)
Content-Type: text/plain; charset=US-ASCII; format=flowed
Content-Transfer-Encoding: 7bit
X-Trace: melchior.cuivre.fr.eu.org 1111496055 60756 212.85.156.195 (22 Mar
 2005 12:54:15 GMT)
X-Complaints-To: usenet@melchior.cuivre.fr.eu.org
NNTP-Posting-Date: Tue, 22 Mar 2005 12:54:15 +0000 (UTC)
To: comp.lang.ada@ada-france.org
Return-Path: <amado.alves@netcabo.pt>
In-Reply-To: <1q9cx4jt7802s.k45m6mcntl87$.dlg@40tude.net>
X-Mailer: Apple Mail (2.619.2)
X-OriginalArrivalTime: 22 Mar 2005 12:53:56.0798 (UTC)
	FILETIME=[35AB8DE0:01C52EDE]
X-Virus-Scanned: by amavisd-new-20030616-p10 (Debian) at ada-france.org
X-BeenThere: comp.lang.ada@ada-france.org
X-Mailman-Version: 2.1.5
Precedence: list
List-Id: "Gateway to the comp.lang.ada Usenet newsgroup"
	<comp.lang.ada.ada-france.org>
List-Unsubscribe: <http://www.ada-france.org/mailman/listinfo/comp.lang.ada>,
	<mailto:comp.lang.ada-request@ada-france.org?subject=unsubscribe>
List-Post: <mailto:comp.lang.ada@ada-france.org>
List-Help: <mailto:comp.lang.ada-request@ada-france.org?subject=help>
List-Subscribe: <http://www.ada-france.org/mailman/listinfo/comp.lang.ada>,
	<mailto:comp.lang.ada-request@ada-france.org?subject=subscribe>
Xref: g2news1.google.com comp.lang.ada:9727
Date: 2005-03-22T12:53:56+00:00

>>           for I in S'Range loop
>>              if S (I) = EOL then Lines := Lines + 1; end if;
>>              if Is_Separator (S (I)) then
>>                 if In_Word then Finish_Word; end if;
>>              else
>>                 if not In_Word then Start_Word; end if;
>>              end if;
>>           end loop;
>>
>> I have not tried with string matching (if that's what you mean with
>> "FSM")....
>
> No, I meant a finite state machine:

Of course. Well, there is already the little FSM above for the word 
count. I didn't extend the FSM to the whole process because the other 
counts (lines, characters) don't need it (they don't depend on any 
state). And I doubt it would increase speed. But someone should try.

> ... FSM is one of that rare cases where gotos are natural. What a pity 
> that Ada
> does not have arrays of labels! (:-))

Indeed. Usually I use an enumeration for states, and a case statement 
on the state, inside a loop.