• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

Article

Polynomial-Time Optimal Pretty-Printing Combinators with Choice

Lecture Notes in Computer Science. 2015. Vol. 8974. P. 257-265.
Podkopaev A., Булычев Д. Ю.

We describe pretty-printing combinators with choice which provide optimal document layout in polynomial time. Bottom-up tree rewriting and dynamic programming (BURS) is used to calculate a set of possible layouts for a given output width. We also present the results of suggested approach evaluation and discuss its application for the implementation of pretty-printers.