After reading your node, I get the impression[1] that you've written your own language based on tags, and your program interprets the tree each time you want to generate a page. I'm thinking that the problem may be that you're reparsing your tree and interpreting the result for each page. Perhaps you should make a preprocessor that will take your tree and generate a program that directly generates the output, something like a compiler.
If you do this, then you can use the standard profiling tools to find out what parts of the code are taking too long. This would enable you to ask smaller, more detailed questions about specific chunks of code, and would help you find out which parts of your compiler need the most work.
Notes:
[1] I found the post hard to read because it doesn't get to the point quickly enough, so I may have missed something important. If so, sorry.
...roboticus
When your only tool is a hammer, all problems look like your thumb.
In reply to Re: Too difficult for me...
by roboticus
in thread Too difficult for me...
by simonodell
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |