Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.compilers > #3068
| From | drb@msu.edu (Dennis Boone) |
|---|---|
| Newsgroups | comp.compilers |
| Subject | Re: counted characters in strings |
| Date | 2022-06-11 11:09 -0500 |
| Organization | Compilers Central |
| Message-ID | <22-06-036@comp.compilers> (permalink) |
| References | (4 earlier) <22-06-015@comp.compilers> <22-06-019@comp.compilers> <22-06-021@comp.compilers> <22-06-025@comp.compilers> <22-06-029@comp.compilers> |
> And when the Hollerith constant required 133 characters, how many coud > reliably count all of them? Such a long Hollerith string would be uncommon, I think. The main purpose would seem to be headers on a printed report. It appears that the 'T' specifier wasn't available in the early 60s versions of IBM FORTRAN, but it certainly was there in FORTRAN 66. De [Early Fortran mostly read and wrote to tape files so who knows what long strings people might have needed. Either way, I think we've beaten this topic long enough. -John]
Back to comp.compilers | Previous | Next — Previous in thread | Next in thread | Find similar
State-of-the-art algorithms for lexical analysis? Roger L Costello <costello@mitre.org> - 2022-06-05 20:53 +0000
Re: State-of-the-art algorithms for lexical analysis? gah4 <gah4@u.washington.edu> - 2022-06-05 16:05 -0700
Re: State-of-the-art algorithms for lexical analysis? Hans-Peter Diettrich <DrDiettrich1@netscape.net> - 2022-06-06 08:59 +0200
State-of-the-art algorithms for lexical analysis? Christopher F Clark <christopher.f.clark@compiler-resources.com> - 2022-06-06 21:16 +0300
Re: State-of-the-art algorithms for lexical analysis? Hans-Peter Diettrich <DrDiettrich1@netscape.net> - 2022-06-07 06:52 +0200
Re: State-of-the-art algorithms for lexical analysis? Christopher F Clark <christopher.f.clark@compiler-resources.com> - 2022-06-07 19:40 +0300
Re: State-of-the-art algorithms for lexical analysis? Hans-Peter Diettrich <DrDiettrich1@netscape.net> - 2022-06-08 05:32 +0200
Re: counted strings, was State-of-the-art algorithms for lexical analysis? gah4 <gah4@u.washington.edu> - 2022-06-09 11:54 -0700
Re: counted characters in strings "Robin Vowels" <robin51@dodo.com.au> - 2022-06-10 12:21 +1000
Re: counted characters in strings Martin Ward <martin@gkc.org.uk> - 2022-06-11 10:52 +0100
Re: counted characters in strings drb@msu.edu (Dennis Boone) - 2022-06-11 11:09 -0500
Re: State-of-the-art algorithms for lexical analysis? Kaz Kylheku <480-992-1380@kylheku.com> - 2022-06-06 16:00 +0000
References for PSL ? Christopher F Clark <christopher.f.clark@compiler-resources.com> - 2022-06-06 20:11 +0300
csiph-web