Awesome q2a theme
Ask us anything
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Categories
Users
Ask a Question
Recent questions tagged grammars
0
votes
1
answer
Ambiguity of grammars
Consider the Language: L = {$a^{n}b^{n}c^{k}$, n,k ≥ 1} ⋃ {$a^{n}b^{k}c^{k}$, n,k≥ 1} Which is True? (a) All the Grammars generating L will be ambiguous. (b) There exists a G which is unambiguous. (c) Language L is unambiguous (d) None of the above
asked
Aug 13
in
Theory of Computation
by
Sambhrant Maurya
(
281
points)

8
views
theoryofcomputation
grammars
ambiguity
To see more, click for the
full list of questions
or
popular tags
.
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
932
questions
596
answers
1,885
comments
81,474
users