Related articles |
---|
Spell checking identifiers johann@myrkraverk.invalid (Johann 'Myrkraverk' Oskarsson) (2020-06-24) |
Re: Spell checking identifiers johann@myrkraverk.invalid (Johann 'Myrkraverk' Oskarsson) (2020-06-24) |
Re: Spell checking identifiers gah4@u.washington.edu (2020-06-23) |
Re: Spell checking identifiers derek@_NOSPAM_knosof.co.uk.invalid (Derek M. Jones) (2020-06-24) |
Re: Spell checking identifiers 937-053-0959@kylheku.com (Kaz Kylheku) (2020-06-24) |
Re: Spell checking identifiers tkoenig@netcologne.de (Thomas Koenig) (2020-06-24) |
Re: Spell checking identifiers gautier_niouzes@hotmail.com (2020-06-24) |
Re: Spell checking identifiers gah4@u.washington.edu (2020-06-24) |
Re: Spell checking identifiers johann@myrkraverk.invalid (Johann 'Myrkraverk' Oskarsson) (2020-06-25) |
Re: Spell checking identifiers johann@myrkraverk.invalid (Johann 'Myrkraverk' Oskarsson) (2020-06-25) |
Re: Spell checking identifiers acolvin@efunct.com (mac) (2020-07-09) |
Re: Spell checking identifiers tkoenig@netcologne.de (Thomas Koenig) (2020-07-10) |
Re: Spell checking identifiers gah4@u.washington.edu (2020-07-10) |
From: | gah4@u.washington.edu |
Newsgroups: | comp.compilers |
Date: | Wed, 24 Jun 2020 18:28:02 -0700 (PDT) |
Organization: | Compilers Central |
References: | 20-06-010 20-06-013 |
Injection-Info: | gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="41925"; mail-complaints-to="abuse@iecc.com" |
Keywords: | lex, errors |
Posted-Date: | 25 Jun 2020 11:54:08 EDT |
In-Reply-To: | 20-06-013 |
On Wednesday, June 24, 2020 at 11:45:44 AM UTC-7, Derek M. Jones wrote:
(snip)
> More than you probably wanted to know:
> http://www.coding-guidelines.com/cbook/sent792.pdf
Interesting.
It seems that the compiler could also suggest when different names
are confusingly similar, other than spelling, or otherwise possibly
confusing to readers. Maybe by how they sound when pronounced.
You might not want J1 and J_one in the same program.
Reminds me that the IBM OS/360 Fortran H compiler, instead of using
a hash table, uses six balanced trees. IBM suggests in one manual
that for faster compilation, one distribute names among the
six lengths. Back in the time when compilation time was more
important than readability.
Return to the
comp.compilers page.
Search the
comp.compilers archives again.