Synchronous Context-Free Grammars

From Cohen Courses
Revision as of 08:57, 1 November 2011 by Aanavas (talk | contribs) (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…')
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigationJump to search

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.

Definition

Relevant Papers

Retrieved from "http://curtis.ml.cmu.edu/w/courses/index.php?title=Synchronous_Context-Free_Grammars&oldid=9653"