Introduction - If you have any usage issues, please Google them yourself
Devil language: Handling parentheses: setting a stack encounter left parenthesis, push constantly, until it encounters a closing parenthesis. Once encountered a right parenthesis to keep the stack until a left parenthesis, and then put these characters through interpretation go back pressure to the stack. Then continue to push until it encounters the next closing parenthesis, and so forth. And using a recursive algorithm to handle multiple brackets situation. Translation: Once the need to translate the characters, the output specified string. Here only set two rules (self-defined), so just follow the rules defined output string can be.