Canonical scattered context generators of sentences with their parses

Alexander Meduna, Jiří Techet
2007 Theoretical Computer Science  
Scattered context generators derive their sentences followed by the corresponding parses. This paper discusses their two canonical versions, which make this derivation either in a leftmost or rightmost way. It demonstrates that for every recursively enumerable language, L, there exists a canonical scattered context generator whose language consists of L's sentences followed by their parses. In fact, this result is established based on the generators containing no more than six nonterminals.
doi:10.1016/j.tcs.2007.07.044 fatcat:ru775vcgtjgehm3k3nai7qfxae