πŸ“Š Theory of Computation and Compiler Design
Q. Consider the following grammars
(S1) :
A --> aBCD
B --> bc|c
C --> d|∈
D -> b
(S2) :
A --> aBCD
B --> bc|∈
C --> d|c
D -> b
(S3) :
A --> aBCD
B --> bc|∈
C --> d|∈
D -> b
(S4) :
A --> aBCD
B --> bc|c
C --> d|c
D -> b
Which of the following grammar has same follow set for variable B?
  • (A) Only (S1), (S2) and (S3), (S4)
  • (B) Only (S1), (S3) and (S2), (S4)
  • (C) Only (S2), (S3) and (S1), (S4)
  • (D) None of the above
πŸ’¬ Discuss
βœ… Correct Answer: (B) Only (S1), (S3) and (S2), (S4)

You must be Logged in to update hint/solution

πŸ’¬ Discussion

πŸ“Š Question Analytics

πŸ‘οΈ
469
Total Visits
πŸ“½οΈ
2 y ago
Published
πŸŽ–οΈ
Mr. Dubey
Publisher
πŸ“ˆ
91%
Success Rate