retagged by
276 views
1 votes
1 votes
Can ambiguous context free grammar be converted into CNF form..?
retagged by

Please log in or register to answer this question.

Related questions

1 votes
1 votes
1 answer
1
admin asked May 4, 2019
495 views
Show that if $G$ is a $CFG$ in Chomsky normal form$,$ then for any string $w\in L(G)$ of length $n\geq 1,$ exactly $2n − 1$ steps are required for any derivation of $w....
0 votes
0 votes
1 answer
2
0 votes
0 votes
0 answers
3