ABLTOBDDCCT(3)
π¦ ORIGIN π¦
okay so first of all, bestie, this software belongs to the ALLIANCE CAD SYSTEM, which was developed by the ASIM team at the LIP6 laboratory of UniversitΓ© Pierre et Marie CURIE, in Paris, France. iconic academic energy, no cap. π«π·β¨
- Web:
http://asim.lip6.fr/recherche/alliance/ - E-mail:
alliance-users@asim.lip6.fr
β¨ NAME β¨
ablToBddCct β literally converts an ABL into a BDD within a circuit. that's the whole gig. π
πΈ SYNOPSIS πΈ
#include "logmmm.h"
pNode ablToBddCct(pC,expr)
pCircuit pC;
chain_list *expr;
π PARAMETERS π
pCβ the Circuit in which the conversion is made. it's the venue, the location, the main character setting ποΈexprβ the expression to convert. the thing we're transforming, slay π
π DESCRIPTION π
so ablToBddCct() constructs the graph that is computed from expr. that's it, that's the function. π«Ά
this function provides the basic method for constructing easily the BDDs β like, it's the easy-breezy entry point, the no thoughts just vibes way to build your BDDs.
and lowkey the way it works? the applyBdd() function is called recursively by going through the ABL. so it's recursion, bestie. recursion all the way down. πβ¨
π EXAMPLE π
okay here's the whole thing in action, look:
#include "mutnnn.h" /* mbk utilities */
#include "logmmm.h"
chain_list *expr;
pNode res;
pCircuit pC;
initializeBdd(SMALL_BDD);
pC = initializeCct("circuit 1",10,10);
addInputCct(pC,"a");
addInputCct(pC,"b");
/* let's suppose that expr = (OR (AND (NOT a) b) a) */
res = ablToBddCct(pC,expr);
displayBdd(res,1);
/* it will display
@res INDEX = 3 LOW = @nodeA HIGH = ONE
@nodeA INDEX = 2 LOW = ZERO HIGH = ONE
*/
destroyCct(pC);
destroyBdd(1);
so we set up the BDD, make a circuit, add inputs "a" and "b", suppose that expr = (OR (AND (NOT a) b) a), convert, and displayBdd(res,1) shows you exactly that graph up there. then you clean up with destroyCct(pC) and destroyBdd(1) because we are responsible queens ππ§Ή
π₯ SEE ALSO π₯
log(1), bdd(1), abl(1), bddToAblCct(3).
π BUG REPORT π
ngl, this tool is under development at the ASIM department of the LIP6 laboratory. π
and they need your feedback to improve documentation and tools. so like... talk to them? fr fr, your input is wanted. π«Ά
and that's the whole page, bestie β brought to you by ASIM/LIP6, version dated October 1, 1997. yes, 1997. vintage. retro. iconic in a elder millennial way. πβ¨π
π¦ where this page comes from
- fedora 43: alliance-devel 5.1.1-35.20160506gitd8c05cd.fc42 Β· GPL-2.0-only
- fedora 43: alliance-devel 5.1.1-35.20160506gitd8c05cd.fc42 Β· GPL-2.0-only
- fedora 44: alliance-devel 5.1.1-35.20160506gitd8c05cd.fc42 Β· GPL-2.0-only
- fedora 44: alliance-devel 5.1.1-35.20160506gitd8c05cd.fc42 Β· GPL-2.0-only
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash on : a language model's rewrite of the original, under its terms