Register

CNF form Grammar

• edited by
409 views

1 Answer

1 1 vote
False
we can represent any nonempty context free grammer in to CNF and GNF and we cannot represent empty string.
Voting & Accepting an answer helps improve the community
← Previous · GO Classes DA Test S...Next → · Jump instruction
← Previous in category · GO Classes CS Test S...Next in category → · GO Classes CS Test S...
Position:
Show:

Related questions

1 1 vote
1 answers 1 answer
2.6k
2.6k views
gari asked Nov 18, 2017
2,592 views
How many variables does the following grammar have when converted to CNF?
E - E+TE - TT - (E)T - i
0 0 votes
1 1 answer
2.2k
2.2k views
komal07 asked May 24, 2015
2,223 views
CNF grammar
in B) production is S->AB(if in image it is not clear)
1 1 vote
2 answers 2 answers
1.2k
1.2k views
Xylene asked Jul 12, 2017
1,249 views
Regular grammar form
Regular grammar can be of form :-A->tV or A->Vt or A->t where t is terminal and V is variable.Here is t string of terminals or a single terminal? I am seeing different de...
1 1 vote
0 0 answers
1.2k
1.2k views
ahmed65956 asked Sep 27, 2023
1,247 views
10. Give the translation scheme that converts infix to postfix form for the following grammar. Also generate the annotated parse tree for input string 2+6+1 E-> E+T E->T T->0|1|2|3|4|5|6|7|8|9
Give the translation scheme that converts infix to postfix form for the following grammar. Also generate the annotated parse tree for input string 2+6+1E- E+TE->TT->0|1|2...