GATE CSE
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions.
Questions by learner_geek
User learner_geek
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User learner_geek
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+1
vote
1
answer
1
PARSER
Is this statement true: If Grammar is unambiguous must be LL(1) if not LL(1) it does not mean ambiguous.
asked
Aug 16
in
Compiler Design

27
views
compilerdesign
grammar
parsing
+1
vote
1
answer
2
TOC BaSiCs
Please explain:
asked
Aug 15
in
Theory of Computation

23
views
theoryofcomputation
regularexpressions
finiteautomata
+1
vote
1
answer
3
Toc Basics
Complement of (0+1)*1 ?? my answer is (0+11*0)* given answer is (1*0)* please give detail explanation!
asked
Aug 15
in
Theory of Computation

38
views
theoryofcomputation
finiteautomata
regularexpressions
+1
vote
1
answer
4
DECIDABILITY
Is complement of language same type or not decidable by CFL and recursive language or not??? Grammar is ambiguous or not? Grammar in regular/CFL/rel decidable or not?
asked
Aug 15
in
Theory of Computation

20
views
decidability
theoryofcomputation
turingmachine
recursiveandrecursivelyenumerablelanguages
contextfreelanguage
badquestion
+1
vote
1
answer
5
BASIC QUESTION TOC
CAN ANYONE EXPLAIN IN SIMPER MANNER GIVEN ANSWER IS A. HOW??? if we take input 0 then ?? if we take input 1 then ?? if we take input 10 then?? i have confusion as which is present input and previous bit??? The Finite ... B) Outputs 01 whenever the input sequence contains 11. (C) Outputs 00 whenever the input sequence contains 10. (D) None of these
asked
Aug 14
in
Theory of Computation

18
views
theoryofcomputation
gateoverflow
finiteautomata
0
votes
1
answer
6
TOC basic
The numbers 1,2,4,8,…2n,…1,2,4,8,…2n,… written in unary Is regular or not?? if not please justify??
asked
Aug 13
in
Theory of Computation

22
views
theoryofcomputation
finiteautomata
gateoverflow
+1
vote
1
answer
7
REGULAR OR NOT
As given that 1st is not regular and 2nd is regular as 1st not form AP but 2nd form.but if in 2nd we fix value of m and n same then it will work as 1st(not regular) so 2nd also should not be regular.as i know if we fix m or n value as any constant it will be AP but what if same???
asked
Aug 8
in
Theory of Computation

53
views
theoryofcomputation
settheory&algebra
compilerdesign
ambiguous
regularlanguages
+1
vote
1
answer
8
REGULAR OR NOT
Please mention reason with answer:
asked
Aug 8
in
Theory of Computation

34
views
theoryofcomputation
compilerdesign
ambiguous
regularlanguages
settheory&algebra
+1
vote
0
answers
9
Equivalence classes & Myhill Nerode Theorm in TOC
asked
Aug 8
in
Theory of Computation

16
views
+1
vote
0
answers
10
Closure properties in toc
Please give correct/verified answer.
asked
Aug 7
in
Theory of Computation

38
views
+1
vote
0
answers
11
Draw a DFA for
DFA ???
asked
Aug 7
in
Theory of Computation

44
views
+1
vote
1
answer
12
LR(zero)
Options are as: (a) i and ii (b) i and iii (c) ii and iii (d) none of the above
asked
Aug 6
in
Compiler Design

32
views
theoryofcomputation
grammar
compilerdesign
contextfreelanguage
+1
vote
0
answers
13
CNF and GNF
Given answer is (a) but L>AB i think it is wrong because A and B produce something else Previously, so instead of L>AB there would have given like L>MN M>c1 and N>S then it was correct . if I am wrong please correct me.
asked
Aug 6
in
Compiler Design

17
views
theoryofcomputation
contextfreelanguage
discretemathematics
derivationtree
cnf
+1
vote
2
answers
14
LL(1) Grammar
Every LL(1) grammer is LALR(1) TRUE OR FALSE Every LL(1) grammer is CLR(1) TRUE OR FALSE AS I think 2nd is True and 1st is False if I am wrong please let me correct.
asked
Aug 5
in
Compiler Design

