The syntax definition formalism SDF—reference manual—

@article{Heering1989TheSD,
  title={The syntax definition formalism SDF—reference manual—},
  author={Jan Heering and P. R. H. Hendriks and Paul Klint and J. Rekers},
  journal={ACM SIGPLAN Notices},
  year={1989},
  volume={24},
  pages={43-75}
}
  • Jan Heering, P. R. H. Hendriks, +1 author J. Rekers
  • Published 1989
  • Computer Science
  • ACM SIGPLAN Notices
  • SDF is a formalism for the definition of syntax which is comparable to BNF in some respects, but has a wider scope in that it also covers the definition of lexical and abstract syntax. Its design and implementation are tailored towards the language designer who wants to develop new languages as well as implement existing ones in a highly interactive manner. It emphasizes compactness of syntax definitions by offering (a) a standard interface between lexical and context-free syntax; (b) a… CONTINUE READING

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 322 CITATIONS

    Label-Based Programming Language Semantics in K Framework with SDF

    • Denis Bogdanas
    • Computer Science
    • 2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
    • 2012
    VIEW 2 EXCERPTS
    CITES METHODS & BACKGROUND

    Grammars As Contracts

    VIEW 2 EXCERPTS
    CITES METHODS

    Generation of abstract programming interfaces from syntax definitions

    VIEW 1 EXCERPT
    CITES METHODS

    HASDF : a generalized LR-parser generator for Haskell

    VIEW 4 EXCERPTS
    CITES METHODS
    HIGHLY INFLUENCED

    MontiCore: a framework for compositional development of domain specific languages

    VIEW 2 EXCERPTS
    CITES BACKGROUND

    FILTER CITATIONS BY YEAR

    1989
    2020

    CITATION STATISTICS

    • 57 Highly Influenced Citations

    • Averaged 7 Citations per year from 2018 through 2020