0 votes 0 votes Give full details of the proof of Theorem 7.2 . Theorem 7.2 : If L = L (M) for some npda M, then L is a context-free language. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation pushdown-automata npda + – Naveen Kumar 3 asked Jun 23, 2019 Naveen Kumar 3 291 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.