Is there any set of rules or methods to convert any context free grammar to a push down automata?
I already found some slides online but I wasn't able to understand them.
In slide 10 he speaks about some rules could anyone explain that?
Asked By : makakas
Best Answer from StackOverflow
Question Source : http://cs.stackexchange.com/questions/11182
Answered By : Hendrik Jan
The actual rules for this construction are given on slide 7 in this presentation. Wikipedia calls these rules "match" and "expand".
The slides you use are from a course by Jeff Ullman it seems. (One of the authors of a famous book on formal languages and automata). He also has prepared an online course on the topic, where I guess he will explain the details himself.
Post a Comment