We don’t allow questions seeking recommendations for software libraries, tutorials, tools, books, or other off-site resources. You can edit the question so it can be answered with facts and citations.
Closed 6 years ago.
由于您还没有绑定你的真实邮箱,如果其他用户或者作者回复了您的评论,将不能在第一时间通知您!
接受
或继续使用网站,即表示您同意使用 Cookies 和您的相关数据。
发布评论
评论(3)
布尔重构和简化
该工具非常适合优化复杂的布尔表达式。
Boolean Refactor and Simplification
This tool worked great for optimising complex boolean expressions.
我不确定有什么工具,但看看 布尔代数
你可以绘制所有输入和输出的网格以尝试找到最小布尔表达式
I'm not sure about a tool but take a look at Boolean Algebra
you can draw a grid of all the inputs and output to try and find a minimal boolean expression
DMS Software Reengineering Toolkit 可以做到这一点。
它是一种通用的编译器技术,用于将语言(包括 Java)解析为 AST 和符号表。 DMS 还提供源到源的转换以及关联和交换律重写。
您的布尔表达式将显示为 Java AST 表达式树。
通过提供一组关于布尔代数的规则,您可以操纵
那些表达树。
我们过去曾这样做过,对 C、RLL 和诊断方程组进行布尔表达式简化和转换,无论是在大规模表达式上还是在许多中等规模表达式上(规模与您的示例非常相似)。
编辑 5/19/2010:查看使用 DMS 的传统代数转换的示例 。 构建一个执行布尔代数运算的变体很简单。
The DMS Software Reengineering Tookit could do this.
It is generalized compiler technology for parsing languages (including Java) to ASTs and symbol tables. DMS also provides source-to-source transformations, and associative and commutative law rewriting.
Your boolean expressions would show up as Java AST expression trees.
By providing a set of rules about boolean algebra, you can manipulate
those expression trees.
We have done this in the past to carry out boolean expression simplification and transformation for C, RLL and a system of diagnostic equations, both on large scale expressions, and on lots of medium scale expressions (scale much like your example).
EDIT 5/19/2010: See an example of conventional algebra transformations using DMS. Its trivial to construct a variant that does Boolean algebra instead.