InterviewSolution
Saved Bookmarks
| 1. |
Consider the following CFG S -> AaAb | Bb A -> ԑ B -> ԑThe above grammar is:(A) Ambiguous(B) Left recursive(C) Left factored(D) None of these |
| Answer» | |