Statistics for FORTRAN identifiers and scatter storage techniques
D. Lurié, Carlo E. Vandoni · Software Practice and Experience · 1973
Abstract Statistical data is presented on the distribution of FORTRAN identifiers as a function of length and initial character. The performance of two hash coding algorithms is tested with random probing on a pool of actual FORTRAN identifiers. A significant gain in performance is observed relative to the theoretical case of random keys, which reinforces the case for hash coding for symbol table construction in FORTRAN compilers.