53
views
compilerdesign
theoryofcomputation
grammar
ll1
parsing
+2
votes
0
answers
15
IN SLR(1) SR CONFLICT
Here what will we do check intersection of follow(S) and follow(B) if common find then declare SR CONFLICT or As S production finish but it's Intersection is only possible with terminal(which is after dot in unfinished production) Please help what to do????
asked
Aug 5
in
Compiler Design

29
views
parsing
gate
compilerdesign
normal
numericalanswers
+1
vote
0
answers
16
SLR one
But given answer SLR(1) if i am wrong let me correct.
asked
Aug 5
in
Compiler Design

13
views
+1
vote
1
answer
17
LR(0) OR NOT???
If i am wrong let me correct.
asked
Aug 5
in
Compiler Design

14
views
compilerdesign
lrparser
grammar
theoryofcomputation
contextfreelanguage
+1
vote
1
answer
18
LEFT RECURSION
To avoid left recursion can we do like this. I think this is incorrect way to do
asked
Aug 5
in
Compiler Design

25
views
+1
vote
0
answers
19
Ambiguous to unambiguous
Make this grammer into unambiguous
asked
Aug 5
in
Compiler Design

15
views
+1
vote
1
answer
20
LL one
Given answer is yes but i think should not be LL(1)
asked
Aug 5
in
Compiler Design

13
views
+1
vote
0
answers
21
UNAMBIGUOUS GRAMMER
If my solution is wrong then please correct it and give proper explanation why it is wrong.
asked
Aug 5
in
Compiler Design

14
views
+1
vote
1
answer
22
First and Follow
Example 3.3
asked
Aug 5
in
Compiler Design

26
views
+1
vote
0
answers
23
CNF and GNF
Is it mandatory in GNF that first element in production must be terminal(I am considering there is no Left recursion) Is it mandatory in CNF that in production only two nonterminal or terminal should be there Can we not take in one production as two nonterminal and one terminal OR one terminal and two nonterminal
asked
Aug 5
in
Theory of Computation

15
views
theoryofcomputation
derivationtree
contextfreelanguage
cnf
+1
vote
0
answers
24
Greibach Normal Form
Is my solution correct?? If not please give reason and correct it.
asked
Aug 5
in
Compiler Design

14
views
+1
vote
0
answers
25
Properties
1.Let L be a CFL and R be a Regular language then L $\cap$ R = GIVEN: always CFL and need not be Regular BUT WHY NOT: always CFL as well as always Regular R  L = GIVEN: always CSL and need not be CFL BUT WHY NOT: ... = GIVEN: always DCFL and need not be Regular BUT WHY NOT: always DCFL as well as always Regular PLEASE GIVE DETAIL EXPLANATION WHY NOT??
asked
Aug 4
in
Theory of Computation

13
views
closureproperty
regularlanguages
theoryofcomputation
+1
vote
1
answer
26
Basic grammer
A Grammar which is only left recursive or right recursive can be ambiguous grammar??? Or it should have both left recursive and right recursive to be ambiguous???
asked
Aug 3
in
Compiler Design

18
views
+1
vote
1
answer
27
Parse tree ambiguous or not
If i am wrong please let me correct with giving proper explanation.
asked
Aug 3
in
Compiler Design

20
views
+1
vote
1
answer
28
Compiler parser
is this given diagram correct or incorrect if incorrect then please correct it .
asked
Aug 3
in
Compiler Design

9
views
+1
vote
1
answer
29
Chomsky hierarchy
Is below given details true or false??
asked
Aug 3
in
Theory of Computation

12
views
+1
vote
0
answers
30
Parsing
Can anyone provide a single diagram by which I can evaluate in between LL(0) LL(1)....... parser LR(0) LR(1)...... LR(K) which is ambiguous which is not ambiguous etc
asked
Aug 2
in
Compiler Design

16
views
Page:
1
2
3
next »
25,071
questions
32,223
answers
75,100
comments
30,232
users