Multi-purpose Syntax Definition with SDF3

Multi-purpose Syntax Definition with SDF3

de Souza Amorim, L.E. (Australian National University)
Visser, Eelco (TU Delft Programming Languages)

de Boer, Frank (editor)
Cerone, Antonio (editor)

2020

SDF3 is a syntax definition formalism that extends plain context-free grammars with features such as constructor declarations, declarative disambiguation rules, character-level grammars, permissive syntax, layout constraints, formatting templates, placeholder syntax, and modular composition. These features support the multi-purpose interpretation of syntax definitions, including derivation of type schemas for abstract syntax tree representations, scannerless generalized parsing of the full class of context-free grammars, error recovery, layout-sensitive parsing, parenthesization and formatting, and syntactic completion. This paper gives a high level overview of SDF3 by means of examples and provides a guide to the literature for further details.

Parsing
Programming language
Syntax definition

http://resolver.tudelft.nl/uuid:9ca9558a-cf08-4f46-8d2b-634d15c98a31

https://doi.org/10.1007/978-3-030-58768-0_1

Springer, Cham

978-3-030-58767-3

Software Engineering and Formal Methods: 18th International Conference, SEFM 2020, Proceedings, 12310

18th International Conference on Software Engineering and Formal Methods, SEFM 2020, 2020-09-14 → 2020-09-18, Amsterdam, Netherlands

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 0302-9743, 12310

Institutional Repository

conference paper

© 2020 L.E. de Souza Amorim, Eelco Visser