Dark Mode

Recent questions tagged inherently-ambiguous

0 votes

0 answers

1

Peter Linz Edition 4 Exercise 7.4 Question 7 (Page No. 204)
Show that a deterministic context-free language is never inherently ambiguous.

Naveen Kumar 3 asked in Theory of Computation Jun 25, 2019

by Naveen Kumar 3

222 views

0 votes

0 answers

2

Michael Sipser Edition 3 Exercise 2 Question 29 (Page No. 157)
Show that the language $A=\{a^{i}b^{j}c^{k}\mid i=j$ $\text{or}$ $ j=k$ $\text{where}$ $ i,j,k\geq 0\}$ is inherently ambiguous$.$

admin asked in Theory of Computation May 4, 2019

by admin

206 views

0 votes

0 answers

3

Peter Linz Edition 4 Exercise 5.2 Question 12 (Page No. 145)
Show that the language $L =$ {$ww^R : w ∈$ {$a,b$}$^*$} is not inherently ambiguous.

Naveen Kumar 3 asked in Theory of Computation Apr 14, 2019

by Naveen Kumar 3

145 views

0 votes

0 answers

4

Peter Linz Edition 4 Exercise 5.2 Question 9 (Page No. 145)
Show that a regular language cannot be inherently ambiguous.

Naveen Kumar 3 asked in Theory of Computation Apr 14, 2019

by Naveen Kumar 3

178 views

0 votes

1 answer

5

Regular Language and Ambiguity
For every regular grammar, we can always have an unambigious grammar?

smsubham asked in Theory of Computation Oct 28, 2018

450 views

–1 vote

1 answer

6

Non inherently ambiguous

Na462 asked in Theory of Computation Sep 2, 2018

by Na462

1.2k views

0 votes

0 answers

7

Peter Linz Edition 4 Example 5.13 (Page No. 144)
Consider the language $L = \{a^nb^nc^m\}U \{a^nb^mc^m\}$ with $n$ and $m$ nonnegative. Which of the following options is correct? There is no context free grammar possible for $L$. There exists a simple grammar for $L$. There exists an unambiguous grammar for $L$. There exists an ambiguous grammar for $L$.

tarun_svbk asked in Theory of Computation Feb 24, 2018

319 views

1 vote

1 answer

8

#doubt
Which of the following statement/s is/are false for the following language: $L = \{a^m b^n c^q \mid m = n \text{ or } n = q, m > 0, n > 0, q > 0\}$ S1: The language can be parsed by any LR(K) parsers for any value of K. S2: The language cannot be recognized by deterministic PDA. Only S2 Only S1 Both S1 and S2 Neither S1 nor S2

abhijeet pandey asked in Compiler Design Dec 5, 2017

by abhijeet pandey

819 views

0 votes

1 answer

9

Inherited Language confusion
How is it opt C and not opt A ?

Parshu gate asked in Compiler Design Nov 18, 2017

572 views

1 vote

0 answers

10

Inherently Ambiguous Grammar
Is every language that is generated by a NDCFG (Non Deterministic Context Free Grammar) , CSG (Context Sensitive Grammar) and Unrestricted Grammar inherently ambiguous ? I think so because they dont have a DPDA accepting that language. And as far as I ... there are no "parse trees" as such. So how do I determine if the language is inherently ambiguous or not?

humblefool asked in Theory of Computation Nov 17, 2017

1.4k views

0 votes

0 answers

11

Self Doubt
By seeing a grammar I can say it is ambiguous or not. But How can I say it is inherently ambiguous or not.?

Lucky sunda asked in Theory of Computation Jan 22, 2017

759 views

2 votes

3 answers

12

Theory-of-computation
S-> S+S | S*S | a | € Which is false? a) G is ambiguous b) L is ambiguous c) both a and b d) none

Chetnawadhwa asked in Theory of Computation Nov 8, 2016

by Chetnawadhwa

678 views

1 vote

2 answers

13

Doubt
L = { an bm cp dq , n != m or p != q } Is it inherently ambiguous or not????

Rahul Jain25 asked in Theory of Computation Oct 20, 2016

by Rahul Jain25

737 views

24 votes

2 answers

14

Inherently ambiguous grammar
Q- Which one of following languages is inherently ambiguous? (A) The set of all strings of the form $\left\{a^nb^n,n>0 \right\}$ (B) $\left\{a^nb^nc^md^m,n,m>0 \right\}$ ... (D) Both (B) and (C) Plz explain.. ..........Is there any criteria on the basis of which we could identify inherently ambiguous grammar

komal07 asked in Theory of Computation May 24, 2015

15.4k views

To see more, click for the full list of questions or popular tags.

Recent questions tagged inherently-ambiguous