The Gateway to Computer Science Excellence

made easy compiler design theory book [closed]

0 votes
109 views

 

answer is option c

closed with the note: found the answer
in Compiler Design by
closed by | 109 views
0
If a grammar has either two left most derivations or two right most derivations then it is ambiguous but here for any string we get one leftmost derivation and one rightmost derivation. so not ambiguous.

Correct me if I'm wrong.
0
I have the same doubt.
0
what does conflict means here exactly??

1 Answer

0 votes
Best answer
string "aca" can be generated by 2 parse tree..
by
selected by
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
52,345 questions
60,494 answers
201,847 comments
95,305 users