Consider the following grammar.
S → aB | aAb
A → bAb | a
B → aB | ε
How many parse trees exist to generate the string aab from the above grammar?
3
4
1
2
Boost your performance with adaptive practice tests
Practice every concept in the syllabus
Compare your speed and accuracy with your peers
Download the app and practice on the go