The Gateway to Computer Science Excellence
0 votes
25 views
Consider a Context Free Grammar G

I  -  if G is not Suitable for Top Down  Parser then it is also not suitable for LR parsers Family.

II -  if G is not Suitable for Top Down  Parser then it may work for Operator Precedence parsers.

III- .if G is suitable for  LR parsers Family then it will surely work for Top Down  Parser

a) I and II correct

b) II and III correct.

c) only II correct

d) all are correct
in Compiler Design by Active (1.6k points) | 25 views
0
Is it C?

1 Answer

+1 vote
I THINK ANSWER IS C.

1st condition and 3rd condition false due to left recursive conditions . left recursion no effect on lr grammars where as in top down we got LL(1) which is surely affected by this

2nd condition true as OPERATOR PRECEDENCE PARSER works for ambigous grammar which is not for top down
by Loyal (7.8k points)
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,647 questions
56,479 answers
195,421 comments
100,547 users