From: Vladimir Prus (ghost_at_[hidden])
Date: 2001-05-28 07:14:09
John Max Skaller wrote
> joel de guzman wrote:
>> I believe there's more we can squeeze from RD.
> What you need is a Recursive Transition Network.
>This is what Python uses. It is a very powerful blend
>of recursive descent and finite state machines.
>It can be shown that RTN's can recognize all context free
>languages. This is much more powerful than regular,
>LL(1), or RD.
Interesting. What is average/worst case complexity? Can you give a link to
some paper that discusses RTN?
-- Regards, Vladimir
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk