Question: 1} Q2: Write> Construct PDA machines that will accept the following languages on {a, b} 2 Marks (a) L= {ab:n> 1} Q2: Write a CFG
1} Q2: Write">
Construct PDA machines that will accept the following languages on {a, b} 2 Marks (a) L= {ab":n> 1} Q2: Write a CFG grammar for the following languages: 2 Marks L(G) = {abcd2 | n20, m>0} Q3: Explain ambiguity in the Grammar concept with an example. 1 Mark Construct PDA machines that will accept the following languages on {a, b} 2 Marks (a) L= {ab":n> 1} Q2: Write a CFG grammar for the following languages: 2 Marks L(G) = {abcd2 | n20, m>0} Q3: Explain ambiguity in the Grammar concept with an example. 1 Mark
Step by Step Solution
There are 3 Steps involved in it
2 a L a6m n 1 907 an bn a POL for L State transition diagram alalaa 9 20 I... View full answer
Get step-by-step solutions from verified subject matter experts
