Register

Made easy workbook

• edited by
651 views
0 0 votes
Consider the following grammar production.

S -> X
X-> YX | $\epsilon$
Y ->aY |b

Which of the following is not LR(1) item set?

<ol style="list-style-type:upper-alpha"><li>  [S ->X.,\$] </li><li>  [Y ->a.,a |b|\$] </li> <li> [Y-> b.,a |b|\$] </li>  <li> [ Y -> a.Y, a|b|\$] ,[Y * aY,a|b|\$]  </li></ol>

1 Answer

0 0 votes
why can't answer be d?in option d there is no dot at all it is compulsory na before or after terminal so how it is LR(1)?
Voting & Accepting an answer helps improve the community
← Previous · Self DoubtNext → · Random Variable
← Previous in category · made easy test serie...Next in category → · Register Allocation ...
Position:
Show:

Related questions

0 0 votes
1 1 answer
2.4k
2.4k views
Souvik33 asked Jan 1, 2023
2,391 views
Made Easy Textbook Problem | Compiler Design | CLR(1) | Look-a-heads
Let G be any grammar with the following productions:X → X+Y | YY→ Y*Z | ZZ → (X)Z → idIf LR(1) parser is used to parse the above grammar, then total how many look-a-heads...
1 1 vote
0 0 answers
699
699 views
anon1 asked Mar 25, 2025
699 views
Made Easy: Workbook
Find the minimum number of states in DFA that accepts a language where each string starts with 'a' and ends with 'ab' over input (a,b). Please share the solution with DFA...
1 1 vote
1 1 answer
472
472 views
Aman Koli asked Nov 13, 2024
472 views
Made Easy Workbook 2023
If a variable is having Ex-OR operation itself 'n'number of times, then the result is(a) Complement of variable if 'n' is even.(b) Uncomplement of variable if 'n' is even...
0 0 votes
1 1 answer
793
793 views
KrishnaVardhan asked Oct 6, 2024
793 views
Made easy workbook
Q. 55 Suppose that minimum spanning tree of the following edge weighted graph contains the edges with weights $x, y$ and $z$What is the maximum value of $x+y+z$ ?