如何用字符串形成一棵树 [英] How to form a tree with a String

问题描述

如果我有一个字符串如下

If i have a String as follow

( (a || b) && c) ||(d & & e)

( (a || b) && c) || (d && e)

如何根据括号将它们拆分为不同的字符串并形成这样的树?

How can i split them into diffrent string based on the brackets and form a tree like that?

         ( (a || b) && c) || (d && e)  ---> Root

               /                \
              /                  \
           ( (a|| b) || c)      (d && e)
           /           \             /  \             
          /             \            /   \
         (a || b)        c           d    e

推荐答案

您需要一个分析树生成器.对于繁重的工作，许多人使用 ANTLR，但对于简单的语法，我使用 JavaCC 和 JJTree

You'll want a parse tree generator. For heavy lifting many use ANTLR, but for simple grammars, I've had good success with JavaCC and JJTree

这篇关于如何用字符串形成一棵树的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！