[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [Groff] [groff] Formatting algorithm
From: |
Ulrich Lauther |
Subject: |
Re: [Groff] [groff] Formatting algorithm |
Date: |
Fri, 9 May 2014 10:37:14 +0200 |
User-agent: |
Mutt/1.5.23 (2014-03-12) |
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