I know about CUDD. As for understanding enough about BDD to make your own algorithm...it's been almost six months since I've started to learn about BDD and still I'm not able to do it. I guess I'll just try to reduce my expresions by "hand". Thanks.

Does anyone know where to find an implementation in C of the BDD? Or an algorithm not so criptical. Or maybe someone has something like that.

I guess you are asking that because of the "xcopy". Well that is only the first command and exit is the last one. I'm using gcc under cygwin so I must login before I can execute something like "gcc [param]".

I have made a wizard and on the last page I call: ShellExecute(NULL,"open","cmd",NULL,NULL, SW_SHOWNORMAL ); ................ SendInput(....); When that is done in the page I should receive some informations. Everything works fine when I use the wizard for the first time, but if I try to use it again without restarting the application when the cmd window closes so does the wizard. The comands sent to the cmd are: "xcopy ..... exit\n "

Why don't you post here the source code that handles the drawing of the message? Also you can search in the articles for CSocket - it's a chat program and you can look trough it to see how he does it. Actually where do you want to draw the message? In a listbox, or directly on the CDC?

Or you can click in the menu on Project->[name] Settings and you have there a combobox Configuration.

Can I integrate the gcc into a program made with Visual C? I want to use it to create a preprocessed file of a c program and then to extract the informations. Another option is to use ShellExecute for gcc but I don't know the sintax for creating a preprocessed file from a C program. Does anyone know the exact sintax? I know it has something to do with -E but that's it and I can't find an example on the net. Or some files already preprocessed.

Trollslayer wrote: Are they paying you anything ? Nope. They have somekind of agreement with our teachers and because of that the students were given some projects from that company.

I guess you'll have to take each pixel and verify if it has the same value as at least one from his neighbours. Something like this: [ 1 2 3 ] [ 4 5 6 ] [ 7 8 9 ] Now you take pixel #5 and check his value with the ones from that matrix. if it's the same then it is a point of the line(composing the grid), if not then it don't belongs there. Once you know where the grid lines starts it's easy to identify the intersecting points since you'll know the angle and everything.

Bob Stanneveld wrote: Are you going to post it here on CP? I would like too see your article! I don't know. I'm doing this for my engineer diploma and the project was given to me by a company so I guess it's theirs once I finish it. But if I'll decide not to work for them, I'll post it. :) I just figured out that I need only to extract the classes' names to know that them are user defined data, the #define and #typedef, and the functions' names. After that I can work on every function individualy. As a matter of fact the project is supposed to take two functions, construct the decision tabels for them and see if they are logigally identical.

Bob Stanneveld wrote: Anyway, in his own reply to his original post he says that he needs an analyser that gives him the structure of the program No,no, I need a parser. I think a parser knows which statement is an conditional one or not. Bob Stanneveld wrote: I don't know if such a tool exists. It will as soon as I finish this project. :)

The parser is only a part of the entire project and I don't have enough time left to make one. I just need one that will know which statement is an if/for/while/switch/goto/label, to detect the functions, functions calls, return etc. I just need to know the structure of the program not to make the calculations and the operations. Or to make me the AST. Thanks.

I need a parser for C++ that can be integrated in Visual C. I've tried to make one using yacc and bison but it didn't work(didn't manage to do the file). Can anyone help me? Do you know where I can find it? Do you have it? Thank you.