Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
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.
I need parse a string inside a parenthesis, which looks like (A, B, C), where A, B, and C are string that can contain any legal JavaScript code. For example, B might be a very long string with nested structures similar to (A, B, C). What would be the best way to parse such a string?
An example of the string to parser is invoking a function:
func( parameter 1, parameter 2, parameter 3)
where all the three parameters could be other function definitions.
One of the simplest ways to create such a parser is to write a recursive descent parser. This type of parser is relatively easy to create and is certainly easier to understand than more complex parser generators (such as “yacc” and the like).