Pretty printing Export

@techreport{citeulike:6101136, abstract = {An algorithm for pretty printing is given. For an input stream of length n and an output device with margin width m, the algorithm requires time O(n) and space O(m). The algorithrn is described in terms of two parallel processes; the first scans the input stream to determine the space required to print logical blocks of tokens; the second uses this information to decide where to break lines of text; the two processes communicate by means of a buffer of size O(m). The algorithm does not wait for the entire stream to be input, but begins printing as soon as it has received a linefull of input. The algorithm is easily implemented.}, address = {Stanford, CA, USA}, author = {Oppen, Derek C.}, citeulike-article-id = {6101136}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=892238}, keywords = {pretty-printer}, posted-at = {2009-11-12 10:28:23}, priority = {2}, publisher = {Stanford University}, title = {Pretty printing}, url = {http://portal.acm.org/citation.cfm?id=892238}, year = {1979} }

TY - RPRT ID - citeulike:6101136 L3 - citeulike-article-id:6101136 N2 - An algorithm for pretty printing is given. For an input stream of length n and an output device with margin width m, the algorithm requires time O(n) and space O(m). The algorithrn is described in terms of two parallel processes; the first scans the input stream to determine the space required to print logical blocks of tokens; the second uses this information to decide where to break lines of text; the two processes communicate by means of a buffer of size O(m). The algorithm does not wait for the entire stream to be input, but begins printing as soon as it has received a linefull of input. The algorithm is easily implemented. AD - Stanford, CA, USA TI - Pretty printing PB - Stanford University KW - pretty-printer AU - Oppen, Derek PY - 1979/// UR - http://portal.acm.org/citation.cfm?id=892238 ER -