2. [5 Points We discussed a method (on page 7 in Slides PGclass10) that converts any CFG G into a 3-states NPDA M such that L

2. [5 Points We discussed a method (on page 7 in Slides PGclass10) that converts any CFG G into a 3-states NPDA M such that L(G) = L(M). Explain how to modify the method such that whenever A g L(G), the resulting PDA M always USES an symbol at every transition as opposed to having transitions of the form “, a > w” which ignores input input symbol an



Source link

Leave a Reply

Your email address will not be published.