Show simple item record

dc.contributor.authorPugh, William W.en_US
dc.contributor.authorSinofsky, Steven J.en_US
dc.date.accessioned2007-04-23T17:17:58Z
dc.date.available2007-04-23T17:17:58Z
dc.date.issued1987-01en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR87-808en_US
dc.identifier.urihttps://hdl.handle.net/1813/6648
dc.description.abstractAn algorithm for prettyprinting using word wrapping is described that is independent of the language being formatted and is substantially simpler than other published algorithms. The algorithm makes use of a simple model with a small set of primitives to direct the prettyprinting of text. For an input string of length $n$, and an output device $m$ characters wide the algorithm runs in $O(n)$ time and requires $O(m)$ space. The algorithm can be restarted from an intermediate point and is therefore well suited for incremental prettyprinting of text. This algorithm is now being used in the Cornell Synthesizer Generator [2]. The algorithm is compared with and contrasted to the previously published algorithm by Oppen [1].en_US
dc.format.extent1415967 bytes
dc.format.extent309422 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleA New Language - Independent Prettyprinting Algorithmen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics