Compilers Regular Expression 2 Online Exam Quiz
Compilers Regular Expression 2 GK Quiz. Question and Answers related to Compilers Regular Expression 2. MCQ (Multiple Choice Questions with answers about Compilers Regular Expression 2
The regular expression have all strings of 0?s and 1?s with no two consecutive 0?s is?
Options
A : (0+1)
B : (0+1)*
C : (0+?) (1+10)*
D : (0+1)* 011
The RE in which any number of 0?s is followed by any number of 1?s followed by any number of 2?s is?
Options
A : (0+1+2)*
B : 0*1*2*
C : 0* + 1 + 2
D : (0+1)*2*
The regular expression with all strings of 0?s and 1?s with at least two consecutive 0?s is?
Options
A : 1 + (10)*
B : (0+1)*00(0+1)*
C : (0+1)*011
D : 0*1*2*
Which of the following is NOT the set of regular expression R = (ab + abb)* bbab?
Options
A : ababbbbab
B : abbbab
C : ababbabbbab
D : abababab
The production of the form no terminal ? ? is said to be null production.
Options
A : False
B : True
C :
D :
Consider the production of the grammar S->AA A->aa A->bb Describe the language specified by the production grammar.
Options
A : L = {aaaa,aabb,bbaa,bbbb}
B : L = {abab,abaa,aaab,baaa}
C : L = {aaab,baba,bbaa,bbbb}
D : L = {aaaa,abab,bbaa,aaab}
If R is regular language and Q is any language (regular/ non regular), then Pref (Q in R) is _____________
Options
A : Non-regular
B : Equal
C : Infinite
D : Regular
Chemical Engineering Basics - Part 1 more Online Exam Quiz
Compilers Predictivetop Down Parsing 1
Compilers Regular Expression 1