|
Boost : |
From: Vladimir Prus (ghost_at_[hidden])
Date: 2001-05-24 07:44:09
David Abrahams wrote:
>> Theoretical study is not likely do give us much. Backtraing parser have
>> exponetial complexity in worst case, and "high priests" would find their
use
>> impossible.
>FWIW, I know that at least one well-respected C++ compilers uses recursive
>descent with backtracking.
Which compiler is called...?
-- Regards, Vladimir
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk