Parsing and Reflective Printing, Bidirectionally
Language designers usually need to implement parsers and printers. Despite being two intimately related programs, in practice they are often designed separately, and then need to be revised and kept consistent as the language evolves. It will be more convenient if the parser and printer can be unified and developed in one single program, with their consistency guaranteed automatically.
Furthermore, in certain scenarios (like showing compiler optimisation results to the programmer), it is desirable to have a more powerful reflective printer that, when an abstract syntax tree corresponding to a piece of program text is modified, can reflect the modification to the program text while preserving layouts, comments, and syntactic sugar.
To address these needs, we propose a domain-specific language BIYacc, whose programs denote both a parser and a reflective printer for an unambiguous context-free grammar. BIYacc is based on the theory of_bidirectional transformations_, which helps to guarantee by construction that the pairs of parsers and reflective printers generated by BIYacc are consistent. We show that BIYacc is capable of facilitating many tasks such as Pombrio et al.’s ‘‘resugaring’’, language evolution, and refactoring.
Mon 31 Oct Times are displayed in time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
|10:30 - 10:40|
|10:40 - 11:05|
|Parsing and Reflective Printing, Bidirectionally|
Zirun ZhuNational University SOKENDAI, Japan, Yongzhe ZhangNational University SOKENDAI, Japan, Hsiang-Shang ‘Josh’ KoNational Institute of Informatics, Pedro MartinsUniversity of California at Irvine, USA, João SaraivaUniversity of Minho, Portugal, Zhenjiang HuNational University SOKENDAI, JapanDOI
|11:05 - 11:30|
|Taming Context-Sensitive Languages with Principled Stateful Parsing|
Nicolas LaurentUniversité Catholique de Louvain, Belgium, Kim MensUniversité Catholique de Louvain, BelgiumDOI Pre-print
|11:30 - 11:45|
|MetaEdit+ for Collaborative Language Engineering and Language Use (Tool Demo)|
Juha-Pekka TolvanenMetaCase, FinlandDOI Pre-print Media Attached
|11:45 - 12:10|
|Efficient Development of Consistent Projectional Editors using Grammar Cells|
Markus Völteritemis, Germany, Tamás Szabóitemis AG / TU Delft, Sascha Lissonitemis AG, Bernd Kolbitemis AG, Sebastian ErdwegDelft University of Technology, Netherlands, Thorsten BergerChalmers University of Technology, SwedenDOI Pre-print Media Attached