Over the past few months, I have been racking my brain to try and work out how, or even if it is possible to implement tabstops (and I do mean tabstops NOT tables) within lines broken using Knuths line breaking algorithm.
It seems to me that the very nature of the algorithm means that when building a list of boxes, glue and penalties one cannot set a fixed length space that is a known distance from the left margin, rather than a known distance from the previous word.
It is possible with a line by line first fit based libe breaking algorithm, but I cannot see how it is possible with Knuths algorithm.
Any ideas people?