Question
S → F ⎪ H
F → p ⎪ c
H → d ⎪ c
Which one is true?
S1: All strings generated by G can be parsed with help of LL (1).
S2: All strings generated by G can be parsed with help of LR (1).
a.
Only S1
b.
Only S2
c.
Both S1 S2
d.
None of the mentioned
Posted under Compiler Design
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. Consider the following grammar G. S → F ⎪ H F → p ⎪ c H → d ⎪ c Which one is true? S1: All strings generated by G can be parsed with help of LL (1). S2: All...
Similar Questions
Discover Related MCQs
Q. Consider the following two sets of LR (1) items of an LR (1) grammar.
X -> c.X, c/d
X -> .cX, c/d
X -> .d, c/d
X -> c.X, $
X -> .cX, $
X -> .d, $
Which one is false?
1. Cannot be merged since look ahead’s are different.
2. Can be merged but will result in S-R conflict.
3. Can be merged but will result in R-R conflict.
4. Cannot be merged since goto on c will lead to two different sets.
View solution
Q. Lr parser are attractive because
View solution
Q. Which is the most powerful parser?
View solution
Q. How is the parsing precedence relations defined
View solution
Q. When will the relationship between ‘+’ and ‘-’ be <
View solution
Q. When will the relationship between ‘<’ and ‘>’ be <
View solution
Q. In an absolute loading scheme which loader function is accomplished by assembler
View solution
Q. Shift reduce parser are
View solution
Q. Which of these is true about LR parsing ?
View solution
Q. Which of the following is incorrect for the actions of A LR-Parser I) shift s ii) reduce A->ß iii) Accept iv) reject?
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Compiler Design? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
.png)
