The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent questions tagged contextfreegrammars
+5
votes
1
answer
1
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
(
755
points)

743
views
theoryofcomputation
isro2017
contextfreelanguage
contextfreegrammars
+2
votes
2
answers
2
ISRODEC201723
Identify the language generated by the following grammar $S\rightarrow AB\\ A\rightarrow aAb\mid \varepsilon\\ B\rightarrow bB\mid b$ $\{a^m b^n\mid n\geq m,m>0\}$ $\{a^m b^n\mid n\geq m,m\geq0\}$ $\{a^m b^n\mid n> m,m>0\}$ $\{a^m b^m\mid n> m,m\geq0\}$
asked
Dec 17, 2017
in
Theory of Computation
by
gatecse
Boss
(
16.8k
points)

706
views
isrodec2017
theoryofcomputation
contextfreegrammars
0
votes
0
answers
3
Context free or not
How to understand such problems?
asked
Nov 20, 2017
in
Theory of Computation
by
Parshu gate
Active
(
3.1k
points)

124
views
contextfreelanguage
identifyclasslanguage
contextfreegrammars
0
votes
0
answers
4
regular and context free
Let Σ = {a, b}. For a word w ∈ Σ* , let na(x) denote the number of a’s in w and let nb(x) denote the number of b’s in w. Consider the following language: L := {xy  x, y ∈ Σ* , na(x) = nb(y)} What can we say about L? (A) L is regular, but not contextfree. (B) L is contextfree, but not regular. (C) L is Σ*. (D) None of these.
asked
Nov 15, 2017
in
Theory of Computation
by
Parshu gate
Active
(
3.1k
points)

40
views
contextfreegrammars
identifyclasslanguage
theoryofcomputation
0
votes
1
answer
5
#TOC Someone please Explain this Gate Question
This is the Gate Question  https://gateoverflow.in/3392/gate2008it78?show=155376#c155376 I couln't help but understand the balanced paranthesis thing, I know, () this is balanced, (( )) is balanced, ((( ))) is balanced, ... t have any intention to make a duplicate question/thread, I will close this question whenever I get my doubt solved. Thanks!
asked
Sep 26, 2017
in
Theory of Computation
by
iarnav
Loyal
(
8.3k
points)

101
views
theoryofcomputation
contextfreelanguage
contextfreegrammars
cfg
0
votes
1
answer
6
#Parsing
Grammar : E>T+E/T T>id/id*T/(E) Is grammar LL(2)?
asked
Sep 26, 2017
in
Compiler Design
by
saxena0612
Boss
(
11.8k
points)

100
views
contextfreegrammars
0
votes
3
answers
7
UGCNETdec2009ii34
Contexfree Grammar (CFG) can be recognized by (A) Finite state automata (B) 2way linear bounded automata (C) push down automata (D) both (B) and (C)
asked
Sep 17, 2017
in
Theory of Computation
by
rishu_darkshadow
Loyal
(
7.2k
points)

130
views
ugcnetdec2009ii
theoryofcomputation
contextfreegrammars
+1
vote
1
answer
8
context free grammers
L = {a^nb^m : n >= m+3} below context grammer is correct?? S ==> aA  Aa A ==> aAb  bAa  abA  baA  aa
asked
Jul 12, 2017
in
Theory of Computation
by
akhileshreddy
(
113
points)

81
views
theoryofcomputation
cfg
contextfreegrammars
0
votes
1
answer
9
dr.O.G. kakde, context free grammar and syntax analysis
obtain regular grammar equivalent to the regular expression given below: 1) a*(ab)bb 2) (ab)*ba(ab)*
asked
Jun 28, 2017
in
Compiler Design
by
RAJKUMAR
(
67
points)

122
views
contextfreegrammars
+1
vote
0
answers
10
UGCNETAUG2016III57
Let $G = (V, T, S, P)$ be a contextfree grammar such that every one of its productions is of the form $A \rightarrow ν$, with $ν = k > 1$. The derivation tree for any string $W \in L (G)$ has a height such that $h < \frac{(W1)}{k1}$ $\log_{k} W \leq h$ $\log_{k} W < h < \frac{(W1)}{k1}$ $\log_{k} W \leq h \leq \frac{(W1)}{k1}$
asked
Oct 4, 2016
in
Theory of Computation
by
makhdoom ghaya
Boss
(
30.2k
points)

222
views
ugcnetaug2016iii
theoryofcomputation
contextfreegrammars
+3
votes
2
answers
11
UGCNETJune2015III61
A context free grammar for $L=\{w \mid n_0 (w) > n_1 (w)\}$ is given by: $S \rightarrow 0 \mid 0S \mid 1 S S$ $S \rightarrow 0 S \mid 1 S \mid 0 S S \mid 1 S S \mid 0 \mid 1$ $S \rightarrow 0 \mid 0 S \mid 1 S S \mid S 1 S \mid S S 1$ $S \rightarrow 0 S \mid 1 S \mid 0 \mid 1$
asked
Aug 2, 2016
in
Theory of Computation
by
jothee
Veteran
(
105k
points)

712
views
ugcnetjune2015iii
theoryofcomputation
contextfreegrammars
+1
vote
3
answers
12
UGCNETDec2014II35
The following ContextFree Grammar (CFG) : $S \rightarrow aB  bA$ $A \rightarrow a  as  bAA$ $B \rightarrow b  bs  aBB$ will generate Odd numbers of $a's$ and odd numbers of $b's$ Even numbers of $a's$ and even numbers of $b's$ Equal numbers of $a's$ and $b's$ Different numbers of $a's$ and $b's$
asked
Jul 22, 2016
in
Theory of Computation
by
makhdoom ghaya
Boss
(
30.2k
points)

324
views
ugcnetdec2014ii
theoryofcomputation
contextfreegrammars
+3
votes
1
answer
13
UGCNETJune2013III38
For every context free grammar (G) there exists an algorithm that passes any $w \in L(G)$ in number of steps proportional to $ln\mid w \mid$ $\mid w \mid$ $\mid w \mid^2$ $\mid w \mid^3$
asked
Jul 17, 2016
in
Others
by
jothee
Veteran
(
105k
points)

664
views
ugcnetjune2013iii
theoryofcomputation
contextfreegrammars
Page:
« prev
1
2
3
4
5
6
7
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
Linear Algebra Important Points
GATE 2020
OFFICIAL GATE MOCK TEST RELEASED
IIITH: Winter Research Admissions 2019 (For Spring 2020)
TIFR and JEST exam
Follow @csegate
Recent questions tagged contextfreegrammars
Recent Blog Comments
It's a question not a post..
i also don't have any pdf, actually, I added the...
i don't have , if you have upload it
@mohan123 Do you have all standard book...
bro can be upload all standard book questions in...
50,647
questions
56,479
answers
195,422
comments
100,559
users