A finite graph model for a context?free language is proposed. The model is called an extended transition system; its nodes encode [pushdown automata state, top stack symbol] pairs and its arcs encode pushdown automaton ...