Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
A Pretty Expressive Printer
Proceedings of the ACM on Programming Languages (PACMPL), Volume 7, Issue OOPSLA2Article No.: 261, Pages 1122–1149https://doi.org/10.1145/3622837Pretty printers make trade-offs between the expressiveness of their pretty printing language, the optimality objective that they minimize when choosing between different ways to lay out a document, and the performance of their algorithm. This paper ...
- research-articleSeptember 2017
Generic packet descriptions: verified parsing and pretty printing of low-level data
TyDe 2017: Proceedings of the 2nd ACM SIGPLAN International Workshop on Type-Driven DevelopmentPages 30–40https://doi.org/10.1145/3122975.3122979Complex protocols describing the communication or storage of binary data are difficult to describe precisely. This paper presents a collection of data types for describing a binary data formats; the corresponding parser and pretty printer are generated ...
- research-articleSeptember 2010
Invertible syntax descriptions: unifying parsing and pretty printing
Haskell '10: Proceedings of the third ACM Haskell symposium on HaskellPages 1–12https://doi.org/10.1145/1863523.1863525Parsers and pretty-printers for a language are often quite similar, yet both are typically implemented separately, leading to redundancy and potential inconsistency. We propose a new interface of syntactic descriptions, with which both parser and pretty-...
Also Published in:
ACM SIGPLAN Notices: Volume 45 Issue 11