Login
Register
Dark Mode
Brightness
Ambient Glow – Questions list
Register
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
This combine questions from Gateforum Test Series .
Recent questions tagged gateforum-test-series
8
8 votes
5
answers
5 answers
2.7k
2.7k views
Gateforum test series
Identify the regular expression which represents the language containing all strings of $a's$ and $b's$ where each string contains at least two $b's$$(a+b)^*ba^*b$$(a+b)^...
amitlko
2.7k
views
asked
Oct 1, 2016
Theory of Computation
theory-of-computation
regular-expression
gateforum-test-series
+
–
5
5 votes
3
3 answers
3.1k
3.1k views
decidability-toc
Which of the following is not decidable problem?(a) A sting is generated by C.N.F or Not?(b) A given non-terminal A in a given grammar CFG is ever used in the generation ...
vkm07
3.1k
views
asked
Jul 15, 2016
Theory of Computation
gateforum-test-series
theory-of-computation
decidability
+
–
0
0 votes
2
2 answers
1.3k
1.3k views
Bottom up and top down parser's ?
q. 23 : can anyone explain why both statements are false? I thought option B is correct?
prasitamukherjee
1.3k
views
asked
Jul 16, 2015
Compiler Design
compiler-design
parsing
gateforum-test-series
+
–
Page:
« prev
1
2
3
4
5
6