Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 572133
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 13, 20262026-05-13T13:34:51+00:00 2026-05-13T13:34:51+00:00

I’m writing a text tag parser and I’m currently using this recursive method to

  • 0

I’m writing a text tag parser and I’m currently using this recursive method to create tags of n words. Is there a way that it can be done non-recursively or at least be optimized? Assume that $this->dataArray could be a very large array.

/**
 * A recursive function to add phrases to the tagTracker array
 * @param string $data
 * @param int $currentIndex
 * @param int $depth
 */ 
protected function compilePhrase($data, $currentIndex, $depth){
    if (!empty($data)){
        if ($depth >= $this->phraseStart){
            $this->addDataCount($data, $depth);
        }
        if ($depth < $this->phraseDepth){
            $currentIndex = $currentIndex + 1;
            //$this->dataArray is an array containing all words in the text
            $data .= ' '.$this->dataArray[$currentIndex]; 
            $depth += 1;
            $this->compilePhrase($data, $currentIndex, $depth);
        }
    }
}
  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-13T13:34:51+00:00Added an answer on May 13, 2026 at 1:34 pm

    See if you can use tail recursion rather than call-based recursion. Some rewriting may be required but a cursory looks says it is fine to do.

    Tail recursion is great for a subset of recursive functions, and good practice to spot when loops can replace recursion, and how to rewrite.

    Saying that, I don’t know what the overhead inside PHP is of the call. Might just be one return-pointer type setup rather than a real stack wind.

    Turns out about the same. Does PHP optimize tail recursive calls out itself?

    Here is my rewrite, but beware, my brain is currently sleep deprived!

    protected function compilePhrase($data, $currentIndex, $depth){
        /* Loop until break condition */
        while(true) {
            if (!empty($data)){
                if ($depth >= $this->phraseStart){
                    $this->addDataCount($data, $depth);
                }
                if ($depth < $this->phraseDepth){
                    $currentIndex = $currentIndex + 1;
                    // A test here might be better than the !empty($data)
                    // in the IF condition. Check array bounds, assuming
                    // array is not threaded or anything
                    $data .= ' '.$this->dataArray[$currentIndex]; 
                    $depth += 1;
                }else{
                   break;
                }
            }else{
               break;
            }
        }
        /* Finish up here */
        return($this->dataArray);
    }
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Ask A Question

Stats

  • Questions 390k
  • Answers 390k
  • Best Answers 0
  • User 1
  • Popular
  • Answers
  • Editorial Team

    How to approach applying for a job at a company ...

    • 7 Answers
  • Editorial Team

    How to handle personal stress caused by utterly incompetent and ...

    • 5 Answers
  • Editorial Team

    What is a programmer’s life like?

    • 5 Answers
  • Editorial Team
    Editorial Team added an answer It is possible to create a mixed-mode assembly (that is,… May 15, 2026 at 1:09 am
  • Editorial Team
    Editorial Team added an answer Get to know XMPP. There's plenty of Java libraries and… May 15, 2026 at 1:09 am
  • Editorial Team
    Editorial Team added an answer Unfortunately, item.getMenuInfo() will be null when you are using a… May 15, 2026 at 1:09 am

Trending Tags

analytics british company computer developers django employee employer english facebook french google interview javascript language life php programmer programs salary

Top Members

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.