Recent research in artificial intelligence has led to AND/OR graphs as a model of problem decomposition (Nilsson [3]; Simon and Lee [4]). However, AND/OR graphs of a restricted type are equivalent to context-free grammars. This can be set-up formally (the beginnings of a formalism of AND/OR graphs is contained in [4]), but the formalism is so obvious that a brief discussion and example suffice.
No takes yet. Share an insight, caveat, or question.
Patrick A. V. Hall (1973) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: