search
Log In
0 votes
1.5k views

in Compiler Design 1.5k views

1 Answer

0 votes
  $ d e b i h g f a
S             S → B b S → B b S → a A C
A     A → e D            
B             B → g B → f  
C         C → i C → h      
D       D → b E D → ϵ D →ϵ      
E   E → d D E → e D            

Related questions

4 votes
1 answer
1
5.2k views
Consider a Grammar G as follows : $S\rightarrow W$ $W \rightarrow ZXY / XY$ $Y\rightarrow c/\epsilon$ $Z\rightarrow a/d$ $X\rightarrow Xb/\epsilon$ Draw the LL(1) parsing table for the given grammar ? NOTE :- The above grammar is NOT LL(1) .
asked Dec 27, 2016 in Compiler Design Kapil 5.2k views
6 votes
6 answers
2
4.9k views
Every LL(1) grammer is LALR(1) TRUE OR FALSE Every LL(1) grammer is CLR(1) TRUE OR FALSE AS I think 2nd is True and 1st is False if I am wrong please let me correct.
asked Aug 5, 2017 in Compiler Design learner_geek 4.9k views
1 vote
1 answer
3
361 views
To compute FOLLOW(A) for any grammar symbol A a) We must compute FIRST of some grammar symbols. b) No need of computing FIRST of some symbols. c) Maybe compute FIRST of some symbols. d) None of the above. The answer is given as option (A) but if we take start symbol( ... will definitely in FOLLOW(S) and we didn't computed FIRST of any symbol for it. So option (C) should be the answer.
asked Oct 10, 2018 in Compiler Design garvit_vijai 361 views
2 votes
1 answer
4
...