c++ code completion status report
snuffeler at gmx.net
Sat Jan 5 12:42:03 UTC 2002
> I wouldn't think a recursive descent parser could be used for anything
> serious, though you said LL(k) rather than LL(1) which should make it
> powerful enough. But it's still less capable than LR(k), no? Nah, I just
> up, not in my parsing theory mood.
The problem with LL(1) is that it forbids left recursion. So using LL(1)
would complicate our grammar. And I already wrote some
top-down-parser (I mean, I started to write one) until I found that
I needed k > 1 (better: k >> 1). That would be very inefficient.
More information about the KDevelop-devel