It can express the entire range of context-free grammars.
[1] A parser and parser generator for SDF specifications are provided as part of the free ASF+SDF Meta Environment.
These operate using the SGLR (Scannerless GLR parser).
Features of SDF: The following example defines a simple Boolean expression syntax in SDF2:
This computer science article is a stub.