def create_test_program2():
""""
This creates a new program based on the previous one but with a while loop
"""
# Create the variables
x = Var()
variables = {"x": x}
# Create the program graph
pgm = nx.DiGraph()
# Programme exemple du sujet
pgm.add_node(1, attr_dict={"operation": node.If()})
pgm.add_node(2, attr_dict={"operation": node.Always()})
pgm.add_edge(1,
2,
attr_dict={
"expr": boolean.InfOrEqual(x, Var(value=0)),
"instr": instructions.Skip()
})
pgm.add_node(3, attr_dict={"operation": node.Always()})
pgm.add_edge(1,
3,
attr_dict={
"expr": boolean.InfOrEqual(x, Var(value=0), no=True),
"instr": instructions.Skip()
})
pgm.add_node(4, attr_dict={"operation": node.If()})
pgm.add_edge(2,
4,
attr_dict={
"expr":
boolean.Always(),
"instr":
instructions.Assign(x, arithmetic.Min(Var(value=0), x))
})
pgm.add_edge(3,
4,
attr_dict={
"expr":
boolean.Always(),
"instr":
instructions.Assign(x, arithmetic.Min(Var(value=1), x))
})
pgm.add_node(5, attr_dict={"operation": node.Always()})
pgm.add_edge(4,
5,
attr_dict={
"expr": boolean.InfOrEqual(x, Var(value=1)),
"instr": instructions.Skip()
})
pgm.add_node(6, attr_dict={"operation": node.Always()})
pgm.add_edge(4,
6,
attr_dict={
"expr": boolean.InfOrEqual(x, Var(value=1), no=True),
"instr": instructions.Skip()
})
pgm.add_edge(6,
4,
attr_dict={
"expr":
boolean.Always(),
"instr":
instructions.Assign(x, arithmetic.Min(x, Var(value=1)))
})
pgm.add_node("_", attr_dict={"operation": node.End()})
pgm.add_edge(5,
"_",
attr_dict={
"expr": boolean.Always(),
"instr": instructions.Assign(x, Var(value=1))
})
# Get the program from the program graph
pgm = Program(pgm, variables)
return pgm
def create_test_program5():
# Create the variables
x = Var()
y = Var()
z = Var()
variables = {"x": x, "y": y, "z": z}
# Create the program graph
pgm = nx.DiGraph()
# Programme exemple du sujet
pgm.add_node(1, attr_dict={"operation": node.If()})
pgm.add_node(2, attr_dict={"operation": node.Always()})
pgm.add_edge(1,
2,
attr_dict={
"expr": boolean.InfOrEqual(x, Var(value=0)),
"instr": instructions.Skip()
})
pgm.add_node(3, attr_dict={"operation": node.Always()})
pgm.add_edge(1,
3,
attr_dict={
"expr": boolean.InfOrEqual(x, Var(value=0), no=True),
"instr": instructions.Skip()
})
pgm.add_node(4, attr_dict={"operation": node.If()})
pgm.add_edge(2,
4,
attr_dict={
"expr": boolean.Always(),
"instr": instructions.Skip()
})
pgm.add_edge(3,
4,
attr_dict={
"expr": boolean.Always(),
"instr": instructions.Skip()
})
pgm.add_node(5, attr_dict={"operation": node.Always()})
pgm.add_edge(4,
5,
attr_dict={
"expr": boolean.Equal(y, Var(value=1)),
"instr": instructions.Skip()
})
pgm.add_node(6, attr_dict={"operation": node.Always()})
pgm.add_edge(4,
6,
attr_dict={
"expr": boolean.Equal(y, Var(value=1), no=True),
"instr": instructions.Skip()
})
pgm.add_node(7, attr_dict={"operation": node.Always()})
pgm.add_edge(6,
7,
attr_dict={
"expr": boolean.InfOrEqual(z, Var(value=1), no=True),
"instr": instructions.Skip()
})
pgm.add_edge(7,
6,
attr_dict={
"expr":
boolean.Always(),
"instr":
instructions.Assign(z, arithmetic.Min(z, Var(value=1)))
})
pgm.add_node("_", attr_dict={"operation": node.End()})
pgm.add_edge(5,
"_",
attr_dict={
"expr": boolean.Always(),
"instr": instructions.Skip()
})
pgm.add_edge(6,
"_",
attr_dict={
"expr": boolean.InfOrEqual(z, Var(value=1), no=False),
"instr": instructions.Skip()
})
# Get the program from the program graph
pgm = Program(pgm, variables)
return pgm