递归替换为 javascript 正则表达式

Question

I have a string: pow(pow(487,2)+873,2) that I generate from a calculator I am creating. I want to trans-pile it to ((487^2) + 873)^2.

I had no problem with trans-piling pow(487,2) to 487^2 using

var string = `pow(487,2)`;
console.log(string.replace(/pow\((.*?),(.*?)\)/g,'$1^$2'));

The problem is that I don't know how to handle it recursively with pow(pow(487,2)+873,2) to become ((487^2) + 873)^2. Please help.

Answer 1

you can write recursive function to achieve like this

var string = `pow(pow(487,2)+873,2)`;
var numberOfOccurance = string.match(/pow/g).length;
const makeTranspile=(str,nooc)=>{
  const newStr=str.replace(/pow\((.*?),(.*?)\)/g,'($1)^$2');
  if(nooc>1)
  {
  return makeTranspile(newStr,nooc-1)
  }
  return newStr
}


const finalString=makeTranspile(string,numberOfOccurance);
console.log(finalString);