We present a distributed connectionist architecture for parsing context free grammars. It improves earlierattempts in that it is not limited to parse trees of fixed width and height (i e. fixed length sentences). Thememory limitations inherent m connectionist architectures comes out in an inability to parse centerembeddedsentencesKey Words: connectionist parsing, distributed connectionism, context-free grammars.