The Gateway to Computer Science Excellence
+1 vote
An unambiguous grammar has same leftmost and rightmost derivation.

True or False

and how??
in Compiler Design by (19 points)
edited by | 72 views
Ambiguity has no relation with left most and right most derivation.It is true.Every grammer if it has some string then it will have both left and right deravation

1 Answer

0 votes

"An unambiguous grammar has same leftmost and rightmost derivation"

This statement is false, let me take an example, suppose given gammer is (which is certainly unambiguous)

S -> AB
A -> a
B -> b

Suppose our input string is ab

Left Most Derivation
S -> AB -> aB -> ab

Right Most Derivation
S -> AB -> Ab -> ab

Notice Left Most derivation and Right most derivation are not same, still gammer is unambiguous.

Here is the Derivation Tree

by Loyal (7.8k points)
edited by

Related questions

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,737 questions
57,322 answers
105,144 users