monardo@cshl.org (Pat Monardo) (03/25/91)
Once again Knuth has proven himself to be the great Houdini, able to break the iron shackles of Pascal. I am referring to the new hyphenation code. He stores the tries for all languages in one array, using the "\language" code as the first character in every word to be hyphenated. I suppose this is adequate since a format designer knows what languages will be supported and can easily calculate the required array sizes. However, i have seen comments on alternate implementation stategies mentioned in comp.text.tex. I would like to follow up on work done in this area. Can someone send me information on this topic? I imagine a scheme in which all the hyphenation tries can be stored separately in a hyphenation trie vector and allocated as needed. Problems in Common TeX's new hyphenation functions have been fixed. Problems in the dynamic reallocation of stacks (to avoid memory limits) are being fixed now. But I have received comments on memory management in general which i want to address. I would also like to handle the issues described in the above paragraph. Pat