Register

MadeEasy Test Series: Compiler Design - Parsing

• edited by
538 views
1 votes
1 votes

 

 

 

 

 

The answer is only S2. Why not both s2 and s3..

Someone explain this plz..

• edited by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

4 votes
4 votes
0 answers
2
Mizuki asked Aug 19, 2018
2,595 views
MadeEasy Test Series: Compiler Design - Parsing
Consider the following grammar which is not LL(1) because LL(1) table contain multiple entry for same production. The number of entries have multiple productions in LL(1) table are ________.
Consider the following grammar which is not LL(1) because LL(1) table contain multiple entry for same production.The number of entries have multiple productions in LL(1) ...
User Avatar
0 votes
0 votes
0 answers
3
syncronizing asked Jun 12, 2018
412 views
MadeEasy Test Series: Compiler Design - Parsing
Let G be a grammar with the following productions: If LR(1) parser is used to construct the DFA using the above productions, then how many look-a-heads are present for an item T → .T * F in the initial state ________.
Let G be a grammar with the following productions:If LR(1) parser is used to construct the DFA using the above productions, then how many look-a-heads are present for an ...
User Avatar
1 votes
1 votes
0 answers
4
rahul sharma 5 asked Jan 24, 2018
279 views
MadeEasy Test Series 2018: Compiler Design - Parsing
Consider the following grammar G: The grammar G is A. LL (1) grammar and not LR (0) B. LL (1) and LR (0) C. Not LL (1) but LR (0) D. Neither LL (1) nor LR (0) Here B should be correct option?
Consider the following grammar G:The grammar G isA. LL (1) grammar and not LR (0)B. LL (1) and LR (0)C. Not LL (1) but LR (0)D. Neither LL (1) nor LR (0)Here B should be ...
User Avatar
Link Copied!