Register

MadeEasy Test Series: Compiler Design - Parsing

• edited by
234 views

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

1 votes
1 votes
0 answers
2
muthu kumar asked Nov 15, 2018
536 views
MadeEasy Test Series: Compiler Design - Parsing
The answer is only S2. Why not both s2 and s3.. Someone explain this plz..
The answer is only S2. Why not both s2 and s3..Someone explain this plz..
User Avatar
4 votes
4 votes
0 answers
3
Mizuki asked Aug 19, 2018
2,580 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
4
syncronizing asked Jun 12, 2018
410 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
Link Copied!