Re: Is Minimal Perfect Hashing the wrong algorithm?

I guess a lot depends on the kind of language you are compiling. In C
and F77, identification of the symbol is sufficient to continue with
the next stage of parsing. In most larger languages it is not as you
may have many definitions for that one symbol in scope (generic
procedures in F90 and Ada, user defined operators in A68) and the type
equivalence on the parameters (or other additional context) needed to
complete the identification usually makes the symbol look up time
irrelevant (well, as long as you aren't doing a linear search on
strings!).


Regards,
----------------------------------------------------------------------
Dave Lloyd Email: Dave@occl-cam.demon.co.uk
Oxford and Cambridge Compilers Ltd Phone: (44) 1223 572074
55 Brampton Rd, Cambridge CB1 3HJ, UK
--

Return to the comp.compilers page.
Search the comp.compilers archives again.