Yeah... recursion depth. Sorry, I wrongly typed it.
I think it may be cleaner now... On Mon, Sep 8, 2008 at 11:07 PM, Stan Vassilev | FM <[EMAIL PROTECTED]> wrote: > > Hi, > > He means recursion depth, not input nesting depth. 5.3 had a proposed fast > function call algorithm which would avoid the stack limit and allow deeper > recursion, was this accepted and how does it affect the limit of 100 nested > calls? > > Regards, > Stan Vassilev > >> Hi! >> >>> Currently I'm working on the compiler, which has this BNF: >>> http://trac.doctrine-project.org/browser/trunk/query-language.txt >>> I've done a lot of optimizations to be able to not touch the default >>> nesting input level, but doing that I added a lot of restrictions that >>> now are my bottlenecks. >> >> I'm not sure I understand - how this compiler is related to input nesting >> level? What exactly you do there that requires 150+ levels of nesting on >> input? > > > -- > PHP Internals - PHP Runtime Development Mailing List > To unsubscribe, visit: http://www.php.net/unsub.php > > -- Guilherme Blanco - Web Developer CBC - Certified Bindows Consultant Cell Phone: +55 (16) 9166-6902 MSN: [EMAIL PROTECTED] URL: http://blog.bisna.com Rio de Janeiro - RJ/Brazil -- PHP Internals - PHP Runtime Development Mailing List To unsubscribe, visit: http://www.php.net/unsub.php
