A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Important Notice!

Dear users, compscibits.com is now permanently moved to compsciedu.com. Please update all your links and bookmarks accordingly. Soon, the site will be accessible through URL compsciedu.com only.

Discussion Forum

Que. Which of the following statements is false?
a. Top-down parsers are LL parsers where first L stands for left-to-right scan and second L stands for a leftmost derivation.
b. (000)* is a regular expression that matches only strings containing an odd number of zeroes, including the empty string.
c. Bottom-up parsers are in the LR family, where L stands for left-to-right scan and R stands for rightmost derivation.
d. The class of context-free languages is closed under reversal. That is, if L is any context-free language, then the language LR={WR:wϵL} is context free.
Answer:(000)* is a regular expression that matches only strings containing an odd number of zeroes, including the empty string.
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: