Question 11788 – Compiler-Design
May 17, 2024Question 12384 – Compiler-Design
May 17, 2024Question 11791 – Compiler-Design
Consider the grammar
S→AS/b A→SA / a then Closure (S’→.S,$) is:
Correct Answer: A
Question 343 Explanation:
The given grammar is
S → AS|b
A → SA|a
Now closure for S →.S, $,
S’ → .S, $
S → .AS|.b, $
A → .SA|.a, a|b
S → .AS|.b, a|b
⇓
S → .S, $
S → .AS|.b, $|a|b
A → .SA|.a, a|b
S → AS|b
A → SA|a
Now closure for S →.S, $,
S’ → .S, $
S → .AS|.b, $
A → .SA|.a, a|b
S → .AS|.b, a|b
⇓
S → .S, $
S → .AS|.b, $|a|b
A → .SA|.a, a|b
S1→.S,$
S→.AS,$ / a/b
S→.b,$/a/b
A→.SA, a/b
A→.a,a /b
S→.AS,$ / a/b
S→.b,$/a/b
A→.SA, a/b
A→.a,a /b
S1→.S,$
S→.AS,$ s/ b
S→.b,$ / b
S→.AS,$ s/ b
S→.b,$ / b
S1→.S,$
S→.AS,$ / a/b
S→.AS,$ / a/b
S→.b,$ / a/b
S→.AS,$ / a/b
S→.AS,$ / a/b
S→.b,$ / a/b
S1→.S,$
S→.AS,$
S→.b,$
S→.AS,$
S→.b,$
Subscribe
Login
0 Comments