Path: utzoo!attcan!utgpu!jarvis.csri.toronto.edu!mailrus!iuvax!uxc.cso.uiuc.edu!uxc.cso.uiuc.edu!m.cs.uiuc.edu!bucc2!larr
From: larr@bucc2.UUCP
Newsgroups: comp.lang.modula2
Subject: Perfect hashes???
Message-ID: <13400003@bucc2>
Date: 14 Sep 89 21:27:00 GMT
Lines: 12
Nf-ID: #N:bucc2:13400003:000:515
Nf-From: bucc2.UUCP!larr    Sep 14 16:27:00 1989


   I am working on writing an assembler for one of my courses.  The
language I am working in is M-2, and I am wondering if there exists
somewhere in the universe an algorithm for finding perfect hash
functions (miniml or otherwise) for a set of opcodes in which some
opcodes' character strings are permutations of other opcodes character
strings and the algorithm to find this function does not require a phd
in mathematics.  Any help would be greatly appreciated. 

				Larry Schoeneman
				Bradley University