Boost logo

Boost :

From: David Abrahams (abrahams_at_[hidden])
Date: 2001-05-24 06:54:45


----- Original Message -----
From: "Vladimir Prus" <ghost_at_[hidden]>
>
> 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.

-Dave


Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk