248 views
1 votes
1 votes
Consider a CFG that describes a language L(G) . G may have € productions. If a non empty string w of length n can be derived in m steps, what is the maximum number of nodes in the parse tree for w?

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
2
baofbuiafbi asked Nov 14, 2023
151 views
Prove the language L={(G,H)|G is a CFG, H is a DFA, and L(G)∩L(H)=∅} is undecidable.