0 votes 0 votes S -> A B A -> f S f A -> b b B d B -> Ɛ B -> c First(S) = First(A) = First(B) = Follow(S) = Follow(A) = Follow(B) = Compiler Design first-and-follow compiler-design parsing first-order-logic descriptive + – Ana_101 asked Apr 19 Ana_101 193 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Answers :- First(S) = {b, f} First(A) = {b, f} First(B) = {ɛ, c} Follow(S) = {$, f} Follow(A) = {$, c} Follow(B) = {$, d} manishankarkanrar answered Apr 19 • edited Apr 20 by manishankarkanrar manishankarkanrar comment Share Follow See all 2 Comments See all 2 2 Comments reply Ana_101 commented Apr 19 reply Follow Share Could you explain to me why Follow(S) = {$, f, d}? Based on what I understand (which is very little), it would be: Follow(S) = {$, f}, because "f" is to the right of "S". 0 votes 0 votes manishankarkanrar commented Apr 19 reply Follow Share Follow (S) will be [ Follow(B) UNION {f, $} ] 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes First(S) = {b, f} First(A) = {b, f} First(B) = {ɛ, c} Follow(S) = {$, f} Follow(A) = {$, c,f} Follow(B) = {$, d,f} archiii answered May 24 archiii comment Share Follow See all 0 reply Please log in or register to add a comment.