Register

Made easy mock test question from Compiler Design

172 views

1 Answer

0 votes
0 votes

Here c→ cc will never be terminate this is wrong question. I don’t know how they got the answer.

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

Related questions

967
views
1 answers
0 votes
Souvik33 asked Jan 1, 2023
967 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 are present for the item “X→.Y” and “Z →.id” in the initial state?
User Avatar
321
views
1 answers
2 votes
Sadique Ul Malik asked Nov 20, 2017
321 views
Made Easy Test series Compiler design
S --> aA | CBA --> BaA | ϵB --> bB | Abc | ϵC --> BWhat will be first(B)?
User Avatar
690
views
1 answers
1 votes
vaibhav101 asked Jan 13, 2018
690 views
Compiler Design - Parsing: Is LALR(1) made from the LR(0) or the LR(1) automaton?
According to my understanding, we LALR is constructed by reducing LR(1) automaton states. So I think it should be LR(1)However, we construct SLR(1) items from the LR(0) ... ...) is equal to number of states in LALR(...), how can this be?
User Avatar
362
views
1 answers
0 votes
Vasu_gate2017 asked Dec 14, 2016
362 views
made Easy compiler test q 10
correct answer
User Avatar
Link Copied!