Question: Question 1 1 pts Consider the CFG with start variable S and the rules: SaSa|6Sb|a16 This can derive every palindrome in in{a, 6}*. True False


Question 1 1 pts Consider the CFG with start variable S and the rules: SaSa|6Sb|a16 This can derive every palindrome in in{a, 6}*. True False Question 2 1 pts Say that a CFG G is unambiguous and has language L. Must every string in the language have exactly one leftmost derivation? Yes O No Question 3 1 pts For any CFG G in CNF, every string of length n in its language must have a derivation with precisely 2n - 1 rule applications, True. False
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
