Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| [3 earlier articles] |
| State-of-the-art algorithms for lexical analysis? christopher.f.clark@compiler-resources.com (Christopher F Clark) (2022-06-06) |
| Re: State-of-the-art algorithms for lexical analysis? DrDiettrich1@netscape.net (Hans-Peter Diettrich) (2022-06-07) |
| Re: State-of-the-art algorithms for lexical analysis? christopher.f.clark@compiler-resources.com (Christopher F Clark) (2022-06-07) |
| Re: State-of-the-art algorithms for lexical analysis? DrDiettrich1@netscape.net (Hans-Peter Diettrich) (2022-06-08) |
| Re: counted characters in strings robin51@dodo.com.au (Robin Vowels) (2022-06-10) |
| Re: counted characters in strings martin@gkc.org.uk (Martin Ward) (2022-06-11) |
| Re: counted characters in strings drb@msu.edu (2022-06-11) |
| From: | drb@msu.edu (Dennis Boone) |
| Newsgroups: | comp.compilers |
| Date: | Sat, 11 Jun 2022 11:09:11 -0500 |
| Organization: | Compilers Central |
| References: | 22-06-006 22-06-007 22-06-008 22-06-013 22-06-015 22-06-019 22-06-021 22-06-025 22-06-029 |
| Injection-Info: | gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="69116"; mail-complaints-to="abuse@iecc.com" |
| Keywords: | Fortran, history, comment |
| Posted-Date: | 11 Jun 2022 12:53:27 EDT |
> 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]
Return to the
comp.compilers page.
Search the
comp.compilers archives again.