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. For hardcopy of previous year questions please see
here
Recent questions tagged cnf
0
votes
0
answers
1
what is cnf for following grammer ?
Eliminate ε productions, unit productions, useless symbols and then rewrite the resulting grammar in the Chomsky Normal Form (in that order) for the following two input grammars: S > 0E0  1FF  ε E > G F > S  E G > S  ε
asked
Apr 10
in
Theory of Computation
by
hem chandra joshi
Active
(
4.4k
points)

41
views
theoryofcomputation
cnf
+2
votes
0
answers
2
CFG to GNF
Convert the given CFG to GNF. $S \rightarrow MN$ $M\rightarrow aMb\epsilon $ $N\rightarrow aNb\epsilon $
asked
Mar 25
in
Theory of Computation
by
Mk Utkarsh
Boss
(
12.4k
points)

101
views
theoryofcomputation
contextfreelanguage
cnf
gnf
+1
vote
0
answers
3
Explain This
Every grammar in Chomsky normal form is contextfree, and conversely, every contextfree grammar can be transformed into an equivalent one[note 1] which is in Chomsky normal form and has a size no larger than the square of the original grammar's size. Source https://en.m.wikipedia.org/wiki/Chomsky_normal_form
asked
Jan 22
in
Theory of Computation
by
Anshul Shankar
Active
(
1.1k
points)

19
views
theoryofcomputation
cnf
+1
vote
1
answer
4
Chomskey Normal Form
State true/false In CNF , S> espilon and Start symbol can appear on RHS side of production.
asked
Jan 1
in
Theory of Computation
by
Anjan
Active
(
1.7k
points)

68
views
theoryofcomputation
cnf
0
votes
0
answers
5
Chomsky Normal Form
asked
Dec 10, 2017
in
Theory of Computation
by
Sanjay Sharma
Boss
(
47.8k
points)

75
views
theoryofcomputation
cfg
cnf
0
votes
1
answer
6
UllmanChomsky Normal Form
If the start symbol derives epsilon.Can we eliminate all epsilons while converting to Chomsky Normal Form?Following question from ullman the answer given they have removed the epsilon.But I think if the start symbol derives epsilon,more accurately if L(G) contains epsilon we cannot remove it. S>ASBepsilon A>aASa B>SbSAbb
asked
Nov 25, 2017
in
Theory of Computation
by
Surajit
Active
(
3.1k
points)

61
views
theoryofcomputation
cfg
cnf
+1
vote
1
answer
7
How many variables does the following grammar have when converted to CNF?
asked
Nov 18, 2017
in
Theory of Computation
by
gari
Active
(
3.2k
points)

98
views
cnf
theoryofcomputation
0
votes
0
answers
8
Automata: CFG to CNF
As the null string belongs to the language generated by the grammar, answer of the following questions should be "none of these"?
asked
Oct 29, 2017
in
Theory of Computation
by
Manu Thakur
Boss
(
39.2k
points)

103
views
theoryofcomputation
cnf
0
votes
0
answers
9
Automata: Conversion from CFG to CNF
Convert the following context free grammar into Chomsky Normal Form: $S \rightarrow ASA  aB$ $A \rightarrow B  S$ $B \rightarrow b  \epsilon$ Does the appearance of starting symbol S at RHS impacts the conversion from CFG to CNF?
asked
Oct 14, 2017
in
Theory of Computation
by
Manu Thakur
Boss
(
39.2k
points)

678
views
theoryofcomputation
contextfreelanguage
cnf
simplification
+1
vote
0
answers
10
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, 2017
in
Compiler Design
by
learner_geek
Active
(
4.6k
points)

219
views
theoryofcomputation
contextfreelanguage
discretemathematics
derivationtree
cnf
+1
vote
0
answers
11
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, 2017
in
Theory of Computation
by
learner_geek
Active
(
4.6k
points)

421
views
theoryofcomputation
derivationtree
contextfreelanguage
cnf
+2
votes
1
answer
12
Raghunath Tiwari(NPTEL NOC Chomsky Normal Form)
asked
Jul 3, 2017
in
Theory of Computation
by
Veeplob Singh
(
79
points)

152
views
theoryofcomputation
cfg
cnf
grammar
0
votes
0
answers
13
[TOC] CNF Tree Depth
1. Assume that we have CNF tree of depth of h(Assume root at height 0).What is the maximum yeild possible in terms of h? 2. Assume that we have a string of length n,what is the min and max height of parse tree possible in CNF. Please explain
asked
Jan 12, 2017
in
Theory of Computation
by
rahul sharma 5
Boss
(
23.9k
points)

133
views
theoryofcomputation
contextfreelanguage
cnf
derivationtree
0
votes
1
answer
14
TOC CFG to CNF convertion
asked
Dec 10, 2016
in
Theory of Computation
by
KISHALAY DAS
Loyal
(
6.5k
points)

139
views
theoryofcomputation
contextfreelanguage
cnf
To see more, click for the
full list of questions
or
popular tags
.
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
ISRO Interview Experience
IISC CSA shortlist to final select conversion
career advice
IIT Madras MS written test and interview
Interview experience at IIITSricity
Follow @csegate
Gatecse
Recent questions tagged cnf
Recent Blog Comments
Every night before sleeping I read it . ...
Awesome Vidhi.. Hope soon the mail of admission ...
Congrats Niharika :) :)
Congratulations and All the best for life at ISRO ...
By June end.
35,535
questions
42,875
answers
121,904
comments
42,216
users