I have a question regarding the computation of FOLLOW sets.
Consider the following grammar:
A -> aB | a
B -> bA | b
From the production A -> aB, we have FOLLOW(B) contains FOLLOW(A).
From the production B -> bA, we have FOLLOW(A) contains FOLLOW(B).
This ends up being an infinite loop when I code it. I would appreciate
your suggestions on this.
Thank you.
