The Gateway to Computer Science Excellence
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.
Recent questions tagged contextfreelanguage
+1
vote
0
answers
1
Compiler: Ambiguous Grammar
Consider the following grammars: Grammar G1: S → 0 T  ε T → 1 S Grammar G2: S → T S S → ε T → X Y X → 0 Y → 1 Which of the following statements is not true? A. Grammar G1 can generate any string ... corresponds to a regular language. D. Grammar G1 corresponds to a language that can be recognized with an LR parser. Is G2 ambiguous grammar?
asked
3 days
ago
in
Compiler Design
by
Vijay Thakur
Veteran
(
17.9k
points)

38
views
theoryofcomputation
compilerdesign
ambiguous
contextfreelanguage
+1
vote
0
answers
2
Toc dfa
Is this DCFL or not a^n b^2n c^3n. n>=1 My logic is Push all a's Pop one a with one b After remain b push on stack After pop one b With 3c
asked
4 days
ago
in
Theory of Computation
by
Nitesh Choudhary
Loyal
(
2.9k
points)

18
views
theoryofcomputation
contextfreelanguage
+2
votes
1
answer
3
CFG and CSL
My doubt may be silly but plz help. Given a particular language how to know whether a grammar is CFL or CSL sometimes it really creates me a problem Language like {a^n b^n c^2n n > 0} is a CSL but if suppose it was a new ... PDA so it should be CFL. SO How to tackle such question in first attempt if before hand we don't know anything about the language
asked
6 days
ago
in
Theory of Computation
by
Na462
Active
(
1.1k
points)

21
views
theoryofcomputation
contextfreelanguage
+3
votes
2
answers
4
TOC DFA
I got 3 states... Given is 4
asked
Jan 16
in
Theory of Computation
by
Ashwin Kulkarni
Veteran
(
11.8k
points)

65
views
theoryofcomputation
regularlanguages
contextfreelanguage
+2
votes
0
answers
5
cfl or not
the condition is 1) (i<=j) or (j<=i) , j=k 2) (i<=j) or (j<=i) ,j=k how should we interpret the condition given ?
asked
Jan 12
in
Theory of Computation
by
gari
Loyal
(
2.6k
points)

24
views
theoryofcomputation
contextfreelanguage
+3
votes
0
answers
6
Decidability
a) L is decidable b) L is undecidable c) L is regular d) None of these
asked
Jan 10
in
Theory of Computation
by
Nymeria
(
321
points)

87
views
decidability
contextfreelanguage
turingmachine
reduction
+2
votes
1
answer
7
Context Free Language
Is B context free? Please explain in detail.
asked
Jan 6
in
Theory of Computation
by
Shubham Kumar Gupta
Junior
(
579
points)

78
views
contextfreelanguage
theoryofcomputation
identifyclasslanguage
regularlanguages
grammar
0
votes
1
answer
8
closure property
CFL over a single alphabet are always> A. dcfl B. regular C. dcfl but not regular d. non regular
asked
Dec 30, 2017
in
Theory of Computation
by
raviyogi
Active
(
1.8k
points)

44
views
theoryofcomputation
contextfreelanguage
closureproperty
regularlanguages
0
votes
0
answers
9
is language L={ a^p*b^q*c^r*d^s  p+r=q+s }is dcfl?
asked
Dec 26, 2017
in
Theory of Computation
by
Durgesh Singh
Junior
(
899
points)

31
views
theoryofcomputation
contextfreelanguage
0
votes
1
answer
10
#theory of computation
asked
Dec 25, 2017
in
Theory of Computation
by
Abhijeet_Kumar
Boss
(
7.2k
points)

48
views
theoryofcomputation
contextfreelanguage
0
votes
1
answer
11
Deterministic Context Free Languages
asked
Dec 24, 2017
in
Theory of Computation
by
Shubham Kumar Gupta
Junior
(
579
points)

