Questions: 1. Consider the given grammar and do the following? (2 MARKS) S aS |...

Transcribed Image Text:

Questions: 1. Consider the given grammar and do the following? (2 MARKS) S à aS | AB A à bA | ε Bà cS | C Càε a. Find FIRST and FOLLOW sets b. Construct Predictive Parsing Table. 2. Consider the following grammar and answer the following? (2 MARKS) Sàs, *A | A A à A₁-B | B B à (S) | digit digit à 3 | 4 | 6 | 7 a. Give the Syntax Directed Translation (SDT) Semantic rules. b. Draw the reduction parse tree to find the S.val for the input 4*(6-3)*7. 3. Remove left recursion from the following grammar? (1.50 MARKS) Q2 Q3 Q4 E à Xx|z X à Ey | w 4. Consider the following NFA table and answer the following? (2.50 MARKS) X y Qo Q1 Φ ||Q1{Q1,Q2}|Q1 Φ |Q3| Q4 Φ a. Draw the transition diagram of NFA b. Make the DFA transition table and draw DFA transition diagram 5. Consider the given grammar is ambiguous or not and find out the following,? (2 MARKS) where the string sentence w-xxxyxqzw T à xYZw Y àYyZz | xx Z àxq | e a. Leftmost and rightmost derivation b. Parse tree Questions: 1. Consider the given grammar and do the following? (2 MARKS) S à aS | AB A à bA | ε Bà cS | C Càε a. Find FIRST and FOLLOW sets b. Construct Predictive Parsing Table. 2. Consider the following grammar and answer the following? (2 MARKS) Sàs, *A | A A à A₁-B | B B à (S) | digit digit à 3 | 4 | 6 | 7 a. Give the Syntax Directed Translation (SDT) Semantic rules. b. Draw the reduction parse tree to find the S.val for the input 4*(6-3)*7. 3. Remove left recursion from the following grammar? (1.50 MARKS) Q2 Q3 Q4 E à Xx|z X à Ey | w 4. Consider the following NFA table and answer the following? (2.50 MARKS) X y Qo Q1 Φ ||Q1{Q1,Q2}|Q1 Φ |Q3| Q4 Φ a. Draw the transition diagram of NFA b. Make the DFA transition table and draw DFA transition diagram 5. Consider the given grammar is ambiguous or not and find out the following,? (2 MARKS) where the string sentence w-xxxyxqzw T à xYZw Y àYyZz | xx Z àxq | e a. Leftmost and rightmost derivation b. Parse tree

Answer rating: 100% (QA)

1 a FIRST sets FIRSTS The FIRST set of S is the set of terminals that can start a string derived from S FIRSTS a b FIRSTA The FIRST set of A is the set of terminals that can start a string derived fro... View the full answer