How to Make Arbitrary Grammars Look Like Context-Free Grammars

Normal form theorems which factor arbitrary phrase-structure grammars into context-free grammars and “a little more” are presented. Every phrase-structure grammar is proven equivalent to one in which each production is either context-free or pure erasing. A pda-like machine is shown to characterize the phrase-structure languages.