From: joel de guzman (isis-tech_at_[hidden])
Date: 2001-05-28 18:47:07
From: "Vladimir Prus" :
> 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.
> > [snip]
> >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?
This is truly worth investigating. Thank you for the info, Mr. Skaller.
Joel de Guzman
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk