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=-0.3 required=5.0 tests=BAYES_00, REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,1cf653444208df72 X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2001-10-03 23:22:23 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!headwall.stanford.edu!unlnews.unl.edu!newsfeed.ksu.edu!nntp.ksu.edu!news.okstate.edu!not-for-mail From: David Starner Newsgroups: comp.lang.ada Subject: Re: ada vs. cpp Date: 4 Oct 2001 05:13:44 GMT Organization: Oklahoma State University Message-ID: <9pgr68$7pu1@news.cis.okstate.edu> References: Reply-To: dstarner98@aasaa.ofe.org NNTP-Posting-Host: x8b4e53d2.dhcp.okstate.edu User-Agent: slrn/0.9.7.2 (Linux) Xref: archiver1.google.com comp.lang.ada:13705 Date: 2001-10-04T05:13:44+00:00 List-Id: On Thu, 4 Oct 2001 01:08:42 -0400, Pi wrote: > Remember that Ada is at his very best if you give him few > input, billions of calculations on numbers and than few output. "her" very best. I guess it's very debatable, though . . . > You say that it's text-based. > Do you have to parse the text-input? > In this case I would consider using Perl[1] for the parsing > and than the actual treatement in Ada. > (Strings aren't Ada's strength) Strings aren't Ada's strength, but Ada isn't terribly weak in strings. I don't see any problem in parsing the input using Ada. -- David Starner - dstarner98@aasaa.ofe.org Pointless website: http://dvdeug.dhis.org "I saw a daemon stare into my face, and an angel touch my breast; each one softly calls my name . . . the daemon scares me less." - "Disciple", Stuart Davis