Question: Consider the below CFG: G1: S --> AA A--> AAA | a | bA | Ab choose one correct answer a. There are 12 derivations
Consider the below CFG: G1: S --> AA A--> AAA | a | bA | Ab choose one correct answer
a. There are 12 derivations of length no more than 4 and the strings that could be generated are aa; aba
b. There are 15 derivations of length no more than 4 and the strings that could be dedicated are: aba; aaaa
c. There are 10 derivations of length no more than 4 and this grammar is unambiguous d. There are 10 derivations of length no more than 4 and the strings that could be generated are: aaa; abaa; bab; baa
e. There are 14 derivations of length no more than 4 and the strings that could be generated are: aa; aba; aab; baa
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
