c - Boolean Expression Parser for CUDD -

i using cudd library on c making binary decision diagrams. wondering if there way convert boolean expression given string binary decision diagram.

thank you!

there couple of projects around in functionality parse string bdd contained.

for example, @ https://github.com/ltlmop/slugs/blob/master/src/synthesiscontextbasics.cpp, lines 22-64, can find simple parser polish normal form boolean formulas in c++. @ assumes variables have been allocated , bdd references nodes representing variables stored in arrays "variables[..]" , respective names stored in "variabenames[...]" adapting general idea c relatively simple. class "bf" in code wrapper "ddnode*" references.

if want infix notation, can use yacc/lex build simple parser you.