魔王语言：

处理括号：

先设置一个栈，遇到左括号时，不断地压栈，直到遇到右括号。一旦遇到了右括号就不断地出栈，直到出一个左括号，然后把这些字符解释，解释后压到栈里去。然后再不断地压栈，直到遇到下一个右括号，如此往复。并利用递归算法处理多重括号的情况。

翻译：

一旦遇到需要翻译的字符，输出指定的字符串。此处仅仅设置了两种规则（自行定义），因此只需按照定义过的规则输出字符串即可。-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.