39
views
contextfreelanguage
deterministiccontextfreegrammars
theoryofcomputation
+1
vote
1
answer
12
Context Free Languages
Please Explain in detail.
asked
Dec 23, 2017
in
Theory of Computation
by
Shubham Kumar Gupta
Junior
(
579
points)

66
views
contextfreelanguage
theoryofcomputation
contextfreelanguages
theory
0
votes
1
answer
13
Context Free Language
CFL Over one alphabet will always be regular True False
asked
Dec 23, 2017
in
Theory of Computation
by
hacker16
Active
(
2.3k
points)

70
views
contextfreelanguage
theoryofcomputation
+1
vote
3
answers
14
Is the following language CFL?
Not able to understand whether it is CFL or not due to the condition 'm>=481'.
asked
Dec 22, 2017
in
Theory of Computation
by
Ashish Sharma 3
(
317
points)

62
views
theoryofcomputation
contextfreelanguage
pushdownautomata
dcfl
contextfreelanguages
0
votes
0
answers
15
Given Language is Context free or Regular ?
asked
Dec 18, 2017
in
Theory of Computation
by
hacker16
Active
(
2.3k
points)

65
views
theoryofcomputation
regularlanguages
contextfreelanguage
+4
votes
1
answer
16
NIELT 2017 Question
Let G be a grammar in CFG and Let W1 and W2 is element of G such that w1 = w2 then which of the following is true? A. Any derivation of W1 has exactly the same number of steps as any derivation of W2 B. Different derivation have different length C.Some derivation of W1 may be shorter that derivation of W2 D. None of the options
asked
Dec 18, 2017
in
Theory of Computation
by
Durgesh Singh
Junior
(
899
points)

367
views
theoryofcomputation
isro2017
contextfreelanguage
contextfreegrammars
0
votes
0
answers
17
Doubt related to context free Language.
asked
Dec 17, 2017
in
Theory of Computation
by
Mayank Joshi
(
33
points)

21
views
theoryofcomputation
contextfreelanguage
0
votes
0
answers
18
TOC CFL Closure property doubt
Is it viable possibility that L and L complement can both be CFL but not Regular?
asked
Dec 15, 2017
in
Theory of Computation
by
Nefarious Monkey
(
47
points)

62
views
theoryofcomputation
contextfreelanguage
selfdoubt
+3
votes
0
answers
19
CFL OR REGULAR
asked
Dec 11, 2017
in
Theory of Computation
by
pranab ray
Active
(
1.5k
points)

86
views
theoryofcomputation
contextfreelanguage
0
votes
1
answer
20
Regular and CFL
LC may be CFL LC cannot be CFL LC may be regular LC may or may not be CFL
asked
Dec 10, 2017
in
Theory of Computation
by
Parshu gate
Boss
(
6.2k
points)

45
views
theoryofcomputation
contextfreelanguage
contextsensitive
contextfreelanguages
+1
vote
1
answer
21
Identify Class of Grammar
Hi mates, Please Identify Class of grammr with suitable Explanation, 1) L={WXW,/ W,X{a,b}*} 2) L={WXW,/ W,X{a,b}+} 3) L={WXWY,/ W,X,Y{a,b}+} 4)L={WXYW,/ W,X,Y{a,b}+} Thanks,
asked
Dec 7, 2017
in
Theory of Computation
by
Sahil1994
Junior
(
979
points)

56
views
theoryofcomputation
identifyclasslanguage
contextfreelanguage
regularlanguages
0
votes
0
answers
22
TOC doubts test series
State whether statement is true or false. 1. (a+b)*.anbn is regular . 2. Language produced by grammar S > AaB A>aC  $\epsilon$ B>aBbB$\epsilon$ C>aCb$\epsilon$ is regular. 3. Language produced ... equal to number of occurrences of "ba" } 6. Given a grammar, checking if the grammar is not regular is decidable problem.
asked
Dec 5, 2017
in
Theory of Computation
by
sumit chakraborty
Junior
(
807
points)

