Question: A CNF for F = {w {a, b} | w is a palindrome } is given by the rules: S | AA | BB |
A CNF for F = {w {a, b} | w is a palindrome } is given by the rules:
S | AA | BB | a | b | AT,
U AT | BW | AA | BB | a | b,
T UA,
W UB,
A a,
B b,
where S is the start variable. Suppose M is a PDA that accepts F by simulating the leftmost derivation according to the grammar. Show a path for M to accept abababa. Explain your work.
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
