Re: [Groff] [groff] Formatting algorithm

[Denis M. Wilson]

The method used in TeX is the shortest path in a directed acyclic graph.
This is a well-understood problem. There seems unfortunately to be
nothing useful in the STL. The DAG would need to be a new data type.

The real problem is assigning the values in the DAG. Something of the
sort must already be in Heirloom troff.

As there are no modes in troff, I agree with Peter that new commands to
begin and end a paragraph are required. A careful review of the effect
of any troff command needs to be done, even possibly restricting the
effects of some.

This is the time to introduce shaped paragraphs (also in Heirloom
Troff).

IMHO the KP method *should* be used -- if anyone is going to do
anything at all. It's not going to be me, I'm too old. It's going to be
hard work, bit doable (Gunnar did it).

Time to stop the waffle, find someone prepared to take it on and work
out the nitty-gritty.

Denis

On Fri, 9 May 2014 10:37:14 +0200
Ulrich Lauther <address@hidden> wrote:

> On Thu, May 08, 2014 at 04:17:16PM -0400, Doug McIlroy wrote:
> [...]
> > I fully agree with the first paragraph. However, as there is
> > essentially no limit on the amount (or kind) of path-dependent
> > state that may be needed to calculate each partial solution, I see
> > forking as the easiest way to implement the recipe.
> [...]
> > 
> Thanks for the elaborate discussion of your ideas.
> But a short question: Does TeX use forking for formatting? If not,
> are its results considered unsatisfactory or worse than what we are
> aiming at?
> 
> Kind regards,
> 
>      ulrich
> 


--