no code implementations • 11 Jul 2017 • Joost Engelfriet, Andreas Maletti, Sebastian Maneth
Every multiple context-free tree grammar that is finitely ambiguous can be lexicalized; i. e., it can be transformed into an equivalent one (generating the same tree language) in which each rule of the grammar contains a lexical symbol.