Register

MadeEasy Test Series: Compiler Design - Parsing
closed

• closed by
456 views
0 votes
0 votes
closed with the note: image to the question is unavailable.

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 ________.

• closed by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1.5k
views
0 answers
1 votes
Hopealways asked Nov 23, 2018
1,476 views
MadeEasy Test Series: Compiler Design - Parsing
Why ε is not shown in First(S). First(s) does contain ε . And please help me figure out which grammar is this?According to me it is NOT LL(1) (since it is left ... a RR conflict since Follow(X) = Follow(Y) = {a,b}correct me If i'm wrong
User Avatar
589
views
0 answers
1 votes
muthu kumar asked Nov 15, 2018
589 views
MadeEasy Test Series: Compiler Design - Parsing
The answer is only S2. Why not both s2 and s3..Someone explain this plz..
User Avatar
2.7k
views
0 answers
4 votes
Mizuki asked Aug 19, 2018
2,669 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 ________.
User Avatar
293
views
0 answers
1 votes
rahul sharma 5 asked Jan 24, 2018
293 views
MadeEasy Test Series 2018: Compiler Design - Parsing
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 correct option?
User Avatar
Link Copied!