1.

The language of all non-null strings of a’s can be defined by a context free grammar as follow:S → aS|Sa|aThe word a3 can be generated by __________ different trees.(A) two(B) three(C) four(D) five

Answer»


Discussion

No Comment Found

Related InterviewSolutions