Register

gateforum
closed

• retagged by
153 views
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
0 answers
1
h4kr asked Nov 19, 2022
333 views
gateforum
User Avatar
1 votes
1 votes
1 answer
2
Prince Sindhiya asked Jan 11, 2019
744 views
Gateforum Test Series: Compiler Design - Parsing
Which of the following is FALSE? (A) LL(k) grammars are context free grammar (B) LL(k) grammars are unambiguous (C) There are LL(k) grammars which are not context free (D) LL(k) grammars cannot have left recursion i marked a answer is given c)
Which of the following is FALSE?(A) LL(k) grammars are context free grammar(B) LL(k) grammars are unambiguous(C) There are LL(k) grammars which are not context free(D) LL...
User Avatar
0 votes
0 votes
0 answers
4
Gupta731 asked Nov 29, 2018
626 views
Gateforum Test Series
Consider the following Grammar G S-->SX|SSb|XS|a X-->a|Xb The number of productions in the grammar(including epsilon production) after removing left recursion is ?
Consider the following Grammar GS >SX|SSb|XS|aX >a|XbThe number of productions in the grammar(including epsilon production) after removing left recursion is ?
User Avatar
Link Copied!