Is complement of LL(k) grammar context free?

1$\begingroup$ What is LL(k)?? $\endgroup$ – Benjamin Steinberg Jun 1 '12 at 15:04

1$\begingroup$ en.wikipedia.org/wiki/LL_parser $\endgroup$ – Sridhar Ramesh Jun 1 '12 at 21:30
In general, the complement of a contextfree language is not contextfree. However, LL(k) languages are a strict subset of the deterministic CFLs.
The complement of a DCFL is also a DCFL, because it can be recognized by the same deterministic pushdown automaton, just with the "accept" and "reject" states swapped.
So the answer to your question appears to be "yes, in fact it is deterministic contextfree."