Abstract. We describe the design and implementation of a Standard ML of New Jersey library for the interactive pretty-printing of possibly infinite syntax trees. The library handles elision in a novel way, and is implemented using Concurrent ML and the eXene X Window System toolkit. 1 Pretty-printing with Elision In the modern approach to pretty-printing, as developed by Oppen [Opp80] and others [Mik81, MCC86, Hug95, Wad98], and featured in Paulson’s textbook [Pau96], prettyprinting of abstract syntax is a two-stage process: • First, an abstract syntax tree is converted into a pretty-printing tree that abstractly describes how the syntax tree should be formatted. Pretty-printing trees are made up of strings, potential line-break points, and...
The article considers partially formalized text documents. For such documents, it is not possible to...
Abstract. The shapes of binary trees can be encoded as permutations having a very special property. ...
Type systems featuring counting constraints are often stud- ied, but seldom implemented. We describe...
Pretty printing is the task of nicely formatting tree structured data within a given line width limi...
Abstract Pretty printing is the task of nicely formatting tree structured data within a given line w...
An algorithm for prettyprinting using word wrapping is described that is independent of the languag...
There are several purely functional libraries for converting tree structured data into indented text...
AbstractProgrammers working on large software systems are faced with an extremely complex, informati...
The domain-specific language allows for describing problems of a concrete domain, for which the lang...
Parsers and pretty-printers for a language are often quite similar, yet both are typically implement...
Tool builders dealing with many different languages, and language designers require sophisticated pr...
Many metaprogramming tasks, such as refactorings, automated bug fixing, or large-scale software reno...
XP provides efficient and flexible support for pretty printing in Common Lisp. Its single greatest...
Frequently source code analysis tools need to exchange internal representations of abstract syntax t...
We introduce a tree manipulation language, Fast, that over-comes technical limitations of previous t...
The article considers partially formalized text documents. For such documents, it is not possible to...
Abstract. The shapes of binary trees can be encoded as permutations having a very special property. ...
Type systems featuring counting constraints are often stud- ied, but seldom implemented. We describe...
Pretty printing is the task of nicely formatting tree structured data within a given line width limi...
Abstract Pretty printing is the task of nicely formatting tree structured data within a given line w...
An algorithm for prettyprinting using word wrapping is described that is independent of the languag...
There are several purely functional libraries for converting tree structured data into indented text...
AbstractProgrammers working on large software systems are faced with an extremely complex, informati...
The domain-specific language allows for describing problems of a concrete domain, for which the lang...
Parsers and pretty-printers for a language are often quite similar, yet both are typically implement...
Tool builders dealing with many different languages, and language designers require sophisticated pr...
Many metaprogramming tasks, such as refactorings, automated bug fixing, or large-scale software reno...
XP provides efficient and flexible support for pretty printing in Common Lisp. Its single greatest...
Frequently source code analysis tools need to exchange internal representations of abstract syntax t...
We introduce a tree manipulation language, Fast, that over-comes technical limitations of previous t...
The article considers partially formalized text documents. For such documents, it is not possible to...
Abstract. The shapes of binary trees can be encoded as permutations having a very special property. ...
Type systems featuring counting constraints are often stud- ied, but seldom implemented. We describe...