http://www.cs.washington.edu/education/courses/322/96w/handout2/handout2.html Top-Down Construction of PDA from Context-Free Grammar



next up previous
Next: About this document

Top-Down Construction of PDA from Context-Free Grammar

Let . Assume all the productions in P, not of the form , are numbered 1 to m.

The PDA will accept the language generated by G. We need to specify Q and .

The function consists of the following rules:





James Fix
Mon Mar 4 14:26:16 PST 1996