Результаты исследований: Научные публикации в периодических изданиях › статья
Polynomial-Time Optimal Pretty-Printing Combinators with Choice. / Podkopaev, Anton; Boulytchev, Dmitri.
в: Lecture Notes in Computer Science, Том 8974, 2015, стр. 257-265.Результаты исследований: Научные публикации в периодических изданиях › статья
}
TY - JOUR
T1 - Polynomial-Time Optimal Pretty-Printing Combinators with Choice
AU - Podkopaev, Anton
AU - Boulytchev, Dmitri
PY - 2015
Y1 - 2015
N2 - 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.
AB - 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.
KW - Pretty-printing
KW - Combinators
KW - Bottom-up rewriting systems
U2 - 10.1007/978-3-662-46823-4_21
DO - 10.1007/978-3-662-46823-4_21
M3 - Article
VL - 8974
SP - 257
EP - 265
JO - Lecture Notes in Computer Science
JF - Lecture Notes in Computer Science
SN - 0302-9743
ER -
ID: 5770392