parse tree

基本解释

It would be really interesting though, if there were a language that operated directly on parse trees.
不过，真正值得关注的是，是否有直接操作解析树的语言。
It also serves as an example of my earlier contention that using parse trees makes debugging easier and consequently speeds development time.
它还充当了我以前的论点（使用解析树使调试更容易，从而缩短开发时间）的示例。
I'll also look briefly at the issue of operator precedence and generalize the treewalking code into a full-fledged recursive routine that's able to handle arbitrarily complex parse trees.
我还将简要地研究运算符优先级的问题，并将树遍历代码推广到成熟的递归例程中，该例程可以处理任意复杂的解析树。