c++ code completion status report
Eray Ozkural (exa)
erayo at cs.bilkent.edu.tr
Sun Jan 6 19:18:04 UTC 2002
On Sunday 06 January 2002 18:22, Richard Dale wrote:
> Yes, I don't think LR(k) is suitable for implementing prolog style
> non-deterministic parsers. Accent is effectively a combination of LL(1) and
> LR(1), but still deterministic.
> It should be so quick to parse a complete source file with bison when a
> user wants to do code completion (eg 0.5s), that my original suggestion
> about LL(k) and backtracking doesn't make much sense relative to all the
> extra work involved.
Is that 0.5 seconds going to grow when we are dealing with complex codes,
such as one that #include's a good collection of kde libraries?
Eray Ozkural (exa) <erayo at cs.bilkent.edu.tr>
Comp. Sci. Dept., Bilkent University, Ankara
GPG public key fingerprint: 360C 852F 88B0 A745 F31B EA0F 7C07 AE16 874D 539C
More information about the KDevelop-devel