Register

Ambiguity of Grammer

668 views
1 votes
1 votes

 

User Avatar

1 Answer

0 votes
0 votes
For the given question

1st statement is false because power of NFA=power of DFA and both are unambiguous therefore the ambiguity cant be occur due to NFA

2nd statement is that ambiguity of cfg is due to NPDA it could be true because the  power of NPDA is superset of DPDA therefore every cfg is a NPDA can accept the ambiguous  grammar

3rd statement is always true because anyway every regular expression is unambiguous only

it is dependent on language that whether it accepts the ambiguous grammar or not.
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
5 answers
2
Abhishek Malik asked Apr 5, 2018
1,325 views
Finding Handles in a grammer
Total number of Handles for $(w=aa)$ in the following grammar ? $S\rightarrow DT$ $D\rightarrow aa$ $T\rightarrow \epsilon$
Total number of Handles for $(w=aa)$ in the following grammar ?$S\rightarrow DT$$D\rightarrow aa$$T\rightarrow \epsilon$
User Avatar
0 votes
0 votes
0 answers
3
rahul sharma 5 asked Nov 12, 2017
1,131 views
Compiler : LL(k) and LR(k) grammer
Can LL(k) and LR(k) gammer has null and unit productions?
Can LL(k) and LR(k) gammer has null and unit productions?
User Avatar
4 votes
4 votes
3 answers
4
kyrierose asked Jun 13, 2017
29,018 views
LL(1) Grammer
S -> (L) | a L -> L . S | S Question: Make necessary changes to make it suitable for LL(1) parsing and Construct FIRST and FOLLOW sets.
S - (L) | aL - L . S | SQuestion: Make necessary changes to make it suitable for LL(1) parsing and Construct FIRST and FOLLOW sets.
User Avatar
Link Copied!