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-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,97643ec695b9bf73
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 2003-12-11 14:50:02 PST
Path: 
 archiver1.google.com!news2.google.com!newsfeed2.dallas1.level3.net!news.level3.com!news-out.visi.com!petbe.visi.com!skynet.be!freenix!enst.fr!melchior!cuivre.fr.eu.org!melchior.frmug.org!not-for-mail
From: "amado.alves" <amado.alves@netcabo.pt>
Newsgroups: comp.lang.ada
Subject: RE: Word counting
Date: Thu, 11 Dec 2003 22:47:51 -0000
Organization: Cuivre, Argent, Or
Message-ID: <mailman.101.1071182880.31149.comp.lang.ada@ada-france.org>
NNTP-Posting-Host: lovelace.ada-france.org
Mime-Version: 1.0
Content-Type: text/plain;
	charset="iso-8859-1"
Content-Transfer-Encoding: quoted-printable
X-Trace: melchior.cuivre.fr.eu.org 1071182881 4154 80.67.180.195 (11 Dec 2003
 22:48:01 GMT)
X-Complaints-To: usenet@melchior.cuivre.fr.eu.org
NNTP-Posting-Date: Thu, 11 Dec 2003 22:48:01 +0000 (UTC)
To: <comp.lang.ada@ada-france.org>
Return-Path: <amado.alves@netcabo.pt>
X-MimeOLE: Produced By Microsoft Exchange V6.0.6487.1
content-class: urn:content-classes:message
Thread-Topic: Word counting
Thread-Index: AcPANE4d3Wn/0RQvTyi7cd7Mu/IfOgAANtNp
X-OriginalArrivalTime: 11 Dec 2003 22:47:52.0204 (UTC)
	FILETIME=[CF1DBCC0:01C3C038]
X-Virus-Scanned: by amavisd-new-20030616-p5 (Debian) at ada-france.org
X-BeenThere: comp.lang.ada@ada-france.org
X-Mailman-Version: 2.1.3
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: archiver1.google.com comp.lang.ada:3400
Date: 2003-12-11T22:47:51+00:00

(Sorry if this shows up illformatted. Right now I'm limited to a crappy =
webmail system.)

	<<Hello, been following this newsgroup for a few months now and I can
	tell it's a great place for help judging by some of the threads I've
	been reading.>>

=09

	You bet!=20

	<<I'm extremely new to ada after coding in a handful of newer languages
	such as PHP and the like.>>

	Welcome. A warning: there are no ex-Adaists ;-)

	<<I'm trying to read a file of which each sentence consists of a line =
of
	words, separated obviously by one or more blank spaces. I'm trying to
	get it to read these lines of the file and count the number of words
	that have one letter, two letters, and so on, up to a maximum of
	fifteen letters.>>

	<<...
	   type Words_Of_Length is array (Integer range 1 .. 10) of Integer;
	>>

	Shouldn't the upper bound be Max_Words?

	<<
	   while (not End_Of_File) loop
=09
	      Position :=3D 1; -- LOOSE THIS
	      Get_Line(Current_Line,Length);
=09
	      for Position in 1..Length loop
	         if (Current_Line(Position) =3D ' ')  then -- MISSES WORDS AT =
END OF LINE, WHICH ARE NOT FOLLOWED BY SPACE
	            Word_Length(Number) :=3D Word_Length(Number) + 1;
	            Number :=3D Number + 1;
	            Counted_Words :=3D Counted_Words + 1; -- EQUAL TO Number, =
NO?
	         end if;
=09
	            Put(Current_Line(Position));
=09
	      end loop;
	   end loop;
	...>>

	Too many problems so far. Some of logic. Rethink your program. Write in =
pseudo-code first. Or in Pascal. Assume functions like Get_Next_Word. =
We'll flesh them out after. Post the pseudo code, and I'll gladly teach =
you the Ada.