Difference between revisions of "Synchronous Context-Free Grammars"
From Cohen Courses
Jump to navigationJump to search (Created page with 'This [[category::method]] is a generalization of context-free grammars (CFGs) that generates pairs of related strings instead of single strings. SCFGs are useful in many situatio…') |
|||
| Line 8: | Line 8: | ||
== Relevant Papers == | == Relevant Papers == | ||
| − | {{#ask: [[UsesMethod:: | + | {{#ask: [[UsesMethod::Synchronous Context-Free Grammars]] |
| ?AddressesProblem | | ?AddressesProblem | ||
| ?UsesDataset | | ?UsesDataset | ||
}} | }} | ||
Latest revision as of 09:58, 1 November 2011
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.
