679 views
0 votes
0 votes
A) $S\rightarrow aA\mid bBa$

    $A\rightarrow bA\mid a$

    $ B\rightarrow aB\mid \varepsilon$

B) $S\rightarrow Aa\mid Bb$

    $ A\rightarrow \varepsilon $

    $ B\rightarrow \varepsilon $

C) $E\rightarrow E+E\mid (E) \mid id$

1 Answer

Related questions

4.4k
views
1 answers
1 votes
radha gogia asked Dec 6, 2015
4,406 views
Top down parsers parse LL(K) grammar ,Now if we talk about recursive descent parsers they just scan each input symbol and then perform their respective function calls , ... where do they see the look-ahead symbols, I am not getting this .
21.5k
views
1 answers
4 votes
Kapil asked Dec 27, 2016
21,473 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) .
3.4k
views
1 answers
2 votes
sripo asked Nov 10, 2018
3,397 views
Can you give an example which is not LL(1) but is CLR(1)