SDF

Program-Transformation.Org: The Program Transformation Wiki
SDF is a formalism for the definition of the syntax of ProgrammingLanguages and DataFormats. Its features include: a module system, integration of lexical and context-free syntax and priorities. An important aspect of the design is definition of features by normalization to kernel features.

The ScannerlessGeneralizedLR? parser is an adaptation of the GLR parsing algorithm for parsing grammars that define the lexical and context-free syntax of a language. Innovations include handling of priorities, reject productions and follow restrictions. The latter two features are used for lexical disambiguation.

See also


CategoryLanguage | Contributors: EelcoVisser