0

Here is my grammar:

E ⇒ T P 
P ⇒ ε 
P ⇒ l T P 
T ⇒ F Q 
Q ⇒ ε 
Q ⇒ F Q 
F ⇒ ( E ) R 
F ⇒ i R
R ⇒ ε 
R ⇒ * R

How can I compute the first and follow sets of these production rules?

rici
  • 234,347
  • 28
  • 237
  • 341
Zakir Ullah Mahsood
  • 1
  • 2
  • You need to show that you have attempted this problem, otherwise your question will be removed. Please visit the [guidelines](https://stackoverflow.com/help/how-to-ask) for more info. – Munib Jan 17 '20 at 20:47
  • Here are a couple of questions with resources to find the algorithm. https://stackoverflow.com/questions/19869163/algorithm-for-computing-first-and-follow-sets-for-context-free-grammars and https://stackoverflow.com/questions/29197332/how-to-find-first-and-follow-sets-of-a-recursive-grammar/29200860#29200860. Search this site and you should find more helpful answers. (You could try a search like `grammar "first set" algorithm`) – rici Jan 17 '20 at 22:19

0 Answers0