Theory of Computation2080.15 marksConversion of PDA to CFG
How is conversion of PDA to CFG done? Illustrate with example.
How is conversion of PDA to CFG done? Illustrate with example. [5]
Given a Pushdown Automaton (PDA) P = (Q, Σ, Γ, δ, q₀, Z₀, F), we can construct an equivalent Context-Free Grammar (CFG) G = (V, T, R, S). --- For each pair of states (p, q) in the PDA, we create a non-terminal symbol A[p,q], which represents: "All strings that can take the PDA from state p with s...