Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.compilers > #3063
| From | "Robin Vowels" <robin51@dodo.com.au> |
|---|---|
| Newsgroups | comp.compilers |
| Subject | Re: counted characters in strings |
| Date | 2022-06-10 12:21 +1000 |
| Organization | Compilers Central |
| Message-ID | <22-06-029@comp.compilers> (permalink) |
| References | (3 earlier) <22-06-013@comp.compilers> <22-06-015@comp.compilers> <22-06-019@comp.compilers> <22-06-021@comp.compilers> <22-06-025@comp.compilers> |
From: "gah4" <gah4@u.washington.edu> Subject: Re: counted strings > On Thursday, June 9, 2022 at 9:33:52 AM UTC-7, Hans-Peter Diettrich wrote: > > In any case, if you write your program on a coding form, with > each character in a little box, it is easy to know how many are > in each H constant. Nevertheless, counting the number of characters was a constant source of error. It was easy enough to include the letter 'H' in the character count, sp that the following character became gobbled up in the Hollerith constant, and resulting in weird error messages. When a Hollerith constant was long enough to require a continuation card, it was even easier to lose count; the continuation character in column 6 sometimes being included. And when the Hollerith constant required 133 characters, how many coud reliably count all of them?
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