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.
Original languageEnglish
Pages (from-to)257-265
JournalLecture Notes in Computer Science
Volume8974
DOIs
StatePublished - 2015

    Research areas

  • Pretty-printing, Combinators, Bottom-up rewriting systems

ID: 5770392