Boolean expressions represented as directed graph

"Steve Jones" <steve@istech.demon.co.uk>
27 May 2002 21:09:51 -0400

          From comp.compilers
Related articles
Boolean expressions represented as directed graph steve@istech.demon.co.uk (Steve Jones) (2002-05-27)
Re: Boolean expressions represented as directed graph vbdis@aol.com (VBDis) (2002-05-31)
Re: Boolean expressions represented as directed graph heinrich@idirect.com (Kenn Heinrich) (2002-05-31)
| List of all articles for this month |
From: "Steve Jones" <steve@istech.demon.co.uk>
Newsgroups: comp.compilers
Date: 27 May 2002 21:09:51 -0400
Organization: I.S.Technology Ltd
Keywords: design, question
Posted-Date: 27 May 2002 21:09:51 EDT

Hi,


I'm working on a visual designer which uses a directed graph to
represent boolean expressions. In the graph vertexes represent
variables and the edges the relationship between them.


A simple example:


A -+-> B -> C -+-> J
            +-> X -> Y -+


would equate to:


J = A and ( ( B and C) or ( X and Y ) )


Put simply, vertexes connected by more than one path are OR'ed together.
Vertexes connected by a single path are AND'ed


I'm looking for some insight on the approach I might take in traversing the
graph to convert it to the text form.




Thanks, Steve.


--
Steve Jones
I.S.Technology Ltd


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.