The Gateway to Computer Science Excellence
0 votes
146 views
Is true..?

 

In an unambiguous grammar every string has exactly one derivation.
in Theory of Computation by (209 points) | 146 views
0
exactly one Leftmost derivation or exactly one Rightmost derivation
0
Thank you:)

1 Answer

+1 vote

true

  ambiguous grammar is a  grammar for which there exists a string that can have more than one leftmost derivation or right most derivation or parse tree,

 unambiguous grammar is a  grammar for which every  string has a unique leftmost derivation or right most derivation or parse tree.

by Boss (35.7k 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,645 questions
56,588 answers
195,788 comments
101,842 users