In Section 2 we introduce some preliminary definitions, followed in Section 3 by a first algorithm based on CKY parsing.
to give a few examples, in some natural language generation systems (Langkilde, 2000) nonrecursive CFGs are used to encode very large sets of candidate sentences realizing some input conceptual representation (Langkilde calls such grammars forests).