52
views
theoryofcomputation
regularlanguages
contextfreelanguage
+1
vote
0
answers
23
Doubt in CSL and CFL
$a) \{\ 0^i\ 1^j\ 2^k\ \  where\ i\ \neq j\ or\ j\ \neq k\ \}$ $b) \{\ 0^i\ 1^j\ 2^k\ \  where\ i\ \neq j\ and\ j\ \neq k\ \}$ a) CFL(union of two ORed comparisons ) b) CSL( Double comaprison ) Am I correct?
asked
Dec 4, 2017
in
Theory of Computation
by
Tuhin Dutta
Boss
(
5.6k
points)

69
views
theoryofcomputation
contextsensitive
contextfreelanguage
0
votes
0
answers
24
Toc doubt
asked
Dec 3, 2017
in
Theory of Computation
by
Parshu gate
Boss
(
6.2k
points)

36
views
theoryofcomputation
regularlanguages
contextfreelanguage
0
votes
1
answer
25
DCFL or not
Consider the following languages: L1={abna2nn>=0} L2={aabna3nn>=0} Why L1UL2 is DCFL please explain?
asked
Dec 2, 2017
in
Theory of Computation
by
shivangi5
Active
(
1.9k
points)

64
views
theoryofcomputation
dcfl
contextfreelanguage
contextfreelanguages
0
votes
1
answer
26
contextfreelanguage
A CFG G is ambiguous which of the following is false? a) at least one w ∈ L(G) such that w has at least 2 distinct derivation trees b) at least one w ∈ L(G) such that w has at least 2 RMD's and at least 2 LMD's c) at least one w ∈ L(G) such that w has exactly 2 derivation trees d)None of these
asked
Dec 1, 2017
in
Theory of Computation
by
raks8877
(
39
points)

19
views
theoryofcomputation
contextfreelanguage
0
votes
1
answer
27
Self doubt in TOC
Suppose in question we are given the language is Turing Recognizable , can I consider it a CFL or Regular?
asked
Nov 30, 2017
in
Theory of Computation
by
Parshu gate
Boss
(
6.2k
points)

64
views
theoryofcomputation
regularlanguages
decidability
contextfreelanguage
turingmachine
0
votes
2
answers
28
Self doubt in Class of language
asked
Nov 29, 2017
in
Theory of Computation
by
Parshu gate
Boss
(
6.2k
points)

37
views
theoryofcomputation
identifyclasslanguage
contextfreelanguage
regularlanguages
contextfreelanguages
0
votes
1
answer
29
TOC closure property doubt
If a language L1 is given as anbn and L2 is given as {a,b}* , then the language L1  L2 will be : regular or CFL and why ? My doubt is that since L2 is a regular language and L1 is CFL and L2 will contain all ... of regular is regular and intersection of CFL with regular is closed and the language will be CFL. Which one is right and why ?
asked
Nov 29, 2017
in
Theory of Computation
by
sumit chakraborty
Junior
(
807
points)

46
views
theoryofcomputation
closureproperty
contextfreelanguage
regularlanguages
0
votes
0
answers
30
#context free languages
Hi mates, Difference between 1) xcy {x, y € (0,1)*} 2) xcx {x €(0,1)*} and c is a terminal symbol and c is not 0,1
asked
Nov 29, 2017
in
Theory of Computation
by
Sahil1994
Junior
(
979
points)

31
views
contextfreelanguage
theoryofcomputation
Page:
1
2
3
4
5
6
...
9
next »
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Changes in UGC NET Exam Pattern
Remember the guy who gave up ?
[email protected]
mistakes which i did and you should not !
All points to MugUp Under One post!
Follow @csegate
Gatecse
Recent questions tagged contextfreelanguage
Recent Blog Comments
Thank you everyone for reading this :)
Thank you bhaiya
I didn't receive any emails, sir. I would like ...
Sahi baat h....
Needed this a lot :) Thank you :) We should not ...
32,732
questions
39,309
answers
110,280
comments
36,733
users