Multi-purpose Syntax Definition with SDF3

Luís Eduardo de Souza Amorim, Eelco Visser*

*Corresponding author for this work

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    16 Citations (Scopus)


    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.

    Original languageEnglish
    Title of host publicationSoftware Engineering and Formal Methods - 18th International Conference, SEFM 2020, Proceedings
    EditorsFrank de Boer, Antonio Cerone
    PublisherSpringer Science and Business Media Deutschland GmbH
    Number of pages23
    ISBN (Print)9783030587673
    Publication statusPublished - 2020
    Event18th International Conference on Software Engineering and Formal Methods, SEFM 2020 - Amsterdam, Netherlands
    Duration: 14 Sept 202018 Sept 2020

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume12310 LNCS
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349


    Conference18th International Conference on Software Engineering and Formal Methods, SEFM 2020


    Dive into the research topics of 'Multi-purpose Syntax Definition with SDF3'. Together they form a unique fingerprint.

    Cite this