Ask
Login
0
3.6kviews
Design a PDA corresponding to the grammar S->aSA|E A->bB B->b
written 8.7 years ago by gravatar for teamques10 teamques10 ★ 70k •   modified 3.8 years ago

Mumbai University > Computer Engineering > Sem 4 > Theoretical Computer Science

Marks: 10M

Year: Dec 2016
theory of computation
ADD COMMENT EDIT
1 Answer
1
108views
written 8.7 years ago by gravatar for teamques10 teamques10 ★ 70k

For converting CFG to PDA we will follow following steps

Step1: Convert given grammer to CNF

Step2: The PDA should be designed by initially pushing start symbol. Then immediately perform POP operation

Step3: Then for each production perform corresponding PUSH and POP operation.

S->XA|€

A->bB can be written as

A->YB …

Create a free account to keep reading this post.

and 5 others joined a min ago.

ADD COMMENT EDIT
Please log in to add an answer.