Vidyalelo
Data Structure · Q157

Trees in Data Structures

Programming · Data Structure · question 157

Q157

Which among the following best represents the computational complexity of GLR parsing?

A.
O(|G| x n)
Answer
B.
O(|G|2 x n)
C.
O(|G| x n2)
D.
O(|G|2 x n2)

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board