What is the maximum number of reduce moves that can be taken by a bottom up parser for a grammar with no epsilon and unit production(i.e., of type A → ∈ and A → a) to parse a string with n tokens?
- N/2
- N-1
- 2n-1
- 2n
Answer : B,
Explanation:
N-1
Do U have Better Solution ?
Contribute your Solution in Comment Section below