Context-free grammars with graph-controlled tables

摘要

Variations of programmed grammars, where control is imposed over sets of productions rather than over single productions, are studied. This corresponds to the notion of tables in the theory of L systems. The two variations of graph controduced correspond to programmed grammars with empty failure fields and those with unconditional transfer. Also some results concerning programmed grammars in their traditional form are obtained.