larr@bucc2.UUCP (09/15/89)
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