# Recent questions tagged cfg

Are all recursive grammar may it direct or indirect produce infinite language?
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?
Hello, How do I convert this PDA to CFG? I am currently stuck with this, any help would be appreciated, thank you in advance!
What are “sentential forms”,”left sentential form”, “right sentential form” and “rightmost sentential form”? Please explain with an example.