使用 .Net 绘制解析树最简单、最快的方法是什么？
我使用 C# 编写了一个简单的自顶向下解析器。这是一个控制台应用程序。我希望解析器可以在计算结束时保存解析树的图像文件。我想我可以使用 graphviz，但我想知道你的意见。 谢谢。
I've written a simple top down parser using c#. It's a console application. I'd like the parser could save, at the end of the computation, an image file of the parse tree. I think I could use graphviz, but I'd like to know your opinion.
Thanks.
如果你对这篇内容有疑问，欢迎到本站社区发帖提问 参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱，如果其他用户或者作者回复了您的评论，将不能在第一时间通知您！
发布评论
评论（2）
您可以使用 SVG 作为 DOT/Graphviz 的替代品；两者可能都同样好。
无论哪种情况，遍历解析树并生成控制图形绘制的输出都应该非常容易。如果树是显式构造的，则递归遍历应该很容易实现。如果未构建树，则需要在解析时动态生成图节点。
对于构建显式 AST 的 DMS Software Reengineering Toolkit，我们做了一些更简单的事情：遍历树，只需在一行上打印出根节点，并将其子节点打印在已识别的单独文本行上。我们使用 LISP 样式格式（出于历史原因）和 XML 样式格式（强烈要求）来完成此操作。如果您可以进行递归树遍历，则编写此代码的工作量可能大约需要一个小时。
它不像图形绘制那样漂亮，但它不会遇到绘制巨大图形的问题......只是获得巨大的文本输出，但您可以使用 less 或 <强>perl。
即使很小的 AST 也可能有很多节点，从而削弱你绘制/理解图形的能力。我的经验是，AST 每条源代码行大约有 5-8 个节点。
对于以下 22 行 PLSQL 代码：
这是一个示例输出，180 个树节点（注意每个节点的源位置信息）：
You could use SVG as an alternative to DOT/Graphviz; both are probably equally good.
In either case, it should be pretty easy to walk the parse tree and produce output that will control the drawing of the graph. If the tree is constructed explicitly, a recursive walk should be easy to implement. If the tree isn't constructed, you'll need to generate the graph nodes on the fly as you parse.
For the DMS Software Reengineering Toolkit, which constructs explicit ASTs, we do something simpler: walk the tree, and simply print out the root noot on one line, and its children on idented seperate lines of text. We do this in a LISP style format (for historical reasons) and an XML style format (much requested). The effort to code this if you can do a recursive tree walk is probably about an hour.
It isn't a pretty as a graph drawing, but it doesn't suffer from the problem of drawing huge graphs... just from getting huge text outputs, but those you can navigate with less or perl.
Even a small AST can have lots of nodes, and thus swamp your ability to draw/comprehend with graphics. My experience is that an AST has roughly 5-8 nodes per source line.
For the following 22-line PLSQL code:
Here's a sample output, 180 tree nodes (note source position information for each node):
我想我会生成 XML（或以某种方式使树 XPath 可导航）并使用 XSLT 转换来生成您喜欢的任何（基于文本的）格式，尤其是 SVG。
I think I'd generate XML (or make the tree XPath navigable somehow) and use an XSLT transform to generate any (text-based) format you like, especially SVG.