Question 10140 – Theory-of-Computation
December 6, 2023Question 10154 – Theory-of-Computation
December 6, 2023Question 10141 – Theory-of-Computation
The grammar whose productions are
→ if id then → if id then else → id := id
is ambiguous because
Correct Answer: D
Question 16 Explanation:
We have to generate
“if a then if b then c:=d else c:=f”.
Parse tree 1:
Parse tree 2:
“if a then if b then c:=d else c:=f”.
Parse tree 1:
Parse tree 2:
the sentence
if a then if b then c:=d
if a then if b then c:=d
the left most and right most derivations of the sentence
if a then if b then c:=d
give rise top different parse trees
if a then if b then c:=d
give rise top different parse trees
the sentence
if a then if b then c:=d else c:=f
has more than two parse trees
if a then if b then c:=d else c:=f
has more than two parse trees
the sentence
if a then if then c:=d else c:=f
has two parse trees
if a then if then c:=d else c:=f
has two parse trees
Subscribe
Login
0 Comments