Monday 1 June 2015

Q38,paper3,J 13. For every context free grammar (G) there exists an algorithm that passes any w ∈L(G) in number of steps proportional to



(A) ln|w|
(B) |w|
(C) |w|2
(D) |w|3
Answer D.

No comments:

Post a Comment

Note: only a member of this blog may post a comment.