Synchronous Context-Free Grammars
From Cohen Courses
This method is a generalization of context-free grammars (CFGs) that generates pairs of related strings instead of single strings. SCFGs are useful in many situations where one might want to specify a recursive relationship between two languages. Originally, they were developed in the late 1960s for programming-language compilation.
