recategorized by
1,238 views

1 Answer

1 votes
1 votes

Option A. 2n-1

In CNF , the height of the syntax tree is 2n-1 i.e. 2n-1 productions are used to obtain a string on n terminals.

Related questions

1 votes
1 votes
2 answers
1
Pooja Khatri asked Jul 13, 2018
15,274 views
Two finite state machines are said to be equivalent if they:Have the same number of edgesHave the same number of statesRecognize the same set of tokensHave the same numbe...
0 votes
0 votes
2 answers
2
0 votes
0 votes
6 answers
3
0 votes
0 votes
3 answers
4
Pooja Khatri asked Jul 13, 2018
3,222 views
Pushdown automata can recognize language generated by _______Only context free grammarOnly regular grammarContext free grammar or regular grammarOnly context sensitive gr...