To comment on the following update, log in, then open the issue: http://www.openoffice.org/issues/show_bug.cgi?id=60584
------- Additional comments from [EMAIL PROTECTED] Tue Jan 24 13:46:46 -0800 2006 ------- I was afraid of an answer "read the code" :-( I cannot understand the code and apparently the wording in the readme is not clear to me. I don't understand what is meant by "finite state machine" and I have problems with the term "transition" as well. Is one of the pattern a transition? And how does a transition "consume" an input letter? I was hoping to get an explanation of the algorithm with some examples, just like Knuth's algorithm is easily explained given the example. It wasn't clear to me that "Theory of the algorithm" explains the OOo-hyphenation mechanism either. I always thought it is a "technical" explanation of Knuth's algorithm. (As I've written, I don't understand the language used therein). It is not obvious that these are different things. ################## So if you don't want / cannot provide an "easy to understand/read" explanation, then please at least add a prominent note that it is not Knuth's algo that is being used, but a rather significant modification that is explained in the "tech-talk" below the description of the TeX-Algorithm. --------------------------------------------------------------------- Please do not reply to this automatically generated notification from Issue Tracker. Please log onto the website and enter your comments. http://qa.openoffice.org/issue_handling/project_issues.html#notification --------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED] --------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
