Home > lambdatheultimate > Invertible Syntax Descriptions: Unifying Parsing and Pretty Printing

Invertible Syntax Descriptions: Unifying Parsing and Pretty Printing

January 26th, 2011 01:21 admin Leave a comment Go to comments

In Invertible Syntax Descriptions: Unifying Parsing and Pretty Printing, Rendel Tillmann and Klaus Ostermann at the University of Marburg, Germany apply the “don’t repeat yourself” principle to parsers and pretty printers.

Parsers 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-printer can be described as a single program. Whether a syntactic description is used as a parser or as a pretty-printer is determined by the implementation of the interface. Syntactic descriptions enable programmers to describe the connection between concrete and abstract syntax once and for all, and use these descriptions for parsing or pretty-printing as needed. We also discuss the generalization of our programming technique towards an algebra of partial isomorphisms.

Source: Invertible Syntax Descriptions: Unifying Parsing and Pretty Printing

Related Articles:

  1. Parsing people, unite! Call for position papers for Parsing@SLE (SPLASH, Indianapolis)
  2. Parsing people, unite! Call for position papers for Parsing@SLE (SPLASH, Indianapolis)
  3. Parsing people, unite! Call for position papers for Parsing@SLE (SPLASH, Indianapolis)
  4. Parsing people, unite! Call for position papers for Parsing@SLE (SPLASH, Indianapolis)
  5. Parsing people, unite! Call for position papers for Parsing@SLE (SPLASH, Indianapolis)
blog comments powered by Disqus
YOYOYOOYOYOYO