Statistics for FORTRAN identifiers and scatter storage techniques

Abstract

S t . d 8 t i d data ir premented 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 identifieis. A sigdilcant gain in performance b observed relative to the theoretical case of random keys, which reinforces the cue for h u h coding for symbol table construction in FORTRAN compilers. ~(gy worn Hash coding Symbol table FORTRAN compiler

Comparative lexical analysis of FORTRAN code, code comments and English text

“…Examples of lexical approaches to computer programs can be found in Knuth (1971), Lurie and Vandoni (1973), and Elshoff (1976).…”