3. (16 points) In slide 39 of the notes “Contest-free Languages and Pushdown Automata IV”, it is shown that the set of LL(k) languages is a proper subset of the set of deterministic C-F languages (see the following figure). In particular, it points out that the language fa”, a”b” n EN is a deterministic C-F, but not LL(kfor any k. Palindromes over fa, b) Context-free Deterministic C-F LL(k) Regular To show the language is not
OR
OR