Research Output | Dar Al-hikmah Library | IIUM Only
A tree controlled grammar is specified as a pair (G, G′) where G is a context-free grammar and G′ is a regular grammar. Its language consists of all terminal words with a derivation in G such that all levels of the corresponding derivation tree – except the last level – belong to L(G′). We define the nonterminal complexity Var(H) of H = (