Login
Register
Dark Mode
Brightness
Ambient Glow – Questions list
Register
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged inherently-ambiguous
0
0 votes
0
0 answers
418
418 views
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
418
views
asked
Jun 25, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
context-free-language
inherently-ambiguous
+
–
1
1 vote
0
0 answers
467
467 views
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
467
views
asked
May 4, 2019
Theory of Computation
michael-sipser
theory-of-computation
context-free-language
inherently-ambiguous
+
–
0
0 votes
0
0 answers
314
314 views
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
314
views
asked
Apr 14, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
inherently-ambiguous
grammar
+
–
0
0 votes
0
0 answers
323
323 views
Peter Linz Edition 4 Exercise 5.2 Question 9 (Page No. 145)
Show that a regular language cannot be inherently ambiguous.
Naveen Kumar 3
323
views
asked
Apr 14, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
inherently-ambiguous
grammar
+
–
0
0 votes
1
1 answer
681
681 views
Regular Language and Ambiguity
For every regular grammar, we can always have an unambigious grammar?
smsubham
681
views
asked
Oct 28, 2018
Theory of Computation
theory-of-computation
finite-automata
regular-language
inherently-ambiguous
+
–
–1
–1 vote
1
1 answer
1.8k
1.8k views
Non inherently ambiguous
Na462
1.8k
views
asked
Sep 2, 2018
Theory of Computation
context-free-language
theory-of-computation
inherently-ambiguous
+
–
0
0 votes
0
0 answers
711
711 views
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...
tarun_svbk
711
views
asked
Feb 24, 2018
Theory of Computation
theory-of-computation
context-free-language
peter-linz
peter-linz-edition4
grammar
inherently-ambiguous
+
–
1
1 vote
1
answers
1 answer
1.4k
1.4k views
#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 p...
abhijeet pandey
1.4k
views
asked
Dec 5, 2017
Compiler Design
compiler-design
parsing
inherently-ambiguous
+
–
0
0 votes
1
1 answer
858
858 views
Inherited Language confusion
How is it opt C and not opt A ?
Parshu gate
858
views
asked
Nov 18, 2017
Compiler Design
compiler-design
inherently-ambiguous
ace-test-series
+
–
1
1 vote
0
0 answers
1.9k
1.9k views
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...
humblefool
1.9k
views
asked
Nov 17, 2017
Theory of Computation
theory-of-computation
inherently-ambiguous
context-free-language
+
–
0
0 votes
0
0 answers
1.7k
1.7k views
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
1.7k
views
asked
Jan 22, 2017
Theory of Computation
theory-of-computation
inherently-ambiguous
ambiguous
+
–
2
2 votes
3
answers
3 answers
1.4k
1.4k views
Theory-of-computation
S- S+S | S*S | a | €Which is false? a) G is ambiguous b) L is ambiguous c) both a and bd) none
Chetnawadhwa
1.4k
views
asked
Nov 8, 2016
Theory of Computation
theory-of-computation
ambiguous
inherently-ambiguous
grammar
+
–
1
1 vote
2
2 answers
1.3k
1.3k views
Doubt
L = { an bm cp dq , n != m or p != q }Is it inherently ambiguous or not????
Rahul Jain25
1.3k
views
asked
Oct 20, 2016
Theory of Computation
theory-of-computation
inherently-ambiguous
+
–
27
27 votes
2
answers
2 answers
20.4k
20.4k views
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\}$(C)...
komal07
20.4k
views
asked
May 24, 2015
Theory of Computation
theory-of-computation
inherently-ambiguous
+
–
To see more, click for the
full list of questions
or
popular tags
.