Many of these features are implemented by means of a normalization to KernelSDF?.
The formalism is supported by an extension of the SLR(0) parsing generation algorithm that is aware of priorities and follow restrictions. The parse tables produced by the parser generator are interpreted by SGLR, an extension of the GLR parsing algorithm that handles reductions with reject productions.
The definition can be found in AFamilyOfSyntaxDefinitionFormalisms? which also appeared in SyntaxDefinitionForLanguagePrototyping.