Consider the following two statements computer science gate 2007

The Eduladder is a community of students, teachers, and programmers just interested to make you pass any exams. So we solve previous year question papers for you.
In eduladder you can Ask,Answer,Listen,Earn and Download Questions and Question papers.
Watch related videos of your favorite subject.
Connect with students from different parts of the world.
Apply or Post Jobs, Courses ,Internships and Volunteering opportunity. For FREE
See Our team
Wondering how we keep quality?
Got unsolved questions? Ask Questions

GATE-Computer-Science-Engineering--Information-Technology-Question-Paper-with-Answer-key-2007-download-->View question

Consider the following two statements: -computer science-gate-2007


Consider the following two statements:
P: Every regular grammar is LL(I)
Q: Every regular set has a LR(I) grammar
Which of the following is TRUE?
(A) Both P and Q are true.
(C) P is false and Q is true.
(B) P is true and Q is false.
(D) Both P and Q are false. 


Asked On2017-07-03 18:44:49 by:Amogh

Taged users:


Likes:
Be first to like this question

Dislikes:
Be first to dislike this question
Talk about this  Delete  Like  Dislike
View all qusetions

You might like this video:Books Suggestion of Engineeering Mathematics for GATE
Watch more here

Watch more videos from this user Here

Eduladder videos are community generated video contents which we deliver to you according to the content you are browsing.We are constantly working on video delivering algorithms in order to give you the best experiance as possible

Learn how to upload a video and start earning here

Answers
(C) P is false and Q is true.
Explanation:
A regular grammar can also be ambiguous also
For example, consider the following grammar,                             
S → aA/a
A → aA/ε
In above grammar, string 'a' has two leftmost
derivations. 
(1)   S → aA                      (2)   S → a
      S->a (using A->ε)
And LL(1) parses only unambiguous grammar,
so statement P is False.
Statement Q is true is for every regular set, we can have a regular
grammar which is unambiguous so it can be parse by LR parser. 
So option C is correct choice

Answerd on:2017-07-04 Answerd By:Aparna-Dasgupta

Likes:
Be first to like this answer

Dislikes:
Be first to dislike this answer
Talk about this  Delete  Like  Dislike

You might like this video:Delivering bad news to patients in a good manner
Watch more here

Watch more videos from this user Here

Eduladder videos are community generated video contents which we deliver to you according to the content you are browsing.We are constantly working on video delivering algorithms in order to give you the best experiance as possible

Learn how to upload a video and start earning here



Lets together make the web is a better place

We made eduladder by keeping the ideology of building a supermarket of all the educational material available under one roof. We are doing it with the help of individual contributors like you, interns and employees. So the resources you are looking for can be easily available and accessible also with the freedom of remix reuse and reshare our content under the terms of creative commons license with attribution required close.

You can also contribute to our vision of "Helping student to pass any exams" with these.
Answer a question: You can answer the questions not yet answered in eduladder.How to answer a question
Career: Work or do your internship with us.Work with us
Create a video: You can teach anything and everything each video should be less than five minutes should cover the idea less than five min.How to upload a video on eduladder