Hierarchical graph decompositions defined by grammars and logical formulas

摘要

A context-free grammar specifies a set of words,and for each of these words one or more derivation trees.Such a tree represents the (or a) hierarchical structure of the corresponding word and is the input of algorithms like those used in a compiler.