compiler-design-timothy-g-griffin [closed]

Question

Please provide in detail solution step by step 

 

5. Find the FIRST and FOLLOW of the grammar to check whether it is LL (1) parser or not.

    N → AB | BA

    A → a | CAC

    B → b | CBC

    C → a | b

Please provid in detail solution step by step

 

 

 

Comments

please answer my question