home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!ogicse!das-news.harvard.edu!cantaloupe.srv.cs.cmu.edu!netnews-2.srv.cs.cmu.edu!moss
- From: moss@cs.cmu.edu (Eliot Moss)
- Newsgroups: comp.lang.modula3
- Subject: Re: What is the representation of Text?
- Message-ID: <MOSS.93Jan26224045@CRAFTY.cs.cmu.edu>
- Date: 27 Jan 93 03:40:45 GMT
- Article-I.D.: CRAFTY.MOSS.93Jan26224045
- References: <1993Jan25.230239.45587@slate.mines.colorado.edu>
- <FN00.93Jan26072103@tahoe.gte.com>
- Sender: news@cs.cmu.edu (Usenet News System)
- Reply-To: moss@cs.cmu.edu
- Organization: Dept of Comp and Info Sci, Univ of Mass (Amherst)
- Lines: 19
- In-Reply-To: fn00@gte.com's message of 26 Jan 93 12:21:03 GMT
- Nntp-Posting-Host: crafty.fox.cs.cmu.edu
-
- Farshad is entirely right that the implementation is hidden so that programs
- cannot bypass it and depend on it in that way. Still, it can be useful to
- understand the relative costs of various operations, which tends to vary
- depending on the implementation. I believe that SRC uses C-like strings
- (probably even null terminated), and I am sure that GNU Modula-3 will.
- However, we can always go to something more sophisticated, such as the
- Modula-2+ implementation, which uses a tree of string fragments, which may
- tend to reduce the allocation overhead and the cost of certain operations.
-
- Cheers -- Eliot
- --
-
- J. Eliot B. Moss, Associate Professor Visiting Associate Professor
- Department of Computer Science School of Computer Science
- Lederle Graduate Research Center Carnegie Mellon University
- University of Massachusetts 5000 Forbes Avenue
- Amherst, MA 01003 Pittsburgh, PA 15213-3891
- (413) 545-4206, 545-1249 (fax) (412) 268-6767, 681-5739 (fax)
- Moss@cs.umass.edu Moss@cs.cmu.edu
-