Hi,
I would like to write a parser in C#. Lets say I have expression like
NOT(NOT(a AND b) OR (c AND d)). I want this to be in Sum of Products for->(a AND b AND NOT c) OR (a AND b AND NOT d). To do that normally in the logic, demorgan rule is applied and then distributivity of AND over OR. I am having problems about it and tried to find a solution on the Net. Some people have suggested to use Antlr but it does not have tutorials enough. Is there any sample program or at least piece of solution? Even simple guidence like "Use bla bla library in C#" is appreciated-
Best regards,
N
karismasa
0
Newbie Poster
Recommended Answers
Jump to PostHi, karismasa, welcome at DaniWeb!
Some time ago I worked on something just that.
I don't have it here at hand, but I let you know more as soon as I can.
See ya:)
All 3 Replies
ddanbe
2,724
Professional Procrastinator
Featured Poster
karismasa
0
Newbie Poster
ddanbe
2,724
Professional Procrastinator
Featured Poster
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.