A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. An LALR(1) parser for a grammar G can have shift-reduce (S-R) conflicts if and only if
a. the SLR(1) parser for G has S-R conflicts
b. the LR(1) parser for G has S-R conflicts
c. the LR(0) parser for G has S-R conflicts
d. the LALR(1) parser for G has reduce-reduce conflicts
Answer:the LR(1) parser for G has S-R conflicts

Similar Questions:



View All Questions on: Compiler Design


Start The Conversation: