Each grammar rule may forward calls and subsequent things to build itself. So, ConditionalExpression may forward a call and later call itself again and again, etc.
At last, the number of nested function calls can easily reach 100. If you need an example... I can spend some time on it to highlight to you. Regards, On Mon, Sep 8, 2008 at 10:14 PM, Stanislav Malyshev <[EMAIL PROTECTED]> wrote: > 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? > > -- > Stanislav Malyshev, Zend Software Architect > [EMAIL PROTECTED] http://www.zend.com/ > (408)253-8829 MSN: [EMAIL PROTECTED] > -- 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
