Souza, EduardoVisser, EelcoCleophas, LoekMassink, Mieke2024-01-232024-01-23September978-3-030-67219-5http://hdl.handle.net/1885/311752SDF3 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.application/pdfen-AU© The Author(s) 2020http://creativecommons.org/licenses/by/4.0/Syntax definitionProgramming languageParsing202010.1007/978-3-030-58768-0_12022-10-02Creative Commons Attribution 4.0 International License