search
Log In
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 questions tagged cfg

0 votes
2 answers 14 views
Are all recursive grammar may it direct or indirect produce infinite language?
asked Jul 13 in Compiler Design arnab2022 5 points 14 views
0 votes
0 answers 30 views
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?
asked Jan 20 in Theory of Computation aditi19 53 points 30 views
0 votes
0 answers 61 views
Hello, How do I convert this PDA to CFG? I am currently stuck with this, any help would be appreciated, thank you in advance!
asked Apr 19, 2020 in Theory of Computation anonymous 61 views
0 votes
1 answer 39 views
What are “sentential forms”,”left sentential form”, “right sentential form” and “rightmost sentential form”? Please explain with an example.
asked Aug 15, 2019 in Compiler Design Sambhrant Maurya 493 points 39 views
0 votes
1 answer 37 views
Is the given language CFL or not? Σ*-L={a^n b^n a^n| n>=1}
asked Aug 14, 2019 in Theory of Computation kshubham538 -31 points 37 views
0 votes
0 answers 58 views
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 ?
asked Aug 12, 2019 in Theory of Computation user2525 2.4k points 58 views
0 votes
1 answer 74 views
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?
asked Jul 31, 2019 in Theory of Computation kshubham538 -31 points 74 views
2 votes
4 answers 226 views
What is the maximum number of language a context-free Grammar (CFG) can generate? Three Two One Infinite
asked Jul 31, 2019 in Compiler Design akshat sinha 15 points 226 views
To see more, click for the full list of questions or popular tags.
...