closed by
392 views
0 votes
0 votes

closed by

Related questions

2 votes
2 votes
2 answers
1
Subhrangsu asked Apr 16, 2022
8,569 views
Is the following grammar LL(1) ?S→ aABbCD | ϵA→ ASd | ϵB→ Sac| hC | ϵC→ Sf |CgD→ aBD | ϵDraw the LL(1) parsing table for the given grammar.
0 votes
0 votes
1 answer
2
abc1 asked Jan 26, 2019
3,973 views
consider the grammar G: S->A|B A->a|c B->b|c where {S,A,B} are non-terminals,{a,b,c} are terminals.Does LR(1) can parse all strings that are generated by gr...
2 votes
2 votes
1 answer
3
sripo asked Nov 10, 2018
3,180 views
Can you give an example which is not LL(1) but is CLR(1)
1 votes
1 votes
1 answer
4