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.
我還將簡要地研究運算符優先級的問題，竝將樹遍歷代碼推廣到成熟的遞歸例程中，該例程可以処理任意複襍的解析樹。