menu
Recent questions tagged cfg
Login
Register
My account
Edit my Profile
Private messages
My favorites
Register
Recent questions tagged cfg
All Activity
Q&A
Questions
Unanswered
Tags
Categories
Users
Ask a Question
Blogs
Previous Year
Exams
Recent questions tagged cfg
0
votes
0
answers
24
views
#Self Doubt #Recursive CFG
Are all recursive grammar may it direct or indirect produce infinite language?
arnab2022
asked
in
Compiler Design
Jul 13, 2021
by
arnab2022
5
points
24
views
cfg
theory-of-computation
compiler-design
0
votes
0
answers
38
views
CFG Self-doubt
As per the definition of CNF and GNF, these grammars doesn’t allows $\epsilon$ productions. What if the language contains $\epsilon$? In that case how do we convert the CFG to CNF and GNF? Can someone explain with an example?
aditi19
asked
in
Theory of Computation
Jan 20, 2021
by
aditi19
59
points
38
views
cfg
0
votes
0
answers
79
views
How to convert this PDA to CFG?
Hello, How do I convert this PDA to CFG? I am currently stuck with this, any help would be appreciated, thank you in advance!
anonymous
asked
in
Theory of Computation
Apr 19, 2020
by
anonymous
79
views
pushdown-automata
cfg
0
votes
1
answer
46
views
Self Doubt: CFG
What are “sentential forms”,”left sentential form”, “right sentential form” and “rightmost sentential form”? Please explain with an example.
Sambhrant Maurya
asked
in
Compiler Design
Aug 15, 2019
by
Sambhrant Maurya
493
points
46
views
cfg
compiler-design
0
votes
1
answer
42
views
Context free language
Is the given language CFL or not? Σ*-L={a^n b^n a^n| n>=1}
kshubham538
asked
in
Theory of Computation
Aug 14, 2019
by
kshubham538
-31
points
42
views
theory-of-computation
cfg
context-free-languages
0
votes
0
answers
75
views
Gateoverflow question - doubt
https://gateoverflow.in/311001/deletion-of-useless-symbols-from-a-grammar-self-doubt In the above question aren’t we supposed to delete the production A → b because at the end after removing the useless symbols, A is unreachable from the start symbol S. So, wont be the answer S → a only after removing useless symbols ?
user2525
asked
in
Theory of Computation
Aug 12, 2019
by
user2525
2.4k
points
75
views
theory-of-computation
cfg
0
votes
1
answer
105
views
Context free grammar: string derivation
Consider the following CFG S→aAbBC | abB A→bBd | ∈ B→eBf | g C→f How many derivative steps required to derive the string abegff using the above grammar when start symbol S is available?
kshubham538
asked
in
Theory of Computation
Jul 31, 2019
by
kshubham538
-31
points
105
views
cfg
made-easy-workbook
theory-of-computation
2
votes
4
answers
376
views
fssai IT assistant exam 2019 Q15
What is the maximum number of language a context-free Grammar (CFG) can generate? Three Two One Infinite
akshat sinha
asked
in
Compiler Design
Jul 31, 2019
by
akshat sinha
15
points
376
views
cfg
compiler-design
context-free-languages
compiler
grammar
To see more, click for the
full list of questions
or
popular tags
.
Ask a Question
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Recent Posts
New GATEOverflow PDFs
Guidelines to users
No Recent Blog Comments
Search GATE CSE Doubts